1991 · 14 citations · 9 references
ComputingComputer ScienceComputer SystemsData ManagementData ParallelismHigh-throughput ComputingMemory Hierarchy OptimizationStream ProcessingStreaming AlgorithmsData StreamingI/o OptimizationParallel Stream ProcessingStreaming ArchitecturesStreaming Data Processing
We present an I/O architecture, called Swift, that addresses the problem of data-rate mismatches between the requirements of an application, the maximum data-rate of the storage devices, and the data-rate of the interconnection medium. The goal of Swift is to support integrated continuous multimedia in general purpose distributed systems. In installations with a high-speed interconnection medium, Swift will provide high data-rate transfers by using multiple slower storage devices in parallel. The data-rates obtained with this approach scale well when using multiple storage devices and multiple interconnections. Swift has the \nexibility to use any appropriate storage technology, including disk arrays. The ability to adapt to technological advances will allow Swift to provide for ever increasing I/O demands. To address the problem of partial failures, Swift stores data redundantly. Using the Unix operating system, we have constructed a simplied prototype of the Swift architecture. Using a single Ethernet-based local-area network and three servers, the prototype provides data-rates that are almost three times as fast as access to the local SCSI disk in the case of writes. When compared with NFS, the Swift prototype provides double the data-rate for reads and eight times the data-rate for writes. The data-rate of our prototype scales almost linearly in the number of servers and the number of network segments. Its performance is shown to be limited by the speed of the Ethernet-based local-area network. We also constructed a simulation model to show how the Swift architecture can exploit storage, communication, and processor advances, and to locate the components that will limit I/O performance. In a simulated gigabit/second token ring local-area network the data-rates are seen to scale proportionally to the size of the transfer unit and to the number of storage agents.
9
A trace-driven analysis of the UNIX 4.2 BSD file system
John K. Ousterhout, Hervé Da Costa, David Harrison et al. · ACM SIGOPS Operating Systems Review · 1985 · 498 citations · Full text
Kenneth Salem, Héctor García-Molina · 1986 · 293 citations