FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
A principle task in parallel and distributed systems is to reduce the communication load in the interconnection network, as this is usually the major bottleneck for the performanc...
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
SPAA
2003
ACM
13 years 9 months ago
2003
ACM
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...
INFOCOM
2003
IEEE
13 years 9 months ago
2003
IEEE
— We present a new algorithm for routing of messages in ad-hoc networks where the nodes are energy-constrained. The routing objective is to maximize the total number of messages ...
STACS
2004
Springer
13 years 9 months ago
2004
Springer
We study a class of single-round, sealed-bid auctions for a set of identical items. We adopt the worst case competitive framework defined by [1,2] that compares the profit of an ...
ICALP
2004
Springer
13 years 9 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
ICALP
2004
Springer
13 years 9 months ago
2004
Springer
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
SPAA
2004
ACM
13 years 9 months ago
2004
ACM
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
SPAA
2004
ACM
13 years 9 months ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
SIGECOM
2004
ACM
13 years 9 months ago
2004
ACM
For the problem of online real-time scheduling of jobs on a single processor, previous work presents matching upper and lower bounds on the competitive ratio that can be achieved ...