83 search results - page 16 / 17 » Fault-Tolerant Routing Algorithms for Hypercube Networks |
SPAA
1996
ACM
13 years 11 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
DAC
2011
ACM
12 years 6 months ago
2011
ACM
Clock tree synthesis is one of the most important and challenging problems in 3D ICs. The clock signals have to be delivered by through-silicon vias (TSVs) to different tiers with...
FOCS
2002
IEEE
13 years 12 months ago
2002
IEEE
A principle task in parallel and distributed systems is to reduce the communication load in the interconnection network, as this is usually the major bottleneck for the performanc...
PODC
2009
ACM
14 years 1 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
COCOA
2009
Springer
13 years 11 months ago
2009
Springer
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...