A study of scheduling problems with preemptions on multi-core computers with GPU accelerators
From MaRDI portal
Publication:499342
DOI10.1016/J.DAM.2015.04.009zbMath1329.68052OpenAlexW601696178WikidataQ57387697 ScholiaQ57387697MaRDI QIDQ499342
Denis Trystram, Grégory Mounié, Jacek Błażewicz, Florence Monna, Safia 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
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Corrigendum to: ``Scheduling multiprocessor tasks on three dedicated processors
- Parallel solution of American option derivatives on GPU clusters
- Scheduling with Deadlines and Loss Functions
- Bounds for LPT Schedules on Uniform Processors
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
- Scheduling independent tasks to reduce mean finishing time
- A Hardware Accelerator for the Fast Retrieval of DIALIGN Biological Sequence Alignments in Linear Space
- Bounds for Certain Multiprocessing Anomalies
- Handbook on Scheduling
This page was built for publication: A study of scheduling problems with preemptions on multi-core computers with GPU accelerators
