Dario Faggioli
ABSTRACT
Recently, many projects have been started to introduce some real-time mechanisms into general purpose operating systems (GPOS) in order to make them capable of providing the users with some temporal guarantees. Many of these projects focused especially on Linux for its capillary and widespread adoption throughout many different research and industrial environments.
By tracking the kernel release cycle, we propose an efficient Earliest Deadline First implementation in the form of a patch-set against the 2.6.27 version, that is the latest released one, as of now. Our implementation provides the user with the possibility to choose SCHED_EDF as one of the possible scheduling policies for a task, with an enhanced version of the standard algorithm. In fact, we propose a new approach to shared resources' access which, differently from many other previous existing works, does not require the user to specify any parameters about the critical sections every task will enter during its execution.
- Ada 2005 Reference Manual. http://www.adaic.com/standards/ada05.html.Google Scholar
- Ingo Molnar's RT Tree. Available online.Google Scholar
- Linux kernel. The Linux Kernel Archives, http://kernel.org.Google Scholar
- Linux Testbed for Multiprocessor Scheduling in Real-Time Systems. http://www.cs.unc.edu/~anderson/litmus-rt/.Google Scholar
- Modular Scheduler Core and Completely Fair Scheduler. http://lkml.org/lkml/2007/4/13/180.Google Scholar
- Programming Real-Time with Ada 2005. http://www.embedded.com/showArticle.jhtml?articleID=192503587.Google Scholar
- RTAI home page. https://www.rtai.org/.Google Scholar
- RTLinux home page. http://www.rtlinux.org.Google Scholar
- The Real-Time Driver Model. http://www.xenomai.org/documentation/trunk/html/api/group__rtdm.html.Google Scholar
- XENOMAI home page. http://www.xenomai.org.Google Scholar
- T. P. Baker. A stack-based resource allocation policy for realtime processes. In IEEE Real-Time Systems Symposium, pages 191--200, 1990.Google ScholarCross Ref
- T. P. Baker. Stack-based scheduling of real-time processes. Real-Time Systems, (3), 1991. Google ScholarDigital Library
- S. Baruah. The limited-preemption uniprocessor scheduling of sporadic task systems. In Proceedings of the EuroMicro Conference on Real-Time Systems, pages 137--144, Palma de Mallorca, Balearic Islands, Spain, July 2005. IEEE Computer Society Press. Google ScholarDigital Library
- C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1):46--61, 1973. Google ScholarDigital Library
- L. Sha, R. Rajkumar, and J. P. Lehoczky. Priority inheritance protocols: An approach to real-time synchronization. IEEE Trans. Comput., 39(9):1175--1185, 1990. Google ScholarDigital Library
- V. Yodaiken. Against priority inheritance. Technical report, Finite State Machine Labs, June 2002.Google Scholar
Index Terms
- An implementation of the earliest deadline first algorithm in Linux
Recommendations
Designing and Implementing of Earliest Deadline First Scheduling Algorithm on Standard Linux
GREENCOM-CPSCOM '10: Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social ComputingThis thesis focuses on the problem of utilizing a desktop operating system to provide support for concurrent Real-Time (RT) processes. The operating system discussed is Linux. An Introduction into the nature of real time is given as well as ...
Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling
In this paper, we focus on the semi-partitioned scheduling of sporadic tasks with constrained deadlines and identical processors. We study two cases of semi-partitioning: (i) the case where the worst case execution time (WCET) of a job can be portioned, ...
The Global Limited Preemptive Earliest Deadline First Feasibility of Sporadic Real-Time Tasks
AGILE '14: Proceedings of the 2014 Agile ConferenceThe feasibility of preemptive and non-preemptive scheduling has been well investigated on uniprocessor and multiprocessor platforms under both Fixed Priority Scheduling (FPS) and Earliest Deadline First (EDF) paradigms. While feasibility of limited ...
Comments