5562 search results - page 348 / 1113 » Implementing Parallel Cell-DEVS |
130
Voted
SPAA
1998
ACM
15 years 9 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...
210
click to vote
ICS
2011
Tsinghua U.
14 years 8 months ago
2011
Tsinghua U.
Phase-Change Memory (PCM) technology has received substantial attention recently. Because PCM is byte-addressable and exhibits access times in the nanosecond range, it can be used...
218
click to vote
PODC
2011
ACM
14 years 7 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
182
click to vote
PODC
2011
ACM
14 years 7 months ago
2011
ACM
Maintaining data structure semantics of concurrent queues such as first-in first-out (FIFO) ordering requires expensive synchronization mechanisms which limit scalability. Howev...
186
click to vote
PPOPP
2011
ACM
14 years 7 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...