{"id":"https://openalex.org/W2128426273","doi":"https://doi.org/10.1109/real.2003.1253262","title":"Multiple-resource periodic scheduling problem: how much fairness is necessary?","display_name":"Multiple-resource periodic scheduling problem: how much fairness is necessary?","publication_year":2004,"publication_date":"2004-05-13","ids":{"openalex":"https://openalex.org/W2128426273","doi":"https://doi.org/10.1109/real.2003.1253262","mag":"2128426273"},"language":"en","primary_location":{"id":"doi:10.1109/real.2003.1253262","is_oa":false,"landing_page_url":"https://doi.org/10.1109/real.2003.1253262","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 2003 International Symposium on System-on-Chip (IEEE Cat. No.03EX748)","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/A5012210223","display_name":"Dakai Zhu","orcid":"https://orcid.org/0000-0002-1938-9947"},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dakai Zhu","raw_affiliation_strings":["Computer Science Department, University of Pittsburgh, Pittsburgh, PA, USA","Dept. of Comput. Sci., Pittsburgh Univ., PA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Pittsburgh, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I170201317"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Pittsburgh Univ., PA, USA#TAB#","institution_ids":["https://openalex.org/I170201317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088337929","display_name":"Daniel Moss\u00e9","orcid":"https://orcid.org/0000-0002-9508-9815"},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Mosse","raw_affiliation_strings":["Computer Science Department, University of Pittsburgh, Pittsburgh, PA, USA","Dept. of Comput. Sci., Pittsburgh Univ., PA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Pittsburgh, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I170201317"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Pittsburgh Univ., PA, USA#TAB#","institution_ids":["https://openalex.org/I170201317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038997010","display_name":"Rami Melhem","orcid":"https://orcid.org/0000-0001-6403-5446"},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Melhem","raw_affiliation_strings":["Computer Science Department, University of Pittsburgh, Pittsburgh, PA, USA","Dept. of Comput. Sci., Pittsburgh Univ., PA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Pittsburgh, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I170201317"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Pittsburgh Univ., PA, USA#TAB#","institution_ids":["https://openalex.org/I170201317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012210223"],"corresponding_institution_ids":["https://openalex.org/I170201317"],"apc_list":null,"apc_paid":null,"fwci":1.0564,"has_fulltext":false,"cited_by_count":87,"citation_normalized_percentile":{"value":0.7686021,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"142","last_page":"151"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9997000098228455,"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.9997000098228455,"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.9930999875068665,"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.9876000285148621,"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/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.7717447280883789},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.7587281465530396},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7537773847579956},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.7397348284721375},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.6908143758773804},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.6800904273986816},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.645318329334259},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.6300832033157349},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.525288462638855},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5012061595916748},{"id":"https://openalex.org/keywords/deadline-monotonic-scheduling","display_name":"Deadline-monotonic scheduling","score":0.4395107626914978},{"id":"https://openalex.org/keywords/lottery-scheduling","display_name":"Lottery scheduling","score":0.4299110174179077},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3944897949695587},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1553289294242859},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1522463858127594},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.0651068389415741}],"concepts":[{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.7717447280883789},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.7587281465530396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7537773847579956},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.7397348284721375},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.6908143758773804},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.6800904273986816},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.645318329334259},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.6300832033157349},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.525288462638855},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5012061595916748},{"id":"https://openalex.org/C76774629","wikidata":"https://www.wikidata.org/wiki/Q1146103","display_name":"Deadline-monotonic scheduling","level":5,"score":0.4395107626914978},{"id":"https://openalex.org/C112866106","wikidata":"https://www.wikidata.org/wiki/Q267053","display_name":"Lottery scheduling","level":5,"score":0.4299110174179077},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3944897949695587},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1553289294242859},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1522463858127594},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0651068389415741}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/real.2003.1253262","is_oa":false,"landing_page_url":"https://doi.org/10.1109/real.2003.1253262","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 2003 International Symposium on System-on-Chip (IEEE Cat. No.03EX748)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.130.836","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.836","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.pitt.edu/~melhem/vita/doc/01253262.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.4.6561","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.6561","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.pitt.edu/PARTS/papers/RTSS03_zhu.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.561.2831","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.561.2831","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.pitt.edu/PARTS/papers/RTSS03_zhu.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1628974215","https://openalex.org/W1805570991","https://openalex.org/W1996641400","https://openalex.org/W2015495501","https://openalex.org/W2032094184","https://openalex.org/W2056830486","https://openalex.org/W2058817479","https://openalex.org/W2104338317","https://openalex.org/W2123791481","https://openalex.org/W2141389846","https://openalex.org/W2157407983"],"related_works":["https://openalex.org/W2167574351","https://openalex.org/W1935185185","https://openalex.org/W2184166483","https://openalex.org/W1545991362","https://openalex.org/W3184267879","https://openalex.org/W2378854764","https://openalex.org/W2978148977","https://openalex.org/W2359186131","https://openalex.org/W261946124","https://openalex.org/W1593612559"],"abstract_inverted_index":{"The":[0,63],"Pfair":[1,106],"algorithms":[2],"are":[3],"optimal":[4,68],"for":[5,34,138],"independent":[6],"periodic":[7],"real-time":[8],"tasks":[9,58],"executing":[10],"on":[11],"a":[12,18,43],"multiple-resource":[13],"system.":[14],"However,":[15],"they":[16],"incur":[17],"high":[19],"scheduling":[20,24,45,52,81,92,117,132],"overhead":[21],"by":[22,79],"making":[23,80],"decisions":[25,53,82],"in":[26,69,109,124],"every":[27],"time":[28],"unit":[29],"to":[30,57,122],"enforce":[31],"proportional":[32],"progress":[33],"each":[35],"task.":[36],"In":[37],"this":[38],"paper,":[39],"we":[40],"will":[41],"propose":[42],"novel":[44],"algorithm,":[46],"boundary":[47],"fair":[48],"(BF),":[49],"which":[50,134],"makes":[51],"and":[54,127],"enforces":[55],"fairness":[56],"only":[59],"at":[60,83],"period":[61,84],"boundaries.":[62],"BF":[64,86,96],"algorithm":[65,97],"is":[66,135],"also":[67],"the":[70,89,95,99,105,114,130],"sense":[71],"that":[72,103],"it":[73,111],"achieves":[74],"100%":[75],"system":[76],"utilization.":[77],"Moreover,":[78],"boundaries,":[85],"effectively":[87],"reduces":[88],"number":[90,115],"of":[91,104,116],"points.":[93],"Theoretically,":[94],"has":[98],"same":[100],"complexity":[101],"as":[102],"algorithms.":[107],"But,":[108],"practice,":[110],"could":[112],"reduce":[113,129],"points":[118],"dramatically":[119],"(e.g.,":[120],"up":[121],"75%":[123],"our":[125],"experiments)":[126],"thus":[128],"overall":[131],"overhead,":[133],"especially":[136],"important":[137],"online":[139],"scheduling.":[140]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}