Sciweavers

1156 search results - page 10 / 232
» Efficient Barriers for Distributed Shared Memory Computers
Sort
View
118
Voted
SPAA
2003
ACM
15 years 9 months ago
Quantifying instruction criticality for shared memory multiprocessors
Recent research on processor microarchitecture suggests using instruction criticality as a metric to guide hardware control policies. Fields et al. [3, 4] have proposed a directed...
Tong Li, Alvin R. Lebeck, Daniel J. Sorin
129
Voted
HPCC
2010
Springer
15 years 4 months ago
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-Grained Parallelism
This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with d...
Stefan Marr, Stijn Verhaegen, Bruno De Fraine, The...
144
Voted
IPPS
1998
IEEE
15 years 8 months ago
Configuration Independent Analysis for Characterizing Shared-Memory Applications
Characterizing shared-memory applications provides insight to design efficient systems, and provides awareness to identify and correct application performance bottlenecks. Configu...
Gheith A. Abandah, Edward S. Davidson
128
Voted
IEEEPACT
2005
IEEE
15 years 9 months ago
Store-Ordered Streaming of Shared Memory
Coherence misses in shared-memory multiprocessors account for a substantial fraction of execution time in many important scientific and commercial workloads. Memory streaming prov...
Thomas F. Wenisch, Stephen Somogyi, Nikolaos Harda...