Views and Consistencies in Distributed Shared Memory
Author :
Publisher :
Page : pages
File Size : 47,31 MB
Release : 2000
Category :
ISBN :
Author :
Publisher :
Page : pages
File Size : 47,31 MB
Release : 2000
Category :
ISBN :
Author : Vincent Gramoli
Publisher : Springer Nature
Page : 176 pages
File Size : 31,63 MB
Release : 2022-05-31
Category : Computers
ISBN : 3031020154
Providing a shared memory abstraction in distributed systems is a powerful tool that can simplify the design and implementation of software systems for networked platforms. This enables the system designers to work with abstract readable and writable objects without the need to deal with the complexity and dynamism of the underlying platform. The key property of shared memory implementations is the consistency guarantee that it provides under concurrent access to the shared objects. The most intuitive memory consistency model is atomicity because of its equivalence with a memory system where accesses occur serially, one at a time. Emulations of shared atomic memory in distributed systems is an active area of research and development. The problem proves to be challenging, and especially so in distributed message passing settings with unreliable components, as is often the case in networked systems. We present several approaches to implementing shared memory services with the help of replication on top of message-passing distributed platforms subject to a variety of perturbations in the computing medium.
Author : Jelica Protic
Publisher : John Wiley & Sons
Page : 384 pages
File Size : 39,76 MB
Release : 1997-08-10
Category : Computers
ISBN : 9780818677373
The papers present in this text survey both distributed shared memory (DSM) efforts and commercial DSM systems. The book discusses relevant issues that make the concept of DSM one of the most attractive approaches for building large-scale, high-performance multiprocessor systems. The authors provide a general introduction to the DSM field as well as a broad survey of the basic DSM concepts, mechanisms, design issues, and systems. The book concentrates on basic DSM algorithms, their enhancements, and their performance evaluation. In addition, it details implementations that employ DSM solutions at the software and the hardware level. This guide is a research and development reference that provides state-of-the art information that will be useful to architects, designers, and programmers of DSM systems.
Author : J. Silcock
Publisher :
Page : 11 pages
File Size : 12,10 MB
Release : 1996
Category : Computer architecture
ISBN :
Author : Abdul Naeem
Publisher : LAP Lambert Academic Publishing
Page : 260 pages
File Size : 40,3 MB
Release : 2013
Category :
ISBN : 9783659380297
The shared memory systems should support parallelization at the computation (multiprocessor), communication (Network-on-Chip, NoC) and memory architecture levels to exploit the potential performance benefits. Such systems are facing the critical issues of memory consistency and coherence. Memory consistency issue arises due to the unconstrained operations which sometimes lead to the unexpected behavior of the systems. Memory consistency models are used to resolve this issue. Relaxed or weaker consistency models enforce less ordering constraints on the memory operations and exploit system optimizations compared to the stricter models. This book discusses the novel realization schemes and scalability analysis of strict Sequential Consistency (SC) model and relaxed memory consistency models: Total Store Ordering (TSO), Partial Store Ordering (PSO), Weak Ordering (WO), Release Consistency (RC), and Protected Release Consistency (PRC) in the NoC based distributed shared memory multiprocessor systems. This study should help the average readers and professionals to understand the critical issue of memory consistency both in the NoC based systems and general purpose multiprocessor systems.
Author : Venkateswarlu Chennareddy
Publisher : Independently Published
Page : 0 pages
File Size : 37,9 MB
Release : 2024-02-07
Category : Computers
ISBN :
This book talks about the Specification and Verification of Distributed Shared Memory Relaxed Consistency Models specifically Weak Consistency Models. For this, an abstract Distributed Shared Memory (DSM) has been designed and implemented using CADP (Construction and Analysis of Distributed Processes). In DSM, sequential consistency unnecessarily reduces the performance of the system because it does not allow reordering or pipelining the memory operations. Weak consistency allows the reordering of memory events and buffering or pipelining of memory accesses so weak consistency improves the performance of the DSM system. For any critical system, it is very important to develop methods that increase our confidence in the correctness of such systems. One such method for the correctness of critical systems is formal verification. For verification of the weak consistency model, the properties of weak consistency have been specified and verified on the Abstract DSM System using CADP Toolbox.
Author : Krzysztof Piotrowski
Publisher : Sudwestdeutscher Verlag Fur Hochschulschriften AG
Page : 284 pages
File Size : 39,70 MB
Release : 2012-03
Category :
ISBN : 9783838131597
This work investigates the feasibility of data consistency models to be used in Distributed Shared Memory (DSM) for Wireless Sensor Networks (WSN) to enable more powerful distributed systems with reliable data exchange. It starts with an introduction of WSN and consistency related approaches. Based on these basics, mechanisms that enable data consistency are discussed as a theoretical framework for the prototypical implementation of a data consistency providing middleware that was implemented as part of this work. The proposed middleware adapts the mechanisms known from the original memory consistency approaches to make them usable in the sensor network area and also proposes own low cost mechanisms. The latter are at least partially based on the idea that within the shared memory in WSNs the information is the major concern and by that the replica update rates can be tailored to the application. In order to allow for ease of use of the middleware, the replication schemes and the consistency mechanisms are defined by the application engineer as a policy. The most appropriate memory consistency models were implemented and evaluated using the framework proposed in this work.
Author : Christoph Lindemann
Publisher :
Page : 38 pages
File Size : 15,43 MB
Release : 1991
Category : Virtual storage (Computer science)
ISBN :
The compact DSPN is employed for a quantitative performance analysis of the sequential consistency protocol. A detailed evaluation of the sequential consistency protocol is presented which give [sic] important hints for designing more relaxed consistency models."
Author : K. M. Liew
Publisher : Springer Science & Business Media
Page : 914 pages
File Size : 18,3 MB
Release : 2004-12-02
Category : Computers
ISBN : 3540240136
This book constitutes the refereed proceedings of the 5th International Conference on Parallel and Distributed Computing, Applications and Technologies; PDCAT 2004, held in Singapore in December 2004. The 173 papers presented were carefully reviewed and selected from 242 submissions. The papers focus on parallel and distributed computing from the perspectives of algorithms, networking and architecture, software systems and technologies, and applications. Besides classical topics from high performance computing, major recent developments are addressed, such as molecular computing, date mining, knowledge discovery, optical networks, secure computing and communications, wireless networks, mobile computing, component-based systems, Internet computing, and Web Technologies.
Author : Sindhu Singh
Publisher :
Page : 0 pages
File Size : 27,65 MB
Release : 2010
Category :
ISBN :
Distributed Shared Memory (DSM) is a collection of nodes or clusters, each with its own memory connected by an interconnected network. The key issue in DSM is keeping the memory pages consistent. It refers to the degree of consistency that has to be maintained for the shared memory data. Maintaining perfect consistency is especially painful when the difference between the latency and/or throughput of memory accesses on the one hand, and the network connecting the machines on which these copies reside on the other, is big. The solution might be to accept less than perfect consistency as the price for better performance. This paper reviews various memory consistency models which are used in different DSM systems.