A Note on the EDF Preemption Behavior in "Rate Monotonic Versus EDF: Judgment Day"

In G. C. Buttazzo, Real-Time Syst., vol. 29, no. 1, pp. 5-26, 2005, the author empirically compared earliest deadline first (EDF) and rate monotonic (RM) scheduling algorithms and made a few EDF preemption behavior observations based on data obtained from the first 1000 time units of scheduling acti...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE embedded systems letters 2015-09, Vol.7 (3), p.89-91
Hauptverfasser: Brun, Adrien, Chunhui Guo, Shangping Ren
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 91
container_issue 3
container_start_page 89
container_title IEEE embedded systems letters
container_volume 7
creator Brun, Adrien
Chunhui Guo
Shangping Ren
description In G. C. Buttazzo, Real-Time Syst., vol. 29, no. 1, pp. 5-26, 2005, the author empirically compared earliest deadline first (EDF) and rate monotonic (RM) scheduling algorithms and made a few EDF preemption behavior observations based on data obtained from the first 1000 time units of scheduling activities. However, based on test settings given in (G. C. Buttazzo, Real-Time Syst., vol. 29, no. 1, pp. 5-26, 2005), the first 1000 time units occupies only a small percentage of the entire task set's hyper-period. We extend EDF preemption behavior study by extending scheduling activities from the first small percentage of a hyper-period of a given task to the entire hyper-period. The extended experiments indicate that the number of preemptions occurred at the beginning of a task set's hyper-period does not necessarily represent the trend for the entire hyper-period. Hence, comparisons and conclusions made based on a small percentage of a scheduling interval over a task set's hyper-period may not be accurate. Second, the total number of preemptions within a task set's hyper-period does not decrease when the task set total utilization increases which is different from the observation obtained in (G. C. Buttazzo, Real-Time Syst., vol. 29, no. 1, pp. 5-26, 2005). We also investigate the impact of execution time differences among tasks on the preemption behavior.
doi_str_mv 10.1109/LES.2015.2452226
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_LES_2015_2452226</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7147791</ieee_id><sourcerecordid>3796298851</sourcerecordid><originalsourceid>FETCH-LOGICAL-c324t-8a5d609442326ffe29234aaac38c77297cdb651dedcb5b3582e838721c4b76253</originalsourceid><addsrcrecordid>eNpdkElPwzAQhSMEEhX0jsTFKhcuKV7jhFvpwqKyqCxXy3EmNFUbFztB6r_HVasemMuMRt-b5UXRBcF9QnB2Mx2_9ykmok-5oJQmR1GHZJzFOJHk-FAn7DTqer_AIQSXgolONBugF9sAsjVq5oDGowl6cwCrdVOF1h3M9W9lHapq1JvpwD3b2ja2rgz6Audbv1Xcoqe2-F5B3aCR3vTOo5NSLz109_ks-pyMP4YP8fT1_nE4mMaGUd7EqRZFgjPOKaNJWQLNKONaa8NSIyXNpCnyRJACCpOLnImUQspSSYnhuUyoYGfR9W7u2tmfFnyjVpU3sFzqGmzrFQkf8gwLKgN69Q9d2NbV4bpA4bA4TUgWKLyjjLPeOyjV2lUr7TaKYLX1WQWf1dZntfc5SC53kgoADrgkXMqMsD8r4HTv</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1709238619</pqid></control><display><type>article</type><title>A Note on the EDF Preemption Behavior in "Rate Monotonic Versus EDF: Judgment Day"</title><source>IEEE Electronic Library (IEL)</source><creator>Brun, Adrien ; Chunhui Guo ; Shangping Ren</creator><creatorcontrib>Brun, Adrien ; Chunhui Guo ; Shangping Ren</creatorcontrib><description>In G. C. Buttazzo, Real-Time Syst., vol. 29, no. 1, pp. 5-26, 2005, the author empirically compared earliest deadline first (EDF) and rate monotonic (RM) scheduling algorithms and made a few EDF preemption behavior observations based on data obtained from the first 1000 time units of scheduling activities. However, based on test settings given in (G. C. Buttazzo, Real-Time Syst., vol. 29, no. 1, pp. 5-26, 2005), the first 1000 time units occupies only a small percentage of the entire task set's hyper-period. We extend EDF preemption behavior study by extending scheduling activities from the first small percentage of a hyper-period of a given task to the entire hyper-period. The extended experiments indicate that the number of preemptions occurred at the beginning of a task set's hyper-period does not necessarily represent the trend for the entire hyper-period. Hence, comparisons and conclusions made based on a small percentage of a scheduling interval over a task set's hyper-period may not be accurate. Second, the total number of preemptions within a task set's hyper-period does not decrease when the task set total utilization increases which is different from the observation obtained in (G. C. Buttazzo, Real-Time Syst., vol. 29, no. 1, pp. 5-26, 2005). We also investigate the impact of execution time differences among tasks on the preemption behavior.</description><identifier>ISSN: 1943-0663</identifier><identifier>EISSN: 1943-0671</identifier><identifier>DOI: 10.1109/LES.2015.2452226</identifier><identifier>CODEN: ESLMAP</identifier><language>eng</language><publisher>Piscataway: IEEE</publisher><subject>Algorithms ; Computer science ; Concrete ; Earliest deadline first ; Electronic mail ; Empirical analysis ; Engineering profession ; Indexes ; Intervals ; Judgments ; Preemption ; Real time ; real-time scheduling ; Real-time systems ; Scheduling ; Task analysis ; Tasks ; Trends ; Utilization</subject><ispartof>IEEE embedded systems letters, 2015-09, Vol.7 (3), p.89-91</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2015</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c324t-8a5d609442326ffe29234aaac38c77297cdb651dedcb5b3582e838721c4b76253</citedby><cites>FETCH-LOGICAL-c324t-8a5d609442326ffe29234aaac38c77297cdb651dedcb5b3582e838721c4b76253</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7147791$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7147791$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Brun, Adrien</creatorcontrib><creatorcontrib>Chunhui Guo</creatorcontrib><creatorcontrib>Shangping Ren</creatorcontrib><title>A Note on the EDF Preemption Behavior in "Rate Monotonic Versus EDF: Judgment Day"</title><title>IEEE embedded systems letters</title><addtitle>LES</addtitle><description>In G. C. Buttazzo, Real-Time Syst., vol. 29, no. 1, pp. 5-26, 2005, the author empirically compared earliest deadline first (EDF) and rate monotonic (RM) scheduling algorithms and made a few EDF preemption behavior observations based on data obtained from the first 1000 time units of scheduling activities. However, based on test settings given in (G. C. Buttazzo, Real-Time Syst., vol. 29, no. 1, pp. 5-26, 2005), the first 1000 time units occupies only a small percentage of the entire task set's hyper-period. We extend EDF preemption behavior study by extending scheduling activities from the first small percentage of a hyper-period of a given task to the entire hyper-period. The extended experiments indicate that the number of preemptions occurred at the beginning of a task set's hyper-period does not necessarily represent the trend for the entire hyper-period. Hence, comparisons and conclusions made based on a small percentage of a scheduling interval over a task set's hyper-period may not be accurate. Second, the total number of preemptions within a task set's hyper-period does not decrease when the task set total utilization increases which is different from the observation obtained in (G. C. Buttazzo, Real-Time Syst., vol. 29, no. 1, pp. 5-26, 2005). We also investigate the impact of execution time differences among tasks on the preemption behavior.</description><subject>Algorithms</subject><subject>Computer science</subject><subject>Concrete</subject><subject>Earliest deadline first</subject><subject>Electronic mail</subject><subject>Empirical analysis</subject><subject>Engineering profession</subject><subject>Indexes</subject><subject>Intervals</subject><subject>Judgments</subject><subject>Preemption</subject><subject>Real time</subject><subject>real-time scheduling</subject><subject>Real-time systems</subject><subject>Scheduling</subject><subject>Task analysis</subject><subject>Tasks</subject><subject>Trends</subject><subject>Utilization</subject><issn>1943-0663</issn><issn>1943-0671</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkElPwzAQhSMEEhX0jsTFKhcuKV7jhFvpwqKyqCxXy3EmNFUbFztB6r_HVasemMuMRt-b5UXRBcF9QnB2Mx2_9ykmok-5oJQmR1GHZJzFOJHk-FAn7DTqer_AIQSXgolONBugF9sAsjVq5oDGowl6cwCrdVOF1h3M9W9lHapq1JvpwD3b2ja2rgz6Audbv1Xcoqe2-F5B3aCR3vTOo5NSLz109_ks-pyMP4YP8fT1_nE4mMaGUd7EqRZFgjPOKaNJWQLNKONaa8NSIyXNpCnyRJACCpOLnImUQspSSYnhuUyoYGfR9W7u2tmfFnyjVpU3sFzqGmzrFQkf8gwLKgN69Q9d2NbV4bpA4bA4TUgWKLyjjLPeOyjV2lUr7TaKYLX1WQWf1dZntfc5SC53kgoADrgkXMqMsD8r4HTv</recordid><startdate>201509</startdate><enddate>201509</enddate><creator>Brun, Adrien</creator><creator>Chunhui Guo</creator><creator>Shangping Ren</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>201509</creationdate><title>A Note on the EDF Preemption Behavior in "Rate Monotonic Versus EDF: Judgment Day"</title><author>Brun, Adrien ; Chunhui Guo ; Shangping Ren</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c324t-8a5d609442326ffe29234aaac38c77297cdb651dedcb5b3582e838721c4b76253</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Algorithms</topic><topic>Computer science</topic><topic>Concrete</topic><topic>Earliest deadline first</topic><topic>Electronic mail</topic><topic>Empirical analysis</topic><topic>Engineering profession</topic><topic>Indexes</topic><topic>Intervals</topic><topic>Judgments</topic><topic>Preemption</topic><topic>Real time</topic><topic>real-time scheduling</topic><topic>Real-time systems</topic><topic>Scheduling</topic><topic>Task analysis</topic><topic>Tasks</topic><topic>Trends</topic><topic>Utilization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Brun, Adrien</creatorcontrib><creatorcontrib>Chunhui Guo</creatorcontrib><creatorcontrib>Shangping Ren</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005–Present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE embedded systems letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Brun, Adrien</au><au>Chunhui Guo</au><au>Shangping Ren</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Note on the EDF Preemption Behavior in "Rate Monotonic Versus EDF: Judgment Day"</atitle><jtitle>IEEE embedded systems letters</jtitle><stitle>LES</stitle><date>2015-09</date><risdate>2015</risdate><volume>7</volume><issue>3</issue><spage>89</spage><epage>91</epage><pages>89-91</pages><issn>1943-0663</issn><eissn>1943-0671</eissn><coden>ESLMAP</coden><abstract>In G. C. Buttazzo, Real-Time Syst., vol. 29, no. 1, pp. 5-26, 2005, the author empirically compared earliest deadline first (EDF) and rate monotonic (RM) scheduling algorithms and made a few EDF preemption behavior observations based on data obtained from the first 1000 time units of scheduling activities. However, based on test settings given in (G. C. Buttazzo, Real-Time Syst., vol. 29, no. 1, pp. 5-26, 2005), the first 1000 time units occupies only a small percentage of the entire task set's hyper-period. We extend EDF preemption behavior study by extending scheduling activities from the first small percentage of a hyper-period of a given task to the entire hyper-period. The extended experiments indicate that the number of preemptions occurred at the beginning of a task set's hyper-period does not necessarily represent the trend for the entire hyper-period. Hence, comparisons and conclusions made based on a small percentage of a scheduling interval over a task set's hyper-period may not be accurate. Second, the total number of preemptions within a task set's hyper-period does not decrease when the task set total utilization increases which is different from the observation obtained in (G. C. Buttazzo, Real-Time Syst., vol. 29, no. 1, pp. 5-26, 2005). We also investigate the impact of execution time differences among tasks on the preemption behavior.</abstract><cop>Piscataway</cop><pub>IEEE</pub><doi>10.1109/LES.2015.2452226</doi><tpages>3</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1943-0663
ispartof IEEE embedded systems letters, 2015-09, Vol.7 (3), p.89-91
issn 1943-0663
1943-0671
language eng
recordid cdi_crossref_primary_10_1109_LES_2015_2452226
source IEEE Electronic Library (IEL)
subjects Algorithms
Computer science
Concrete
Earliest deadline first
Electronic mail
Empirical analysis
Engineering profession
Indexes
Intervals
Judgments
Preemption
Real time
real-time scheduling
Real-time systems
Scheduling
Task analysis
Tasks
Trends
Utilization
title A Note on the EDF Preemption Behavior in "Rate Monotonic Versus EDF: Judgment Day"
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T02%3A17%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Note%20on%20the%20EDF%20Preemption%20Behavior%20in%20%22Rate%20Monotonic%20Versus%20EDF:%20Judgment%20Day%22&rft.jtitle=IEEE%20embedded%20systems%20letters&rft.au=Brun,%20Adrien&rft.date=2015-09&rft.volume=7&rft.issue=3&rft.spage=89&rft.epage=91&rft.pages=89-91&rft.issn=1943-0663&rft.eissn=1943-0671&rft.coden=ESLMAP&rft_id=info:doi/10.1109/LES.2015.2452226&rft_dat=%3Cproquest_RIE%3E3796298851%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1709238619&rft_id=info:pmid/&rft_ieee_id=7147791&rfr_iscdi=true