Scalable qos-based resource allocation

A distributed real-time or embedded system consists of a large number of applications that interact with the physical environment and must satisfy end-to-end timing constraints. Applications in such system may offer different quality levels (such as higher or lower frame rates for a video conferencing application) across multiple factors or dimensions (such as frame rate, resolution). The end-user derives different degrees of satisfaction (known as utility) from these quality levels. In this dissertation, we design and implement a resource allocation methodology that determines the quality settings of the applications in a given system with the goal of maximizing the global utility of the system. We build on the QoS-based Resource Allocation Model (Q-RAM) as a QoS optimizer [51]. This acts as a resource manager between the applications and the operating system scheduler. Q-RAM was able to reduce the NP-hard complexity of the optimal algorithm to a polynomial one while yielding a near-optimal solution. Nevertheless, Q-RAM becomes practically intractable as the system becomes large and dynamic. Hence, we develop scalable hierarchical optimization algorithms that yields near-optimal results within 5% of Q-RAM while obtaining several orders magnitude of gain in execution times. Collectively, we name the above techniques as Hierarchical Q-RAM (H-Q-RAM). H-Q-RAM can be practically implemented in large-scale distributed systems at design time and/or at run-time. We apply our scheme to: large multiprocessor systems, hierarchical networked systems, phased-array radar systems and distributed automotive systems. We also exemplify the interaction of this optimizer with the lower level resource scheduler.

[1]  D. R. Fulkerson,et al.  Flows in Networks , 1963 .

[2]  S. Shenker.  Fundamental Design Issues for the Future Internet , 1995 .

[3]  Edward G. Coffman,et al.  Bin packing with divisible item sizes , 1987, J. Complex..

[4]  Karsten Schwan,et al.  On adaptive resource allocation for complex real-time applications , 1997, Proceedings Real-Time Systems Symposium.

[5]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[6]  Kwei-Jay Lin,et al.  Distributed pinwheel scheduling with end-to-end timing constraints , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[7]  Ragunathan Rajkumar,et al.  Cooperative scheduling of multiple resources , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[8]  Michalis Faloutsos,et al.  A simple conceptual model for the Internet topology , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[9]  M. V. Wilkes,et al.  The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[10]  Lap Mui Ann Chan,et al.  Worst-case analyses, linear programming and the bin-packing problem , 1998, Math. Program..

[11]  Lui Sha,et al.  Scheduling real-time dwells using tasks with synthetic periods , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[12]  John P. Lehoczky,et al.  Integrated resource management and scheduling with multi-resource constraints , 2004, 25th IEEE International Real-Time Systems Symposium.

[13]  Steve Goddard.  Analyzing the real-time properties of a dataflow execution paradigm using a synthetic aperture radar application , 1997, Proceedings Third IEEE Real-Time Technology and Applications Symposium.

[14]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

[15]  Brian Everitt,et al.  Cluster analysis , 1974 .

[16]  Dipankar Raychaudhuri,et al.  Size matters: size-based scheduling for MPEG-4 over wireless channels , 2003, IS&T/SPIE Electronic Imaging.

[17]  Lui Sha,et al.  Template-based real-time dwell scheduling with energy constraint , 2003, The 9th IEEE Real-Time and Embedded Technology and Applications Symposium, 2003. Proceedings..

[18]  Philip Koopman,et al.  The Amaranth framework: Probabilistic, utility-based quality of service management for high-assurance computing , 1999, Proceedings 4th IEEE International Symposium on High-Assurance Systems Engineering.

[19]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[20]  Anukool Lakhina,et al.  BRITE: Universal Topology Generation from a User''s Perspective , 2001 .

[21]  Ragunathan Rajkumar,et al.  Resource management of the OS network subsystem , 2002, Proceedings Fifth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing. ISIRC 2002.

[22]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[23]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

[24]  John P. Lehoczky,et al.  Scalable resource allocation for multi-processor QoS optimization , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[25]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[26]  Klara Nahrstedt,et al.  QoS-aware resource management for distributed multimedia applications^{1} , 1998, J. High Speed Networks.

[27]  Daniel P. Siewiorek,et al.  A scalable solution to the multi-resource QoS problem , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[28]  Ariel Orda,et al.  QoS routing in networks with inaccurate information: theory and algorithms , 1999, TNET.

