Supporting soft real-time parallel applications on multiprocessors |
| |
| Affiliation: | 1. Department of Computer Science, The University of Texas at Dallas, United States;2. Department of Computer Science, The University of North Carolina at Chapel Hill, United States;1. Mälardalen Real-Time Research Centre (MRTC), Mälardalen University, Västerås, Sweden;2. Arcticus Systems AB, Järfälla, Sweden |
| |
| Abstract: | The prevalence of multicore processors has resulted in the wider applicability of parallel programming models such as OpenMP and MapReduce. A common goal of running parallel applications implemented under such models is to guarantee bounded response times while maximizing system utilization. Unfortunately, little previous work has been done that can provide such performance guarantees. In this paper, this problem is addressed by applying soft real-time scheduling analysis techniques. Analysis and conditions are presented for guaranteeing bounded response times for parallel applications under global EDF multiprocessor scheduling. |
| |
| Keywords: | Multiprocessor scheduling Real-time systems Parallel applications Response time bounds |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
