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

Algorithms for handling skew in parallel task scheduling

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

DOI10.1016/0743-7315(92)90019-JzbMATH Open0786.68014OpenAlexW2076137611MaRDI QIDQ1208591FDOQ1208591


Authors: Arun Swami, Honesty C. Young, Ashish Gupta Edit this on Wikidata


Publication date: 16 May 1993

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-7315(92)90019-j




Recommendations

  • A note on LPT scheduling
  • Scheduling Independent Tasks on Uniform Processors
  • Performance of the LPT algorithm in multiprocessor scheduling
  • scientific article; zbMATH DE number 1234084
  • Parametric bounds for LPT scheduling on uniform processors


zbMATH Keywords

scheduling


Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)







This page was built for publication: Algorithms for handling skew in parallel task scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208591)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1208591&oldid=13272875"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 06:21. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki