{"id":"https://openalex.org/W1879402272","doi":"https://doi.org/10.1137/s0097539792236882","title":"$\\text{D}^{\\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems","display_name":"$\\text{D}^{\\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems","publication_year":1995,"publication_date":"1995-04-01","ids":{"openalex":"https://openalex.org/W1879402272","doi":"https://doi.org/10.1137/s0097539792236882","mag":"1879402272"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792236882","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792236882","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","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/A5042560079","display_name":"G. Koren","orcid":null},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Gilad Koren","raw_affiliation_strings":["Bar Ilan University ,"],"affiliations":[{"raw_affiliation_string":"Bar Ilan University ,","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055576104","display_name":"Dennis Shasha","orcid":"https://orcid.org/0000-0002-7036-3312"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dennis Shasha","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042560079"],"corresponding_institution_ids":["https://openalex.org/I13955877"],"apc_list":null,"apc_paid":null,"fwci":4.8584,"has_fulltext":false,"cited_by_count":189,"citation_normalized_percentile":{"value":0.94782876,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"24","issue":"2","first_page":"318","last_page":"339"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9983000159263611,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9926999807357788,"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/uniprocessor-system","display_name":"Uniprocessor system","score":0.9591384530067444},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7159042954444885},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6722851991653442},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6347120404243469},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.51123046875},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.4938984513282776},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.43192464113235474},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.4119337797164917},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.3572847545146942},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2967366576194763},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.28556299209594727},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.28286394476890564},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2772596478462219},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20487985014915466},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.1934751570224762},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08422651886940002},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.08052420616149902}],"concepts":[{"id":"https://openalex.org/C79189994","wikidata":"https://www.wikidata.org/wiki/Q3488021","display_name":"Uniprocessor system","level":3,"score":0.9591384530067444},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7159042954444885},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6722851991653442},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6347120404243469},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.51123046875},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.4938984513282776},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.43192464113235474},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.4119337797164917},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3572847545146942},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2967366576194763},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.28556299209594727},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.28286394476890564},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2772596478462219},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20487985014915466},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.1934751570224762},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08422651886940002},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.08052420616149902},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539792236882","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792236882","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2005239962","https://openalex.org/W2011670396","https://openalex.org/W2041645394","https://openalex.org/W2044260124","https://openalex.org/W3013976155","https://openalex.org/W3163474831"],"related_works":["https://openalex.org/W1996475154","https://openalex.org/W2171342002","https://openalex.org/W1992519595","https://openalex.org/W1840932120","https://openalex.org/W1992741870","https://openalex.org/W1651746398","https://openalex.org/W2144012470","https://openalex.org/W2766687947","https://openalex.org/W2162284428","https://openalex.org/W2044260124"],"abstract_inverted_index":{"Consider":[0],"a":[1,9,37,54,61],"real-time":[2],"system":[3,55,112],"in":[4,138],"which":[5,64],"every":[6],"task":[7,38],"has":[8,33],"value":[10,47],"that":[11,43,78,102,141],"it":[12,16,40,142],"obtains":[13],"only":[14],"if":[15],"completes":[17],"by":[18,49],"its":[19],"deadline.":[20],"The":[21],"problem":[22],"is":[23,41,56,113,136],"to":[24,119,150],"design":[25],"an":[26,126,151],"on-line":[27,128],"scheduling":[28,129],"algorithm":[29,83,130],"(i.e.,":[30,58],"the":[31,45,50,79,88,111,139,144],"scheduler":[32],"no":[34],"knowledge":[35],"of":[36,87],"until":[39],"released)":[42],"maximizes":[44],"guaranteed":[46],"obtained":[48],"system.":[51],"When":[52],"such":[53],"underloaded":[57],"there":[59],"exists":[60],"schedule":[62],"for":[63,131],"all":[65],"tasks":[66],"meet":[67],"their":[68],"deadlines),":[69],"Dertouzos":[70],"[Proceedings":[71],"IFIF":[72],"Congress,":[73],"1974,":[74],"pp.":[75],"807\u20138131":[76],"showed":[77,101],"earliest":[80,103],"deadline":[81,104],"first":[82,105],"will":[84],"achieve":[85],"100%":[86],"possible":[89,148],"value.":[90],"Locke":[91],"[Ph.D.":[92],"thesis,":[93],"Computer":[94],"Science":[95],"Dept.,":[96],"Carnegie-Mellon":[97],"Univ.,":[98],"Pittsburgh,":[99],"PA]":[100],"performs":[106],"very":[107],"badly,":[108],"however,":[109],"when":[110],"overloaded,":[114],"and":[115],"he":[116],"proposed":[117],"heuristics":[118],"deal":[120],"with":[121],"overload.":[122],"This":[123],"paper":[124],"presents":[125],"optimal":[127,137],"overloaded":[132],"uniprocessor":[133],"systems.":[134],"It":[135],"sense":[140],"gives":[143],"best":[145],"competitive":[146],"ratio":[147],"relative":[149],"off-line":[152],"scheduler.":[153]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":8}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}