Sciweavers

11 search results - page 1 / 3
» Adaptive Virtual Cut-Through as a Viable Routing Method
Sort
View
JPDC
1998
64views more  JPDC 1998»
13 years 4 months ago
Adaptive Virtual Cut-Through as a Viable Routing Method
Howon Kim, Hyun Suk Lee, Sunggu Lee, Jong Kim
PACT
2005
Springer
13 years 10 months ago
Minimizing Hotspot Delay by Fully Utilizing the Link Bandwidth on 2D Mesh with Virtual Cut-Through Switching
Abstract. The hotspot seriously degrades the performance of a parallel algorithm but there have not been many methods proposed for this problem. Without modification of mesh topolo...
MinHwan Ok, Myong-Soon Park
IPPS
2003
IEEE
13 years 10 months ago
BLAM : A High-Performance Routing Algorithm for Virtual Cut-Through Networks
High performance, freedom from deadlocks, and freedom from livelocks are desirable properties of interconnection networks. Unfortunately, these can be conflicting goals because n...
Mithuna Thottethodi, Alvin R. Lebeck, Shubhendu S....
INFOCOM
2000
IEEE
13 years 9 months ago
Adaptive Proportional Routing: A Localized QoS Routing Approach
Abstract—Most of the QoS routing schemes proposed so far require periodic exchange of QoS state information among routers, imposing both communication overhead on the network and...
Srihari Nelakuditi, Zhi-Li Zhang, Rose P. Tsang
ICS
2000
Tsinghua U.
13 years 8 months ago
Improving parallel system performance by changing the arrangement of the network links
The Midimew network is an excellent contender for implementing the communication subsystem of a high performance computer. This network is an optimal 2D topology in the sense ther...
Valentin Puente, Cruz Izu, José A. Gregorio...