Scheduling preemptive tasks in parallel and distributed systems

MaRDI QIDQ4495070zbMATH OpenFDO

Authors L. Huang, Michael J. Oudshoorn

Publication date 3 May 2001

zbMATH Keywords

parallel programpreemptive task modelscheduling of tasks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• SCHEDULING PARALLEL PROGRAM TASKS WITH NON-NEGLIGIBLE INTERTASK COMMUNICATIONS ON TO NUMA MULTIPROCESSOR SYSTEMS
• An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems
• Preemptive multiprocessor task scheduling with release times and time windows
• Scheduling parallel tasks with sequential heads and tails

Cited in

(10)

• Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
• Preemptive multiprocessor task scheduling with release times and time windows
• Serial vs. Concurrent scheduling of transmission and processing tasks in collaborative systems
• scientific article; zbMATH DE number 3902030 (Why is no real title available?)
• scientific article; zbMATH DE number 716745 (Why is no real title available?)
• SCHEDULING PARALLEL PROGRAM TASKS WITH NON-NEGLIGIBLE INTERTASK COMMUNICATIONS ON TO NUMA MULTIPROCESSOR SYSTEMS
• scientific article; zbMATH DE number 2086672 (Why is no real title available?)
• VizzScheduler - a framework for the visualization of scheduling algorithms
• scientific article; zbMATH DE number 6157244 (Why is no real title available?)
• From non-preemptive to preemptive scheduling using synchronization synthesis

This page was built for publication: Scheduling preemptive tasks in parallel and distributed systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4495070)