Abstract
The problem of compiling an acceptable multiprocessor schedule without interruptions and switching is considered for the case when the set of partial relations is specified on the set of operations, all operations have a common deadline, and the distribution of tasks on the processors is specified. At some undetermined times, requests may be made to perform additional, higher priority operations, for which some processors are freed for a certain time. As a result, the execution of the initial set of tasks is postponed to a later time and thereby violates the schedule built for it. A strategy is developed for constructing an acceptable schedule in which the probability of its violation due to requests for additional operations is minimal.
Sign-in/Register to access full text options 
Free) 
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 call
