A study of scheduling problems with preemptions on multi-core computers with GPU accelerators
DOI10.1016/J.DAM.2015.04.009zbMATH Open1329.68052OpenAlexW601696178WikidataQ57387697 ScholiaQ57387697MaRDI QIDQ499342FDOQ499342
Denis Trystram, Grégory Mounié, Jacek Blazewicz, Florence Monna, S. Kedad-Sidhoum
Publication date: 30 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.04.009
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
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Bounds for Certain Multiprocessing Anomalies
- Title not available (Why is that?)
- Bounds for LPT Schedules on Uniform Processors
- Handbook on Scheduling
- Scheduling with deadlines and loss functions
- Scheduling independent tasks to reduce mean finishing time
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
- Parallel solution of American option derivatives on GPU clusters
- Title not available (Why is that?)
- Corrigendum to: ``Scheduling multiprocessor tasks on three dedicated processors
- A Hardware Accelerator for the Fast Retrieval of DIALIGN Biological Sequence Alignments in Linear Space
Cited In (2)
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)
