Task scheduling with interprocessor communication delays

DOI10.1016/0377-2217(92)90346-BMaRDI QIDQ1197669zbMATH OpenOpenAlexFDO

Authors Philippe Chrétienne

Publication date 16 January 1993

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(92)90346-b

zbMATH Keywords

distributed memory computer schedulinginterprocessor communication delaypolynomial special cases

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18)

Recommendations

• New complexity results on scheduling with small communication delays
• Publication:4945672
• Tree scheduling with communication delays
• Complexity of Task Graph Scheduling with Fixed Communication Capacity
• Scheduling tasks and communications on a virtual distributed system

Cites work

• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• On general routing problems

Cited in

(8)

• Memory-constrained task scheduling on a network of dual processors
• Task scheduling with and without communication delays: A unified approach
• Distributed order scheduling and its application to multi-core DRAM controllers
• Quasi-static scheduling of communicating tasks
• On message packaging in task scheduling for distributed memory parallel machines
• Mathematical module for optimal scheduling in distributed-memory machines
• Bounds and algorithms for a practical task allocation model (extended abstract)
• New complexity results on scheduling with small communication delays

This page was built for publication: Task scheduling with interprocessor communication delays

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