Realistic analysis of limited parallel software / hardware implementations
- 13 November 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Proposed real-time system implementations combine reconfigurable hardware (for speed-up) with processor-memory architectures. Such hardware can execute many functions in parallel, leading to a limited parallel system where a single software process can execute on the processor at any time, in parallel with a number of functions implemented on the reconfigurable hardware. This approach is not amenable to conventional fixed priority timing analysis, as fundamental assumptions are compromised, namely that of a critical instant. This paper describes generalised fixed priority timing analysis for limited parallel systems, illustrated by an example system utilising field programmable gate arrays as the reconfigurable hardware resource. Author(s) Audsley, N.C. Dept. of Comput. Sci., York Univ., UK Bletsas, K.Keywords
This publication has 10 references indexed in Scilit:
- Fixed priority timing analysis of real-time systems with limited parallelismPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Optimized priority assignment for tasks and messages in distributed hard real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Hardware implementation of the Ravenscar Ada tasking profilePublished by Association for Computing Machinery (ACM) ,2002
- Hardware compilation of sequential adaPublished by Association for Computing Machinery (ACM) ,2001
- System-level exploration with SpecSynPublished by Association for Computing Machinery (ACM) ,1998
- Holistic schedulability analysis for distributed hard real-time systemsMicroprocessing and Microprogramming, 1994
- Applying new scheduling theory to static priority pre-emptive schedulingSoftware Engineering Journal, 1993
- On the complexity of fixed-priority scheduling of periodic, real-time tasksPerformance Evaluation, 1982
- 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