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

An optimal algorithm for scheduling interval ordered tasks with communication on \(N\) processors

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

DOI10.1006/JCSS.1995.1068zbMath0830.68007OpenAlexW1970631330MaRDI QIDQ1900934

Hesham El-Rewini, Hesham H. Ali

Publication date: 3 December 1995

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1995.1068


zbMATH Keywords

multiprocessor systemsscheduling problem


Mathematics Subject Classification ID

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


Related Items (2)

Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays ⋮ New MIP model for multiprocessor scheduling problem with communication delays







This page was built for publication: An optimal algorithm for scheduling interval ordered tasks with communication on \(N\) processors

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1900934&oldid=14310931"
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 13:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki