Sciweavers

628 search results - page 35 / 126
» Tying Memory Management to Parallel Programming Models
Sort
View
HPCA
2007
IEEE
15 years 10 months ago
A Scalable, Non-blocking Approach to Transactional Memory
Transactional Memory (TM) provides mechanisms that promise to simplify parallel programming by eliminating the need for locks and their associated problems (deadlock, livelock, pr...
Hassan Chafi, Jared Casper, Brian D. Carlstrom, Au...
SPAA
2003
ACM
15 years 3 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
IPPS
2008
IEEE
15 years 4 months ago
Intermediate checkpointing with conflicting access prediction in transactional memory systems
Transactional memory systems promise to reduce the burden of exposing thread-level parallelism in programs by relieving programmers from analyzing complex inter-thread dependences...
M. M. Waliullah, Per Stenström
WSC
1997
14 years 11 months ago
Simulation of Modern Parallel Systems: A CSIM-based Approach
Components of modern parallel systems are becoming quite complex with many features and variations. An integrated modeling of these components (interconnection network, messaging ...
Dhabaleswar K. Panda, Debashis Basak, Donglai Dai,...
ISCA
1998
IEEE
114views Hardware» more  ISCA 1998»
15 years 1 months ago
Tempest and Typhoon: User-Level Shared Memory
Future parallel computers must efficiently execute not only hand-coded applications but also programs written in high-level, parallel programming languages. Today's machines ...
Steven K. Reinhardt, James R. Larus, David A. Wood