Efficient Exact Response Time Analysis for Fixed Priority Scheduling in Lowest Priority First-Based Feasibility Tests

The exact response time analysis for fixed priority scheduling (FPS) in the lowest priority first-based feasibility tests is commonly required as a part of system design tools. This letter proposes an efficient method for this, which we named incremental lower bound (ILB) calculation method. Compare...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE embedded systems letters Jg. 13; H. 3; S. 69 - 72
1. Verfasser: Kim, Saehwa
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Piscataway IEEE 01.09.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Dynamic scheduling
Feasibility
Job shop scheduling
Lower bounds
Mathematical analysis
Mathematical model
Multiprocessing/multiprogramming/multitasking
Priority scheduling
real-time and embedded systems
Response time
Run time (computers)
scheduling
Systems design
Task analysis
Time factors
worst-case response time (WCRT) analysis
ISSN:1943-0663, 1943-0671
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract The exact response time analysis for fixed priority scheduling (FPS) in the lowest priority first-based feasibility tests is commonly required as a part of system design tools. This letter proposes an efficient method for this, which we named incremental lower bound (ILB) calculation method. Compared to the best algorithm that has been known so far, which is the incremental calculation method, ILB reduces the feasibility test iterations/run times by more than 38% and 20% regardless of varying utilization and the number of tasks in task sets.
AbstractList The exact response time analysis for fixed priority scheduling (FPS) in the lowest priority first-based feasibility tests is commonly required as a part of system design tools. This letter proposes an efficient method for this, which we named incremental lower bound (ILB) calculation method. Compared to the best algorithm that has been known so far, which is the incremental calculation method, ILB reduces the feasibility test iterations/run times by more than 38% and 20% regardless of varying utilization and the number of tasks in task sets.
Author Kim, Saehwa
Author_xml – sequence: 1
  givenname: Saehwa
  orcidid: 0000-0003-3303-4218
  surname: Kim
  fullname: Kim, Saehwa
  email: ksaehwa@hufs.ac.kr
  organization: Department of Information and Communications Engineering, Hankuk University of Foreign Studies, Yongin-si, South Korea
BookMark eNp9kNFLIzEQh8PhwXme7we-BO5562TTJLuPKq0KBUV7z0uandyNrJuapGj_e1MqCj44LxmS3zdhvp_sYAwjMvZbwEQIaE8Xs_tJDTVMJNRKA3xjh6Kdygq0EQfvvZY_2HFKD1BKTY2S6pBtZt6TIxwzn71Yl_kdpnUYE_IlPSI_G-2wTZS4D5HP6QV7fhspRMpbfu_-Y78ZaPzHaeSL8Iwpf7zOKaZcndtUkDnaRCsadvfLkkq_2Hdvh4THb-cR-zufLS-uqsXN5fXF2aJydStypUFKoxU633utlNcGQaz6ujcgm5WR1ntnLBqAFl1jvLZW-6ZxvZ3axjVWHrE_-7nrGJ425efuIWxi2Sl1xZOqpVEAJaX3KRdDShF95yjbTGHM0dLQCeh2lrtiudtZ7t4sFxA-getIjzZuv0JO9ggh4nu8rUGosuwrs72K6w
CODEN ESLMAP
CitedBy_id crossref_primary_10_3390_app13031532
Cites_doi 10.1109/TPDS.2016.2528978
10.1109/TC.2018.2878835
10.1145/3320271
10.1007/s11241-009-9071-z
10.1016/j.jss.2006.03.023
10.1109/TC.2017.2777826
10.1109/TC.2008.66
10.1007/s11241-005-0507-9
10.1093/comjnl/29.5.390
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/LES.2020.3025600
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE/IET Electronic Library
CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1943-0671
EndPage 72
ExternalDocumentID 10_1109_LES_2020_3025600
9201503
Genre orig-research
GrantInformation_xml – fundername: Basic Science Research Program through the National Research Foundation of Korea
  funderid: 10.13039/501100003725
– fundername: Hankuk University of Foreign Studies Research Fund
  funderid: 10.13039/501100002486
– fundername: Ministry of Science, ICT, and Future Planning
  grantid: 2017R1A2B1001824
  funderid: 10.13039/501100003621
GroupedDBID 0R~
29G
4.4
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACIWK
AETIX
AGQYO
AGSQL
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
F5P
HZ~
IFIPE
IPLJI
JAVBF
M43
O9-
OCL
PQQKQ
RIA
RIE
RNS
AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c291t-6033765ecfdf655f67e01bd2d7038b73affc7ae7009ec87f6aa6f88cda4a8c8a3
IEDL.DBID RIE
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000690438000003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1943-0663
IngestDate Sun Nov 09 06:37:32 EST 2025
Sat Nov 29 03:34:57 EST 2025
Tue Nov 18 21:51:47 EST 2025
Wed Aug 27 02:28:00 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c291t-6033765ecfdf655f67e01bd2d7038b73affc7ae7009ec87f6aa6f88cda4a8c8a3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-3303-4218
PQID 2565237500
PQPubID 75726
PageCount 4
ParticipantIDs crossref_citationtrail_10_1109_LES_2020_3025600
ieee_primary_9201503
proquest_journals_2565237500
crossref_primary_10_1109_LES_2020_3025600
PublicationCentury 2000
PublicationDate 2021-Sept.
2021-9-00
20210901
PublicationDateYYYYMMDD 2021-09-01
PublicationDate_xml – month: 09
  year: 2021
  text: 2021-Sept.
