Scheduling in multiprocessor systems with additional restrictions

DOI10.1134/S1064230718020077MaRDI QIDQ1795622zbMATH OpenOpenAlexFDO

Authors M. G. Furugyan

Publication date 16 October 2018

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1064230718020077

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors
• Making schedules in multiprocessing systems with several additional resources
• scientific article; zbMATH DE number 1192099
• Some algorithms for resource allocation in multiprocessor systems
• Optimal preemptive scheduling in multiprocessor systems with incomplete communication graph

Cites work

• A minimax under nonlinear transportation constraints.
• Analysis of multiuser network systems, taking into account uncertainty
• Combinatorial optimization. Theory and applications.
• Computation planning in multiprocessor real time automated control systems with an additional resource
• Computation scheduling in multiprocessor real-time automatic control systems with constrained processor memory
• Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors
• Hereditarily minimax matrices in models of transportation type
• scientific article; zbMATH DE number 4070602 (Why is no real title available?)
• Introduction to algorithms.
• Making schedules in multiprocessing systems with several additional resources
• Minimax in transportation models with integral constraints. I
• Minimax in transportation models with integral constraints. II
• Network models with fixed parameters at the communication nodes. I
• Network models with fixed parameters at the communication nodes. II
• Optimal preemptive scheduling in multiprocessor systems with incomplete communication graph
• Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
• Preemptive Scheduling of Uniform Processor Systems
• Scheduling algorithms
• Some algorithms for resource allocation in multiprocessor systems
• The analysis of multiuser network systems under uncertainty. VII: The problem of standard vulnerability analysis of a multicommodity flow network
• Transportation problems with a minimax criterion

Cited in

(15)

• Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors
• Making schedules in multiprocessing systems with several additional resources
• Planning calculations in a multiprocessor system with unspecified moments of operational readiness
• Synthesizing a multiprocessor system for scheduling with interruptions and execution intervals
• Optimal preemptive scheduling in multiprocessor systems with incomplete communication graph
• Planning computations in a multiprocessor system with unfixed parameters
• scientific article; zbMATH DE number 3885635 (Why is no real title available?)
• scientific article; zbMATH DE number 1192096 (Why is no real title available?)
• scientific article; zbMATH DE number 1192099 (Why is no real title available?)
• scientific article; zbMATH DE number 1157215 (Why is no real title available?)
• Optimal correction of execution intervals for multiprocessor scheduling with additional resource
• Computation planning in multiprocessor real time automated control systems with an additional resource
• Better permutations for the single-processor scheduling with time restrictions
• Scheduling calculations for a multiprocessor system in real time
• Some algorithms for resource allocation in multiprocessor systems

This page was built for publication: Scheduling in multiprocessor systems with additional restrictions

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