{"id":"https://openalex.org/W2054929942","doi":"https://doi.org/10.1109/isorc.2013.6913216","title":"Semi-fixed-priority scheduling with multiple mandatory parts","display_name":"Semi-fixed-priority scheduling with multiple mandatory parts","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W2054929942","doi":"https://doi.org/10.1109/isorc.2013.6913216","mag":"2054929942"},"language":"en","primary_location":{"id":"doi:10.1109/isorc.2013.6913216","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isorc.2013.6913216","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"16th IEEE International Symposium on Object/component/service-oriented Real-time distributed Computing (ISORC 2013)","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/A5080415428","display_name":"Hiroyuki Chishiro","orcid":null},"institutions":[{"id":"https://openalex.org/I203951103","display_name":"Keio University","ror":"https://ror.org/02kn6nx58","country_code":"JP","type":"education","lineage":["https://openalex.org/I203951103"]},{"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":["JP","US"],"is_corresponding":true,"raw_author_name":"Hiroyuki Chishiro","raw_affiliation_strings":["Department of Computer Science, University of North Carolina at Chapel Hill, NC, USA","Department of Information and Computer Science, Keio University, Yokohama, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of North Carolina at Chapel Hill, NC, USA","institution_ids":["https://openalex.org/I114027177"]},{"raw_affiliation_string":"Department of Information and Computer Science, Keio University, Yokohama, Japan","institution_ids":["https://openalex.org/I203951103"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111606328","display_name":"Nobuyuki Yamasaki","orcid":null},"institutions":[{"id":"https://openalex.org/I203951103","display_name":"Keio University","ror":"https://ror.org/02kn6nx58","country_code":"JP","type":"education","lineage":["https://openalex.org/I203951103"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Nobuyuki Yamasaki","raw_affiliation_strings":["Department of Information and Computer Science, Keio University, Yokohama, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computer Science, Keio University, Yokohama, Japan","institution_ids":["https://openalex.org/I203951103"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080415428"],"corresponding_institution_ids":["https://openalex.org/I114027177","https://openalex.org/I203951103"],"apc_list":null,"apc_paid":null,"fwci":1.5761,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.83671101,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"79","issue":null,"first_page":"1","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.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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9927999973297119,"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.9926999807357788,"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.7979863882064819},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.7545318603515625},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6588165163993835},{"id":"https://openalex.org/keywords/deadline-monotonic-scheduling","display_name":"Deadline-monotonic scheduling","score":0.6378061771392822},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6336130499839783},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.6267004013061523},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.46988677978515625},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4631566107273102},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4526779353618622},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.4234408140182495},{"id":"https://openalex.org/keywords/priority-ceiling-protocol","display_name":"Priority ceiling protocol","score":0.41432899236679077},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.32189345359802246},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3013008236885071},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20271173119544983},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.11287078261375427},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09769633412361145},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09692898392677307}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7979863882064819},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.7545318603515625},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6588165163993835},{"id":"https://openalex.org/C76774629","wikidata":"https://www.wikidata.org/wiki/Q1146103","display_name":"Deadline-monotonic scheduling","level":5,"score":0.6378061771392822},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6336130499839783},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.6267004013061523},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.46988677978515625},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4631566107273102},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4526779353618622},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.4234408140182495},{"id":"https://openalex.org/C117420606","wikidata":"https://www.wikidata.org/wiki/Q386027","display_name":"Priority ceiling protocol","level":5,"score":0.41432899236679077},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.32189345359802246},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3013008236885071},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20271173119544983},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.11287078261375427},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09769633412361145},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09692898392677307}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isorc.2013.6913216","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isorc.2013.6913216","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"16th IEEE International Symposium on Object/component/service-oriented Real-time distributed Computing (ISORC 2013)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W381552973","https://openalex.org/W1565527413","https://openalex.org/W1984147675","https://openalex.org/W1984972071","https://openalex.org/W1990640262","https://openalex.org/W2001056823","https://openalex.org/W2090557530","https://openalex.org/W2098914505","https://openalex.org/W2109488193","https://openalex.org/W2123329595","https://openalex.org/W2168711587","https://openalex.org/W2262960161","https://openalex.org/W2336002698","https://openalex.org/W6613135377","https://openalex.org/W6633682156","https://openalex.org/W6674879450"],"related_works":["https://openalex.org/W4300092030","https://openalex.org/W1827860574","https://openalex.org/W2386407620","https://openalex.org/W2098651083","https://openalex.org/W2165972904","https://openalex.org/W2377321505","https://openalex.org/W2393789493","https://openalex.org/W2962323017","https://openalex.org/W2108793785","https://openalex.org/W38128398"],"abstract_inverted_index":{"An":[0],"imprecise":[1,23,55,63,78,83,118,179],"computation":[2,24,56,64,84],"model":[3,25,57,85],"has":[4,68],"the":[5,22,30,38,44,47,50,61,145,153],"advantage":[6],"of":[7,32,46,49,148,156],"supporting":[8],"overloaded":[9],"conditions":[10],"in":[11],"dynamic":[12],"real-time":[13,79,119],"environments,":[14],"compared":[15],"to":[16,42,75,98,143,171],"Liu":[17],"and":[18,72,134],"Layland's":[19],"model.":[20],"However,":[21],"is":[26,58,86,96,106,152],"not":[27],"practical":[28,54,62,82],"because":[29],"termination":[31,48,154],"each":[33,66,149],"optional":[34,51,73,146,157],"part":[35],"cannot":[36],"guarantee":[37,43],"schedulability.":[39],"In":[40,60,101,137],"order":[41],"schedulability":[45,160],"part,":[52],"a":[53],"presented.":[59],"model,":[65],"task":[67],"multiple":[69,129,175],"mandatory":[70,113,130,176],"parts":[71,74,114,131],"support":[76,99],"many":[77,178],"applications.":[80],"The":[81,159],"supported":[87,117],"by":[88],"dynamic-priority":[89,94],"scheduling":[90,95,127,165,173],"on":[91,132],"uniprocessors.":[92],"Unfortunately,":[93],"difficult":[97],"multiprocessors.":[100],"contrast,":[102],"semifixed-priority":[103],"scheduling,":[104,109],"which":[105,151],"part-level":[107],"fixed-priority":[108,168],"supports":[110],"only":[111],"two":[112],"so":[115],"that":[116,163],"applications":[120,181],"are":[121],"restricted.":[122],"This":[123],"paper":[124,140],"presents":[125],"semi-fixed-priority":[126,164,172],"with":[128,174],"uniprocessors":[133],"multiprocessors":[135],"respectively.":[136],"addition,":[138],"this":[139],"explains":[141],"how":[142],"calculate":[144],"deadline":[147],"task,":[150],"time":[155],"part.":[158],"analysis":[161],"shows":[162],"strictly":[166],"dominates":[167],"scheduling.":[169],"Thanks":[170],"parts,":[177],"realtime":[180],"can":[182],"be":[183],"supported.":[184]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}