Results 241 to 250 of about 1,360,988 (290)
Some of the next articles are maybe not open access.
An implementation of distributed shared memory
Software - Practice and Experience, 1991AbstractShared memory is a simple yet powerful paradigm for structuring systems. Recently, there has been an interest in extending this paradigm to non‐shared memory architectures as well. For example, the virtual address spaces for all objects in a distributed object‐based system could be viewed as constituting a globaldistributed shared memory.
Umakishore Ramachandran
exaly +2 more sources
Journal of the ACM, 2022
Assuming that there is an a priori agreement between processes on the names of shared memory locations, as is done in almost all the publications on concurrent shared memory algorithms, is tantamount to assuming that agreement has already been solved at a lower level.
openaire +1 more source
Assuming that there is an a priori agreement between processes on the names of shared memory locations, as is done in almost all the publications on concurrent shared memory algorithms, is tantamount to assuming that agreement has already been solved at a lower level.
openaire +1 more source
Analysis of sharing overhead in shared memory multiprocessors [PDF]
Proceedings of the Thirty-First Hawaii International Conference on System Sciences, 2002 The aim of the work is to analyze the overhead caused by general-purpose workloads in managing shared cached copies and investigate the relations among workload features, process scheduling policies, and some architecture features, such as, processor and cache organization, and coherence protocol.
FOGLIA, PIERFRANCESCO +2 more
openaire +2 more sources
IEEE Transactions on Communications, 1983
Efficient design of service facilities, such as data or computer networks that meet random demands, often leads to the sharing of resources among users. Contention for the use of a resource results in queueing. The waiting room is a part of any such service facility. The number of accepted service requests per unit of time (throughput), or the fraction
Gerard J. Foschini, B. Gopinath
openaire +1 more source
Efficient design of service facilities, such as data or computer networks that meet random demands, often leads to the sharing of resources among users. Contention for the use of a resource results in queueing. The waiting room is a part of any such service facility. The number of accepted service requests per unit of time (throughput), or the fraction
Gerard J. Foschini, B. Gopinath
openaire +1 more source
SIAM Journal on Computing, 1997
Summary: Sequential consistency is the most widely used correctness condition for multiprocessor memory systems. This paper studies the problem of testing shared- memory multiprocessors to determine if they are indeed providing a sequentially consistent memory.
Phillip B. Gibbons, Ephraim Korach
openaire +1 more source
Summary: Sequential consistency is the most widely used correctness condition for multiprocessor memory systems. This paper studies the problem of testing shared- memory multiprocessors to determine if they are indeed providing a sequentially consistent memory.
Phillip B. Gibbons, Ephraim Korach
openaire +1 more source
Shared memory vs. message passing in shared-memory multiprocessors
[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 2003It is argued that the choice between the shared-memory and message-passing models depends on two factors: the relative cost of communication and computation as implemented by the hardware, and the degree of load imbalance inherent in the application. Two representative applications are used to illustrate the performance advantages of each programming ...
Thomas J. LeBlanc, Evangelos P. Markatos
openaire +1 more source
Shared memory and distributed shared memory systems: A survey
2000Publisher Summary This chapter illustrates distributed shared memory (DSM) systems that are intended to combine the ease of programming of the shared-memory model with the scalability of the distributed-memory system. DSM systems aim to unify parallel processing systems that rely on message passing with the shared-memory systems. The chapter explores
Krishna M. Kavi +3 more
openaire +1 more source
IEEE Transactions on Communications, 1994
This paper presents an alternative proof for the structure of the optimal policy for the memory sharing problem, where several types of users share a common finite memory (or any other finite resource) and a policy is needed to allocate this memory among different types of service request. It is known that the optimal policy when there are two or three
openaire +1 more source
This paper presents an alternative proof for the structure of the optimal policy for the memory sharing problem, where several types of users share a common finite memory (or any other finite resource) and a policy is needed to allocate this memory among different types of service request. It is known that the optimal policy when there are two or three
openaire +1 more source
Parallel Computing, 1988
Abstract We investigate the use of a hypercube packet switching network as a shared memory server for vector multiprocessors. Using the generalization of a high performance switch node introduced in an earlier paper, we develop a packet switched memory server capable of providing high bandwidth vector access to a shared memory.
openaire +1 more source
Abstract We investigate the use of a hypercube packet switching network as a shared memory server for vector multiprocessors. Using the generalization of a high performance switch node introduced in an earlier paper, we develop a packet switched memory server capable of providing high bandwidth vector access to a shared memory.
openaire +1 more source