Scalably scheduling processes with arbitrary speedup curves-Reference-Cited by-同舟云学术

Scalably scheduling processes with arbitrary speedup curves

Published:2012-07 Issue:3 Volume:8 Page:1-10
ISSN:1549-6325
Container-title:ACM Transactions on Algorithms
language:en
Short-container-title:ACM Trans. Algorithms

Author:

Edmonds Jeff¹,Pruhs Kirk²

Affiliation:

1. York University, Canada

2. University of Pittsburgh, PA

Abstract

We give a scalable ((1+ϵ)-speed O (1)-competitive) nonclairvoyant algorithm for scheduling jobs with sublinear nondecreasing speedup curves on multiple processors with the objective of average response time.

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

Link

https://dl.acm.org/doi/pdf/10.1145/2229163.2229172

Reference22 articles.

1. Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines

2. Speed is more powerful than clairvoyance;Berman P.;Nordic J. Comput.,1999

3. Speed scaling of processes with arbitrary speedup curves on a multiprocessor

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models;Theoretical Computer Science;2022-11

2. Adaptive scheduling of multiprogrammed dynamic-multithreading applications;Journal of Parallel and Distributed Computing;2022-04

3. Nonsubmodular Optimization;Introduction to Combinatorial Optimization;2022

4. Greedy Approximation and Submodular Optimization;Introduction to Combinatorial Optimization;2022

5. AMCilk: A Framework for Multiprogrammed Parallel Workloads;2020 IEEE 27th International Conference on High Performance Computing, Data, and Analytics (HiPC);2020-12