<?xml version="1.0" encoding="UTF-8"?>
<doi_batch version="4.3.0" xmlns="http://www.crossref.org/doi_resources_schema/4.3.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.crossref.org/doi_resources_schema/4.3.0 http://www.crossref.org/schema/deposit/doi_resources4.3.0.xsd">
<head>
<doi_batch_id>409dcc53-afc0-4570-9ef1-566b23e83da5</doi_batch_id>
<depositor>
<name>beie</name>
<email_address>director@blueeyesintelligence.org</email_address>
</depositor>
</head>
<body>
<doi_citations>
<doi>10.35940/ijrte.A5900.0510121</doi>
<citation_list><citation key="ref0"><doi>10.1109/TC.2007.70787</doi><unstructured_citation>Patricia Balbastre, Ismael Ripoll, Alfons Crespo &quot;Minimum deadline calculation for periodic real-time tasks in dynamic priority systems&quot;, IEEE Transactions on Computers 2007 IEEE.</unstructured_citation></citation><citation key="ref1"><unstructured_citation>Kevin Jeffay, David Becker, David Bennett, Shaun Bharrat, Timothy Gramling, Mark Housel &quot;The Design, Implementation and Use of a Sporadic Tasking Model&quot;, 27599-3175 USA April 1994.</unstructured_citation></citation><citation key="ref2"><doi>10.1145/321738.321743</doi><unstructured_citation>C. L. Liu, James W. Layland, &quot;Scheduling Algorithms for Multiprogramming in a Hard- Real-Time Environment&quot;, Journal of the Association for Computing Machinery, Vo|, 20, No. 1, January 1973, pp. 46-61</unstructured_citation></citation><citation key="ref3"><doi>10.1109/ICCDA.2010.5541363</doi><unstructured_citation>Fengxiang Zhang, Alan Burns, Sanjoy Baruah &quot;Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling&quot;, Springer Science Business Media, LLC 2011</unstructured_citation></citation><citation key="ref4"><doi>10.1109/DSN.2004.1311953</doi><unstructured_citation>Mehdi Kargahi, Ali Movaghar&quot;A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy&quot;, Proceedings of the 2004 International Conference on Dependable Systems and Networks (DSN'04) 0-7695-2052-9/04 © 2004 IEEE.</unstructured_citation></citation><citation key="ref5"><doi>10.1109/CCECE.2007.378</doi><unstructured_citation>Andrew Morton and Wayne M. Loucks &quot;EDF Feasibility Analysis of Accelerated Tasks&quot;, 0840-7789/07©2007 IEEE</unstructured_citation></citation><citation key="ref6"><doi>10.1109/ETFA.2011.6059008</doi><unstructured_citation>Michael Short Electronics &amp; Control Group Teesside University, Middlesborough, UK &quot;Improved schedulability analysis of implicit deadline tasks under limited preemption EDF scheduling&quot; IEEE ETFA 2011.</unstructured_citation></citation><citation key="ref7"><doi>10.1109/ICCDA.2010.5541363</doi><unstructured_citation>Fengxiang Zhang • Alan Burns • Sanjoy Baruah &quot;Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling&quot;, Springer Science Business Media, LLC 2011.</unstructured_citation></citation><citation key="ref8"><unstructured_citation>J. Lehoczky, L. Sha, and Y. Ding, &quot;The rate monotonic scheduling algorithm: Exact characterization and average case behavior&quot;, in IEEE Real-Time Systems Symposium, 1989, pp. 166-171.</unstructured_citation></citation><citation key="ref9"><doi>10.1145/633625.52418</doi><unstructured_citation>Sprunt B, Kirk D, and L.Sha &quot;Priority Driven Preemptive I/O Controllers for Real Time Systems&quot;, Proceedings of 15th International Symposium on Computer Architecture (1998), 152-159.</unstructured_citation></citation><citation key="ref10"><unstructured_citation>Stronsnider J K, Marchok T and J Lehoczky &quot;Advanced Real Time Scheduling using the IEEE 802.5 Token Ring&quot;, Proceedings of the IEEE Real Time Systems Symposium (1988), 42-52.</unstructured_citation></citation><citation key="ref11"><doi>10.1023/B:TIME.0000048932.30002.d9</doi><unstructured_citation>Giorgio C. Buttazzo &quot;Rate Monotonic vs. EDF: Judgment Day&quot;, 2005 Springer Science Business Media, Inc. Manufactured in the Netherlands.</unstructured_citation></citation><citation key="ref12"><unstructured_citation>Lehoczky, J. P., Sha, L., and Ding, Y. &quot;The rate-monotonic scheduling algorithm: exact characterization and average case behavior&quot;, Proceedings of the IEEE Real-Time Systems Symposium 1989, pp. 166-171.</unstructured_citation></citation><citation key="ref13"><doi>10.1016/j.cja.2014.05.003</doi><unstructured_citation>Chen Yao, Li Qiao, Li Zheng, Xiong Huagang &quot;Efficient schedulability analysis for mixed-criticality systems under deadline-based scheduling&quot;, Chinese Journal of Aeronautics 2014 Ref CJA 305.</unstructured_citation></citation><citation key="ref14"><doi>10.1016/S1474-6670(17)51264-1</doi><unstructured_citation>K. J. Ransom, C. D. Marlin and Wei Zhao, &quot;An integrated environment for the development and analysis of hard real-time systems&quot;, Design of Real-Time Systems, Copyright © IFAC Real Time Programming 1991.</unstructured_citation></citation></citation_list>
</doi_citations>
</body>
</doi_batch>
