A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
An implementation of the earliest deadline first algorithm in Linux
2009
Proceedings of the 2009 ACM symposium on Applied Computing - SAC '09
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
doi:10.1145/1529282.1529723
dblp:conf/sac/FaggioliTC09
fatcat:ltirp3wahfcvbhkgovcjpu4jsm