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

DOI10.1287/OPRE.39.4.680MaRDI QIDQ3980521zbMATH OpenOpenAlexFDO

Authors J.-Y. Colin, Philippe Chrétienne

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

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

Recommendations

• Scheduling with duplication on m processors with small communication delays
• Scheduling tasks and communications on a virtual distributed system
• Multiprocessor scheduling with communication delays
• Tree scheduling with communication delays

Cited in

(23)

• 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
• Tree scheduling with communication delays
• Three, four, five, six, or the complexity of scheduling with communication delays
• Using duplication for scheduling unitary tasks on m processors with unit communication delays
• Minimizing the volume in scheduling an out-tree with communication delays and duplication.
• New complexity results on scheduling with small communication delays
• General scheduling non-approximability results in presence of hierarchical communications
• Scheduling with duplication on m processors with small communication delays
• Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules
• Clustering and scheduling method based on task duplication
• Resource allocation algorithm for light communication grid-based workflows within an SLA context
• Task scheduling algorithm using minimized duplications in homogeneous systems
• scientific article; zbMATH DE number 1955815 (Why is no real title available?)
• On message packaging in task scheduling for distributed memory parallel machines
• Mathematical module for optimal scheduling in distributed-memory machines
• Some models for scheduling parallel programs with communication delays
• Optimizing latency and throughput of application workflows on clusters
• Bounds and algorithms for a practical task allocation model (extended abstract)
• Scheduling jobs with shared additional operations on parallel identical machines
• Multiprocessor scheduling with communication delays
• Complexity and approximation for precedence constrained scheduling problems with large communication delays

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

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