Paper Info
Title
Using Dynamic Priority Time Petri Nets for Scheduling Analysis via Earliest Deadline First Policy
Abstract
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.
Year
DOI
Venue
2012
10.1109/ISPA.2012.50
ISPA
Keywords
Field
DocType
dynamic priorities,independent task,earliest deadline first policy,present paper,earliest deadline first,scheduling analysis,dynamic priority time petri,previous paper,time petri,laxity first,dependent tasks problem,dynamic scheduling,petri nets,job shop scheduling,real time system,robots
Preemption,Petri net,Job shop scheduling,Computer science,Scheduling (computing),Real-time operating system,Real-time computing,Least slack time scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Distributed computing
Conference
Citations 
PageRank 
References 
2
0.36
0
Authors
3
Name
Order
Citations
PageRank
Walid Karamti1132.74
Adel Mahfoudhi27214.26
Yessine Hadj Kacem3349.72