Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Analysis of the list scheduling algorithm for precedence constrained parallel tasks

From MaRDI portal
Publication:1304383
Jump to:navigation, search

DOI10.1023/A:1009817206440zbMath0962.68020OpenAlexW1606760325MaRDI QIDQ1304383

Keqin Li

Publication date: 20 February 2000

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009817206440


zbMATH Keywords

list schedulingtask schedulingprecedence constraintworst-case performance ratioparallel task


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)


Related Items (2)

Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion ⋮ Scheduling DAGs with random parallel tasks on binarily partitionable systems







This page was built for publication: Analysis of the list scheduling algorithm for precedence constrained parallel tasks

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1304383&oldid=13415207"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 11:16.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki