{"id":"https://openalex.org/W4254490331","doi":"https://doi.org/10.1109/mascots.2005.44","title":"Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performance Study","display_name":"Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performance Study","publication_year":2005,"publication_date":"2005-10-24","ids":{"openalex":"https://openalex.org/W4254490331","doi":"https://doi.org/10.1109/mascots.2005.44"},"language":"en","primary_location":{"id":"doi:10.1109/mascots.2005.44","doi":"https://doi.org/10.1109/mascots.2005.44","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mascots.2005.44","pdf_url":null,"source":{"id":"https://openalex.org/S4210229048","display_name":"Proceedings - International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","issn_l":"1526-7539","issn":["1526-7539","2375-0227"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045589459","display_name":"Mehdi Kargahi","orcid":"https://orcid.org/0000-0001-9300-4665","observed_orcids":["https://orcid.org/0000-0001-9300-4665"]},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]},{"id":"https://openalex.org/I4210146419","display_name":"Institute for Research in Fundamental Sciences","ror":"https://ror.org/04xreqs31","country_code":"IR","type":"facility","lineage":["https://openalex.org/I4210146419"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"M. Kargahi","raw_affiliation_strings":["School of Computer Science, IPM and Department of Computer Engineering, Sharif University of Technology, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, IPM and Department of Computer Engineering, Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467","https://openalex.org/I4210146419"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089228487","display_name":"Ali Movaghar","orcid":"https://orcid.org/0000-0002-6803-6750","observed_orcids":["https://orcid.org/0000-0002-6803-6750","https://orcid.org/0009-0000-2132-7764"]},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"A. Movaghar","raw_affiliation_strings":["Department of Computer Engineering, Sharif University of Technology, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.9904,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.94413408,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"201","last_page":"210"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.5493000149726868,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.5493000149726868,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.4406999945640564,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.0026000000070780516,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/non-preemptive-scheduling","display_name":"non-preemptive scheduling","score":0.8659999966621399},{"id":"https://openalex.org/keywords/earliest-deadline-first","display_name":"earliest deadline first","score":0.9869999885559082},{"id":"https://openalex.org/keywords/soft-real-time-systems","display_name":"soft real-time systems","score":0.9919999837875366},{"id":"https://openalex.org/keywords/single-server-queue","display_name":"single-server queue","score":0.9309999942779541},{"id":"https://openalex.org/keywords/transient-faults","display_name":"transient faults","score":0.7490000128746033},{"id":"https://openalex.org/keywords/deadline-miss-probability","display_name":"deadline miss probability","score":0.8169999718666077},{"id":"https://openalex.org/keywords/loss-probability","display_name":"loss probability","score":0.7139999866485596},{"id":"https://openalex.org/keywords/markovian-approximation","display_name":"Markov approximation","score":0.7799999713897705},{"id":"https://openalex.org/keywords/poisson-arrivals","display_name":"Poisson arrivals","score":0.7689999938011169}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7822550535202026},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6528943777084351},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.649273157119751},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.6119328737258911},{"id":"https://openalex.org/C2780799671","wikidata":"https://www.wikidata.org/wiki/Q17087362","display_name":"Transient (computer programming)","level":2,"score":0.527921199798584},{"id":"https://openalex.org/C100906024","wikidata":"https://www.wikidata.org/wiki/Q205692","display_name":"Poisson distribution","level":2,"score":0.4898826479911804},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.4733196198940277},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.45769721269607544},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.43044450879096985},{"id":"https://openalex.org/C192163390","wikidata":"https://www.wikidata.org/wiki/Q612061","display_name":"Markovian arrival process","level":3,"score":0.4297291934490204},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.41326141357421875},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3902988135814667},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.3240465521812439},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3189181685447693},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.26349908113479614},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.22009727358818054},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16807958483695984},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.11252474784851074},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10040444135665894},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mascots.2005.44","doi":"https://doi.org/10.1109/mascots.2005.44","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mascots.2005.44","pdf_url":null,"source":{"id":"https://openalex.org/S4210229048","display_name":"Proceedings - International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","issn_l":"1526-7539","issn":["1526-7539","2375-0227"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1242050445","https://openalex.org/W1483741998","https://openalex.org/W1569029889","https://openalex.org/W1595529246","https://openalex.org/W1600850084","https://openalex.org/W1853358807","https://openalex.org/W1922801252","https://openalex.org/W1985418297","https://openalex.org/W1985578743","https://openalex.org/W2015448379","https://openalex.org/W2025585405","https://openalex.org/W2026691835","https://openalex.org/W2036645045","https://openalex.org/W2064815339","https://openalex.org/W2068171717","https://openalex.org/W2072906481","https://openalex.org/W2076939426","https://openalex.org/W2102166244","https://openalex.org/W2109488193","https://openalex.org/W2110041740","https://openalex.org/W2113212182","https://openalex.org/W2155248253","https://openalex.org/W2243549378","https://openalex.org/W2319370155","https://openalex.org/W2331476099","https://openalex.org/W3015465031","https://openalex.org/W4243863555","https://openalex.org/W4254812284"],"related_works":["https://openalex.org/W3155284287","https://openalex.org/W2278352900","https://openalex.org/W7097072261","https://openalex.org/W2135102218","https://openalex.org/W2300386362","https://openalex.org/W2309055765","https://openalex.org/W3128199534","https://openalex.org/W2015757338","https://openalex.org/W1985418297","https://openalex.org/W2242400273"],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"an":[3,31],"analytical":[4],"method":[5],"for":[6],"approximating":[7],"the":[8,24,52,65,79,98,105,114,119,126,153],"performance":[9,74],"of":[10,54,61],"a":[11,17,44,94],"soft":[12],"real-time":[13],"system":[14,90,115,127],"modeled":[15],"by":[16,93,124],"single-server":[18],"queue.":[19],"The":[20,72,89,132],"service":[21,55],"discipline":[22],"in":[23,64,97,113,118],"queue":[25],"is":[26,30,78,91,116,122],"earliest-deadline-first":[27],"(EDF),":[28],"which":[29,121],"optimal":[32],"scheduling":[33],"policy.":[34],"Real-time":[35],"jobs":[36,48,112],"with":[37],"exponentially":[38],"distributed":[39],"deadlines":[40,50],"arrive":[41],"according":[42],"to":[43,76,83],"Poisson":[45],"process.":[46],"All":[47],"have":[49],"until":[51],"end":[53],"and":[56,147],"are":[57,67,110,156],"served":[58],"non-preemptively.":[59],"Occurrences":[60],"transient":[62,87],"faults":[63],"server":[66],"also":[68],"taken":[69],"into":[70,128],"account.":[71],"important":[73],"measure":[75],"calculate":[77],"loss":[80,106],"probability":[81],"due":[82],"deadline":[84],"misses":[85],"and/or":[86],"faults.":[88],"approximated":[92],"Markovian":[95,142],"model":[96,134],"long":[99],"run.":[100],"A":[101],"key":[102],"parameter,":[103],"namely,":[104],"rate":[107],"when":[108],"there":[109],"n":[111],"used":[117],"model,":[120],"estimated":[123],"partitioning":[125],"two":[129],"virtual":[130],"subsystems.":[131],"resulting":[133],"can":[135],"then":[136],"be":[137],"solved":[138],"analytically":[139],"using":[140],"standard":[141],"solution":[143],"techniques.":[144],"Comparing":[145],"numerical":[146],"simulation":[148],"results,":[149],"we":[150],"find":[151],"that":[152],"existing":[154],"errors":[155],"relatively":[157],"small.":[158]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":6}],"updated_date":"2026-10-29T09:56:32.521200","created_date":"2022-05-12T00:00:00"}