Jeff Edmonds  Home/Search
Context Related
| cs.yorku.ca/~jeff/research...arrSTOC.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.yorku.ca/~jeff/research/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when either the jobs all arrive at time zero, or when all the jobs are fully parallelizable, or when the scheduler has considerable knowledge about the jobs. This paper considers for the first time this problem without any of these three restrictions and provides new upper and lower bound techniques applicable in this more... (Update)
Cited by: More
New Directions in Machine Scheduling - Uthaisombut (2000) (Correct)
Applying Extra-Resource Analysis to Load Balancing - Brehob, Torng, Uthaisombut (2000) (Correct)
Performance Guarantee for EDF under Overload - Lam, Ngan, To (2004) (Correct)
Similar documents (at the sentence level):
64.1%: Scheduling in the Dark - Edmonds (1999) (Correct)
Active bibliography (related documents): More All
0.5: Non-clairvoyant Multiprocessor Scheduling of Jobs with .. - Edmonds, Chinn.. (1997) (Correct)
0.4: Non-clairvoyant Multiprocessor Scheduling of Jobs with .. - Edmonds, Chinn.. (1997) (Correct)
0.4: Preemptive Scheduling of Parallel Jobs on Multiprocessors - Deng, Gu, Brecht, Lu (2000) (Correct)
Similar documents based on text: More All
0.2: Using Parallel Program Characteristics in Dynamic Processor.. - Brecht, Guha (1996) (Correct)
0.1: Tight Lower Bounds for st-Connectivity on the NNJAG Model - Edmonds, Poon, Achlioptas (1999) (Correct)
0.1: Using the Groebner basis algorithm to find proofs of.. - Clegg, Edmonds.. (1996) (Correct)
Related documents from co-citation: More All
22: Speed is as powerful as clairvoyance - Kalyanasundaram, Pruhs - 1995
20: Speed is more powerful than clairvoyance (context) - Berman, Coulston - 1998
18: between speed and processor in hard-deadline scheduling (context) - Lam, To - 1999
BibTeX entry: (Update)
Je Edmonds. Scheduling in the dark. In Proceedings of the 31st ACM Symposium on Theory of Computing, pages 179-188, 1999. http://citeseer.ist.psu.edu/edmonds99scheduling.html More
@inproceedings{ edmonds99scheduling,
author = "Jeff Edmonds",
title = "Scheduling in the dark",
pages = "179--188",
year = "1999",
url = "citeseer.ist.psu.edu/edmonds99scheduling.html" }
Citations (may not include all citations):488 Amortized efficiency of list update and paging rules (context) - Sleator, Tarjan - 1985
234 Competitive snoopy caching (context) - Karlin, Manasse et al. - 1988
190 Process control and scheduling issues for multiprogrammed sh.. (context) - Tucker, Gupta - 1989
137 The performance of multiprogrammed multiprocessor scheduling.. (context) - Leutenegger, Vernon - 1990
137 A dynamic processor allocation policy for multiprogrammed (context) - McCann, Vaswani et al. - 1993
100 Competitive algorithms for on-line problems (context) - Manasse, McGeoch et al. - 1988
98 Processor scheduling in shared memory multiprocessors (context) - Zahorjan, McCann - 1990
92 Speed is as powerful as clairvoyance - Kalyanasundaram, Pruhs - 1995
80 Application scheduling and processor allocation in multiprog.. - Sevcik - 1994
75 Measuring parallelism computation intensive scientificengine.. (context) - parallelism, intensive et al. - 1988
69 Use of application characteristics and limited preemption fo.. - Chiang, Mansharamani et al. - 1994
54 Optimal Time-Critical Scheduling Via Resource Augmentation I.. - Phillips, Stein et al. - 1997
41 Approximating total flow time on parallel machines - Leonardi, Raz - 1997
34 Scheduling parallel tasks to minimize average response time (context) - Turek, Schwiegelshohn et al. - 1994
33 Using parallel program characteristics in dynamic multiproce.. - Brecht, Guha - 1996
32 Scheduling memory constrained jobs on distributed memory par.. - McCann, Zahorjan - 1995
29 Maximizing speedup through self-tuning of processor allocati.. - Nguyen, Vaswani et al. - 1996
25 Scheduling parallelizable tasks to minimize average response.. (context) - Turek, Ludwig et al. - 1994
20 Smart SMART bounds for weighted response time scheduling (context) - Schwiegelshohn, Ludwig et al.
19 Preemptive scheduling of parallel jobs on multiprocessors - Deng, Gu et al. - 1996
17 Non-clairvoyant Multiprocessor Scheduling of Jobs with Chang.. - Edmonds, Chinn et al. - 1997
14 Competitive implementation of parallel programs - Deng, Koutsoupias - 1993
11 Minimizing flow time nonclairvoyantly - Kalyanasundaram, Pruhs - 1997
9 On multiprocessor system scheduling - Deng, Dymond - 1996
5 Special Issue on Dynamic and On-Line Algorithms (context) - Motwani, Phillips et al. - 1993
4 Probablistic Computations: Towards a Unified Measure of Comp.. (context) - Yao - 1977
4 Speed is more powerful than clairvoyance SWAT (context) - Berman, Coulston
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.yorku.ca/~jeff/research/): More
Communication Complexity Towards Lower Bounds on.. - Edmonds, Rudich.. (1991) (Correct)
Removing Ramsey Theory: Lower Bounds With Smaller Domain Size - Edmonds (Correct)
Scheduling in the Dark - Edmonds (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC