Planning computations in a multiprocessor system with unfixed parameters
From MaRDI portal
Publication:290006
DOI10.3103/S0278641915040044zbMath1343.90034MaRDI QIDQ290006
Publication date: 1 June 2016
Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (1)
Cites Work
- Scheduling algorithms for real-time computing systems admitting simulation models
- Optimal correction of execution intervals for multiprocessor scheduling with additional resource
- Computation planning in multiprocessor real time automated control systems with an additional resource
- Some algorithms for resource allocation in multiprocessor systems
- An algorithm for constructing single machine schedules based on ant colony approach
- Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
- Preemptive Scheduling with Release Times, Deadlines, and Due Times
- Preemptive Scheduling of Uniform Processor Systems
- Unnamed Item
This page was built for publication: Planning computations in a multiprocessor system with unfixed parameters