Efficient, distributed data placement strategies for storage area networks (extended abstract)

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: André Brinkmann Department of Electrical Engineering and Information Technology and Heinz Nixdorf Institute (HNI), Paderborn University, D-33102 Paderborn, Germany
Kay Salzwedel Graduiertenkolleg, HNI, Paderborn University, D-33102, Paderborn, Germany
Christian Scheideler Department of Mathematics & Computer Science, and HNI, Paderborn University, D-33102 Paderborn, Germany
Published in:
Cover Image
 
· Proceeding
SPAA '00 Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Pages 119-128
ACM New York, NY, USA ©2000
table of contents ISBN:1-58113-185-2 doi>10.1145/341800.341815
Efficient, distributed data placement strategies for storage area networks (extended abstract) Published by ACM 2000 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 8
· Downloads (12 Months): 57
· Downloads (cumulative): 1,162
· Citation Count: 19


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder