You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: University of York » Outputs » Detail

Output details

11 - Computer Science and Informatics

University of York

Return to search Previous output Next output

Output 113 of 139 in the submission

Article title

Schedulability Analysis for Real-Time Systems with EDF Scheduling

Type

D - Journal article

DOI

10.1109/TC.2009.58

Title of journal

IEEE Transactions on Computers

Article number

Volume number

Issue number

First page of article

1250

ISSN of journal

0018-9340

Year of publication

2009

URL

http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=4815215

Number of additional authors

Additional information

<03>The scheme developed in this paper (QPA) delivers an exponential improvement in the analysis of Earliest Deadline First systems. This being an optimal scheduling scheme for single processor or partitioned multiprocessor systems. QPA is one of six Matlab-based algorithms identified on the IEEE Technical Committee on Real-Time Systems' list of recommended algorithms (http://tcrts.org/software/algorithms/). It also now forms the basis for a number of semi-partitioning allocation algorithms for multi-core real-time systems. A number of extensions to the basic scheme have been published subsequently in, for example, the Real-Time Systems Journal (in 2011) and the ACM Transactions on Embedded Systems (in 2013).

Interdisciplinary

Cross-referral requested

Research group

B - Real-Time Systems

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract