Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priority-based scheduling algorithms is computation dependent. Scheduling based on the concept of earliest-startable-task produ
Scheduling tasks and communications on a virtual distributed system
β Scribed by J.-Y. Colin; P. Colin
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 419 KB
- Volume
- 94
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
One of the major limitations of distributed memory systems (DMSs) is the high cost for interprocessor communication, which can be minimized by having an efficient task partitioning and scheduling algorithm. It is well known that scheduling the tasks of a directed acyclic graph (DAG) to obtain an opt
Using a single concentrated scheduling system in a large-scale manufacturing system is problematic. As a result, scheduling systems are being introduced in departmental units, which has resulted in having to repeat schedule adjustments between departments whenever there is a change in one department