Fast Schedulability Analysis Using Commodity Graphics Hardware
- 1 August 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007)
- No. 23251271,p. 400-408
Abstract
In this paper we explore the possibility of using commodity graphics processing units (GPUs) to speedup standard schedulability analysis algorithms. Our long-term goal is to exploit GPUs to accelerate common electronic design automation algorithms, most of which tend to be computationally expensive. Our main contribution in this paper is a reformulation of a standard demand bound criteria-based schedulability analysis algorithm as a streaming algorithm expressed in terms of computer graphics primitives. This allows the algorithm to be efficiently implemented on a GPU, thereby resulting in very attractive speedups.Keywords
This publication has 6 references indexed in Scilit:
- Brook for GPUsACM Transactions on Graphics, 2004
- Linear algebra operators for GPU implementation of numerical algorithmsACM Transactions on Graphics, 2003
- CgACM Transactions on Graphics, 2003
- Approximate schedulability analysis2003
- Dynamic- and Static-priority Scheduling of Recurring Real-time TasksReal-Time Systems, 2003
- Generalized Multiframe TasksReal-Time Systems, 1999