C.P.M. Scheduling with Small Communication Delays and Task Duplication
From MaRDI portal
Publication:3980521
DOI10.1287/opre.39.4.680zbMath0793.68012MaRDI 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
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Some models for scheduling parallel programs with communication delays, Complexity and approximation for precedence constrained scheduling problems with large communication delays, 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, New complexity results on scheduling with small communication delays, General scheduling non-approximability results in presence of hierarchical communications, Unnamed Item, Resource allocation algorithm for light communication grid-based workflows within an SLA context
