M. T. J. Protic and V. Milutinovic, "A survey of distributed shared memory systems," in Proceedings of the 28th Annual Hawaii International Conference on System Sciences. Volume 1: Architecture, T. N. Mudge and B. D. Shriver, Eds. Los Alamitos, Calif.: IEEE Computer Society Press, Jan. 1995, pp. 74--84.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....data. The first design gives the programmers more control whereas the second design provides more transparency. The benefits of both designs include improved efficiency, ease of construction, and ease of use. I. INTRODUCTION Message Passing (MP) and Distributed Shared Memory (DSM) 1] 2] [3], 4] 5] are the two most common approaches to programming on distributed memory systems. MP is scalable but difficult to use, and DSM is easy to use but unscalable. The reason behind the efficiency of MP is that it encourages the programmers to place a subcomputation on the node where the ....

M. T. J. Protic and V. Milutinovic, "A survey of distributed shared memory systems," in Proceedings of the 28th Annual Hawaii International Conference on System Sciences. Volume 1: Architecture, T. N. Mudge and B. D. Shriver, Eds. Los Alamitos, Calif.: IEEE Computer Society Press, Jan. 1995, pp. 74--84.

....message passing one. Second, at the system level, DSM makes transparent transport of programs, load balancing and process migration. So, numerous protocols implementing a DSM on top of a distributed memory parallel machine or on top of a distributed system have been proposed. References [29] and [30] survey systems offering a DSM to their users. DSM implementations have common points with multiprocessor caches, networked file systems and distributed databases. Basically, the shared memory is supported by local memories of processors and copies of a data item can simultaneously be present in ....

....a very subtle way) from the classic semantics associated with a centralized shared memory, namely the atomic semantics. Semantics of a shared memory is espressed by a consistency criterion. Such a criterion defines the value returned by every read operation invoked by a process. In nearly all DSMs [29, 24, 30], this consistency criterion is not formally defined and has to be deduced from the protocol implementing the shared memory. This makes study of properties of DSMs difficult and facilitates neither their understanding nor their comparison. We propose, in this paper, a set of formal definitions for ....

J. Protic, M. Tomasevi'c and V. Milutinovi'c. A survey of distributed shared memory systems. Proc. 28th Annual Hawaii Int. Conf. on System Sciences, Vol. I (Architecture) , pp. 74-84, 1995.

....provide an intuitive interface to the programmer. Essentially, LAM must manage allocation of RM space and synchronize access to this shared space. In this section the architectural properties of LAM are described. 4. 1 Architectural Properties In terms of the DSM classification system provided in [Pro95], LAM has the following architectural properties. DSM implementation: hybrid with library routines. LAM uses RM hardware as the interconnect media. The library routines are linked into the application and allow the programmer to allocate and synchronize shared memory from RM space. Shared data ....

J. Protic, M. Tomasevic, V. Multinovic, "A Survey of Distributed Shared Memory Systems," Proceedings of the 28th Annual Hawaii International Conference on System Sciences, January 1995, pp 74--84.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC