A study of scheduling problems with preemptions on multi-core computers with GPU accelerators
From MaRDI portal
(Redirected from Publication:499342)
Recommendations
- Preemptive Scheduling of Parallel Jobs on Multiprocessors
- scientific article; zbMATH DE number 871911
- Idempotence-Based Preemptive GPU Kernel Scheduling for Embedded Systems
- Multiprocessor scheduling under precedence constraints: polyhedral results
- Globally scheduled real-time multiprocessor systems with GPUs
Cites work
- A Hardware Accelerator for the Fast Retrieval of DIALIGN Biological Sequence Alignments in Linear Space
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
- Bounds for Certain Multiprocessing Anomalies
- Bounds for LPT Schedules on Uniform Processors
- Corrigendum to: ``Scheduling multiprocessor tasks on three dedicated processors
- Handbook on Scheduling
- scientific article; zbMATH DE number 3466528 (Why is no real title available?)
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel solution of American option derivatives on GPU clusters
- Scheduling independent tasks to reduce mean finishing time
- Scheduling with deadlines and loss functions
Cited in
(3)
This page was built for publication: A study of scheduling problems with preemptions on multi-core computers with GPU accelerators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499342)