By Topic

Computer storage structure and utilization at a large scientific laboratory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
J. G. Fletcher ; University of California, Livermore, Calif. ; S. Fernbach ; P. J. DuBois ; G. L. Boer

The Octopus computer network at the Lawrence Livermore Laboratory, University of California, Livermore, ties together one of the largest concentrations of computing capability in the world, serving about 1500 users. The network's information storage capacity is large in every range of access speed. There are computers with main memories of 30 Mbits and secondary storage of 10 Gbits, a shared tertiary store of 1 Tbit, and 30-40 thousand reels of magnetic tape. This storage supports correspondingly large numerical simulations and other application programs that require the continuous operation of four major computers. Efficient storage use necessitates proper design of algorithms and buffer structures on the part of both the users and the system implementors. The main problems that arise include maintenance of high data transfer rates, reliability in the presence of intermittent hardware failure, achieving balance between media with differing access speeds, flexibility of the indexing structure, and equitable allocation among users. The discussion covers these issues in some detail and includes an historical perspective and estimates of future trends.

Published in:

Proceedings of the IEEE  (Volume:63 ,  Issue: 8 )