Sciweavers

17840 search results - page 3119 / 3568
» Heterogeneous Parallel Computing
Sort
View
SPAA
2003
ACM
16 years 3 days ago
A proportionate fair scheduling rule with good worst-case performance
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
Micah Adler, Petra Berenbrink, Tom Friedetzky, Les...
SPAA
2003
ACM
16 years 3 days ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
SPAA
2003
ACM
16 years 3 days ago
A practical algorithm for constructing oblivious routing schemes
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
Marcin Bienkowski, Miroslaw Korzeniowski, Harald R...
SPAA
2003
ACM
16 years 3 days ago
Analysis of link reversal routing algorithms for mobile ad hoc networks
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...
Costas Busch, Srikanth Surapaneni, Srikanta Tirtha...
186
Voted
SPAA
2003
ACM
16 years 3 days ago
On local algorithms for topology control and routing in ad hoc networks
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any fixed infrastructure. Indeed, an important task of an ad hoc network...
Lujun Jia, Rajmohan Rajaraman, Christian Scheidele...
« Prev « First page 3119 / 3568 Last » Next »