Sciweavers

390 search results - page 53 / 78
» Computing shortest paths for any number of hops
Sort
View
ISCA
2012
IEEE
280views Hardware» more  ISCA 2012»
13 years 4 months ago
A case for random shortcut topologies for HPC interconnects
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
Michihiro Koibuchi, Hiroki Matsutani, Hideharu Ama...
COMCOM
2004
90views more  COMCOM 2004»
15 years 1 months ago
Understanding bandwidth-delay product in mobile ad hoc networks
Bandwidth-delay product (BDP) and its upper bound (BDP-UB) have been well-understood in wireline networks such as the Internet. However, they have not been carefully studied in th...
Kai Chen, Yuan Xue, Samarth H. Shah, Klara Nahrste...
GC
2008
Springer
15 years 2 months ago
Almost Given Length Cycles in Digraphs
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...
Raphael Yuster
NCA
2007
IEEE
15 years 8 months ago
Scheduling Bulk File Transfers with Start and End Times
The advancement of optical networking technologies has enabled e-science applications that often require transport of large volumes of scientific data. In support of such data-in...
Kannan Rajah, Sanjay Ranka, Ye Xia
WINET
2010
145views more  WINET 2010»
15 years 8 days ago
Location-centric storage and query in wireless sensor networks
Location-centric storage (LCS) is envisioned as a promising scheme for robust and user-friendly ondemand data storage in networking environments such as the roadway sensor networks...
Kai Xing, Xiuzhen Cheng, Jiang Li, Min Song