Some algorithms for resource allocation in multiprocessor systems

被引：9

作者：

Kosorukov E.O. ^{[1
]}

Furugyan M.G. ^{[2
]}

机构：

[1] Faculty of Computational Mathematics and Cybernetics, Moscow State University

[2] Computer Center, Russian Academy of Sciences, Moscow 117967

来源：

Moscow University Computational Mathematics and Cybernetics | 2009年 / 33卷 / 4期

关键词：

minimum-cost stream; resource allocation; schedule with interrupts;

D O I：

10.3103/S0278641909040050

中图分类号：

学科分类号：

摘要：

The paper considers the admissible scheduling with interrupts in a multiprocessor system in the case when directive intervals are specified and program execution times linearly depend on the amounts of allocated resources. A pseudopolynomial algorithm based on reduction of the original problem to the problem of the minimum-cost stream is developed. © 2009 Allerton Press, Inc.

引用

页码：202 / 205

页数：3

共 5 条

[1]

Tanaev V.S., Gordon V.S., Shafranskii Y.M., Scheduling Theory: One-Stage Systems, (1984)

[2]

Federgruen A., Groenevel H., Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Technique, Manag. Sci., 32, pp. 341-349, (1986)

[3]

Gonzales T., Sahni S., Preemptive Scheduling of Uniform Processor Systems, J. Assoc. Comput. Mach., 25, 1, pp. 92-101, (1978)

[4]

Davydov E.G., Operation Research, (1990)

[5]

Phillips D.T., Garcia-Diaz A., Fundamentals of Network Analysis, (1981)

← 1 →