Sciweavers

317 search results - page 3 / 64
» Benchmarking weak memory models
Sort
View
ISCA
1998
IEEE
123views Hardware» more  ISCA 1998»
13 years 9 months ago
Weak Ordering - A New Definition
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory ac...
Sarita V. Adve, Mark D. Hill
IPPS
2002
IEEE
13 years 10 months ago
Memory-Intensive Benchmarks: IRAM vs. Cache-Based Machines
The increasing gap between processor and memory performance has led to new architectural models for memory-intensive applications. In this paper, we use a set of memory-intensive ...
Brian R. Gaeke, Parry Husbands, Xiaoye S. Li, Leon...
EUROSYS
2007
ACM
14 years 2 months ago
STMBench7: a benchmark for software transactional memory
Software transactional memory (STM) is a promising technique for controlling concurrency in modern multi-processor architectures. STM aims to be more scalable than explicit coarse...
Rachid Guerraoui, Michal Kapalka, Jan Vitek
SC
2000
ACM
13 years 9 months ago
Improving Fine-Grained Irregular Shared-Memory Benchmarks by Data Reordering
We demonstrate that data reordering can substantially improve the performance of fine-grained irregular sharedmemory benchmarks, on both hardware and software shared-memory syste...
Y. Charlie Hu, Alan L. Cox, Willy Zwaenepoel
CONCUR
2009
Springer
13 years 9 months ago
Weak Time Petri Nets Strike Back!
We consider the model of Time Petri Nets where time is associated with transitions. Two semantics for time elapsing can be considered: the strong one, for which all transitions are...
Pierre-Alain Reynier, Arnaud Sangnier