{"id":"https://openalex.org/W2144920761","doi":"https://doi.org/10.1109/rtas.2013.6531087","title":"Improved analysis and evaluation of real-time semaphore protocols for P-FP scheduling","display_name":"Improved analysis and evaluation of real-time semaphore protocols for P-FP scheduling","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W2144920761","doi":"https://doi.org/10.1109/rtas.2013.6531087","mag":"2144920761"},"language":"en","primary_location":{"id":"doi:10.1109/rtas.2013.6531087","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtas.2013.6531087","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 19th Real-Time and Embedded Technology and Applications Symposium (RTAS)","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/A5003988338","display_name":"Bj\u00f6rn B. Brandenburg","orcid":"https://orcid.org/0000-0001-8254-3815"},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"B. B. Brandenburg","raw_affiliation_strings":["MPI-SWS, Germany","MPI-SWS#TAB#"],"affiliations":[{"raw_affiliation_string":"MPI-SWS, Germany","institution_ids":["https://openalex.org/I4210121786"]},{"raw_affiliation_string":"MPI-SWS#TAB#","institution_ids":["https://openalex.org/I4210121786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5003988338"],"corresponding_institution_ids":["https://openalex.org/I4210121786"],"apc_list":null,"apc_paid":null,"fwci":7.9129,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.97665805,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"141","last_page":"152"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998999834060669,"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.9998999834060669,"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.996399998664856,"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.9944999814033508,"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/computer-science","display_name":"Computer science","score":0.7158305644989014},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6708009839057922},{"id":"https://openalex.org/keywords/fifo","display_name":"FIFO (computing and electronics)","score":0.6365582942962646},{"id":"https://openalex.org/keywords/fifo-and-lifo-accounting","display_name":"FIFO and LIFO accounting","score":0.6154881119728088},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.5855661630630493},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.47367602586746216},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4224187731742859},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3695070445537567},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32476806640625},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.31790193915367126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1873932182788849},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.16993659734725952},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.16020286083221436}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7158305644989014},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6708009839057922},{"id":"https://openalex.org/C2777145635","wikidata":"https://www.wikidata.org/wiki/Q515636","display_name":"FIFO (computing and electronics)","level":2,"score":0.6365582942962646},{"id":"https://openalex.org/C48721391","wikidata":"https://www.wikidata.org/wiki/Q1265942","display_name":"FIFO and LIFO accounting","level":3,"score":0.6154881119728088},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.5855661630630493},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.47367602586746216},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4224187731742859},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3695070445537567},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32476806640625},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.31790193915367126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1873932182788849},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16993659734725952},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.16020286083221436}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/rtas.2013.6531087","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtas.2013.6531087","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 19th Real-Time and Embedded Technology and Applications Symposium (RTAS)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.385.5479","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.385.5479","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.mpi-sws.org/~bbb/papers/pdf/rtas13.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.385.9229","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.385.9229","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.mpi-sws.org/~bbb/papers/pdf/rtas13-extended-version.pdf","raw_type":"text"},{"id":"pmh:oai:pure.mpg.de:item_2173549","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0028-31C0-2","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE 19th Real-Time and Embedded Technology and Applications Symposium","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1482813123","https://openalex.org/W1578961151","https://openalex.org/W1905332030","https://openalex.org/W1990949875","https://openalex.org/W2042352414","https://openalex.org/W2042979415","https://openalex.org/W2045683962","https://openalex.org/W2045878091","https://openalex.org/W2100980563","https://openalex.org/W2105420251","https://openalex.org/W2124753960","https://openalex.org/W2126697758","https://openalex.org/W2136259863","https://openalex.org/W2143006785","https://openalex.org/W2154716423","https://openalex.org/W2156324992","https://openalex.org/W2160293203","https://openalex.org/W2168231008","https://openalex.org/W2170643076","https://openalex.org/W2181520421","https://openalex.org/W2412070033","https://openalex.org/W2477294255","https://openalex.org/W2995394804","https://openalex.org/W4291598242","https://openalex.org/W6639451046","https://openalex.org/W6675237100","https://openalex.org/W6682493093","https://openalex.org/W6682761234","https://openalex.org/W6841374044"],"related_works":["https://openalex.org/W2168288612","https://openalex.org/W3145739807","https://openalex.org/W2058492552","https://openalex.org/W2485390638","https://openalex.org/W2626729922","https://openalex.org/W2020531283","https://openalex.org/W2322861814","https://openalex.org/W2945758745","https://openalex.org/W2015441043","https://openalex.org/W2172079042"],"abstract_inverted_index":{"Several":[0],"suspension-based":[1],"multiprocessor":[2],"real-time":[3],"locking":[4,207],"protocols":[5,18],"for":[6,201,211],"partitioned":[7],"fixed-priority":[8],"(P-FP)":[9],"scheduling":[10],"have":[11],"been":[12],"proposed":[13],"in":[14,20,42,52,55,123,214],"prior":[15,132],"work.":[16],"These":[17],"differ":[19],"key":[21],"design":[22],"choices":[23],"that":[24,138],"affect":[25],"implementation":[26],"complexity,":[27],"overheads,":[28],"and":[29,32,97,125,206,222],"worst-case":[30],"blocking,":[31],"it":[33],"is":[34,38,121,143,168,178,186],"not":[35],"obvious":[36],"which":[37,100,120],"\u201cbest\u201d":[39],"when":[40],"implemented":[41],"a":[43,81,114],"real":[44],"OS.":[45],"In":[46,226],"particular,":[47],"should":[48,69],"blocked":[49],"tasks":[50,59],"wait":[51],"FIFO":[53,160],"or":[54,68],"priority":[56,139],"order?":[57],"Should":[58],"execute":[60],"critical":[61,193],"sections":[62,194],"locally":[63],"on":[64,74,80,113,219],"their":[65],"assigned":[66],"processor,":[67],"resource":[70,182],"access":[71,183],"be":[72,189],"centralized":[73,181],"designated":[75],"processors?":[76],"This":[77],"paper":[78],"reports":[79],"large-scale,":[82],"overhead-aware":[83],"schedulability":[84],"study":[85],"comparing":[86],"four":[87,106],"protocols,":[88],"the":[89,98,105,147,171],"MPCP,":[90],"FMLP":[91,196],"<sup":[92,163,197,216,231],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[93,164,198,217,232],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">+</sup>":[94,165,199],",":[95,166],"DPCP,":[96],"DFLP,":[99],"together":[101],"cover":[102],"each":[103],"of":[104,149,157,173],"possible":[107],"combinations.":[108],"The":[109,135],"results":[110,136],"are":[111],"based":[112],"new,":[115],"linear-programming-based":[116],"blocking":[117,133],"analysis":[118],"technique,":[119],"explained":[122],"detail":[124],"shown":[126],"to":[127,175,188,191,228,243],"offer":[128],"substantial":[129],"improvements":[130],"over":[131],"bounds.":[134],"reveal":[137],"queuing":[140],"(MPCP,":[141,195],"DPCP)":[142],"often":[144],"preferable":[145,169,190],"if":[146,170],"range":[148],"temporal":[150],"constraints":[151],"spans":[152],"(at":[153],"least)":[154],"an":[155],"order":[156],"magnitude,":[158],"whereas":[159],"queueing":[161],"(FMLP":[162],"DFLP)":[167,185],"ratio":[172],"longest":[174],"shortest":[176],"deadlines":[177],"small.":[179],"Further,":[180],"(DPCP,":[184],"found":[187],"local":[192],")":[200],"high-contention":[202],"workloads.":[203],"Scheduling,":[204],"cache,":[205],"overheads":[208],"were":[209],"accounted":[210],"as":[212],"measured":[213],"LITMUS":[215,230],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">RT</sup>":[218,233],"two":[220],"8-":[221],"16-core":[223],"x86":[224],"platforms.":[225],"contrast":[227],"earlier":[229],"-based":[234],"studies,":[235],"no":[236],"statistical":[237],"outlier":[238],"filtering":[239],"was":[240],"performed,":[241],"owing":[242],"improved":[244],"tracing":[245],"support.":[246]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}