Article

Free access

Optimal online scheduling of parallel jobs with dependencies

Authors:

Anja Feldmann,

Ming-Yang Kao,

Jiří Sgall,

Shang-Hua TengAuthors Info & Claims

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

Pages 642 - 651

https://doi.org/10.1145/167088.167254

Published: 01 June 1993 Publication History

PDF eReader

References

[1]

S.N. Bhatt, F.R.K. Chung, J.-W.Hong, F.T. Leighton, and A.L. Rosenberg. Optimal simulations by butterfly networks. In STOC, pages 192-204. ACM, 1988.

Digital Library

Google Scholar

[2]

G.E. Blelloch. Vector Models for Data-ParaUel Computing. MIT-Press, Cambridge MA, 1990.

Digital Library

Google Scholar

[3]

E. Davis and J.M. Jaffe. Algorithm for scheduling tasks in unrelated processors. JACM, pages 712-736, 1981.

Digital Library

Google Scholar

[4]

F.G. Feitelson and L. Rudolph. Wasted resources in gang scheduling. In Proc. of the 5th Jerusalem Conference on Information Technology, 1990.

Digital Library

Google Scholar

[5]

A. Feldmann, J. Sgall, and S.-H. Teng. Dynamic scheduling on parallel machines. In FOCS, pages 111- 120, IEEE, 1991.

Digital Library

Google Scholar

[6]

M.R. Garey and D.S. Johnson. Computer and Intractabzlity: a guzde to the theory of NP-completeness. Freeman, San Francisco, 1979.

Digital Library

Google Scholar

[7]

R.L. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal., pages 1563- 1581, 1966.

Google Scholar

[8]

K. Hwang and F.A. Briggs. Computer Architecture and Parallel Process2ng. McGraw-Hill, Inc. 1984.

Digital Library

Google Scholar

[9]

S R. Kosaraju and M.J. Atallah. Optimal simulation between mesh-connected arrays of processors. In STOC, pages 264-272. ACM, 1986.

Digital Library

Google Scholar

[10]

H.T. Kung. Computational Models for Parallel Computers. Technical report, CMU-CS-88-164, 1987.

Google Scholar

[11]

3.L. Peterson and A. Silberschatz. Operatsng System Concepts. Addison-Wesley Publishing Company, 1985.

Digital Library

Google Scholar

[12]

D.D. Sleator and R.E. Tarjan. Amortized efficiency of list. update and paging rules. CA CM, 28(2):202-208, 1985.

Digital Library

Google Scholar

[13]

D.B. Shmoys, J. Wein, and D.P. Williamson. Scheduling parallel machines on-line. In FOCS, pages 131-140, 1991, IEEE.

Digital Library

Google Scholar

[14]

Q. Wang and K.H. Cheng A Heuristic of Scheduling Parallel Tasks and its Analysis. SlAM Journal on Corn. putzng., pages 281-294, 1992.

Digital Library

Google Scholar

Cited By

View all

Mao YZhao JZhang SLiu HMarkl V(2023)MorphStream: Adaptive Scheduling for Scalable Transactional Stream Processing on MulticoresProceedings of the ACM on Management of Data10.1145/35889131:1(1-26)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.1145/3588913
Tian BHuang JMozafari BSchoenebeck G(2018)Contention-aware lock scheduling for transactional databasesProceedings of the VLDB Endowment10.1145/3187009.317774011:5(648-662)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1145/3187009.3177740
Tian BHuang JMozafari BSchoenebeck G(2018)Contention-aware lock scheduling for transactional databasesProceedings of the VLDB Endowment10.1145/3177732.317774011:5(648-662)Online publication date: 5-Oct-2018
https://dl.acm.org/doi/10.1145/3177732.3177740
Show More Cited By

Index Terms

Optimal online scheduling of parallel jobs with dependencies
1. Networks
  1. Network properties
    1. Network structure
2. Theory of computation

Recommendations

Single machine parallel-batch scheduling with deteriorating jobs

We consider several single machine parallel-batch scheduling problems in which the processing time of a job is a linear function of its starting time. We give a polynomial-time algorithm for minimizing the maximum cost, an O(n⁵) time algorithm for ...
Scheduling parallel jobs to minimize the makespan

