Abstract. We study the problem of processor scheduling for n parallel jobs applying the method of competitive analysis. We prove that for jobs with a single phase of parallelism, a preemptive scheduling algorithm without information about job execution time, can achieve a mean completion time within 2 \Gamma 2
|
970
|
A bridging model for parallel computation
– Valiant
- 1997
|
|
634
|
Amortized efficiency of list update and paging rules
– Sleator, Tarjan
- 1985
|
|
578
|
Monitors," in Operating System Concepts
– Silberschatz, Galvin
- 1999
|
|
434
|
LogP: Towards a Realistic Model of Parallel Computation
– Culler, al
- 1993
|
|
205
|
Process Control and Scheduling Issues for Multiprogrammed SharedMemory Multiprocessors
– Tucker, Gupta
- 1989
|
|
153
|
The performance of multiprogrammed multiprocessor scheduling policies
– Leutenegger, Vernon
- 1990
|
|
143
|
A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors
– McCann, Vaswani, et al.
- 1993
|
|
137
|
The impact of operating system scheduling policies and synchronization methods of performance of parallel applications
– Gupta, Tucker, et al.
- 1991
|
|
135
|
Towards an architecture-independent analysis of parallel algorithms
– Papadimitriou, Yannakakis
- 1990
|
|
130
|
Speedup versus efficiency in parallel systems
– Eager, Zahorjan, et al.
- 1989
|
|
127
|
Competitive algorithms for on-line problems
– Manasse, McGeoch, et al.
- 1990
|
|
122
|
Speed is as powerful as clairvoyance
– Pruhs, Kalyanasundaram
- 1995
|
|
122
|
Scheduling parallel machines online
– Shmoys, Wein, et al.
- 1995
|
|
113
|
Characterizations of parallelism in applications and their use in scheduling
– Sevcik
- 1989
|
|
97
|
Processor Scheduling in Shared Memory Multiprocessors
– Zahorjan, McCann
- 1990
|
|
91
|
Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860
– Feitelson, Nitzberg
- 1996
|
|
89
|
Theory and practice in parallel job scheduling, in job scheduling strategies for parallel processing
– Feitelson, Rudolph, et al.
- 1995
|
|
81
|
Amortized eciency of list update and paging rules
– Sleator, E
- 1985
|
|
74
|
Non-clairvoyant scheduling
– Motwani, Phillips, et al.
- 1994
|
|
62
|
Application Scheduling and Processor Allocation in Multiprogrammed Parallel Processing Systems
– Sevcik
|
|
59
|
Measuring parallelism in computationintensive scientific/engineering applications
– Kumar
- 1988
|
|
51
|
Approximability and nonapproximability results for minimizing total flow time on a single machine
– Kellerer, Tautenhahn, et al.
- 1996
|
|
42
|
Scheduling parallel tasks to minimize average response time
– Turek, Schwiegelshohn, et al.
- 1994
|
|
40
|
Scheduling Memory Constrained Jobs on Distributed Memory Parallel Computers
– McCann, Zahorjan
- 1995
|
|
34
|
Using parallel program characteristics in dynamic processor allocation policies. Performance Evaluation
– Brecht
- 1996
|
|
33
|
Using runtime measured workload characteristics in parallel processor scheduling, in Job Scheduling Strategies for Parallel Processing
– Nguyen, Vaswani, et al.
- 1996
|
|
30
|
Maximizing speedup through self-tuning of processor allocation
– Nguyen, Vaswani, et al.
- 1996
|
|
30
|
Scheduling parallelizable tasks to minimize average response time
– Turek, Ludwig, et al.
- 1994
|
|
23
|
Smart smart bounds for weighted response time scheduling
– Schwiegelshohn, Ludwig, et al.
- 1998
|
|
20
|
Analysis of Spatial and Temporal Scheduling Policies for Semi-Static and Dynamic Multiprocessor Environments
– Leutenegger, Nelson
- 1991
|
|
19
|
Multiprocessor scheduling for high-variability service time distributions
– Parsons, Sevcik
- 1995
|
|
17
|
Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics
– Edmonds, Chinn, et al.
|
|
14
|
Competitive implementation of parallel programs
– Deng, Koutsoupias
- 1993
|
|
13
|
On the complexity of cooperative game solution concepts
– Deng, Papadimitriou
- 1994
|
|
11
|
The Power of Choice in Scheduling Parallel Tasks
– Ludwig, Tiwari
- 1993
|
|
10
|
Processor scheduling in multiprogrammed shared memory numa multiprocessors
– Wu
- 1993
|
|
6
|
Speedup versus Eciency in Parallel Systems
– Eager, Zahorjan, et al.
- 1989
|
|
5
|
Nonclairvoyant scheduling, Theoret
– Motwani, Phillips, et al.
- 1994
|
|
3
|
Competitive Algorithms for On-line
– Manasse, McGeoch, et al.
- 1988
|
|
2
|
Competitive Dynamic Processor Allocation for Parallel Applications
– Brecht, Deng, et al.
- 1997
|
|
1
|
Workload evolution on the Cornell theory center
– Hotvoy
- 1996
|
|
1
|
The Power of Choice in Scheduling Parallel
– Ludwig, Tiwari
- 1993
|
|
1
|
Using Parallel Program Characteristics
– Brecht, Guha
- 1996
|
|
