Sciweavers

39 search results - page 7 / 8
» Fault-Tolerant Message Routing for Multiprocessors
Sort
View
TPDS
1998
78views more  TPDS 1998»
13 years 5 months ago
Resource Deadlocks and Performance of Wormhole Multicast Routing Algorithms
—We show that deadlocks due to dependencies on consumption channels are a fundamental problem in wormhole multicast routing. This type of resource deadlocks has not been addresse...
Rajendra V. Boppana, Suresh Chalasani, C. S. Ragha...
NOMS
2008
IEEE
139views Communications» more  NOMS 2008»
14 years 16 days ago
Fast similarity search in peer-to-peer networks
Abstract—Peer-to-peer (P2P) systems show numerous advantages over centralized systems, such as load balancing, scalability, and fault tolerance, and they require certain function...
Thomas Bocek, Ela Hunt, David Hausheer, Burkhard S...
AINA
2004
IEEE
13 years 10 months ago
An Efficient Clustered Architecture for P2P Networks
Peer-to-peer (P2P) computing offers many attractive features, such as self-organization, load-balancing, availability, fault tolerance, and anonymity. However, it also faces some ...
Juan Li, Son T. Vuong
IPPS
1998
IEEE
13 years 10 months ago
Impact of Switch Design on the Application Performance of Cache-Coherent Multiprocessors
In this paper, the effect of switch design on the application performance of cache-coherent non-uniform memory access (CC-NUMA) multiprocessors is studied in detail. Wormhole rout...
Laxmi N. Bhuyan, Hu-Jun Wang, Ravi R. Iyer, Akhile...
TC
2008
13 years 6 months ago
Photonic Networks-on-Chip for Future Generations of Chip Multiprocessors
The design and performance of next-generation chip multiprocessors (CMPs) will be bound by the limited amount of power that can be dissipated on a single die. We present photonic n...
Assaf Shacham, Keren Bergman, Luca P. Carloni