Sciweavers

628 search results - page 25 / 126
» Tying Memory Management to Parallel Programming Models
Sort
View
IWMM
2011
Springer
254views Hardware» more  IWMM 2011»
14 years 29 days ago
Short-term memory for self-collecting mutators
We propose a new memory model called short-term memory for managing objects on the heap. In contrast to the traditional persistent memory model for heap management, objects in sho...
Martin Aigner, Andreas Haas, Christoph M. Kirsch, ...
PPOPP
2010
ACM
15 years 7 months ago
Modeling transactional memory workload performance
Transactional memory promises to make parallel programming easier than with fine-grained locking, while performing just as well. This performance claim is not always borne out bec...
Donald E. Porter, Emmett Witchel
PSLS
1995
15 years 1 months ago
Lazy Remote Procedure Call and its Implementation in a Parallel Variant of C
Abstract. Lazy task creation (LTC) is an e cient approach for executing divide and conquer parallel programs that has been used in the implementation of Multilisp's future con...
Marc Feeley
WSC
2001
14 years 11 months ago
Managing event traces for a web front-end to a parallel simulation
To enhance the widespread use of a parallel supply chain simulator, a web front-end that enables access at any time and from any location has been developed. The front-end provide...
Boon-Ping Gan, Li Liu, Zhengrong Ji, Stephen John ...
IEEEHPCS
2010
14 years 8 months ago
Reducing memory requirements of stream programs by graph transformations
Stream languages explicitly describe fork-join parallelism and pipelines, offering a powerful programming model for many-core Multi-Processor Systems on Chip (MPSoC). In an embedd...
Pablo de Oliveira Castro, Stéphane Louise, ...