Amortized efficiency of list update and paging rules
Communications of the ACM
Measuring Parallelism in Computation-Intensive Scientific/Engineering Applications
IEEE Transactions on Computers
Competitive algorithms for on-line problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Process control and scheduling issues for multiprogrammed shared-memory multiprocessors
SOSP '89 Proceedings of the twelfth ACM symposium on Operating systems principles
Processor scheduling in shared memory multiprocessors
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The performance of multiprogrammed multiprocessor scheduling algorithms
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors
ACM Transactions on Computer Systems (TOCS)
Application scheduling and processor allocation in multiprogrammed parallel processing systems
Performance Evaluation - Special issue: performance modeling of parallel processing systems
Scheduling parallelizable tasks to minimize average response time
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Scheduling memory constrained jobs on distributed memory parallel computers
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Using parallel program characteristics in dynamic processor allocation policies
Performance Evaluation
Smart SMART Bounds for Weighted Response Time Scheduling
SIAM Journal on Computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Scheduling parallel tasks to minimize average response time
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Preemptive Scheduling of Parallel Jobs on Multiprocessors
SIAM Journal on Computing
Maximizing Speedup through Self-Tuning of Processor Allocation
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Speed is as powerful as clairvoyance [scheduling problems]
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Adaptive scheduling with parallelism feedback
Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming
Transactional contention management as a non-clairvoyant scheduling problem
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Adaptive work stealing with parallelism feedback
Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming
Non-clairvoyant scheduling with precedence constraints
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Adaptive work-stealing with parallelism feedback
ACM Transactions on Computer Systems (TOCS)
Improved results for scheduling batched parallel jobs by using a generalized analysis framework
Journal of Parallel and Distributed Computing
Provably efficient two-level adaptive scheduling
JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
Non-clairvoyant batch sets scheduling: fairness is fair enough
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Scheduling jobs with varying parallelizability to reduce variance
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Minimizing maximum flowtime of jobs with arbitrary parallelizability
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Online scalable scheduling for the lk-norms of flow time without conservation of work
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Brief announcement: online batch scheduling for flow objectives
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
This work theoretically proves that Equi-partition efficiently schedules multiprocessor batch jobs with different execution characteristics. Motwani, Phillips, and Torng (Proc. 4th Annu. ACMISIAM Symp. on Discrete Algorithms, pp. 422-431, Austin, 1993) show that the mean response time of jobs is within two of optimal for fully parallelizable jobs. We extend this result by considering jobs with multiple phases of arbitrary nondecreasing and sublinear speedup functions. Having no knowledge of the jobs being scheduled (non-clairvoyant) one would not expect it to perform well. However, our main result shows that the mean response time obtained with Equi-partition is no more than 2 + √ ≈ 3.73 times the optimal. The paper also considers schedulers with different numbers of preemptions and jobs with more general classes of speedup functions. Matching lower bounds are also proved.