Sciweavers

2300 search results - page 249 / 460
» Maximally Concurrent Programs
Sort
View
SC
2000
ACM
15 years 11 months ago
Dynamic Software Testing of MPI Applications with Umpire
As evidenced by the popularity of MPI (Message Passing Interface), message passing is an effective programming technique for managing coarse-grained concurrency on distributed com...
Jeffrey S. Vetter, Bronis R. de Supinski
POS
1998
Springer
15 years 10 months ago
Optimizing the Read and Write Barriers for Orthogonal Persistence
Persistent programming languages manage volatile memory as a cache for stable storage, imposing a read barrier on operations that access the cache, and a write barrier on updates ...
Antony L. Hosking, Nathaniel Nystrom, Quintin I. C...
ICS
2010
Tsinghua U.
15 years 5 months ago
An approach to resource-aware co-scheduling for CMPs
We develop real-time scheduling techniques for improving performance and energy for multiprogrammed workloads that scale nonuniformly with increasing thread counts. Multithreaded ...
Major Bhadauria, Sally A. McKee
MICRO
2002
IEEE
159views Hardware» more  MICRO 2002»
15 years 11 months ago
Master/slave speculative parallelization
Master/Slave Speculative Parallelization (MSSP) is an execution paradigm for improving the execution rate of sequential programs by parallelizing them speculatively for execution ...
Craig B. Zilles, Gurindar S. Sohi
ISCA
2007
IEEE
198views Hardware» more  ISCA 2007»
16 years 26 days ago
Making the fast case common and the uncommon case simple in unbounded transactional memory
Hardware transactional memory has great potential to simplify the creation of correct and efficient multithreaded programs, allowing programmers to exploit more effectively the s...
Colin Blundell, Joe Devietti, E. Christopher Lewis...