{"id":"https://openalex.org/W1845945138","doi":"https://doi.org/10.1109/ipdps.2003.1213223","title":"Dual priority algorithm to schedule real-time tasks in a shared memory multiprocessor","display_name":"Dual priority algorithm to schedule real-time tasks in a shared memory multiprocessor","publication_year":2004,"publication_date":"2004-03-22","ids":{"openalex":"https://openalex.org/W1845945138","doi":"https://doi.org/10.1109/ipdps.2003.1213223","mag":"1845945138"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2003.1213223","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2003.1213223","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Parallel and Distributed Processing Symposium","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/A5080549664","display_name":"J.M. Bands","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"J.M. Bands","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027588100","display_name":"\u00c0lex Arenas","orcid":"https://orcid.org/0000-0003-0937-0334"},"institutions":[{"id":"https://openalex.org/I55952717","display_name":"Universidad Rovira i Virgili","ror":"https://ror.org/00g5sqv46","country_code":"ES","type":"education","lineage":["https://openalex.org/I55952717"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"A. Arenas","raw_affiliation_strings":["Departament d'Enginyeria Inform\u00e0tica i Matem\u00e0tiques, Universitat Rovira i Virgili, Spain"],"affiliations":[{"raw_affiliation_string":"Departament d'Enginyeria Inform\u00e0tica i Matem\u00e0tiques, Universitat Rovira i Virgili, Spain","institution_ids":["https://openalex.org/I55952717"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035035680","display_name":"Jes\u00fas Labarta","orcid":"https://orcid.org/0000-0002-7489-4727"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]},{"id":"https://openalex.org/I55952717","display_name":"Universidad Rovira i Virgili","ror":"https://ror.org/00g5sqv46","country_code":"ES","type":"education","lineage":["https://openalex.org/I55952717"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"J. Labarta","raw_affiliation_strings":["Departament d'Arquitectura de Computadors, Universitat Polit\u00e8cnica de Catalunya, Spain","Departament d'Enginyeria Inform\u00e0tica i Matem\u00e0tiques, Universitat Rovira i Virgili, Spain"],"affiliations":[{"raw_affiliation_string":"Departament d'Arquitectura de Computadors, Universitat Polit\u00e8cnica de Catalunya, Spain","institution_ids":["https://openalex.org/I9617848"]},{"raw_affiliation_string":"Departament d'Enginyeria Inform\u00e0tica i Matem\u00e0tiques, Universitat Rovira i Virgili, Spain","institution_ids":["https://openalex.org/I55952717"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080549664"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2633,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.54286833,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"8","last_page":"8"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.994700014591217,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9943000078201294,"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/aperiodic-graph","display_name":"Aperiodic graph","score":0.9190758466720581},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8179627656936646},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.7584385871887207},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6405029892921448},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6103343963623047},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6049644947052002},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.5229688286781311},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.49313753843307495},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.4734518229961395},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4427124857902527},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.42109471559524536},{"id":"https://openalex.org/keywords/response-time","display_name":"Response time","score":0.4116796553134918},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.3874562680721283},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35994988679885864},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3492823541164398},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.23337110877037048},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.1384149193763733},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09345224499702454},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.09272721409797668}],"concepts":[{"id":"https://openalex.org/C104247578","wikidata":"https://www.wikidata.org/wiki/Q4779368","display_name":"Aperiodic graph","level":2,"score":0.9190758466720581},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8179627656936646},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.7584385871887207},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6405029892921448},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6103343963623047},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6049644947052002},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.5229688286781311},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.49313753843307495},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.4734518229961395},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4427124857902527},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.42109471559524536},{"id":"https://openalex.org/C19012869","wikidata":"https://www.wikidata.org/wiki/Q578372","display_name":"Response time","level":2,"score":0.4116796553134918},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.3874562680721283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35994988679885864},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3492823541164398},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.23337110877037048},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1384149193763733},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09345224499702454},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.09272721409797668},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdps.2003.1213223","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2003.1213223","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Parallel and Distributed Processing Symposium","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W7977343","https://openalex.org/W1524254874","https://openalex.org/W1544418708","https://openalex.org/W1603631587","https://openalex.org/W2015717967","https://openalex.org/W2042979415","https://openalex.org/W2071866027","https://openalex.org/W2086061827","https://openalex.org/W2095381673","https://openalex.org/W2101300711","https://openalex.org/W2109488193","https://openalex.org/W2135559191","https://openalex.org/W2137597833","https://openalex.org/W2140936050","https://openalex.org/W2151350464","https://openalex.org/W2155237069","https://openalex.org/W2157311434","https://openalex.org/W2160498682","https://openalex.org/W2161432424","https://openalex.org/W2165923099","https://openalex.org/W2166440675","https://openalex.org/W2166573642","https://openalex.org/W2262960161","https://openalex.org/W2570030068"],"related_works":["https://openalex.org/W1901015702","https://openalex.org/W2130555437","https://openalex.org/W2471627750","https://openalex.org/W2434525066","https://openalex.org/W2118376847","https://openalex.org/W3023290810","https://openalex.org/W1833217363","https://openalex.org/W2155564881","https://openalex.org/W2126540184","https://openalex.org/W2161267363"],"abstract_inverted_index":{"We":[0,59],"present":[1],"an":[2],"adaptation":[3],"of":[4],"the":[5],"dual":[6],"priority":[7],"scheduling":[8],"algorithm":[9],"to":[10,28,48,50,53],"schedule":[11],"both":[12],"hard":[13],"real-time":[14],"periodic":[15,38,44],"tasks":[16,19,47],"and":[17,45],"soft-aperiodic":[18],"in":[20],"shared":[21],"memory":[22],"multiprocessor":[23],"systems.":[24],"The":[25],"goal":[26],"is":[27],"achieve":[29],"low":[30],"mean":[31,56],"aperiodic":[32,46,55],"response":[33,57],"times":[34],"while":[35],"meeting":[36],"all":[37],"task":[39],"deadlines.":[40],"Our":[41],"proposal":[42],"allows":[43],"migrate":[49],"other":[51],"processors":[52],"improve":[54],"time.":[58],"show":[60],"via":[61],"extensive":[62],"simulations":[63],"that":[64],"our":[65],"approach":[66],"gives":[67],"better":[68],"results":[69],"than":[70],"local":[71],"slack":[72],"stealing":[73],"schedulers.":[74]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}