1271 search results - page 40 / 255 » On Simulation-Checking with Sequential Systems |
ISCA
1998
IEEE
13 years 12 months ago
1998
IEEE
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...
SPAA
1998
ACM
13 years 12 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
SIGECOM
2010
ACM
13 years 8 months ago
2010
ACM
In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the ...
EUROPAR
2007
Springer
14 years 1 months ago
2007
Springer
Iterated Runge-Kutta (IRK) methods are a class of explicit solution methods for initial value problems of ordinary differential equations (ODEs) which possess a considerable poten...
PDIS
1994
IEEE
13 years 11 months ago
1994
IEEE
Informed prefetching provides a simple mechanism for I/O-intensive, cache-ineffective applications to efficiently exploit highly-parallel I/O subsystems such as disk arrays. This ...