{"id":"https://openalex.org/W2108627532","doi":"https://doi.org/10.1109/ipdps.2004.1303077","title":"Improved conditions for bounded tardiness under EPDF fair multiprocessor scheduling","display_name":"Improved conditions for bounded tardiness under EPDF fair multiprocessor scheduling","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W2108627532","doi":"https://doi.org/10.1109/ipdps.2004.1303077","mag":"2108627532"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2004.1303077","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1303077","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","raw_type":"proceedings-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/A5050081788","display_name":"UmaMaheswari C. Devi","orcid":"https://orcid.org/0009-0001-3146-4313"},"institutions":[{"id":"https://openalex.org/I87097829","display_name":"University of North Carolina at Asheville","ror":"https://ror.org/017c6at71","country_code":"US","type":"education","lineage":["https://openalex.org/I87097829"]},{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"U.C. Devi","raw_affiliation_strings":["Department of Computer Science, The University of North Carolina, Chapel Hill, NC","University of North Carolina at Asheville, Asheville, NC, US"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of North Carolina, Chapel Hill, NC","institution_ids":["https://openalex.org/I114027177"]},{"raw_affiliation_string":"University of North Carolina at Asheville, Asheville, NC, US","institution_ids":["https://openalex.org/I87097829"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114246496","display_name":"James H. Anderson","orcid":"https://orcid.org/0000-0001-7138-939X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J.H. Anderson","raw_affiliation_strings":["Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050081788"],"corresponding_institution_ids":["https://openalex.org/I114027177","https://openalex.org/I87097829"],"apc_list":null,"apc_paid":null,"fwci":2.905,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.90180532,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"119","last_page":"126"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9991999864578247,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9986000061035156,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9926999807357788,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tardiness","display_name":"Tardiness","score":0.9560021162033081},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.7163680195808411},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6708504557609558},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5981322526931763},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5963789820671082},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5936408042907715},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4887840449810028},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.4470073878765106},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.4406462609767914},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.418559730052948},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4114798903465271},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.395085871219635},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35823071002960205},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3452413082122803},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.3094276785850525},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.29693055152893066},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2697022557258606},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.23803919553756714},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.07950666546821594},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06834185123443604}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.9560021162033081},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.7163680195808411},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6708504557609558},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5981322526931763},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5963789820671082},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5936408042907715},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4887840449810028},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.4470073878765106},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4406462609767914},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.418559730052948},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4114798903465271},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.395085871219635},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35823071002960205},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3452413082122803},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.3094276785850525},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.29693055152893066},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2697022557258606},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.23803919553756714},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.07950666546821594},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06834185123443604},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/ipdps.2004.1303077","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1303077","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.118.849","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.849","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unc.edu/~anderson/papers/jcss07.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.64.9701","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.9701","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unc.edu/~anderson/papers/wpdrts-04.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.66.220","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.220","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unc.edu/~anderson/papers/wpdrts-04-full.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.76.2505","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.2505","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unc.edu/~anderson/papers/jcss07.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1805570991","https://openalex.org/W1911718429","https://openalex.org/W2012912569","https://openalex.org/W2015495501","https://openalex.org/W2056830486","https://openalex.org/W2069733180","https://openalex.org/W2104338317","https://openalex.org/W2141389846","https://openalex.org/W2148713296","https://openalex.org/W2167731739","https://openalex.org/W2179667834","https://openalex.org/W2400195282"],"related_works":["https://openalex.org/W2283291034","https://openalex.org/W4244289241","https://openalex.org/W1998948241","https://openalex.org/W2186708011","https://openalex.org/W2364223843","https://openalex.org/W4239937204","https://openalex.org/W2101964286","https://openalex.org/W2155564881","https://openalex.org/W1984223094","https://openalex.org/W2598378221"],"abstract_inverted_index":{"Summary":[0],"form":[1],"only":[2],"given.":[3],"The":[4],"earliest-pseudo-deadline-first":[5],"(EPDF)":[6],"Pfair":[7,15],"algorithm":[8],"is":[9,19,75],"more":[10,23,85],"efficient":[11],"than":[12,24,87],"other":[13],"known":[14],"scheduling":[16],"algorithms,":[17],"but":[18],"not":[20,62],"optimal":[21],"on":[22],"two":[25],"processors.":[26],"Srinivasan":[27],"and":[28],"Anderson":[29],"established":[30],"a":[31,38,51],"sufficient":[32,80],"per-task":[33],"utilization":[34,81],"restriction":[35],"for":[36],"ensuring":[37],"tardiness":[39,52],"of":[40,54],"at":[41],"most":[42],"one":[43,55],"quantum":[44,56],"under":[45],"EPDF.":[46],"They":[47],"also":[48,78],"conjectured":[49],"that":[50,60,70,72,83],"bound":[53],"applies":[57],"to":[58],"systems":[59],"are":[61,84],"restricted":[63],"in":[64],"any":[65],"way.":[66],"We":[67,77],"present":[68,79],"counterexamples":[69],"show":[71],"this":[73],"conjecture":[74],"false.":[76],"restrictions":[82],"liberal":[86],"theirs.":[88]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}