Development and Implementation of a File System for Gannet Virtual ...

More documents

Recommendations

Info

2.3.1 RAM Disk RAM disk is reserved memory which accessed through device interface. At initialization, RAM disk formats a region of RAM device to emulate a hard disk. As an area has formatted, RAM is then mounted as an ordinary disk file system. The advantage of this approach is that RAM disk creating a file system on a RAM device by following the existing file system interface. However, as it follows the disk file system interface, RAM drive is still use cache mechanism. Therefore, a data can be maintained on two locations cached in the disk buffer and in the RAM drive. It leads to double memory consumption (Snyder, 1990). Furthermore, RAM drive still uses disk file system on its emulated drive despite having no mechanical limitation which leading to slower the performance. The idea to reserve amount of region on RAM is suitable for GannetFS file system implementation as there is no kernel on Gannet Virtual Machine. Hence, GannetFS file system has to manage its own region of memory. 2.3.2 RAM File System RAM file system (McKusick 1990) is built top of virtual file system (VFS) interface (Kleiman). Instead of allocating reserved fixed region of memory for used as a file system, RAM file system uses dynamically allocation depending on its usage. Furhermore, by using VFS for saving both, metadata and data itself, RAM file system overcomes the doubling memory consumption of RAM drive. Even though, RAM file system has avoided disk-related interface, it relies on top of VFS, which has generic storage access routines. Hence, this approach leads RAM file system to lower performance. 13
GannetFS will follow the RAM file system concept. However, instead of implemented on top of VFS, GannetFS will have its own mechanism to handle the interaction. Furthermore, GannetFS avoid using dynamic allocation as in Gannet system there is no kernel to support that mechanism. 14
Page 1 and 2: Development and Implementation of a
Page 3 and 4: Abstract This project is addressed
Page 5 and 6: 4.3 Integration to Gannet Virtual M
Page 7 and 8: communication architecture (Kogel,
Page 9 and 10: Survey 2.1 Gannet System Overview G
Page 11 and 12: Figure 2.2 Service-based SoC Node (
Page 13 and 14: Service 2 Gannet Functionality Serv
Page 15 and 16: On the other hand, if large allocat
Page 17: Indexed allocation has different ap
Page 21 and 22: explained above are not suitable fo
Page 23 and 24: is quite small. Furthermore, the si
Page 25 and 26: Design 3.1 Requirement This section
Page 27 and 28: GannetFS file system is different w
Page 29 and 30: using this mechanism, the system al
Page 31 and 32: 3.2.2 File Allocation As discussed
Page 33 and 34: GannetFS file system treats these t
Page 35 and 36: 3.2.2.2 Directory Entry Data Struct
Page 37 and 38: Managing directory and path names i
Page 39 and 40: File Descriptor . . . . Stat Struct
Page 41 and 42: (Lewine 1991). Since POSIX also pro
Page 43 and 44: fields will remain the same. Howeve
Page 45 and 46: directory entry. Hence, there is no
Page 47 and 48: Uid 256 Uid 64 Uid Size 320 drwxrwx
Page 49 and 50: ack onto the stack to be reused and
Page 51 and 52: According to illustration on Figure
Page 53 and 54: Testing and Evaluation 5.1 Testing
Page 55 and 56: MAX_NAME_PATH or fewer characters.
Page 57 and 58: 5.2 Evaluation Unlike testing which
Page 59 and 60: 5.2.2 Read Only Memory Evaluation I
Page 61 and 62: Operation Cycles Creat 6722 Open (F
Page 63 and 64: Conclusion This project was underta
Page 65 and 66: Silberschats, A., Galvin, P.B., Gag
Page 67 and 68: A. Requirement Specification Functi
Page 69 and 70:
nbyte : Maximum number of bytes to
Page 71 and 72:
10. readdir() : Reads a directory.
Page 73 and 74:
C. Testing TestCase00 Creates, writ
Page 75 and 76:
TestCase04 This test case creates 1
Page 77:
TestCase10 Writes data to and reads
show all

Development and Implementation of a File System for Gannet Virtual ...

Create successful ePaper yourself

Delete template?

Save as template?