122 search results - page 19 / 25 » Using Disjoint Reachability for Parallelization |
SSS
2010
Springer
13 years 5 months ago
2010
Springer
Design and implementation of distributed algorithms often involve many subtleties due to their complex structure, non-determinism, and low atomicity as well as occurrence of unanti...
IWMM
2009
Springer
14 years 1 months ago
2009
Springer
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
DAC
2007
ACM
14 years 8 months ago
2007
ACM
Mapping packet processing applications onto embedded network processors (NP) is a challenging task due to the unique constraints of NP systems and the characteristics of network a...
ICS
2010
Tsinghua U.
14 years 4 months ago
2010
Tsinghua U.
Almost all of the modern computers use multiple cores, and the number of cores is expected to increase as hardware prices go down, and Moore's law fails to hold. Most of the ...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper, we consider a MIMO wireless relay network where communication between a source and a destination node is assisted by multiple relay nodes using the Amplifyand-Forwar...