Market-Based Model Predictive Control for Large-Scale Information Networks: Completion Time and Value of Solution

There are several important properties of modern software systems. They tend to be large-scale with distributed and component-based architectures. Also, dynamic nature of operating environments leads them to utilize alternative algorithms. However, on the other hand, these properties make it hard to provide appropriate control mechanisms due to the increased complexity. Components are sharing resources and each component can have alternative algorithms. As a result, the behavior of a software system can be controlled through resource allocation, as well as algorithm selection. This novel control problem is worthy of investigation in order to double the benefits of those properties. In this paper, we design a control mechanism for such systems. The quality-of-service we are considering is a product of the value of solution and the time for generating solution for a given problem. We build a mathematical programming model that trades off these two conflicting objectives, and decentralize the model through an auction market. By periodically opening the auction market for each existing system state, a closed-loop policy is formed. Though similar problems can be found in multiprocessor scheduling literature, they have limitations in addressing this control problem. They commonly consider so-called workflow applications in which each component only has to process one task after all of its predecessors complete their tasks. In contrast, a component in the networks under consideration processes multiple tasks in parallel with its successors or predecessors.

[1]  S. DAVID WU,et al.  Auction-theoretic coordination of production planning in the supply chain , 2000 .

[2]  Yvan Lengwiler The multiple unit auction with variable supply , 1998 .

[3]  Jan Janecek,et al.  A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[4]  G. Dantzig,et al.  THE DECOMPOSITION ALGORITHM FOR LINEAR PROGRAMS , 1961 .

[5]  Dimitri P. Bertsekas,et al.  The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial , 1990 .

[6]  Soundar R. T. Kumara,et al.  Estimating global stress environment by observing local behavior in distributed multiagent systems , 2005, IEEE International Conference on Automation Science and Engineering, 2005..

[7]  Douglas C. MacKenzie,et al.  Cougaar Agent Communities , 2004 .

[8]  Allen D. Malony,et al.  Performance Modeling for Dynamic Algorithm Selection , 2003, International Conference on Computational Science.

[9]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[10]  Y.-K. Kwok,et al.  Static scheduling algorithms for allocating directed task graphs to multiprocessors , 1999, CSUR.

[11]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[12]  Christodoulos A. Floudas Generalized Benders Decomposition , 2009, Encyclopedia of Optimization.

[13]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM '89.

[14]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[15]  Rajkumar Buyya,et al.  A taxonomy of scientific workflow systems for grid computing , 2005, SGMD.

[16]  S. Joe Qin,et al.  A survey of industrial model predictive control technology , 2003 .

[17]  Dingchao Li,et al.  Scheduling task graphs onto heterogeneous multiprocessors , 1994, Proceedings of TENCON'94 - 1994 IEEE Region 10's 9th Annual International Conference on: 'Frontiers of Computer Technology'.

[18]  Michael P. Wellman,et al.  Auction Protocols for Decentralized Scheduling , 2001, Games Econ. Behav..

[19]  H. Ali,et al.  Task Scheduling in Multiprocessing Systems , 1995, Computer.

[20]  Bertrand Meyer,et al.  On To Components , 1999, Computer.

[21]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[22]  J. B. Rosen Primal partition programming for block diagonal matrices , 1964 .

[23]  Hussein M. Abdel-Wahab,et al.  A proportional share resource allocation algorithm for real-time, time-shared systems , 1996, 17th IEEE Real-Time Systems Symposium.

[24]  Jason Nieh,et al.  Group Ratio Round-Robin: O(1) Proportional Share Scheduling for Uniprocessor and Multiprocessor Systems , 2005, USENIX Annual Technical Conference, General Track.

[25]  Mary K. Vernon,et al.  Parallel program performance prediction using deterministic task graph analysis , 2004, TOCS.

[26]  David Wells,et al.  Extending the limits of DMAS survivability: the UltraLog project , 2004, IEEE Intelligent Systems.

[27]  James B. Rawlings,et al.  Tutorial overview of model predictive control , 2000 .

[28]  Peyman Oreizy,et al.  An architecture-based approach to self-adaptive software , 1999, IEEE Intell. Syst..

[29]  Mary Mehrnoosh Eshaghian-Wilner,et al.  Mapping heterogeneous task graphs onto heterogeneous system graphs , 1997, Proceedings Sixth Heterogeneous Computing Workshop (HCW'97).

[30]  Jay H. Lee,et al.  Model predictive control: past, present and future , 1999 .

[31]  Francisco Walter Molina A Survey of Resource Directive Decomposition in Mathematical Programming , 1979, CSUR.

[32]  Paul R. Milgrom,et al.  Auctions and Bidding: A Primer , 1989 .

[33]  William E. Weihl,et al.  Lottery scheduling: flexible proportional-share resource management , 1994, OSDI '94.

[34]  Selim G. Akl,et al.  Scheduling Algorithms for Grid Computing: State of the Art and Open Problems , 2006 .

[35]  Jan Janecek,et al.  A Fast Compile-Time Task Scheduling Heuristic for Homogeneous Computing Environments , 2005, Int. J. Comput. Their Appl..

[36]  Oscar H. Ibarra,et al.  Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors , 1977, JACM.

[37]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[38]  David Fernández-Baca,et al.  Allocating Modules to Processors in a Distributed System , 1989, IEEE Trans. Software Eng..