๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Performance Measurement of the Concurrent File System of the Intel iPSC/2 Hypercube

โœ Scribed by J.C. French; T.W. Pratt; M. Das


Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
608 KB
Volume
17
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

โœฆ Synopsis


The Intel Concurrent File System (CFS) for the iPSC/2 and iPSC/860 hypercubes is one of the first production file systems to utilize the declustering of large files across numbers of disks to improve input/output (I/O) performance. The CFS also makes use of dedicated I/O nodes, operating asynchronously, which provide file caching and prefetching. Processing of (\mathrm{I} / \mathrm{O}) requests is distributed between the compute node that initiates the request and the I/O nodes that service the request. We present performance measurements of the CFS for an iPSC/2 hypercube with 32 compute nodes and (4 \mathrm{I} / 0) nodes (4 disks). Measurement of read/ write rates for one compute node to one (1 / O) node, one compute node to multiple I/O nodes, and multiple compute nodes to multiple (\mathrm{I} / \mathrm{O}) nodes form the basis for the study. Additional measurements show the effects of different buffer sizes, caching, prefetching, and file preallocation on system performance. A measure of (\mathrm{I} / \mathrm{O}) system imbalance is also introduced. Co 1993 Academic Press, Inc.


๐Ÿ“œ SIMILAR VOLUMES


Performance of the Intel iPSC/860 and Nc
โœ T.H. Dunigan ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 894 KB

The performance of the Intel iPSC/860 hypercube and the Ncube 6400 hypercube are compared with earlier hypercubes from Intel and Ncube. Computation and communication performance for a number of low-level benchmarks are presented for the Intel iPSC/1, iPSC/2, and iPSC/860 and for the Ncube 3200 and 6

Parallel Implementation of a Recursive L
โœ J.E. Steck; B. Mcmillin; K. Krishnamurthy; G.G. Leininger ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 391 KB

An algorithm based on the Marquardt-Levenberg leastsquares optimization method has been shown by \(S\). Kollias and D. Anastasiou to be a much more efficient training method than gradient descent, when applied to some small feedforward neural networks. Yet, for many applications, the increase in com