Sciweavers

506 search results - page 41 / 102
» Distributing synchronous programs using bounded queues
Sort
View
ISHPC
2003
Springer
14 years 26 days ago
Evaluating Heuristic Scheduling Algorithms for High Performance Parallel Processing
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
Lars Lundberg, Magnus Broberg, Kamilla Klonowska
SRDS
1999
IEEE
13 years 12 months ago
Fault Injection based on a Partial View of the Global State of a Distributed System
Validating distributed systems is particularly difficult, since failures may occur due to a correlated occurrence of faults in different parts of the system. This paper describes ...
Michel Cukier, Ramesh Chandra, David Henke, Jessic...
SPAA
2010
ACM
14 years 14 days ago
Simplifying concurrent algorithms by exploiting hardware transactional memory
We explore the potential of hardware transactional memory (HTM) to improve concurrent algorithms. We illustrate a number of use cases in which HTM enables significantly simpler c...
Dave Dice, Yossi Lev, Virendra J. Marathe, Mark Mo...
PPOPP
2003
ACM
14 years 28 days ago
Using generative design patterns to generate parallel code for a distributed memory environment
A design pattern is a mechanism for encapsulating the knowledge of experienced designers into a re-usable artifact. Parallel design patterns reflect commonly occurring parallel co...
Kai Tan, Duane Szafron, Jonathan Schaeffer, John A...
HPCA
1999
IEEE
13 years 12 months ago
Comparative Evaluation of Fine- and Coarse-Grain Approaches for Software Distributed Shared Memory
Symmetric multiprocessors (SMPs) connected with low-latency networks provide attractive building blocks for software distributed shared memory systems. Two distinct approaches hav...
Sandhya Dwarkadas, Kourosh Gharachorloo, Leonidas ...