Unix文件类型.pptVIP

Figure 4-10. (a) Contiguous allocation of disk space for 7 files. (b) The state of the disk after files D and F have been removed. Contiguous Allocation Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639 Contiguous Allocation Advantage： Simple to implement; to record the first block and length Easy to read; only one seek is needed Disadvantage: Fragmentation Contiguous allocation One way to eliminate holes in contiguous allocation is to compact the disk every time a file is moved. In this case, copying a file requires a seek and rotational delay, followed by transfer. If seek time is 5ms, rotational delay is 4ms, transfer rate is 8MB/sec, average file size if 8KB, how long is it to compact half of a 16-GB disk? Figure 4-11. Storing a file as a linked list of disk blocks. Linked List Allocation Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639 Linked list allocation To keep each file as a linked list of disk blocks Advantage Only internal fragmentation Disadvantage Random access is difficult Adding a pointer at the head of block; extra overhead while coping Figure 4-12. Linked list allocation using a file allocation table in main memory. Linked List Allocation Using a Table in Memory Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639 Linked List Allocation Using a Table in Memory FAT-File Allocation Table Advantage Can take use of the whole block Random access is easy only to store the starting block number Disadvantage To keep the entire table in memory Can’t scale well ? From MS-DOS to Windows FAT-12, FAT 16, FAT 32 For FAT-12 with 512 bytes blocks, what is the maximum partition size? What is the table size? For FAT-16 with 4KB? In Win95, FAT32 was adopted. Internally, the system tracks sectors of 512 bytes using 32-bit number Figure 4-32. Maximum partition size for different block sizes. The empty box