Utilization-based heuristics for statically mapping real-time applications onto the HiPer-D heterogeneous computing system
- 1 January 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
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.Keywords
This publication has 31 references indexed in Scilit:
- The rate monotonic scheduling algorithm: exact characterization and average case behaviorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- How to Solve It: Modern HeuristicsPublished by Springer Nature ,2000
- Heterogeneous Distributed ComputingPublished by Wiley ,1999
- Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing SystemsJournal of Parallel and Distributed Computing, 1999
- Assignment and scheduling communicating periodic tasks in distributed real-time systemsIEEE Transactions on Software Engineering, 1997
- Static processor allocation in a soft real-time multiprocessor environmentIEEE Transactions on Parallel and Distributed Systems, 1994
- Some Results of the Earliest Deadline Scheduling AlgorithmIEEE Transactions on Software Engineering, 1989
- A note on preemptive scheduling of periodic, real-time tasksInformation Processing Letters, 1980
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973