Sciweavers

16 search results - page 1 / 4
» Characterization of Deadlocks in Irregular Networks
Sort
View
JPDC
2002
46views more  JPDC 2002»
13 years 4 months ago
Characterization of Deadlocks in Irregular Networks
Sugath Warnakulasuriya, Timothy Mark Pinkston
JSA
2006
86views more  JSA 2006»
13 years 4 months ago
High-performance adaptive routing for networks with arbitrary topology
A strategy to implement adaptive routing in irregular networks is presented and analyzed in this work. A simple and widely applicable deadlock avoidance method, applied to a ring ...
Valentin Puente, José A. Gregorio, Fernando...
JPDC
2006
111views more  JPDC 2006»
13 years 4 months ago
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
Guojing Cong, David A. Bader
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
13 years 10 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
JPDC
2007
100views more  JPDC 2007»
13 years 4 months ago
Deadlock-free connection-based adaptive routing with dynamic virtual circuits
Virtual circuits can reduce routing overheads with irregular topologies and provide support for a mix of quality of service (QOS) requirements. Information about network loads and...
Yoshio Turner, Yuval Tamir