C.P.M. Scheduling with Small Communication Delays and Task Duplication

DOI10.1287/opre.39.4.680zbMath0793.68012OpenAlexW2158923044MaRDI QIDQ3980521

Philippe Chrétienne, J.-Y. Colin

Publication date: 26 June 1992

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.39.4.680

zbMATH Keywords

machine scheduling problem

Mathematics Subject Classification ID

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

Related Items (16)

Tree scheduling with communication delays ⋮ Three, four, five, six, or the complexity of scheduling with communication delays ⋮ New complexity results on scheduling with small communication delays ⋮ General scheduling non-approximability results in presence of hierarchical communications ⋮ Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules ⋮ Unnamed Item ⋮ Using duplication for scheduling unitary tasks on m processors with unit communication delays ⋮ Task scheduling algorithm using minimized duplications in homogeneous systems ⋮ Optimizing latency and throughput of application workflows on clusters ⋮ Complexity and approximation for precedence constrained scheduling problems with large communication delays ⋮ Some models for scheduling parallel programs with communication delays ⋮ Resource allocation algorithm for light communication grid-based workflows within an SLA context ⋮ Scheduling multiprocessor tasks -- An overview ⋮ Scheduling tasks and communications on a virtual distributed system ⋮ Scheduling inverse trees under the communication model of the LogP-machine ⋮ ON MESSAGE PACKAGING IN TASK SCHEDULING FOR DISTRIBUTED MEMORY PARALLEL MACHINES

This page was built for publication: C.P.M. Scheduling with Small Communication Delays and Task Duplication