Utilization-Based Heuristics for Statically Mapping Real-Time Applications onto the HiPer-D Heterogeneous Computing System
Authors: 
Shoukat Ali, Jong-Kook Kim, Yang Yu, Shriram B. Gundala, Sethavidh Gertphol, Howard Jay Siegel, Anthony A. Maciejewski, Viktor K. PrasannaAuthors Info & Claims
Shoukat Ali, Jong-Kook Kim, Yang Yu, Shriram B. Gundala, Sethavidh Gertphol, Howard Jay Siegel, Anthony A. Maciejewski, Viktor K. PrasannaAuthors Info & ClaimsPage 330
Abstract
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.
References
[1]
A. Kaufmann. Integer and Mixed Programming: Theory and Applications. Academic Press, New York, NY, 1977.
[2]
S. Ali, H. J. Siegel, M. Maheswaran, D. Hensgen, and S. Ali. Representing task and machine heterogeneities for heterogeneous computing systems. Tamkang Journal of Science and Engineering, Special 50th Anniversary Issue, 3(3):195-207, invited, Nov. 2000.
[3]
R. Armstrong, D. Hensgen, and T. Kidd. The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions. In 7th IEEE Heterogeneous Computing Workshop (HCW '98), pages 79-87, Mar. 1998.
[4]
N. C. Audsley, A. Burns, M. F. Richardson, and A. J. Wellings. Hard real-time scheduling: The deadline monotonic approach. In Real Time Programming, W. A. Halang and K. Ramamritham, eds., pages 127-132. Pergamon, Oxford, UK (Proceedings of the IFAC/IFIP Workshop, May 1991), 1992.
[5]
I. Banicescu and V. Velusamy. Performance of scheduling scientific applications with adaptive weighted factoring. In 10th IEEE Heterogeneous Computing Workshop (HCW 2001), Apr. 2001, in the CD-ROM "Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS 2001)," 2001, paper HCW 06.
[6]
H. Barada, S. M. Sait, and N. Baig. Task matching and scheduling in heterogeneous systems using simulated evolution. In 10th IEEE Heterogeneous Computing Workshop (HCW 2001), Apr. 2001, in the CD-ROM "Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS 2001)," 2001, paper HCW_15.
[7]
S. Baruah, A. Mok, and L. Rosier. Preemptively scheduling hard-real-time sporadic tasks on one processor. In 11th Real-Time Systems Symposium, pages 182-190, Dec. 1990.
[8]
R. Bettati and J. W.-S. Liu. End-to-end scheduling to meet deadlines in distributed systems. In International Conference on Distributed Computing Systems, pages 452-459, June 1992.
[9]
T. D. Braun, H. J. Siegel, N. Beck, L. L. Boloni, M. Maheswaran, A. I. Reuther, J. P. Robertson, M. D. Theys, B. Yao, D. Hensgen, and R. F. Freund. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing, 61(6):810-837, June 2001.
[10]
T. D. Braun, H. J. Siegel, and A. A. Maciejewski. Heterogeneous computing: Goals, methods, and open problems. In The 2001 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA '01), pages 1-12 (invited keynote paper), June 2001.
[11]
B. M. Carlson and L.W. Dowdy. Static processor allocation in a soft real-time multiprocessor environment. IEEE Transactions on Parallel and Distributed Systems, 5(3):316-320, Mar. 1994.
[12]
H. Chetto and M. Chetto. Some results of the earliest deadline scheduling algorithm. IEEE Transactions on Software Engineering, 15(10):1261-1269, Oct. 1989.
[13]
E. G. Coffman, Jr. (ed.). Computer and Job-Shop Scheduling Theory. John Wiley & Sons, New York, NY, 1976.
[14]
M. M. Eshaghian, editor. Heterogeneous Computing. Artech House, Norwood, MA, 1996.
[15]
S. Faucou, A.-M. Deplanche, and J.-P. Beauvais. Heuristic techniques for allocating and scheduling communicating periodic tasks in distributed real-time systems. In IEEE International Workshop on Factory Communication Systems, pages 257-265, Sep. 2000.
[16]
D. Fernandez-Baca. Allocating modules to processors in a distributed system. IEEE Transaction on Software Engineering, SE-15(11):1427-1436, Nov. 1989.
[17]
I. Foster and C. Kesselman, editors. The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Fransisco, CA, 1999.
[18]
R. F. Freund, M. Gherrity, S. Ambrosius, M. Campbell, M. Halderman, D. Hensgen, E. Keith, T. Kidd, M. Kussow, J. D. Lima, F. Mirabile, L. Moore, B. Rust, and H. J. Siegel. Scheduling resources in multi-user, heterogeneous, computing environments with SmartNet. In 7th IEEE Heterogeneous Computing Workshop (HCW '98), pages 184- 199, Mar. 1998.
[19]
R. F. Freund and H. J. Siegel. Heterogeneous processing. IEEE Computer, 26(6):13-17, June 1993.
[20]
M. G. Harbour, M. H. Klein, and J. P. Lehoczky. Fixed priority scheduling periodic tasks with varying execution priority. In 12th Real-Time Systems Symposium, pages 116-128, Dec. 1991.
[21]
D. A. Hensgen, T. Kidd, D. S. John, M. C. Schnaidt, H. J. Siegel, T. D. Braun, M. Maheswaran, S. Ali, J.-K. Kim, C. Irvine, T. Levin, R. F. Freund, M. Kussow, M. Godfrey, A. Duman, P. Carff, S. Kidd, V. Prasanna, P. Bhat, and A. Alhusaini. An overview of MSHN: The Management System for Heterogeneous Networks. In 8th IEEE Heterogeneous Computing Workshop (HCW '99), pages 184-198, Apr. 1999.
[22]
C.-J. Hou and K. G. Shin. Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems. IEEE Transactions on Computers, 46(12):1338-1356, Dec. 1997.
[23]
R. R. Howell and M. K. Venkatrao. On nonpreemptive scheduling of recurring tasks using inserted idle times. Information and Computation, 117(1):50-62, Feb. 1995.
[24]
C.-W. Hsueh and K.-J. Lin. Scheduling real-time systems with end-to-end timing constraints using the distributed pinwheel model. IEEE Transactions on Computers, 50(1):51- 66, Jan. 2001.
[25]
E. Huh, L. R. Welch, B. A. Shirazi, B. Tjaden, and C. D. Cavanaugh. Accomodating QoS prediction in an adaptive resource management framework. In Parallel and Distributed Processing, J. Rolim et al., eds., volume 1800, pages 792- 799. Lecture Notes in Computer Science, Springer-Verlag, New York, NY, 2000.
[26]
O. H. Ibarra and C. E. Kim. Heuristic algorithms for scheduling independent tasks on nonidentical processors. Journal of the ACM, 24(2):280-289, Apr. 1977.
[27]
R. Jain. The Art of Computer Systems Performance Analysis. John Wiley & Sons, Inc., New York, NY, 1991.
[28]
K. Jeffay, D. F. Stanat, and C. U. Martel. On optimal, nonpreemptive scheduling of periodic and sporadic tasks. In 12th Real-Time Systems Symposium, pages 129-139, Dec. 1991.
[29]
J. Lehoczky. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In 11th Real-Time Systems Symposium, pages 201-209, Dec. 1990.
[30]
J. Lehoczky, L. Sha, and Y. Ding. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In 10th Real-Time Systems Symposium, pages 166-171, Dec. 1989.
[31]
J. P. Lehoczky and S. Ramos-Thuel. An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems. In 13th Real-Time Systems Symposium, pages 110-123, Dec. 1992.
[32]
J. P. Lehoczky, L. Sha, and J. K. Strosnider. Enhanced aperiodic responsiveness in hard real-time environments. In 8th Real-Time Systems Symposium, pages 261-270, Dec. 1987.
[33]
J. Leung and M. Merrill. A note on preemptive scheduling of periodic, real-time tasks. Information Processing Letters, 11(3):115-118, Nov. 1980.
[34]
C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1):46-61, Jan. 1973.
[35]
J. W. S. Liu. Real-Time Systems. Prentice Hall, Upper Saddle River, NJ, 2000.
[36]
M. Maheswaran, S. Ali, H. J. Siegel, D. Hensgen, and R. F. Freund. Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. Journal of Parallel and Distributed Computing, 59(2):107-131, Nov. 1999.
[37]
M. Maheswaran, T. D. Braun, and H. J. Siegel. Heterogeneous distributed computing. In J. G. Webster, editor, Encyclopedia of Electrical and Electronics Engineering, Vol. 8, pages 679-690. John Wiley, New York, NY, 1999.
[38]
Z. Michalewicz and D. B. Fogel. How to Solve It: Modern Heuristics. Springer-Verlag, New York, NY, 2000.
[39]
Naval Surface Warfare Center,. In Report of the HiPer-D C&CA Working Group, http://www.nswc.navy. mil/hiperd/reports/thrust/, 1999.
[40]
D.-T. Peng, K. G. Shin, and T. F. Abdelzaher. Assignment and scheduling of communicating periodic tasks in distributed real-time systems. IEEE Transactions on Software Engineering, 23(12):745-758, Dec. 1997.
[41]
K. Ramamritham, J. A. Stankovic, and P.-F. Shiah. Efficient scheduling algorithms for real-time multiprocessor systems. IEEE Transactions on Parallel and Distributed Systems, 1(2):184-194, Apr. 1990.
[42]
SPEC CPU '95 technical manual. Warrenton, VA, Aug., 1995. Standard Performance Evaluation Corporation.
[43]
K. W. Tindell, A. Burns, and A. J. Wellings. An extendible approach for analysing fixed priority hard real-time tasks. Real-Time Systems, 6(2):133-151, Mar. 1994.
[44]
L. R. Welch, B. A. Shirazi, B. Ravindran, and C. Bruggeman. DeSiDeRaTa: QoS management technology for dynamic, scalable, dependable, real-time systems. In Distributed Computer Control Systems 1998, F. De Paoli and I. M. MacLeod, eds., pages 7-12. Elsevier Science, Kidlington, UK (Proceedings of the 15th International Federation of Automatic Control (IFAC) Workshop, Sept. 1998), 1999.
[45]
M.-Y. Wu, W. Shu, and H. Zhang. Segmented min-min: A static mapping algorithm for meta-tasks on heterogeneous computing systems. In 9th IEEE Heterogeneous Computing Workshop (HCW 2000), pages 375-385, May 2000.
[46]
J. Xu and D. L. Parnas. Scheduling processes with release times, deadlines, precedence, and exclusion relations. IEEE Transactions on Software Engineering, 16(3):360-369, Mar. 1990.
[47]
W. Zhao, K. Ramamritham, and J. A. Stankovic. Preemptive scheduling under time and resource constraints. IEEE Transactions on Computers, C-36(8):949-960, Aug. 1987.
- Utilization-Based Heuristics for Statically Mapping Real-Time Applications onto the HiPer-D Heterogeneous Computing System
Recommendations
On adaptive resource allocation for complex real-time applications
RTSS '97: Proceedings of the 18th IEEE Real-Time Systems SymposiumResource allocation for high-performance real-time applications is challenging due to the applications' data-dependent nature, dynamic changes in their external environment, and limited resource availability in their target embedded system platforms. ...
Heterogeneous Resource Management for Dynamic Real-Time Systems
HCW '00: Proceedings of the 9th Heterogeneous Computing WorkshopDynamic real-time systems face many resource management problems.This paper addresses the following problems: (1) dynamic resource allocation to provide QoS objectives,(2) heterogeneous resources, and(3) non-intrusive accurate monitoring of QoS, ...
Comments
Information & Contributors
Information
Published In
April 2002
ISBN:0769515738
Publisher
IEEE Computer Society
United States
Publication History
Published: 15 April 2002
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 25 Dec 2024