
	Where results make sense

Topic: Distributed shared memory

Related Topics

random access memory

Hart Memorial Trophy

Lincoln Memorial

Forest Lawn Memorial Park Cemetery

computer memory

flash memory

Art Ross Memorial Trophy

read only memory

Memorial Day

core memory

Virtual Memory System

In the News (Wed 16 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Distributed shared memory - Wikipedia, the free encyclopedia
		Distributed Shared Memory (DSM), in computer science, refers to a wide class of software and hardware implementations, in which each node of a cluster has access to a large shared memory in addition to each node's limited non-shared private memory.
		Such systems are transparent to the developer; which means that the underlying distributed memory is completely hidden from the users.
		Shared memory architecture may involve separating memory into shared parts distributed amongst nodes and main memory; or distributing all memory between nodes.
	en.wikipedia.org /wiki/Distributed_shared_memory (258 words)

	Distributed memory - Wikipedia, the free encyclopedia
		Distributed memory is a concept used in parallel computing.
		It means that in a multi-processor system each processor has its own memory.
		The related term is Distributed shared memory, a model in which in addition to private memories of the nodes there exist large, conceptually shared memory (though in reality such memory may be physically distributed between many different nodes, hence the name).
	en.wikipedia.org /wiki/Distributed_memory (123 words)

	Distributed Shared Memory (Site not responding. Last check: 2007-11-03)
		Multiprocessor machines have shared memory and are far easier to program than multicomputers without shared memory.
		Distributed shared memory is a technique for making multicomputers easier to program by simulating shared memory on them.
		We can simplify the implementation of the shared memory system by dropping the requirement that causally related memory accesses must be seen in the same order by all machines.
	www.cs.rutgers.edu /~pxk/rutgers/syllabus/dsm.html (1476 words)

	A Comprehensive Bibliography of Distributed Shared Memory (Site not responding. Last check: 2007-11-03)
		Shared memory is an attractive programming model for designing parallel and distributed applications.
		This abstraction is commonly known as Distributed Shared Memory (DSM).
		DSM has been implemented both in software (e.g., to provide the shared memory programming model on networks of workstations) and in hardware (e.g., using cache consistency protocols to support shared memory across physically distributed main memories).
	www.cs.umd.edu /~keleher/bib/dsmbiblio/dsmbiblio.html (349 words)

	Transactional Distributed Shared Memory
		Distributed shared memory will not necessarily benefit all applications, however, since it may transfer more data than is needed by the application, and the cost of keeping the cached data consistent may be too large relative to the cost of the processing performed on the data.
		In a complicated distributed system with many transactions concurrently modifying many objects in distributed shared memory, the task of reliably locating the appropriate version of an object, and/or locating a description of the modifications made by a particular transaction can be very difficult.
		Distributed shared memory automatically partitions the data among nodes to match the locality of reference, and migrates the data as references move.
	www.cs.cmu.edu /People/abh/summary.html (5281 words)

	Distributed shared memory at opensource encyclopedia (Site not responding. Last check: 2007-11-03)
		Distributed Shared Memory (DSM) is a term from computer science applying to wide class of software and hardware implementations, in which a set of nodes in addition to limited non-shared private memory has access to large shared memory.
		Shared memory may be separated into shared parts distributed amongst nodes and main memory, or all memory may be distributed between nodes.
		The memory coherence is maintained via one of coherence protocols in accordance to chosen consistency model.
	www.wiki.tatet.com /Distrubuted_shared_memory.html (187 words)

	Distributed Shared Memory
		Memory updates are written to bus, where other snooping caches see them and invalidate or update their copies.
		Shared data pertaining to a critical region are made consistent when a critical region is entered.
		Updates to shared variables are flagged in run-time-system maintained tables, and said flags are used to determine which variables to broadcast on variable release.
	www.rscc.cc.tn.us /faculty/bell/etsu/OpSys/t6.html (3963 words)

	Distributed Shared Memory Home Pages (Site not responding. Last check: 2007-11-03)
		Despite the long and extensive history of work in the DSM area and the well accepted fact that the shared memory paradigm provides the user with an easy-to-use environment, DSM systems for cluster architectures are still mainly research based.
		Page-based distributed shared memory is similar to the virtual memory mechanism of an operating system except that the pages may exist across a network of machines (in a distributed operating system the virtual memory mechanism and page-based distributed shared memory may be one and the same).
		The DSM system implements memory management and communication for loosely coupled machines hiding network boundaries to processes accessing shared memory, providing the illusion of a coarse grained multiprocessor to the programmer and algorithm designer.
	www.cs.utexas.edu /users/kistler/dsm/dsm_links.htm (5710 words)

	Distributed Shared Memory
		A paper discussing the lack of user acceptance of current DSM systems is "John B. Carter, Dilip Khandekar, Linus Kamb, Distributed Shared Memory: Where We Are and Where We Should Be Headed".
		Theoretical aspects of DSM systems, mainly about sequential consistency memory models, can be found in "M. Mizuno, M. Raynal, J.Z. Zhou, Sequential Consistency in Distributed Systems: Theory and Implementation".
		Instead of causing a page fault upon first write cycle, every write access to a shared memory location is coupled with a little overhead dirty bit operation, which is inlined by a specially tuned compiler.
	www4.informatik.uni-erlangen.de /Projects/MEMSY/DSM/dsm.html (777 words)

	Distributed Shared Memory and Memory Objects
		Distributed shared memories (DSM) allow processes to share memory objects even when they execute in environments such as workstation cluster where shared memory is not provided by the the hardware.
		Processes executing in a workstation cluster environment can share memory by using memory objects which can be read and written at multiple nodes.
		Such memory objects were constructed on top of the Indigo system that has been implemented by us.
	www.cc.gatech.edu /systems/projects/COBS/apr_96/node7.html (215 words)

	DSM : Distributed Shared Memory Systems
		In that context, by allowing the programmer to access and to share "memory objects" (pages or variables) without being in charge of their management, Virtually shared memory systems want to propose a trade-off between the easy-programming of shared memory machines and the efficiency and scalability of distributed memory systems.
		A distributed shared memory is a mechanism allowing end-users' processes to access shared data without using inter-process communications.
		Shared virtual memory: This notion is very similar to the well-known concept of paged virtual memory implemented in mono-processor systems.
	www.ens-lyon.fr /LIP/RESO/Software/Dosmos/DSM.html (540 words)

	A Distributed Shared Memory Facility for FreeBSD
		A distributed shared memory (DSM) facility permits processes running at separate hosts on a network to share virtual memory in a transparent fashion, as if the processes were actually running on a single processor [LH89].
		The DSM subsystem handles this request, communicating, if necessary, with DSM servers elsewhere in the network either to obtain a copy of the page to be read, or else to synchronize with the other servers to ensure that a write operation can be performed on a page without violating data consistency guarantees.
		Chorus's DSM uses one of Li's dynamic manager distributed algorithms with page invalidation [LH89] but the authors do not specify which and their description of the protocol is rather incomplete.
	bsd7.starkhome.cs.sunysb.edu /~stark/REPORTS/usenix97/paper.html (8407 words)

	JXTASpaces: A Distributed Shared Memory Service for JXTA
		Distributed shared memory is a model for inter-process communication that provides the illusion of a shared memory on top of a message passing system.
		Programming distributed applications using a shared memory abstraction is less complex than explicitly using message passing.
		A well-known software implementation of distributed shared memory is the generative communication model, best represented by the Linda coordination language for parallel computing.
	www.theserverside.com /news/thread.tss?thread_id=27598 (2078 words)

	Distributed Shared-Memory Architectures
		Distributed shared-memory machines need cache coherence for the same reasons that centralized shared-memory machines need it.
		The distributed nature of the snooping protocol's data structure (which maintains the state of the cache blocks) does NOT scale well.
		Deciding the order of accesses in a distributed memory system is much harder.
	www.cs.umbc.edu /~plusquel/611/slides/chap8_3.html (757 words)

	DSM Motivation (Site not responding. Last check: 2007-11-03)
		Distributed Shared Memory enables programs to access data in traditional virtual memory.
		The Distributed Shared Memory spares the programmer the concerns of message passing when writing applications that might otherwise have to use it.
		Shared memory provides the fastest possible communication, hence the greatest opportunity for concurrent execution.
	cne.gmu.edu /modules/dsm/green/dsmintro.html (162 words)

	Object-Based Distributed Shared Memory (Site not responding. Last check: 2007-11-03)
		This model is in contrast to page-based DSM systems, which just provide a raw linear memory of bytes from 0 to some maximum.
		Once a decision has been made to structure a shared memory as a collection of separate objects instead of as a linear address space, there are many other choices to be made.
		A second potential disadvantage is that since all accesses to shared objects must be done by invoking the objects' methods, extra overhead is incurred that is not present with shared pages that can be accessed directly.
	cne.gmu.edu /modules/dsm/yellow/object_dsm.html (545 words)

	Distributed Shared Memory: A Survey - Silcock (ResearchIndex)
		Abstract: Distributed Shared Memory is an important topic in distributed system research as it allows programmers to write and use code for shared memory multiprocessors on a system which does not in fact have physically shared memory.
		Silcock, Distributed Shared Memory: A Survey, School of Computing and Mathematics, Deakin University, Technical Report TR C95/22, June 1995.
		1 Mermera: Non-Coherent Distributed Shared Memory for Parallel..
	citeseer.ist.psu.edu /319606.html (488 words)

	Shared versus distributed memory (Site not responding. Last check: 2007-11-03)
		In a shared memory system, processors communicate by reading and writing messages to a globally known memory address.
		Message passing machines do not have consistency problems because there is no shared memory that needs to be consistently represented.
		Such a hybrid architecture consists of a message passing machine with hardware and/or middleware that provides a consistent shared memory addressing scheme for programmers.
	www.cs.mu.oz.au /677/notes/node17.html (389 words)

	DOSMOS : Distributed Objects Shared MemOry System
		The goal of the DOSMOS project is to build a new concept of Distributed Shared Memory System (DSM) which mixes efficiency and ease of programming.
		If distributed memory MIMD machines allow very high performances, their programming remains ``esoteric'' for most of end-users accustomed to classical mono-processor programming.
		Oppositely, shared memory parallel computers are easier to program but badly adapted to applications generating many memory accesses.
	perso.ens-lyon.fr /laurent.lefevre/DOSMOS/Dosmos.html (406 words)

	A Comprehensive Bibliography of Distributed Shared Memory
		DSM, distributed shared memory, memory coherence, memory consistency models, coherence protocols.
		Determining the most appropriate classification for existing DSM research was a difficult task and placing papers into a single category sometimes required making seemingly arbitrary decisions.
		Each paper was placed into the category which the author felt was most relevant to the work described in that paper–the author apologizes in advance to researchers who feel that their work was incorrectly categorized or omitted entirely.
	liinwww.ira.uka.de /bibliography/Parallel/dsm.html (307 words)

	Algorithms Implementing Distributed Shared Memory
		Four basic algorithms for implementing distributed shared memory are compared.
		The merits of distributed shared memory and the assumptions made with respect to the environment in which the shared memory algorithms are executed are described.
		Two particularly interesting extensions of the basic algorithms are described, and some limitations of distributed shared memory are noted.
	csdl.computer.org /comp/mags/co/1990/05/r5054abs.htm (368 words)

	ADAM (Site not responding. Last check: 2007-11-03)
		Distributed shared memory (DSM) systems are gaining popularity for providing a logically shared memory over physically distributed memory.
		The programmer is given the illusion of a large global address space encompassing all available memory, eliminating the task of explicitly moving data between processes located on separate machines.
		DSM systems combine programming advantages of shared memory and the cost advantages of distributed memory.
	www.cs.wayne.edu /~haj/html/adam.html (327 words)

	Distributed Shared Memory Systems (ResearchIndex)
		Abstract: INTRODUCTION The effectiveness of distributed shared memory systems, in providing parallel and distributed systems as a cost effective option for high performance computation, is qualified by four key properties: simplicity, portability, efficiency and scalability.
		Simplicity: Distributed Shared Memory (DSM) systems provide relatively easy to use and uniform model for accessing all shared data, whether local or remote.
		16 A Kernel Implementation of Distributed Shared Memory for a N..
	citeseer.ist.psu.edu /408024.html (325 words)

	Distributed Shared Memory Systems (Site not responding. Last check: 2007-11-03)
		A Distributed Shared Memory systems provides a view of logically shared memory over physically distributed memory.
		Contrast this with the message passing approach, where one has to be aware that there are different machines in the compute platform, and data has to be explicitly sent across the nodes.
		However, since the sharing unit is very large (a multiple of the page size), they can suffer from false sharing, ie.
	www.pdcl.eng.wayne.edu /~sumit/research/dsm.html (273 words)

	distributed shared memory ? (Site not responding. Last check: 2007-11-03)
		The distributed > shared memory model on the Convex however is a very user friendly way to > write parallel codes.
		There are a bunch of research-quality DSM implementations out there, most of which require you to insert extra subroutine calls.
		I haven't heard of anyone using one in a large cluster, except Ron Minnich at Sarnoff Labs: ftp://ftp.sarnoff.com/pub/mnfs/www/docs/cluster.html His DSM system, ZOUNDS, can be downloaded.
	www.beowulf.org /pipermail/test/1998-July/002010.html (277 words)

	Distributed Shared Memory (Site not responding. Last check: 2007-11-03)
		Distributed shared memory (DSM) combines the two concepts.
		Dynamic distributed manager--(Li's algorithm) Each copy of block caches probable owner (which may need to be forwarded to real owner).
		Where is lookup of data done and an action must be taken on write to preserve coherence of shared data.
	www.cs.wpi.edu /~cew/courses/535/proticslides/proticslides.html (346 words)

	Disco Lab - Rutgers University
		We implement the shared memory abstraction as a software layer on top of a fast communication library.
		These techniques are reminiscent of the Adaptive DSM System and include home migration, adaptation between single and multiple writer protocols, and adaptation between invalidate and update protocols.
		Fault tolerance support should not add too much overhead during the failure-free operation of the system, and the mechanisms it uses must work without global coordination, which may be either expensive or impractical in the targeted environments.
	discolab.rutgers.edu /dsm (578 words)

	CS395: Distributed Shared Memory (Site not responding. Last check: 2007-11-03)
		This report should be structured such that it can easily be used as the basis for a series of roughly four lectures on DSM for upper level undergraduate or first year graduate course on distributed systems.
		Memory Sharing Predictor: The Key to a Speculative Coherent DSM, An-Chow Lai and Babak Falsafi (ACM/IEEE International Symposium on Computer Architecture (ISCA), May 1999).
		Shared Memory Consistency Models: A Tutorial, S.V. Adve and K. Gharachorloo, Rice University ECE Technical Report 9512 and Western Research Laboratory Research Report 95/7, September 1995.
	www.cs.utexas.edu /users/kistler/cs395_dsm (305 words)

Try your search on: Qwika (all wikis)