PublicationDecade 2020
PublicationPlace Piscataway
PublicationPlace_xml – name: Piscataway
PublicationTitle IEEE embedded systems letters
PublicationTitleAbbrev LES
PublicationYear 2021
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref8
ref7
ref9
ref4
ref3
ref6
ref5
ref2
ref1
References_xml – ident: ref3
  doi: 10.1109/TPDS.2016.2528978
– ident: ref4
  doi: 10.1109/TC.2018.2878835
– ident: ref2
  doi: 10.1145/3320271
– ident: ref6
  doi: 10.1007/s11241-009-9071-z
– ident: ref5
  doi: 10.1016/j.jss.2006.03.023
– ident: ref8
  doi: 10.1109/TC.2017.2777826
– ident: ref1
  doi: 10.1109/TC.2008.66
– ident: ref9
  doi: 10.1007/s11241-005-0507-9
– ident: ref7
  doi: 10.1093/comjnl/29.5.390
SSID ssj0000547535
Score 2.202186
Snippet The exact response time analysis for fixed priority scheduling (FPS) in the lowest priority first-based feasibility tests is commonly required as a part of...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 69
SubjectTerms Algorithms
Dynamic scheduling
Feasibility
Job shop scheduling
Lower bounds
Mathematical analysis
Mathematical model
Multiprocessing/multiprogramming/multitasking
Priority scheduling
real-time and embedded systems
Response time
Run time (computers)
scheduling
Systems design
Task analysis
Time factors
worst-case response time (WCRT) analysis
Title Efficient Exact Response Time Analysis for Fixed Priority Scheduling in Lowest Priority First-Based Feasibility Tests
URI https://ieeexplore.ieee.org/document/9201503
https://www.proquest.com/docview/2565237500
Volume 13
WOSCitedRecordID wos000690438000003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE/IET Electronic Library
  customDbUrl:
  eissn: 1943-0671
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000547535
  issn: 1943-0663
  databaseCode: RIE
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB6seNCDryrWF3vwIhib5rG7Oaq0eBARrdBb2OzOSkBa6UP03zu7SauiCN4CmYGQL5n5ZucFcBLqSKYabWAUj4MkVjxwyaSA8FcWBeeJMX7ZhLi9lYNBdrcEZ4teGET0xWd47i59Lt-M9MwdlbWzyMXncQMaQvCqV2txnkLUg5h36pPIiV-QF8-zkmHWvuk-UCwYUYha-fhvXsivVflhi72D6W3879E2Yb0mkuyiQn4LlnC4DWtfxgs2Ydb18yFIkXXflJ6y-6ogFplr_GDzeSSMeCvrlW9o2N24HLltduyBsDSuSP2JlUN2M3IDFT7v9krijMElOUDDiEPWFbbvrE9Skx147HX7V9dBvWYh0FHWmQY8jMnKpKitsTxNLRcYdgoTGTIGshCxslYLhYLYGGopLFeKWym1UYmSWqp4F5aHoyHuASP6J4sCRWE1JkTFsrCIbJipjs1sJ06xBe35a891PYPcrcJ4zn0sEmY5AZU7oPIaqBacLjReqvkbf8g2HTALuRqTFhzOkc3rH3SSkwKF4ESXwv3ftQ5gNXLlK76c7BCWp-MZHsGKfp2Wk_Gx__Y-ANik19E
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB60CurBt1ife_AiGJvmsdkcVVoUaxGt4C1sdmclIK30Ifrvnd2mVVEEb4HsQMiX7Hyz8_gAjnwViFih8bTkoReFkns2meQR_tJgwnmktRObSNpt8fiY3s7AybQXBhFd8Rme2kuXy9c9NbJHZbU0sPF5OAtzVjmr7NaanqgQ-SDuHbs0cuQk8sJJXtJPa63GPUWDAQWpYy__zQ85YZUfu7FzMc2V_z3cKiyXVJKdjbFfgxnsrsPSlwGDGzBquAkRZMgab1IN2d24JBaZbf1gk4kkjJgraxZvqNltv-hZPTt2T2hqW6b-xIoua_XsSIXPu82CWKN3Ti5QM2KRZY3tO-vQqsEmPDQbnYtLrxRa8FSQ1oce90PaZ2JURhsex4Yn6NdzHWjaDkSehNIYlUhMiI-hEonhUnIjhNIykkIJGW5Bpdvr4jYwIoAizzHJjcKIyFjq54HxU1k3qamHMVahNnntmSqnkFsxjOfMRSN-mhFQmQUqK4GqwvHU4mU8geOPtRsWmOm6EpMq7E2QzcpfdJCRAQXhRJj8nd-tDmHhsnPTylpX7etdWAxsMYsrLtuDyrA_wn2YV6_DYtA_cN_hBz1r2xo
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+Exact+Response+Time+Analysis+for+Fixed+Priority+Scheduling+in+Lowest+Priority+First-Based+Feasibility+Tests&rft.jtitle=IEEE+embedded+systems+letters&rft.au=Kim%2C+Saehwa&rft.date=2021-09-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=1943-0663&rft.eissn=1943-0671&rft.volume=13&rft.issue=3&rft.spage=69&rft_id=info:doi/10.1109%2FLES.2020.3025600&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1943-0663&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1943-0663&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1943-0663&client=summon