Revision as of 22:50, 27 February 2011

Abstract

Access to stored data in main memory is much faster than access to local disks/hard drives. Well maintained data structures can utilize such access. In addition, the performance of the memory fetch, dispatch and store operations on Distributed Operating Systems would augment if they exploit a highly scalable distributed data structures. This paper describes the concept of Distributed Data Structures (DDS) which has been made viable by multicomputers. Scalability aspects and their implementation are reviewed for a chosen subset of classic data structures. Open research issues for SDDS are also discussed.

Revision as of 22:45, 27 February 2011 view source AbdelRahman (talk \| contribs) 302 edits Created page with "=Abstract= n/a"		Revision as of 22:50, 27 February 2011 view source AbdelRahman (talk \| contribs) 302 edits →‎Abstract Newer edit →
Line 1:		Line 1:


	=Abstract=		=Abstract=
	n/a		Access to stored data in main memory is much faster than access to local disks/hard drives. Well maintained data structures can utilize such access. In addition, the performance of the memory fetch, dispatch and store operations on Distributed Operating Systems would augment if they exploit a highly scalable distributed data structures. This paper describes the concept of Distributed Data Structures (DDS) which has been made viable by multicomputers. Scalability aspects and their implementation are reviewed for a chosen subset of classic data structures. Open research issues for SDDS are also discussed.