Abstract
A file system design with a large number of disks, each with its own local processing power, is proposed. This organization allows concurrent access to many records of a file, thus providing a speedup proportional to the number of disks. The focus is on the structure of a single file. Care is taken to preserve the file's integrity, as several processes are contending for it from different processing elements (PEs). A file structure, based on the Blink-tree, a modification of the well-known B+ tree, is introduced. This structure is distributed among the disk-nodes, the PEs that are equipped with disks. Performance figures are derived by analytic and simulation methods.
Original language | English |
---|---|
Pages | 22-30 |
Number of pages | 9 |
State | Published - Oct 1990 |
Event | Proceedings of the 5th Jerusalem Conference on Information Technology - Jerusalem, Isr Duration: 22 Oct 1990 → 25 Oct 1990 |
Conference
Conference | Proceedings of the 5th Jerusalem Conference on Information Technology |
---|---|
City | Jerusalem, Isr |
Period | 22/10/90 → 25/10/90 |