In traditional precedence-constrained scheduling a task is ready to execute when all its predecessors are complete. Such a task is called an AND task. The authors allow certain tasks, known as OR tasks, to be ready when just one of their predecessors is ...
This report presents the architecture, services and performance results obtained from the implementation of the PVM parallel processing tool supported by either the Unix operating system and the RHODOS distributed operating system. It is shown that the ...
Multiprocessor scheduling in a shared multiprogramming environment is often structured as two-level scheduling, where a kernel-level job scheduler allots processors to jobs and a user-level task scheduler schedules the work of a job on the allotted ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in