Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Using dynamic priority time Petri nets for scheduling analysis via earliest deadline first policy

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Karamti, W. ; CES Lab., Univ. of Sfax, Sfax, Tunisia ; Mahfoudhi, A. ; Kacem, Y.H.

In a previous paper [14], we investigated the expressiveness of Time Petri Nets extended with dynamic Priorities and showed that it is able to analyze the schedulability of a partitioned real-time system over a multiprocessor architecture. The scheduling analysis is proven via the Least Laxity First (LLF) policy and a set of independent tasks. In the same vein, we investigate in the present paper the applicability of the proposed approach for the Earliest Deadline First (EDF) policy to reduce the cost of preemption and we tackle the dependent tasks problem. Through an experiment, we present the capacity of our approach to detect the temporal faults in scheduling.

Note: As originally published there was an error in this article. A draft copy was submitted in error. A final, corrected replacement version is now provided.  

Published in:

Parallel and Distributed Processing with Applications (ISPA), 2012 IEEE 10th International Symposium on

Date of Conference:

10-13 July 2012