PEARLS: An Integrated Environment for Task Scheduling

Nilam Chand, Bindiya Mansharamani, Rafael Romero, Will Beazley, Stefan Andrei
2007 Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007)  
The scheduling problem answers the question whether a given set of input tasks is schedulable (or feasible). It has been studied since '70s and impressive results have been revealed to the scientific community. This paper presents an implementation tool, PEARLS i.e, Pliable Earliest Deadline First, Rate Monotonic, Least Laxity Schedulers, based on some of the most significant existing schedulability analytical feasibility conditions and schedulability algorithms.If the input tasks set is
more » ... e, our tool can simulate all the traditional scheduling methods:rate monotonic (RM), earliest deadline first (EDF) and least laxity(LL). Moreover, the tool is designed to handle both preemptive as well as non preemptive tasks. Both periodic and sporadic tasks and precedence contraints may also be considered in the input. Experimental results have been conducted for our tool implemented in the recent Java Development Kit (JDK) version 1.6 on a Pentium GHz system having 1MB memory. We tested our tool on several real-time systems specifications, and the obtained experimental results have confirmed that our tool is efficient and useful.
doi:10.1109/synasc.2007.59 dblp:conf/synasc/ChandMRBA07 fatcat:hksl53fqpfhr7kduztv3bk6geq