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
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Work-Competitive Scheduling on Task Dependency Graphs

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

DOI10.1142/S0129626415500012zbMath1376.68031OpenAlexW2266945376MaRDI QIDQ4598901

Alexander Russell, Chadi Kari, Narasimha Shashidhar

Publication date: 15 December 2017

Published in: Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129626415500012


zbMATH Keywords

competitive analysisonline algorithmsdistributed computingrandomized algorithmspartitionable networks


Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20) Distributed algorithms (68W15) Online algorithms; streaming algorithms (68W27)








This page was built for publication: Work-Competitive Scheduling on Task Dependency Graphs

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