205 search results - page 9 / 41 » Relaxed memory models: an operational approach |
SPAA
2010
ACM
14 years 14 days ago
2010
ACM
Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. Inspired by classical work on databases, formal definitions of the semantics of...
DATE
1998
IEEE
13 years 12 months ago
1998
IEEE
Most memory test algorithms are optimized tests for a particular memory technology and a particular set of fault models, under the assumption that the memory is bit-oriented; i.e....
PPL
2008
13 years 7 months ago
2008
Execution of programs with data parallel language constructs is either based on the fork/join or on the SPMD model. Whereas the former executes a program sequentially and confines...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
Software transactions have received significant attention as a way to simplify shared-memory concurrent programming, but insufficient focus has been given to the precise meaning o...
HPCA
1999
IEEE
13 years 12 months ago
1999
IEEE
Much research has been done in fast communication on clusters and in protocols for supporting software shared memory across them. However, the end performance of applications that...