(操作系统教学课件）ch12 File System Implementation.ppt

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 减少磁头移动 * * * * * * * * Indexed Allocation – Mapping (Cont.) Combined Scheme: UNIX UFS  More index blocks than can be addressed with 32-bit file pointer 4K bytes per block, 32-bit addresses Performance Best method depends on file access type Contiguous great for sequential and random Linked good for sequential, not random Declare access type at creation - select either contiguous or linked Indexed more complex Single block access could require 2 index block reads then data block read Clustering can help improve