{"id":"https://openalex.org/W2463729868","doi":"https://doi.org/10.1109/sies.2016.7509435","title":"Further analysis on blocking time bounds for partitioned fixed priority multiprocessor scheduling","display_name":"Further analysis on blocking time bounds for partitioned fixed priority multiprocessor scheduling","publication_year":2016,"publication_date":"2016-05-01","ids":{"openalex":"https://openalex.org/W2463729868","doi":"https://doi.org/10.1109/sies.2016.7509435","mag":"2463729868"},"language":"en","primary_location":{"id":"doi:10.1109/sies.2016.7509435","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sies.2016.7509435","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 11th IEEE Symposium on Industrial Embedded Systems (SIES)","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/A5086503830","display_name":"Zhongqi Ma","orcid":null},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Zhongqi Ma","raw_affiliation_strings":["Graduate School of Information Science, Nagoya University, Aichi, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science, Nagoya University, Aichi, Japan","institution_ids":["https://openalex.org/I60134161"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022179648","display_name":"Ryo Kurachi","orcid":"https://orcid.org/0000-0002-8565-5799"},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ryo Kurachi","raw_affiliation_strings":["Graduate School of Information Science, Nagoya University, Aichi, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science, Nagoya University, Aichi, Japan","institution_ids":["https://openalex.org/I60134161"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079340373","display_name":"Gang Zeng","orcid":"https://orcid.org/0000-0003-1663-7981"},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Gang Zeng","raw_affiliation_strings":["Graduate School of Engineering, Nagoya University, Aichi, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Engineering, Nagoya University, Aichi, Japan","institution_ids":["https://openalex.org/I60134161"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032678689","display_name":"Hiroaki Takada","orcid":"https://orcid.org/0000-0003-3544-2397"},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hiroaki Takada","raw_affiliation_strings":["Graduate School of Information Science, Nagoya University, Aichi, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science, Nagoya University, Aichi, Japan","institution_ids":["https://openalex.org/I60134161"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5086503830"],"corresponding_institution_ids":["https://openalex.org/I60134161"],"apc_list":null,"apc_paid":null,"fwci":0.3153,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.55839759,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998000264167786,"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.9998000264167786,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9955999851226807,"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.9941999912261963,"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/computer-science","display_name":"Computer science","score":0.6953208446502686},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.6852719187736511},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.6232255101203918},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5973237156867981},{"id":"https://openalex.org/keywords/priority-inversion","display_name":"Priority inversion","score":0.5473282337188721},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4634532630443573},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.4590858519077301},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4507083296775818},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4471542537212372},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3908703923225403},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3540440797805786},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.3194194436073303},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.26631593704223633},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22990646958351135},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.22042813897132874},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.06371241807937622},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.06335446238517761}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6953208446502686},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.6852719187736511},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6232255101203918},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5973237156867981},{"id":"https://openalex.org/C172828308","wikidata":"https://www.wikidata.org/wiki/Q520734","display_name":"Priority inversion","level":5,"score":0.5473282337188721},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4634532630443573},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.4590858519077301},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4507083296775818},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4471542537212372},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3908703923225403},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3540440797805786},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.3194194436073303},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.26631593704223633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22990646958351135},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.22042813897132874},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.06371241807937622},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.06335446238517761},{"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.1109/sies.2016.7509435","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sies.2016.7509435","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 11th IEEE Symposium on Industrial Embedded Systems (SIES)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W173437768","https://openalex.org/W1578961151","https://openalex.org/W1905332030","https://openalex.org/W1968005108","https://openalex.org/W2011039300","https://openalex.org/W2042979415","https://openalex.org/W2109488193","https://openalex.org/W2137784941","https://openalex.org/W2143006785","https://openalex.org/W2144920761","https://openalex.org/W2170091282","https://openalex.org/W2170643076","https://openalex.org/W2181520421","https://openalex.org/W2412070033","https://openalex.org/W6607081818","https://openalex.org/W6686032632","https://openalex.org/W6925714978"],"related_works":["https://openalex.org/W2108793785","https://openalex.org/W2543329403","https://openalex.org/W2944414528","https://openalex.org/W2911627839","https://openalex.org/W2160825858","https://openalex.org/W2111603221","https://openalex.org/W2377321505","https://openalex.org/W2143139136","https://openalex.org/W3151910529","https://openalex.org/W2362787247"],"abstract_inverted_index":{"Partitioned":[0],"fixed":[1],"priority":[2],"scheduling":[3,12],"is":[4,21,82,89],"one":[5,152],"of":[6,94,113,124,140],"the":[7,39,46,53,61,64,95,109,131,138,141],"most":[8],"comprehensively":[9],"chosen":[10],"predictable":[11],"in":[13,18,78],"practice.":[14],"The":[15,33,122],"FMLP+":[16,40,62],"developed":[17],"recent":[19],"years":[20],"a":[22,71,85,102],"better":[23],"protocol,":[24],"which":[25],"ensures":[26],"asymptotically":[27],"optimal":[28],"O(n)":[29],"maximum":[30,49,110],"priority-inversion":[31,76],"blocking.":[32],"constraints":[34,104],"under":[35,60],"several":[36],"protocols":[37],"besides":[38],"can":[41],"be":[42,58,148],"exploited":[43],"to":[44,70,107],"gain":[45],"bound":[47],"on":[48,63,99],"blocking":[50,54,77,111],"time.":[51,121],"However,":[52],"time":[55,112],"bounds":[56],"may":[57],"pessimistic":[59,96],"ground":[65],"that":[66,84,143],"shared":[67],"resources":[68],"local":[69,151],"processor":[72],"do":[73],"not":[74],"incur":[75],"some":[79],"cases.":[80],"It":[81],"possible":[83],"schedulable":[86],"task":[87],"set":[88],"judged":[90],"as":[91],"unschedulable":[92],"because":[93],"values.":[97],"Based":[98],"our":[100,125],"analysis,":[101],"few":[103],"was":[105],"added":[106],"compute":[108],"each":[114],"task,":[115],"and":[116],"then":[117],"its":[118],"worst-case":[119],"response":[120],"results":[123],"experiments":[126],"show":[127],"less":[128],"pessimism":[129],"than":[130],"existing":[132],"ones.":[133],"Meanwhile,":[134],"we":[135],"also":[136],"demonstrate":[137],"usefulness":[139],"conclusion":[142],"global":[144],"resource":[145],"sharing":[146],"should":[147],"transformed":[149],"into":[150],"where":[153],"possible.":[154]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}