Abstract
This papei 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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992 |
| Publisher | Association for Computing Machinery |
| Pages | 571-580 |
| Number of pages | 10 |
| ISBN (Electronic) | 0897915119 |
| DOIs | |
| State | Published - 1 Jul 1992 |
| Externally published | Yes |
| Event | 24th Annual ACM Symposium on Theory of Computing, STOC 1992 - Victoria, Canada Duration: 4 May 1992 → 6 May 1992 |
Publication series
| Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
|---|---|
| Volume | Part F129722 |
| ISSN (Print) | 0737-8017 |
Conference
| Conference | 24th Annual ACM Symposium on Theory of Computing, STOC 1992 |
|---|---|
| Country/Territory | Canada |
| City | Victoria |
| Period | 4/05/92 → 6/05/92 |
Bibliographical note
Funding Information:*Dept. of Mathematics and Lab. for COm puter Science, M. I.T., Cambridge, MA 02139. Email: [email protected] .mit.edu. Supported by Ak Force Contract TNDGAFOSR-860078, ARO contract DAAL03-86-K-0171, NSF contract CCR8611442, DARPA contract NOOO14-89-J-1988, and a special grant from IBM. t IBM T.J. Watson Research Center, Yorktown Heights, NY 10598. E-mail: [email protected]. corn. $Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot 76100, Israel. E-mail: [email protected]. ac.il. Supported in part by an Allen Fellowship, by a Bantrell Fellowship and by a Walter and Elise Haas Career Development Award.
Funding
*Dept. of Mathematics and Lab. for COm puter Science, M. I.T., Cambridge, MA 02139. Email: [email protected] .mit.edu. Supported by Ak Force Contract TNDGAFOSR-860078, ARO contract DAAL03-86-K-0171, NSF contract CCR8611442, DARPA contract NOOO14-89-J-1988, and a special grant from IBM. t IBM T.J. Watson Research Center, Yorktown Heights, NY 10598. E-mail: [email protected]. corn. $Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot 76100, Israel. E-mail: [email protected]. ac.il. Supported in part by an Allen Fellowship, by a Bantrell Fellowship and by a Walter and Elise Haas Career Development Award.
| Funders | Funder number |
|---|---|
| National Science Foundation | CCR8611442 |
| Army Research Office | DAAL03-86-K-0171 |
| Defense Advanced Research Projects Agency | NOOO14-89-J-1988 |
| International Business Machines Corporation |