CLUSTER-BASED TASK SCHEDULING FOR THE LOGP MODEL

DOI10.1142/S0129054199000290MaRDI QIDQ5249015zbMATH OpenFDO

Authors Cristina Boeres, Aline Nascimento, Vinod E. F. Rebello

Publication date 29 April 2015

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

clusteringmultiprocessor schedulingtask replicationLogP model

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 1863333
• Scheduling distributed clusters of parallel machines: primal-dual and LP-based approximation algorithms
• Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms
• Dynamic scheduling for dependence loops on heterogeneous clusters

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
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
• Towards an Architecture-Independent Analysis of Parallel Algorithms

Cited in

(5)

• scientific article; zbMATH DE number 2090582 (Why is no real title available?)
• scientific article; zbMATH DE number 2099201 (Why is no real title available?)
• On scheduling send-graphs and receive-graphs under the LogP-model
• scientific article; zbMATH DE number 1760098 (Why is no real title available?)
• On message packaging in task scheduling for distributed memory parallel machines

This page was built for publication: CLUSTER-BASED TASK SCHEDULING FOR THE LOGP MODEL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249015)