A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems

Decentralized algorithms are examined for optimally distributing a divisible resource in a distributed computer system. To study this problem in a specific context, the problem of optimal file allocation is considered. In this case, the optimization criteria include both the communication cost and average processing delay associated with a file access. The algorithms examined have their origins in the field of mathematical economics. They are shown to have several attractive properties, including their simplicity and distributed nature, the computation of feasible and increasingly better resource allocations as the result of each iteration, and, in the case of file allocation, rapid convergence. Conditions are formally derived under which the algorithms are guaranteed to coverage, and their convergence behavior is additionally examined through simulation. >

[1]  Wesley W. Chu,et al.  Optimal File Allocation in a Multiple Computer System , 1969, IEEE Transactions on Computers.

[2]  Lawrence W. Dowdy,et al.  Comparative Models of the File Assignment Problem , 1982, CSUR.

[3]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[4]  Keith M. Davies.  Planning Without Prices , 1979 .

[5]  Rajan Suri.  A decentralized approach to optimal file allocation in computer networks , 1979, 1979 18th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[6]  Benjamin W. Wah.  File Placement on Distributed Computer Systems , 1984, Computer.

[7]  Giancarlo Martella,et al.  Optimal File Allocation in a Computer Network: a Solution Method Based on the Knapsack Problem , 1982, Comput. Networks.

[8]  C. Cassandras,et al.  An event domain formalism for sample path perturbation analysis of discrete event dynamic systems , 1985 .

[9]  L. Schrage,et al.  Queueing systems, Vol. I: Theory , 1977, Proceedings of the IEEE.

[10]  Yu-Chi Ho,et al.  A Class of Center-Free Resource Allocation Algorithms 1 , 1980 .

[11]  K. Arrow,et al.  General Competitive Analysis , 1971 .

[12]  Kapali P. Eswaran.  Placement of Records in a File and File Allocation in a Computer , 1974, IFIP Congress.

[13]  Peter P. Chen.  Optimal file allocation in multi-level storage systems , 1973, AFIPS National Computer Conference.

[14]  L. Hurwicz.  Studies in Resource Allocation Processes: The design of resource allocation mechanisms , 1977 .

[15]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[16]  J. Spruce Riordon,et al.  Optimal allocation of resources in distributed information networks , 1976, TODS.

[17]  Dimitri P. Bertsekas,et al.  Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks , 1984, IEEE Trans. Commun..

[18]  Satish K. Tripathi,et al.  Optimal allocation of file servers in a local network environment , 1986, IEEE Transactions on Software Engineering.

[19]  Nathan Goodman,et al.  A Survey of Research and Development in Distributed Database Management , 1977, VLDB.

[20]  C. V. Ramamoorthy,et al.  Optimization of Memory Hierarchies in Multiprogrammed Systems , 1970, JACM.

[21]  Leonard Kleinrock,et al.  Queueing Systems - Vol. 1: Theory , 1975 .

[22]  Gautam H. Thaker,et al.  Interactions Between Routing and Flow Control Algorithms , 1986, IEEE Trans. Commun..

[23]  花田 収悦,et al.  Optimal File Allocation in a Multiple Computer System , 1970 .

[24]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[25]  Irving L. Traiger,et al.  The notions of consistency and predicate locks in a database system , 1976, CACM.

[26]  Boris Polyak,et al.  Constrained minimization methods , 1966 .