Utilization-based heuristics for statically mapping real-time applications onto the HiPer-D heterogeneous computing system

Real-time applications continue to increase in importance as they are employed in various critical areas, such as command and control systems. These applications have traditionally required custom-made systems to execute them. Recently, with the widespread use of increasingly powerful commercial off-the-shelf (COTS) products, some real-time system designers have started a shift from custom development to COTS-based systems to achieve lower costs and more flexible systems. This research investigates the problem of allocating real-time applications to a set of COTS heterogeneous machines connected together by a COTS high-speed network. The heuristics were implemented on the High Performance Distributed Computing Program's (HiPer-D) Naval Surface Warfare Center (NSWC) testbed. At the specification of NSWC, the goal of this study is to design static resource allocation heuristics that balance the utilization of the computation and network resources in the HiPer-D system based on the system information provided. The broader goal is to maximize the time before dynamic reallocation is required for managing an increased workload at runtime.

[1]  R. F. Freund,et al.  Guest Editor's Introduction: Heterogeneous Processing , 1993 .

[2]  John P. Lehoczky,et al.  An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems , 1992, [1992] Proceedings Real-Time Systems Symposium.

[3]  Michael W. Godfrey,et al.  An overview of MSHN: the Management System for Heterogeneous Networks , 1999, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99).

[4]  John P. Lehoczky,et al.  Fixed priority scheduling of periodic task sets with arbitrary deadlines , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[5]  Ioana Banicescu,et al.  Performance of scheduling scientific applications with adaptive weighted factoring , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[6]  Kwei-Jay Lin,et al.  Scheduling Real-Time Systems with End-to-End Timing Constraints Using the Distributed Pinwheel Model , 2001, IEEE Trans. Computers.

[7]  Krithi Ramamritham,et al.  Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems , 1989, IEEE Trans. Parallel Distributed Syst..

[8]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[9]  Hong Zhang,et al.  Segmented min-min: a static mapping algorithm for meta-tasks on heterogeneous computing systems , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[10]  John P. Lehoczky,et al.  Fixed priority scheduling periodic tasks with varying execution priority , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

[11]  Sadiq M. Sait,et al.  Task matching and scheduling in heterogeneous systems using simulated evolution , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[12]  Alan Burns,et al.  Hard Real-Time Scheduling: The Deadline-Monotonic Approach , 1991 .

[13]  Howard Jay Siegel,et al.  Representing Task and Machine Heterogeneities for Heterogeneous Computing Systems , 2000 .

[14]  Riccardo Bettati,et al.  End-to-end scheduling to meet deadlines in distributed systems , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[15]  Jay K. Strosnider,et al.  ENHANCED APERIODIC RESPONSIVENESS IN HARD REAL-TIME ENVIRONMENTS. , 1987, IEEE Real-Time Systems Symposium.

[16]  Lawrence W. Dowdy,et al.  Static Processor Allocation in a Soft Real-Time Multiprocessor Environment , 1994, IEEE Trans. Parallel Distributed Syst..

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

[18]  Lonnie R. Welch,et al.  Accommodating QoS Prediction in an Adaptive Resource Management Framework , 2000, IPDPS Workshops.

[19]  R. F. Freund,et al.  Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems , 1999, J. Parallel Distributed Comput..

[20]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[21]  Kang G. Shin,et al.  Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems , 1992, [1992] Proceedings Real-Time Systems Symposium.

[22]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

[23]  Anthony A. Maciejewski,et al.  Heterogeneous Computing: Goals, Methods, and Open Problems , 2001, HiPC.

[24]  Ray Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[25]  Howard Jay Siegel,et al.  Heterogeneous Distributed Computing , 1999 .

[26]  David Lorge Parnas,et al.  Scheduling Processes with Release Times, Deadlines, Precedence, and Exclusion Relations , 1990, IEEE Trans. Software Eng..

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

[28]  Kang G. Shin,et al.  Assignment and Scheduling Communicating Periodic Tasks in Distributed Real-Time Systems , 1997, IEEE Trans. Software Eng..

[29]  Debra A. Hensgen,et al.  The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions , 1998, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98).

[30]  Krithi Ramamritham,et al.  Preemptive Scheduling Under Time and Resource Constraints , 1987, IEEE Transactions on Computers.

[31]  John P. Lehoczky,et al.  The rate monotonic scheduling algorithm: exact characterization and average case behavior , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[32]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .

[33]  A.-M. Deplanche,et al.  Heuristic techniques for allocating and scheduling communicating periodic tasks in distributed real-time systems , 2000, 2000 IEEE International Workshop on Factory Communication Systems. Proceedings (Cat. No.00TH8531).

[34]  W. Tindell AN EXTENDIBLE APPROACH FOR ANALYSING FIXED PRIORITY HARD REAL-TIME TASKS , 1994 .

[35]  ChettoHoussine,et al.  Some Results of the Earliest Deadline Scheduling Algorithm , 1989 .

[36]  Binoy Ravindran,et al.  DeSiDeRaTa: QoS Management Technology for Dynamic, Scalable, Dependable, Real-Time Systems , 1998 .

[37]  Rodney R. Howell,et al.  On Non-Preemptive Scheduling of Recurring Tasks Using Inserted Idle Times , 1995, Inf. Comput..

[38]  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..

[39]  R. F. Freund,et al.  Scheduling resources in multi-user, heterogeneous, computing environments with SmartNet , 1998, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98).

[40]  Maryline Chetto,et al.  Some Results of the Earliest Deadline Scheduling Algorithm , 1989, IEEE Transactions on Software Engineering.

[41]  Sanjoy K. Baruah,et al.  Preemptively scheduling hard-real-time sporadic tasks on one processor , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[42]  J. Leung,et al.  A Note on Preemptive Scheduling of Periodic, Real-Time Tasks , 1980, Inf. Process. Lett..

[43]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Scalable Comput. Pract. Exp..