Abstract: Efficient data management and distribution in a multicomputer is a subject of much research. Distributed file systems are the most common solution of this problem, however, recent works are focused on more general data distribution protocols. Scalable, Distributed Data Structures (SDDS) are another promising approach to this issue. In this paper we discuss the efficiency of an implementation of SDDS in various applications. The results of experiments are presented.
B I B L I O G R A F I A1. Tanenbaum A. S., Steen M., Distributed Systems-Principles and Paradigms (Prentice Hall, New Jersey, 2002): 21-23.
2. Coulouris G., Dollimore J., Kindberg T., Distributed Systems Concepts and Design (Addison Wesley Longman Limited, London, 1996): 301-338.
3. Stoica I., Morris R., Liben-Nowell D. et al., Chord: A scalable peer-to-peer lookup protocol for internet applications, Proc. of the 2001 ACM SIGCOMM Conference (2001): 149-160.
4. Manku G. S., Bawa M., Raghavan P., Symphony: distributed hashing in a small world, Proc. of the 4th USENIX Symposium on Internet Technologies and Systems (USENIX Association Berkeley, CA, 2003): 127-140.
5. Litwin W., Neimat M-A., Schneider D. A., LH*-a scalable, distributed data structure ACM transactions on database systems 21(4), Kim W. (ACM, New York, 1996): 480-525.
6. Gribble S., Brewer E., Hellerstein J., Culler D., Scalable, distributed data structure for internet service construction, Proc. of OSDI 4 (USENIX Association Berkeley, CA, 2000): 319-332.
7. Kubiatowicz J., Bindel D., Chen Y. et al., OceanStore: an architecture for global-scale persistent storage, ACM SIGPLAN Notices 35(11), Norris C., Fenwick J. B. Jr, (ACM New York, NY, 2000): 190-201.
8. Mokadem R., Litwin W., String-matching and update through algebraic signatures in scalable distributed data structures, Proc. of the 17th International Conference on Database and Expert Systems Applications (IEEE Computer Society Washington, DC, 2006): 708-711.
9. Gupta V., Modi M., Pimentel A. D., Performance evaluation of the LH*lh scalable, distributed data structure for a cluster of workstations, Proc. of the 2001 ACM Symposium on Applied Computing (ACM New York, NY, USA, 2001): 544-548.
10. Litwin W., Niemat M.-A., Schneider D., RP*: A family of order preserving scalable distributed data structures, Proc. of the 20th International Conference on Very Large Databases, Bocca J. B., Jarke M., Zaniolo C., (Morgan Kaufman Publishers Inc. San Francisco, CA, 1994): 342-353.
11. Sapiecha K., Łukawski G., Fault-tolerant protocols for scalable distributed data structures, Lecture Notes in Computer Science 3911 (2005): 1018-1025.
12. Litwin W., Schwarz T., LH*RS: A high-availability scalable distributed data structure using Reed Solomon codes, Proc. of the 200 SIGMOD Conference on Management of data (ACM New York, NY, 2000): 237-248.
13. Love R., Linux Kernel Development (Novell Press, USA, 2005): 235-276.
14. Knuth D. E., The Art of Computer Programming Vol. 3 Sorting and Searching (Addison Wesley Longman, 1998): 566-572.
15. Shakshober D. J., Choosing an I/O Scheduler for Red Hat Enterprise Linux 4 and the 2.6 Kernel (web article), Red Hat Magazine (unpublished, 2005) http://www.redhat.com/magazine/008jun05/features/schedulers
16. Chrobot A., Łukawski G., Sapiecha K., Scalable Distributed Data Structures for Linux-based multicomputer, 7th International Symposium on Parallel and Distributed Computing, Tudruj M., (IEEE C. S., DC, 2008): 424-428. 
Pełny tekst 
DOI