An interleaved file system for a highly distributed MIMD architecture

Yaron Farber*, Amnon Barak

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

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 languageEnglish
Pages22-30
Number of pages9
StatePublished - Oct 1990
EventProceedings of the 5th Jerusalem Conference on Information Technology - Jerusalem, Isr
Duration: 22 Oct 199025 Oct 1990

Conference

ConferenceProceedings of the 5th Jerusalem Conference on Information Technology
CityJerusalem, Isr
Period22/10/9025/10/90

Fingerprint

Dive into the research topics of 'An interleaved file system for a highly distributed MIMD architecture'. Together they form a unique fingerprint.

Cite this