We consider the NP-hard problem of scheduling parallel jobs with release dates on identical parallel machines to minimize the makespan. A parallel job requires simultaneously a prespecified, job-dependent number of machines when being processed. We ...
Preemptive online scheduling with rejection of unit jobs on two uniformly related machines

We consider preemptive online and semi-online scheduling of unit jobs on two uniformly related machines. Jobs are presented one by one to an algorithm, and each job has a rejection penalty associated with it. A new job can either be rejected, in which ...

Comments

Information & Contributors

Information

Published In

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

June 1993

812 pages

ISBN:0897915917

DOI:10.1145/167088

Chairmen:
Rao Kosaraju
John Hopkins Univ., Baltimore, MD
,
David Johnson
AT&T Bell Lab.
,
Alok Aggarwal
IBM T. J. Watson Research Center,Yorktown Heights, NY

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC93

Sponsor:

SIGACT

STOC93: 25th Annual ACM Symposium on the Theory of Computing

May 16 - 18, 1993

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

28
Total Citations
View Citations
626
Total Downloads

Downloads (Last 12 months)86
Downloads (Last 6 weeks)14

Reflects downloads up to 01 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Mao YZhao JZhang SLiu HMarkl V(2023)MorphStream: Adaptive Scheduling for Scalable Transactional Stream Processing on MulticoresProceedings of the ACM on Management of Data10.1145/35889131:1(1-26)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.1145/3588913
Tian BHuang JMozafari BSchoenebeck G(2018)Contention-aware lock scheduling for transactional databasesProceedings of the VLDB Endowment10.1145/3187009.317774011:5(648-662)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1145/3187009.3177740
Tian BHuang JMozafari BSchoenebeck G(2018)Contention-aware lock scheduling for transactional databasesProceedings of the VLDB Endowment10.1145/3177732.317774011:5(648-662)Online publication date: 5-Oct-2018
https://dl.acm.org/doi/10.1145/3177732.3177740
Hu MLuo JWang YVeeravalli B(2017)Adaptive Scheduling of Task Graphs with Dynamic ResilienceIEEE Transactions on Computers10.1109/TC.2016.257434966:1(17-23)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1109/TC.2016.2574349
Choudhury PChakrabarti PKumar R(2012)Online Scheduling of Dynamic Task Graphs with Communication and Contention for MultiprocessorsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2011.10423:1(126-133)Online publication date: 1-Jan-2012
https://dl.acm.org/doi/10.1109/TPDS.2011.104
Liu BLuo JCao J(2009)Agent‐based task representation and processing in pervasive computing environmentWireless Communications and Mobile Computing10.1002/wcm.74210:10(1378-1390)Online publication date: 6-Feb-2009
https://doi.org/10.1002/wcm.742
Choudhury PKumar RChakrabarti P(2008)Hybrid Scheduling of Dynamic Task Graphs with Selective Duplication for Multiprocessors under Memory and Time ConstraintsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2007.7078419:7(967-980)Online publication date: 1-Jul-2008
https://dl.acm.org/doi/10.1109/TPDS.2007.70784
Bo LJunzhou LJiuxin C(2007)A Method of Agent Task Representation and Processing in Pervasive Computing Environment2007 2nd International Conference on Pervasive Computing and Applications10.1109/ICPCA.2007.4365411(50-55)Online publication date: Jul-2007
https://doi.org/10.1109/ICPCA.2007.4365411
Liu BLuo JLi W(2006)Semi-online Task Allocation Algorithm among Cooperative Agents2006 10th International Conference on Computer Supported Cooperative Work in Design10.1109/CSCWD.2006.253252(1-6)Online publication date: Nov-2006
https://doi.org/10.1109/CSCWD.2006.253252
Liu JChen XFeng X(2006)Integrated Examination Management System Based on Computer Supported Cooperative Work2006 10th International Conference on Computer Supported Cooperative Work in Design10.1109/CSCWD.2006.253003(1-5)Online publication date: Nov-2006
https://doi.org/10.1109/CSCWD.2006.253003
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Single machine parallel-batch scheduling with deteriorating jobs

Scheduling parallel jobs to minimize the makespan

Preemptive online scheduling with rejection of unit jobs on two uniformly related machines