Sciweavers

189 search results - page 15 / 38
» Bandwidth Scheduling and Path Computation Algorithms for Con...
Sort
View
TON
2002
99views more  TON 2002»
13 years 7 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
ICC
2007
IEEE
130views Communications» more  ICC 2007»
14 years 1 months ago
A Distributed Scheme for Responsive Network Engineering
— Optimal bandwidth utilisation together with resilience and recovery from failure are two key drivers for Traffic Engineering (TE) which have been widely addressed by the IP co...
Johannes Göbel, Anthony E. Krzesinski, Dieter...
ICPP
2005
IEEE
14 years 1 months ago
Push-Pull: Guided Search DAG Scheduling for Heterogeneous Clusters
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...
Sang Cheol Kim, Sunggu Lee
PC
2010
196views Management» more  PC 2010»
13 years 6 months ago
Solving path problems on the GPU
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
Aydin Buluç, John R. Gilbert, Ceren Budak
IPPS
2008
IEEE
14 years 2 months ago
A dynamic scheduling approach for coordinated wide-area data transfers using GridFTP
Many scientific applications need to stage large volumes of files from one set of machines to another set of machines in a wide-area network. Efficient execution of such data t...
Gaurav Khanna 0002, Ümit V. Çataly&uum...