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

Little-preemptive scheduling on unrelated processors

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

DOI10.1023/A:1015674704111zbMath1064.68025OpenAlexW1534810249MaRDI QIDQ1868263

Nodari Vakhania, Evgeny V. Shchepin

Publication date: 27 April 2003

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

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


zbMATH Keywords

algorithmschedulingpreemptionunrelated processorsacyclic distribution


Mathematics Subject Classification ID

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


Related Items (1)

On the geometry, preemptions and complexity of multiprocessor and shop scheduling







This page was built for publication: Little-preemptive scheduling on unrelated processors

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