Searching for "Algorithms for Scheduling Independent Tasks." – sorted by Relevance.
-
A Comparison of basic CPU Scheduling Algorithms for Multiprocessor Unix +
- comparing three basic algorithms that schedule independent tasks in multiprocessor versions of Unix. Two
- Cited by 4 (1 self) – Add To MetaCart
-
A Comparison of basic CPU Scheduling Algorithms for Multiprocessor Unix +
- that schedule independent tasks in multiprocessor versions of Unix. Two of these algorithms, namely Central
- Add To MetaCart
-
A best-compromise bicriteria scheduling algorithm for malleable tasks. Research report (submitted
- -line problems. Shmoys et al. [13]proposed a construction to adapt an algorithm for scheduling independent tasks
- Cited by 1 (1 self) – Add To MetaCart
-
Algorithms for Scheduling Real-Time Tasks with Input Error and End-to-End Deadlines
- of several existing algorithms for scheduling independent tasks with precise inputs to determine the time
- Cited by 21 (3 self) – Add To MetaCart
-
Synthesis Of Application-Specific Real-Time Computing Systems
- independent tasks with time and resource constraints, but no precedence constraints. The algorithm schedules
- Add To MetaCart
-
Probabilistic Analysis of Scheduling Precedence Constrained Parallel Tasks on Multicomputers
- -by-level scheduling strategy relies on a good algorithm that schedules independent tasks. There are many algorithms
- Cited by 1 (0 self) – Add To MetaCart
-
Algorithms for Scheduling Tasks with Input Error and End-to-End Deadlines
- algorithms for scheduling independent tasks with precise inputs to determine the time budgets
- Cited by 6 (3 self) – Add To MetaCart
-
Bin Packing Approximation Algorithms: Combinatorial Analysis
- . Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. J. ACM, 22
- Cited by 21 (1 self) – Add To MetaCart

