Some algorithms for resource allocation in multiprocessor systems

DOI10.3103/S0278641909040050zbMath1192.68105MaRDI QIDQ845541

M. G. Furugyan, E. O. Kosorukov

Publication date: 29 January 2010

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

zbMATH Keywords

resource allocationminimum-cost streamschedule with interrupts

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (9)

Planning computations in a multiprocessor system with unfixed parameters ⋮ Methods and models of project resource management under uncertainty ⋮ Some modifications of integer optimization problems with uncertainty and risk ⋮ Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors ⋮ Optimal correction of execution intervals for multiprocessor scheduling with additional resource ⋮ Combinatorial optimization algorithms combining greedy strategies with a limited search procedure ⋮ Making schedules in multiprocessing systems with several additional resources ⋮ An algorithm for constructing single processor static-dynamic schedules ⋮ Scheduling in multiprocessor systems with additional restrictions

Cites Work

• Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
• Preemptive Scheduling of Uniform Processor Systems

This page was built for publication: Some algorithms for resource allocation in multiprocessor systems