Abstract
Supporting availability, integrity, and confidentiality of data is crucial for parallel computer systems. The parallel computer systems require to encode and distribute data over multiple storage nodes to survive failures and malicious attacks. Information Dispersal Scheme(IDS) is one of the most efficient schemes allowing high availability and security with reasonable overhead. In this paper we propose an algorithm determining an optimal IDS in terms of availability.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Shamir, A.: How to Share a Secret: Comm. ACM 22, 612–613 (1979)
Blakley, G.R., Meadows, C.: Security of Ramp Schemes. Advances in Cryptology -CRYPTO, pp. 242–268 (1985)
Rabin, M.O.: Efficient Dispersal of Information for Security. Load Balancing and Fault Tolerance, pp. 335–348. ACM, New York (1989)
Sun, H.-M., Shieh, S.-P.: Optimal Information Dispersal for Increasing the Reliability of a Distributed Service. IEEE Trans. 46, 462–472 (1997)
Wylie, J.J., Bigrigg, M.W., Strunk, J.D., Ganger, G.R., Kiliccote, H., Khosla, P.K.: Survivable information storage systems. IEEE Computer, 61–68 (2000)
Wylie, J.J., Bakkaloglu, M., Pandurangan, V., Bigrigg, M.W., Oguz, S., Tew, K., Williams, C., Ganger, G.R., Khosla, P.K.: Selecting the Right Data Distribution Scheme for a Surviv-able Storage System. Technical Report CMU-CS-01-120 Carnegie Mellon University (2001)
Agrawal, D., Malpini, A.: Efficient dissemination of information in computer networks. The computer journal, 534-541 (1991)
Agrawal, G., Jalote, P.: Coding-based replication schemes for distributed systems. IEEE Transactions on Parallel and Distributed Systems, 240-250 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Song, SK., Youn, HY., Park, JK. (2003). Deciding Optimal Information Dispersal for Parallel Computing with Failures. In: Malyshkin, V.E. (eds) Parallel Computing Technologies. PaCT 2003. Lecture Notes in Computer Science, vol 2763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45145-7_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-45145-7_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40673-0
Online ISBN: 978-3-540-45145-7
eBook Packages: Springer Book Archive