Quote: GFS uses a B-tree to map namespace to metadata; no directory nodes; 100 bytes per file

Quotation Skeleton

GFS logically represents its namespace as a lookup … [a compact B-tree like form] … [on average, a total of 100 bytes per file]. … Each node in the namespace tree … has an associated read-write lock. Each master operation … it will acquire read-locks on the directory names … and either a read lock or write lock … File creation does not require a write lock … from modification. … One nice property of this locking scheme is … [p.8] locks are acquired in a consistent total … within the same level.   Google-1   Google-2

Copyright clearance needed for quotation.

Additional Titles

Quote: each GFS namespace node has a read-write lock; consistent total order to prevent deadlock

Related Topics

Topic: b-trees (16 items)
Topic: deadlocks (21 items)