CLUSTER-BASED TASK SCHEDULING FOR THE LOGP MODEL
From MaRDI portal
Publication:5249015
DOI10.1142/S0129054199000290zbMath1319.68035MaRDI QIDQ5249015
Vinod E. F. Rebello, Aline Nascimento, Cristina Boeres
Publication date: 29 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
- A versatile cost modelling approach for multicomputer task scheduling: Special issue on task scheduling problems for parallel and distributed systems
- List scheduling with and without communication delays
- Towards an Architecture-Independent Analysis of Parallel Algorithms
- Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
This page was built for publication: CLUSTER-BASED TASK SCHEDULING FOR THE LOGP MODEL