Sciweavers

879 search results - page 88 / 176
» Performance Evaluation of Routing Algorithms in RHiNET-2 Clu...
Sort
View
ICS
2009
Tsinghua U.
15 years 6 months ago
Exploring pattern-aware routing in generalized fat tree networks
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
Germán Rodríguez, Ramón Beivi...
86
Voted
CLUSTER
2004
IEEE
15 years 5 months ago
Bandwidth-aware co-allocating meta-schedulers for mini-grid architectures
The interaction of simultaneously co-allocated jobs can often create contention in the network infrastructure of a dedicated computational grid. This contention can lead to degrad...
William M. Jones, Louis W. Pang, Walter B. Ligon I...
ISPD
2000
ACM
97views Hardware» more  ISPD 2000»
15 years 5 months ago
Routability-driven repeater block planning for interconnect-centric floorplanning
In this paper we present a repeater block planning algorithm for interconnect-centric floorplanning. We introduce the concept of independent feasible regions for repeaters and der...
Probir Sarkar, Vivek Sundararaman, Cheng-Kok Koh
ICPR
2002
IEEE
16 years 2 months ago
Fast Hierarchical Clustering Based on Compressed Data
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Erendira Rendon, Ricardo Barandela
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
15 years 7 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud