{"id":"https://openalex.org/W1840932120","doi":"https://doi.org/10.1007/978-3-540-72590-9_134","title":"Non-preemptive Fixed Priority Scheduling of Hard Real-Time Periodic Tasks","display_name":"Non-preemptive Fixed Priority Scheduling of Hard Real-Time Periodic Tasks","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W1840932120","doi":"https://doi.org/10.1007/978-3-540-72590-9_134","mag":"1840932120"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-72590-9_134","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-72590-9_134","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5078419927","display_name":"Moonju Park","orcid":"https://orcid.org/0000-0001-7731-6781"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Moonju Park","raw_affiliation_strings":["Ubiquitous Computing Lab., IBM Korea, Seoul, Korea","Ubiquitous Computing Lab., IBM-Korea, Seoul, Korea#TAB#"],"affiliations":[{"raw_affiliation_string":"Ubiquitous Computing Lab., IBM Korea, Seoul, Korea","institution_ids":[]},{"raw_affiliation_string":"Ubiquitous Computing Lab., IBM-Korea, Seoul, Korea#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078419927"],"corresponding_institution_ids":["https://openalex.org/I1341412227"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.9956,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.87137546,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"881","last_page":"888"},"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.989799976348877,"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.9657999873161316,"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/uniprocessor-system","display_name":"Uniprocessor system","score":0.836061954498291},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8152810335159302},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.7808213233947754},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.7300959825515747},{"id":"https://openalex.org/keywords/deadline-monotonic-scheduling","display_name":"Deadline-monotonic scheduling","score":0.7202935218811035},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.6784863471984863},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.6127503514289856},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6050271987915039},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5425586700439453},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5154545903205872},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.47278356552124023},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.4635694622993469},{"id":"https://openalex.org/keywords/least-slack-time-scheduling","display_name":"Least slack time scheduling","score":0.4612940549850464},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3337211608886719},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3206131160259247},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.104775071144104},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09209957718849182},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.06923824548721313},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.06362619996070862}],"concepts":[{"id":"https://openalex.org/C79189994","wikidata":"https://www.wikidata.org/wiki/Q3488021","display_name":"Uniprocessor system","level":3,"score":0.836061954498291},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8152810335159302},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.7808213233947754},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.7300959825515747},{"id":"https://openalex.org/C76774629","wikidata":"https://www.wikidata.org/wiki/Q1146103","display_name":"Deadline-monotonic scheduling","level":5,"score":0.7202935218811035},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.6784863471984863},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.6127503514289856},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6050271987915039},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5425586700439453},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5154545903205872},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.47278356552124023},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.4635694622993469},{"id":"https://openalex.org/C132439773","wikidata":"https://www.wikidata.org/wiki/Q1810747","display_name":"Least slack time scheduling","level":5,"score":0.4612940549850464},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3337211608886719},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3206131160259247},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.104775071144104},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09209957718849182},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.06923824548721313},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.06362619996070862}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-72590-9_134","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-72590-9_134","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Responsible consumption and production","score":0.47999998927116394,"id":"https://metadata.un.org/sdg/12"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W6056896","https://openalex.org/W1573956714","https://openalex.org/W1595529246","https://openalex.org/W1606775714","https://openalex.org/W1991295332","https://openalex.org/W2097202338","https://openalex.org/W2106202449","https://openalex.org/W2109488193","https://openalex.org/W2109949380","https://openalex.org/W2130181800","https://openalex.org/W2145132630","https://openalex.org/W2160293203"],"related_works":["https://openalex.org/W2172075652","https://openalex.org/W2017977262","https://openalex.org/W2605049164","https://openalex.org/W2745754772","https://openalex.org/W2502199411","https://openalex.org/W1840932120","https://openalex.org/W2374555443","https://openalex.org/W2245286458","https://openalex.org/W4300092030","https://openalex.org/W2076947091"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}