{"id":"https://openalex.org/W2179018824","doi":"https://doi.org/10.1145/2752801.2752804","title":"Budget allocations for hierarchical fixed-priority scheduling of sporadic tasks with deferred preemptions upon EDP resources","display_name":"Budget allocations for hierarchical fixed-priority scheduling of sporadic tasks with deferred preemptions upon EDP resources","publication_year":2015,"publication_date":"2015-03-27","ids":{"openalex":"https://openalex.org/W2179018824","doi":"https://doi.org/10.1145/2752801.2752804","mag":"2179018824"},"language":"en","primary_location":{"id":"doi:10.1145/2752801.2752804","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2752801.2752804","pdf_url":null,"source":{"id":"https://openalex.org/S4210187018","display_name":"ACM SIGBED Review","issn_l":"1551-3688","issn":["1551-3688"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGBED Review","raw_type":"journal-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/A5066558996","display_name":"Martijn M. H. P. van den Heuvel","orcid":"https://orcid.org/0000-0002-8220-5039"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Martijn M. H. P. van den Heuvel","raw_affiliation_strings":["Technische Universiteit Eindhoven (TU/e), The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universiteit Eindhoven (TU/e), The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080745161","display_name":"Reinder J. Bril","orcid":"https://orcid.org/0000-0001-6234-5117"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Reinder J. Bril","raw_affiliation_strings":["Technische Universiteit Eindhoven (TU/e), The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universiteit Eindhoven (TU/e), The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111437816","display_name":"Johan J. Lukkien","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Johan J. Lukkien","raw_affiliation_strings":["Technische Universiteit Eindhoven (TU/e), The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universiteit Eindhoven (TU/e), The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.07068966,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"12","issue":"1","first_page":"19","last_page":"27"},"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.9937999844551086,"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.9937000274658203,"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.8379572033882141},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6821103096008301},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5915398001670837},{"id":"https://openalex.org/keywords/deadline-monotonic-scheduling","display_name":"Deadline-monotonic scheduling","score":0.5908135771751404},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.584918737411499},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5279344916343689},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.4812900125980377},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.4470668137073517},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.3179799020290375},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.24742069840431213},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.2398800253868103},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.1700315773487091},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.15977799892425537},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1157439649105072}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8379572033882141},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6821103096008301},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5915398001670837},{"id":"https://openalex.org/C76774629","wikidata":"https://www.wikidata.org/wiki/Q1146103","display_name":"Deadline-monotonic scheduling","level":5,"score":0.5908135771751404},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.584918737411499},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5279344916343689},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.4812900125980377},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.4470668137073517},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.3179799020290375},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.24742069840431213},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.2398800253868103},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.1700315773487091},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.15977799892425537},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1157439649105072},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2752801.2752804","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2752801.2752804","pdf_url":null,"source":{"id":"https://openalex.org/S4210187018","display_name":"ACM SIGBED Review","issn_l":"1551-3688","issn":["1551-3688"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGBED Review","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/33df8020-0846-4606-8e17-8b432f2f122c","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/33df8020-0846-4606-8e17-8b432f2f122c","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Heuvel, van den, M M H P, Bril, R J & Lukkien, J J 2015, 'Budget allocations for hierarchical fixed-priority scheduling of sporadic tasks with deferred preemptions upon EDP resources', ACM SIGBED Review, vol. 12, no. 1, pp. 19-27. https://doi.org/10.1145/2752801.2752804","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/8edb1dc2-52cd-4e81-adae-3e0eb8cb6b68","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/8edb1dc2-52cd-4e81-adae-3e0eb8cb6b68","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:tue:oai:pure.tue.nl:publications/33df8020-0846-4606-8e17-8b432f2f122c","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/33df8020-0846-4606-8e17-8b432f2f122c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM SIGBED Review, 12(1), 19 - 27. Association for Computing Machinery, Inc","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1539685208","https://openalex.org/W1548943549","https://openalex.org/W1964142318","https://openalex.org/W1979955079","https://openalex.org/W1986292708","https://openalex.org/W2018770409","https://openalex.org/W2026298242","https://openalex.org/W2050243060","https://openalex.org/W2077252510","https://openalex.org/W2093100591","https://openalex.org/W2095767651","https://openalex.org/W2098664955","https://openalex.org/W2109488193","https://openalex.org/W2118589151","https://openalex.org/W2121443843","https://openalex.org/W2123644071","https://openalex.org/W2143993543","https://openalex.org/W2145132630","https://openalex.org/W2147594675","https://openalex.org/W2153177812","https://openalex.org/W2161022036","https://openalex.org/W2164164245","https://openalex.org/W2166417881","https://openalex.org/W2168767944","https://openalex.org/W3017110305","https://openalex.org/W3023751912"],"related_works":["https://openalex.org/W2169142010","https://openalex.org/W2962323017","https://openalex.org/W1935185185","https://openalex.org/W2912206708","https://openalex.org/W2377321505","https://openalex.org/W2355968897","https://openalex.org/W2386407620","https://openalex.org/W2375726820","https://openalex.org/W2393789493","https://openalex.org/W2362074086"],"abstract_inverted_index":{"In":[0,21,107],"this":[1],"paper":[2],"we":[3,23,65,109],"revisit":[4],"the":[5,15,38,50,70],"admission":[6],"of":[7,40,43,52,60,90,92,102],"applications":[8,25,56,75],"upon":[9],"a":[10,28,41,58],"processor":[11],"share":[12],"modeled":[13],"by":[14],"explicit-deadline":[16],"periodic":[17],"(EDP)":[18],"resource-supply":[19],"model.":[20],"particular,":[22],"consider":[24,49],"that":[26,64],"represent":[27],"fixed-priority":[29],"sporadic":[30],"task":[31,45],"system.":[32],"Existing":[33],"works":[34],"heavily":[35],"build":[36],"on":[37,104],"analysis":[39,98],"hierarchy":[42,59],"preemptive":[44],"schedulers.":[46],"We":[47,95],"instead":[48],"feasibility":[51],"such":[53],"tasks":[54,73,91,103],"and":[55,74],"for":[57,99,112],"deferred-preemptive":[61,100],"schedulers,":[62],"so":[63],"can":[66],"efficiently":[67],"deal":[68],"with":[69],"scenario":[71],"where":[72],"execute":[76],"their":[77],"work":[78],"in":[79],"non-preemptive":[80],"chunks.":[81],"Our":[82],"model":[83],"therefore":[84],"gives":[85],"better":[86],"control":[87],"over":[88],"preemptions":[89],"different":[93],"applications.":[94],"present":[96],"exact":[97],"scheduling":[101],"EDP":[105],"resources.":[106],"addition,":[108],"propose":[110],"algorithms":[111],"dimensioning":[113],"an":[114],"application's":[115],"budget":[116],"tightly.":[117]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-19T07:52:34.831488","created_date":"2025-10-10T00:00:00"}