Sciweavers

317 search results - page 12 / 64
» Benchmarking weak memory models
Sort
View
101
Voted
AAAI
2006
15 years 1 months ago
Memory Intensive Branch-and-Bound Search for Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sens...
Radu Marinescu 0002, Rina Dechter
ICA3PP
2005
Springer
15 years 5 months ago
A Practical Comparison of Cluster Operating Systems Implementing Sequential and Transactional Consistency
Shared Memory is an interesting communication paradigm for SMP machines and clusters. Weak consistency models have been proposed to improve efficiency of shared memory applications...
Stefan Frenz, Renaud Lottiaux, Michael Schött...
PPOPP
2010
ACM
15 years 9 months ago
Symbolic prefetching in transactional distributed shared memory
We present a static analysis for the automatic generation of symbolic prefetches in a transactional distributed shared memory. A symbolic prefetch specifies the first object to be...
Alokika Dash, Brian Demsky
PLDI
2010
ACM
15 years 2 months ago
DRFX: a simple and efficient memory model for concurrent programming languages
The most intuitive memory model for shared-memory multithreaded programming is sequential consistency (SC), but it disallows the use of many compiler and hardware optimizations th...
Daniel Marino, Abhayendra Singh, Todd D. Millstein...
61
Voted
HPCC
2005
Springer
15 years 5 months ago
Transactional Cluster Computing
A lot of sophisticated techniques and platforms have been proposed to build distributed object systems. Remote method invocation and explicit message passing on top of traditional...
Stefan Frenz, Michael Schöttner, Ralph Gö...