317 search results - page 19 / 64 » Benchmarking weak memory models |
101
click to vote
ICS
1999
Tsinghua U.
15 years 4 months ago
1999
Tsinghua U.
Programming languages that provide multidimensional arrays and a flat linear model of memory must implement a mapping between these two domains to order array elements in memory....
122
click to vote
ISCA
1999
IEEE
15 years 4 months ago
1999
IEEE
Information integrity in cache memories is a fundamental requirement for dependable computing. Conventional architectures for enhancing cache reliability using check codes make it...
125
click to vote
DDECS
2009
IEEE
15 years 7 months ago
2009
IEEE
— We propose a novel synthesis method of a dual-rail asynchronous two-level logic of reduced cost. It is based on a model that operates under so called modified weak constraints....
116
click to vote
CADE
2012
Springer
13 years 2 months ago
2012
Springer
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
111
Voted
IISWC
2009
IEEE
15 years 7 months ago
2009
IEEE
— Programming to exploit the resources in a multicore system remains a major obstacle for both computer and software engineers. Transactional memory offers an attractive alternat...