Abstract
A problem of admissible multiprocessor preemptive scheduling is considered when execution intervals are specified, processors have arbitrary performance, and the execution time of tasks linearly depends on the amount of the additional resource allocated to their execution. If there is no admissible schedule for a given amount of the additional resource, we consider the problem of optimal correction of execution intervals. The solution is based on reducing the original problem to the problem of minimum cost flow.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Computer and Systems Sciences International
Paper Title
Journal
Date
