Alsoft DiskWarrior - 4.0 지침 매뉴얼
Graphing a Disk Directory
Chapter 2: Using DiskWarrior
39
1 will now link to node 4 and node 4 will now link to node 2. This causes the nodes to be out of
order. The links indicate the order in which the nodes are to be read. Following the links you
visit all of the nodes and items in the correct order. However, to follow the links, you will have to
jump from node 1 to node 4 then back to node 2 and then to node 3 (Figure 2-5). As more items
are added to the directory, this process of splitting is repeated and the nodes are increasingly out
of order. A typical directory has hundreds or thousands of nodes. If a program or the Mac OS
needs to search the directory it will follow the links and jump back and forth in the directory.
order. The links indicate the order in which the nodes are to be read. Following the links you
visit all of the nodes and items in the correct order. However, to follow the links, you will have to
jump from node 1 to node 4 then back to node 2 and then to node 3 (Figure 2-5). As more items
are added to the directory, this process of splitting is repeated and the nodes are increasingly out
of order. A typical directory has hundreds or thousands of nodes. If a program or the Mac OS
needs to search the directory it will follow the links and jump back and forth in the directory.
Directory optimization is the process of defragmenting and packing nodes. Defragmenting
makes the physical order equal the linked (logical) order. Packing combines nodes that are not
full so that you end up with fewer nodes. Continuing with the directory in the previous example,
the directory is defragmented and the items are packed into just 2 nodes (Figure 2-6). The
resulting speed increase is due to the fact that fewer nodes need to be read and there is no need
to jump around within the directory.
makes the physical order equal the linked (logical) order. Packing combines nodes that are not
full so that you end up with fewer nodes. Continuing with the directory in the previous example,
the directory is defragmented and the items are packed into just 2 nodes (Figure 2-6). The
resulting speed increase is due to the fact that fewer nodes need to be read and there is no need
to jump around within the directory.
Figure 2-4
Example directory with 3 nodes. Files are in order.
Figure 2-5
Adding "File H" causes node 2 to split and fragment the directory.