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

Complexity Analysis of Checkpoint Scheduling with Variable Costs

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

DOI10.1109/TC.2012.57zbMath1365.90133OpenAlexW1992344118MaRDI QIDQ5274434

Frédéric Wagner, Mohamed-Slim Bouguerra, Denis Trystram

Publication date: 12 July 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2012.57



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 (1)

Unnamed Item







This page was built for publication: Complexity Analysis of Checkpoint Scheduling with Variable Costs

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