An Economic Model for Resource Adaptation in 2D Mesh Multicomputer Networks

In the current partitionable Mesh-connected processors parallel machine, the system administrator (SA) can provide a means for offering the required quality of service (QoS) for a multiple classes of users. We consider the approach where the SA rents free processors in a 2D mesh-connected multicomputer with QoS guarantees for the users. Free processors are managed by the SA resource management policy. SA policy should provide QoS for the users. Clearly, maximizing profit is the key objective for the SA. In this work, we propose a novel resource adaptation approach which uses an economic model to derive processors renting policy that can adapt to changing system load and users demand for services. Our scheme uses an economic model for trading computing resources. The economic model includes costs and revenues of serving users’ requests. The main concern of the derived resource management scheme is to allow continuous optimizing of the SA profit, while keeping acceptable Grade of Service. The approach integrates computing resource adaptation with service admission control based on Markov Decision Process theory. Numerical analysis stresses the ability of our approach to maximize SA profit under varying system conditions.

[1]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[2]  Keqin Li,et al.  A Two-Dimensional Buddy System for Dynamic Resource Allocation in a Partitionable Mesh Connected System , 1991, J. Parallel Distributed Comput..

[3]  G. Ryzin,et al.  Optimal dynamic pricing of inventories with stochastic demand over finite horizons , 1994 .

[4]  Phillip Krueger,et al.  ob Scheduling is More Important than Processor Allocation for Hypercube Computers , 1994, IEEE Trans. Parallel Distributed Syst..

[5]  Chita R. Das,et al.  A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers , 2002, IEEE Trans. Computers.

[6]  Prasant Mohapatra,et al.  Performance Improvement of Allocation Schemes for Mesh-Connected Computers , 1998, J. Parallel Distributed Comput..

[7]  T. Srinivasan,et al.  A Minimal Fragmentation Algorithm for Task Allocation in Mesh-Connected Multicomputers , 2004 .

[8]  Herbert Gintis,et al.  Game Theory Evolving: A Problem-Centered Introduction to Modeling Strategic Interaction - Second Edition , 2009 .

[9]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[10]  Ge-Ming Chiu,et al.  An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead , 1999, IEEE Trans. Parallel Distributed Syst..

[11]  Yahui Zhu,et al.  Efficient Processor Allocation Strategie for Mesh-Connected Parallel Computers , 1992, J. Parallel Distributed Comput..

[12]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[13]  Kurt Windisch,et al.  Non-contiguous Processor Allocation Algorithms for Mesh-connected Multicomputers 1 , 1994 .

[14]  Nian-Feng Tzeng,et al.  Allocating Precise Submeshes in Mesh Connected Systems , 1994, IEEE Trans. Parallel Distributed Syst..