scientific article; zbMATH DE number 1487943
From MaRDI portal
Publication:4495070
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
(9)- scientific article; zbMATH DE number 3902030 (Why is no real title available?)
- scientific article; zbMATH DE number 6157244 (Why is no real title available?)
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
- From non-preemptive to preemptive scheduling using synchronization synthesis
- scientific article; zbMATH DE number 716745 (Why is no real title available?)
- 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 2086672 (Why is no real title available?)
- scientific article; zbMATH DE number 1863252 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4495070)