CLUSTER-BASED TASK SCHEDULING FOR THE LOGP MODEL

DOI10.1142/S0129054199000290zbMATH Open1319.68035MaRDI QIDQ5249015FDOQ5249015

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)

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

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)

Cites Work

• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• List scheduling with and without communication delays
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
• Towards an Architecture-Independent Analysis of Parallel Algorithms
• A versatile cost modelling approach for multicomputer task scheduling: Special issue on task scheduling problems for parallel and distributed systems

Cited In (5)

• On scheduling send-graphs and receive-graphs under the LogP-model
• Title not available (Why is that?)
• Title not available (Why is that?)
• On message packaging in task scheduling for distributed memory parallel machines
• Title not available (Why is that?)

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)