Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Iterative list scheduling for heterogeneous computing

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

DOI10.1016/J.JPDC.2005.01.002zbMath1101.68420OpenAlexW2040826828MaRDI QIDQ1779735

Niranjan Chakravarthy

Publication date: 1 June 2005

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

Full work available at URL: https://doi.org/10.1016/j.jpdc.2005.01.002


zbMATH Keywords

Task schedulingList schedulingHeterogeneous computing systemsRandomly generated DAGs


Mathematics Subject Classification ID

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


Related Items (4)

Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay ⋮ List scheduling with duplication for heterogeneous computing systems ⋮ Reliability-aware scheduling strategy for heterogeneous distributed computing systems ⋮ Communication contention in APN list scheduling algorithm







This page was built for publication: Iterative list scheduling for heterogeneous computing

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1779735&oldid=14129234"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 07:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki