Amortized efficiency of list update and paging rules
Communications of the ACM
New models and algorithms for future networks
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
The token distribution problem
SIAM Journal on Computing
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Counting networks and multi-processor coordination
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Dynamic scheduling on parallel machines
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Scheduling parallel machines on-line
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
Distance-dependent distributed directories
Information and Computation
Distributed allocation with pools of servers
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Online tracking of mobile users
Journal of the ACM (JACM)
Modular competitiveness for distributed algorithms
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
An adversarial model for distributed dynamic load balancing
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On page migration and other relaxed task systems
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM (JACM)
On page migration and other relaxed task systems
Theoretical Computer Science
Work-competitive scheduling for cooperative computing with dynamic groups
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Collective asynchronous reading with polylogarithmic worst-case overhead
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Journal of Parallel and Distributed Computing
Controller and estimator for dynamic networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Compositional competitiveness for distributed algorithms
Journal of Algorithms
New bounds for the controller problem
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Distributed decision problems: the locality angle
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Performing dynamically injected tasks on processes prone to crashes and restarts
DISC'11 Proceedings of the 25th international conference on Distributed computing
The communication complexity of distributed task allocation
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Online parallel scheduling of non-uniform tasks: trading failures for energy
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
This paper examines the problem of balancing the job load in a network of processors, and introduces an online algorithm for scheduling a sequence of jobs in a competitive manner. The algorithm is shown to be polylog (n)-competitive according to a strict definition that forces the online algorithm to be competitive even when considering any bounded area of the network and bounded period of time.We also analyze the common greedy feedback-based approach, and provide matching lower and upper bounds (up to a polylogarithmic factor) for the tradeoff between the costs of searches and updates under this approach.