An algorithm for constructing single processor static-dynamic schedules

DOI10.3103/S0278641918010053zbMath1397.90181OpenAlexW2791761382MaRDI QIDQ1789208

A. S. Smirnov, V. A. Kostenko

Publication date: 10 October 2018

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0278641918010053

zbMATH Keywords

real time systemsintegrated module avionicsmaximum flow in a transport networkschedule for performing work

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Some algorithms for resource allocation in multiprocessor systems
• Making schedules in multiprocessing systems with several additional resources
• Some algorithms for analysis and synthesis of real-time multiprocessor computing systems
• Computation scheduling in multiprocessor real-time automatic control systems with constrained processor memory
• Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
• Preemptive Scheduling of Uniform Processor Systems

This page was built for publication: An algorithm for constructing single processor static-dynamic schedules