317 search results - page 5 / 64 » Benchmarking weak memory models |
ASPLOS
1991
ACM
15 years 27 days ago
1991
ACM
The memory consistency model supported by a multiprocessor architecture determines the amount of buffering and pipelining that may be used to hide or reduce the latency of memory ...
124
click to vote
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
We present the Data Parallel Fortran (DPF) benchmark suite, a set of data parallel Fortran codes forevaluatingdata parallel compilers appropriatefor any target parallel architectu...
104
click to vote
CVPR
2012
IEEE
12 years 11 months ago
2012
IEEE
Attribute-based query offers an intuitive way of image retrieval, in which users can describe the intended search targets with understandable attributes. In this paper, we develop...
ESA
2005
Springer
15 years 2 months ago
2005
Springer
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
PPOPP
2009
ACM
15 years 10 months ago
2009
ACM
This paper introduces a new way to provide strong atomicity in an implementation of transactional memory. Strong atomicity lets us offer clear semantics to programs, even if they ...