Scheduling multiprocessor tasks — An overview-Reference-Cited by-同舟云学术

Scheduling multiprocessor tasks — An overview

Published:1996-10 Issue:2 Volume:94 Page:215-230
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Drozdowski Maciej

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference86 articles.

1. An O(n log n) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube;Ahuja;Information Processing Letters,1990

2. Models and algorithms for coscheduling compute-intensive tasks on a network of workstations;Atallah;Journal of Parallel and Distributed Computing,1992

3. The STAR (Self-Testing And Repairing) computer: An investigation of the theory and practice of fault-tolerant computer design;Avizienis;IEEE Transactions on Computers,1971

4. Optimal sequencing and arrangement in distributed single-level tree networks with communication delays;Bharadwaj;IEEE Transactions on Parallel and Distributed Systems,1994

5. Preemptive scheduling of multiprocessor tasks on the dedicated processors system subject to minimal lateness;Bianco;Information Processing Letters,1993

Cited by 180 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. WITHDRAWN: Non-work conserving dynamic scheduling of moldable gang tasks on multicore systems;Internet of Things and Cyber-Physical Systems;2024-03

2. A Non-Work Conserving Algorithm for Dynamic Scheduling of Moldable Gang Tasks on Multicore Systems;2024 International Conference on Electronics, Information, and Communication (ICEIC);2024-01-28

3. On-Line Scheduling Multiprocessor Tasks in the Non-predictive Environment;Lecture Notes in Networks and Systems;2024

4. Multiprocessor Task Scheduling with Probabilistic Task Duration;Lecture Notes in Networks and Systems;2024

5. Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms;Operations Research Letters;2023-11