[29]  Russell C. Walker.  Introduction to Mathematical Programming , 1999 .

[30]  Isabelle Puaut,et al.  Scheduling fault-tolerant distributed hard real-time tasks independently of the replication strategies , 1999, Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306).

[31]  Hermann Kopetz,et al.  The time-triggered architecture , 1998, Proceedings First International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC '98).

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

[33]  Jonathan Walpole,et al.  A quality-of-service specification for multimedia presentations , 1995, Multimedia Systems.

[34]  Vaduvur Bharghavan,et al.  Achieving application level fairness through utility-based wireless fair scheduling , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[35]  Ragunathan Rajkumar,et al.  Portable RK: a portable resource kernel for guaranteed and enforced timing behavior , 1999, Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium.

[36]  Chen Lee,et al.  On Quality of Service Management , 1999 .

[37]  D. Simchi-Levi.  New worst‐case results for the bin‐packing problem , 1994 .

[38]  Ali R. Hurson,et al.  Scheduling and Load Balancing in Parallel and Distributed Systems , 1995 .

[39]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[40]  D. Estrin,et al.  RSVP: a new resource reservation protocol , 2001 .

[41]  Farouk Kamoun,et al.  Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.

[42]  Martin Sanfridson,et al.  Problem Formulations for QoS Management in Automatic Control , 2000 .

[43]  John P. Lehoczky,et al.  Optimization of quality of service in dynamic systems , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[44]  Ding-Zhu Du,et al.  Criticality- and QoS-Based Multiresource Negotiation and Adaptation , 1998, Real-Time Systems.

[45]  Klara Nahrstedt,et al.  Hierarchical QoS routing in delay-bandwidth sensitive networks , 2000, Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000.

[46]  Scott Shenker,et al.  Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks , 1998, SIGCOMM '98.

[47]  Kang G. Shin,et al.  QoS negotiation in real-time systems and its application to automated flight control , 1997, Proceedings Third IEEE Real-Time Technology and Applications Symposium.

[48]  Peter Steenkiste,et al.  On path selection for traffic with bandwidth guarantees , 1997, Proceedings 1997 International Conference on Network Protocols.

[49]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[50]  Daniel P. Siewiorek,et al.  On quality of service optimization with discrete QoS options , 1999, Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium.

[51]  Ragunathan Rajkumar,et al.  Modeling functional and para-functional concerns in embedded real-time systems , 2004 .

[52]  John P. Lehoczky,et al.  Quantized EDF scheduling in a stochastic environment , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[53]  Jonathan Walpole,et al.  Quality of Service Specification for Resource Management in Multimedia Systems , 1996 .

[54]  Lui Sha,et al.  Priority Inheritance Protocols: An Approach to Real-Time Synchronization , 1990, IEEE Trans. Computers.

[55]  Mark Kroll,et al.  Utility Theory and Rent Optimization: Utilizing Cluster Analysis to Segment Rental Markets , 1989 .

[56]  Ragunathan Rajkumar,et al.  Operating system resource reservation for real-time and multimedia applications , 1997 .

[57]  Charles L. Hedrick Rutgers.  An introduction to igrp , 1991 .

[58]  Ion Stoica,et al.  Providing guaranteed services without per flow management , 1999, SIGCOMM '99.

[59]  Frank Thomson Leighton,et al.  Some unexpected expected behavior results for bin packing , 1984, STOC '84.

[60]  A. Peressini,et al.  The Mathematics Of Nonlinear Programming , 1988 .

[61]  Nalini Venkatasubramanian,et al.  A formal model for reasoning about adaptive QoS-enabled middleware , 2001, TSEM.

[62]  Ragunathan Rajkumar,et al.  Synchronization in Real-Time Systems , 1991 .

[63]  Tei-Wei Kuo,et al.  Real-Time Dwell Scheduling of Component-Oriented Phased Array Radars , 2005, IEEE Trans. Computers.

[64]  M. S. Woolfson,et al.  Target tracking algorithms for phased array radar , 1991 .

[65]  Haifeng Zhu,et al.  Design trade-offs for networks with soft end-to-end timing constraints , 2004, Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004..

[66]  Daniel P. Siewiorek,et al.  A resource allocation model for QoS management , 1997, Proceedings Real-Time Systems Symposium.

[67]  A. Orda,et al.  QoS routing mechanisms and OSPF extensions , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[68]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[69]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.