Sciweavers

1156 search results - page 54 / 232
» Efficient Barriers for Distributed Shared Memory Computers
Sort
View
PODC
2004
ACM
14 years 4 months ago
Byzantine disk paxos: optimal resilience with byzantine shared memory
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
Ittai Abraham, Gregory Chockler, Idit Keidar, Dahl...
CF
2006
ACM
14 years 4 months ago
Memory efficient parallel matrix multiplication operation for irregular problems
Regular distributions for storing dense matrices on parallel systems are not always used in practice. In many scientific applicati RUMMA) [1] to handle irregularly distributed mat...
Manojkumar Krishnan, Jarek Nieplocha
BDIM
2007
IEEE
95views Business» more  BDIM 2007»
14 years 5 months ago
A Mechanism of Specifying and Determining Pricing in Utility Computing Environments
Utility services providers offer on-demand services for multiple users and applications from a shared resource pool. The utility computing environment provider manages resources th...
Jinsong Ouyang, Akhil Sahai, Jim Pruyne
EUROPDS
1997
14 years 3 days ago
A Combined Virtual Shared Memory and Network which Schedules
In this paper, we follow a new path to arrive at the idea of a COMA — a Cache Only Memory Architecture. We show how the evolution of another architecture (ADARC) leads quite nat...
Ronald Moore, Bernd Klauer, Klaus Waldschmidt
EUROPAR
2005
Springer
14 years 4 months ago
A Novel Lightweight Directory Architecture for Scalable Shared-Memory Multiprocessors
There are two important hurdles that restrict the scalability of directory-based shared-memory multiprocessors: the directory memory overhead and the long L2 miss latencies due to ...
Alberto Ros, Manuel E. Acacio, José M. Garc...