{"id":"https://openalex.org/W2264426648","doi":"https://doi.org/10.4230/lites-v003-i001-a004","title":"Optimal Scheduling of Periodic Gang Tasks","display_name":"Optimal Scheduling of Periodic Gang Tasks","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2264426648","doi":"https://doi.org/10.4230/lites-v003-i001-a004","mag":"2264426648"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:19259","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LITES-v003-i001-a004","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"preprint","indexed_in":["arxiv","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LITES-v003-i001-a004","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111464986","display_name":"Jo\u00ebl Goossens","orcid":"https://orcid.org/0000-0001-9524-8911"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]},{"id":"https://openalex.org/I4210161954","display_name":"D\u00e9partement d'Informatique","ror":"https://ror.org/05y6rqs46","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I2746051580","https://openalex.org/I29607241","https://openalex.org/I4210159245","https://openalex.org/I4210161954"]}],"countries":["BE","FR"],"is_corresponding":true,"raw_author_name":"Goossens, Jo\u00ebl","raw_affiliation_strings":["Universit\u00e9 Libre de Bruxelles (ULB), 50 av. F.D. Roosevelt 1050 Brussels, Belgium","D\u00e9partement d'Informatique [Bruxelles]"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Libre de Bruxelles (ULB), 50 av. F.D. Roosevelt 1050 Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]},{"raw_affiliation_string":"D\u00e9partement d'Informatique [Bruxelles]","institution_ids":["https://openalex.org/I4210161954"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107303839","display_name":"Pascal Richard","orcid":"https://orcid.org/0009-0003-3916-9241"},"institutions":[{"id":"https://openalex.org/I171246369","display_name":"\u00c9cole Nationale Sup\u00e9rieure de M\u00e9canique et d'A\u00e9rotechnique","ror":"https://ror.org/04jx68594","country_code":"FR","type":"facility","lineage":["https://openalex.org/I171246369"]},{"id":"https://openalex.org/I2802931824","display_name":"Institut Pprime","ror":"https://ror.org/05vjdsn22","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I171246369","https://openalex.org/I2802931824","https://openalex.org/I32881790","https://openalex.org/I4210095849"]},{"id":"https://openalex.org/I4210116740","display_name":"Laboratoire d'Informatique et d'Automatique pour les Syst\u00e8mes","ror":"https://ror.org/02b5vq778","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I4210113334","https://openalex.org/I4210116740","https://openalex.org/I4210139971"]},{"id":"https://openalex.org/I32881790","display_name":"Universit\u00e9 de Poitiers","ror":"https://ror.org/04xhy8q59","country_code":"FR","type":"education","lineage":["https://openalex.org/I32881790"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Richard, Pascal","raw_affiliation_strings":["LIAS/Isae-Ensma-Universit\u00e9 de Poitiers, 1 av. Cl\u00e9ment Ader, BP 40109, 86961 Chasseneuil du Poitou, France","Laboratoire d'Informatique et d'Automatique pour les Syst\u00e8mes"],"affiliations":[{"raw_affiliation_string":"LIAS/Isae-Ensma-Universit\u00e9 de Poitiers, 1 av. Cl\u00e9ment Ader, BP 40109, 86961 Chasseneuil du Poitou, France","institution_ids":["https://openalex.org/I32881790","https://openalex.org/I171246369","https://openalex.org/I2802931824"]},{"raw_affiliation_string":"Laboratoire d'Informatique et d'Automatique pour les Syst\u00e8mes","institution_ids":["https://openalex.org/I4210116740"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111464986"],"corresponding_institution_ids":["https://openalex.org/I132053463","https://openalex.org/I4210161954"],"apc_list":null,"apc_paid":null,"fwci":2.89246637,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.9169981,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9994999766349792,"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.9994999766349792,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9962999820709229,"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/T10715","display_name":"Distributed and Parallel Computing Systems","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.7612105011940002},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6544294357299805},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.6310739517211914},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.6151018142700195},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5966204404830933},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5501717329025269},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5488229990005493},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5137027502059937},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.46330884099006653},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.43960848450660706},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4127786457538605},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38743385672569275},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.34822899103164673},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.31811457872390747},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1991007924079895}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7612105011940002},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6544294357299805},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6310739517211914},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.6151018142700195},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5966204404830933},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5501717329025269},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5488229990005493},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5137027502059937},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.46330884099006653},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.43960848450660706},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4127786457538605},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38743385672569275},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.34822899103164673},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.31811457872390747},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1991007924079895},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:19259","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LITES-v003-i001-a004","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"pmh:oai:arXiv.org:0805.3237","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0805.3237","pdf_url":"https://arxiv.org/pdf/0805.3237","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:ojs.dagstuhl.de:article/62","is_oa":true,"landing_page_url":"http://ojs.dagstuhl.de/index.php/lites/article/view/LITES-v003-i001-a004","pdf_url":"http://ojs.dagstuhl.de/index.php/lites/article/view/LITES-v003-i001-a004","source":{"id":"https://openalex.org/S4306401231","display_name":"Leibniz Transactions on Embedded Systems (Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Leibniz Transactions on Embedded Systems; Vol 3, No 1 (2016); 04:1-04:18","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:HAL:hal-03204299v1","is_oa":false,"landing_page_url":"https://hal.science/hal-03204299","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Leibniz Transactions on Embedded Systems, 2016, 3 (1), pp.1--18. ⟨10.4230/LITES-v003-i001-a004⟩","raw_type":"Journal articles"},{"id":"pmh:oai:doaj.org/article:815ff9bf89ce44fcbd5971adca4d1981","is_oa":false,"landing_page_url":"https://doaj.org/article/815ff9bf89ce44fcbd5971adca4d1981","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Leibniz Transactions on Embedded Systems, Vol 3, Iss 1, Pp 04:1-04:18 (2016)","raw_type":"article"},{"id":"doi:10.4230/lites-v003-i001-a004","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lites-v003-i001-a004","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:19259","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LITES-v003-i001-a004","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5899999737739563,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W34218136","https://openalex.org/W164978841","https://openalex.org/W189633613","https://openalex.org/W1504808146","https://openalex.org/W1510543252","https://openalex.org/W1556859836","https://openalex.org/W1558864477","https://openalex.org/W1570906644","https://openalex.org/W1968005108","https://openalex.org/W1973593109","https://openalex.org/W1977289603","https://openalex.org/W1978759686","https://openalex.org/W1982587869","https://openalex.org/W1996275534","https://openalex.org/W2011039300","https://openalex.org/W2012059473","https://openalex.org/W2033040247","https://openalex.org/W2037468202","https://openalex.org/W2045215405","https://openalex.org/W2054415527","https://openalex.org/W2056830486","https://openalex.org/W2058817479","https://openalex.org/W2089269509","https://openalex.org/W2092826427","https://openalex.org/W2101144036","https://openalex.org/W2101848567","https://openalex.org/W2108167744","https://openalex.org/W2109488193","https://openalex.org/W2116581888","https://openalex.org/W2124888010","https://openalex.org/W2128426273","https://openalex.org/W2132215926","https://openalex.org/W2148960429","https://openalex.org/W2156316099","https://openalex.org/W2156835553","https://openalex.org/W2168253093","https://openalex.org/W2480022109"],"related_works":["https://openalex.org/W1640420690","https://openalex.org/W2245286458","https://openalex.org/W2956094179","https://openalex.org/W2545511463","https://openalex.org/W2182592860","https://openalex.org/W2541348386","https://openalex.org/W2106332846","https://openalex.org/W27741389","https://openalex.org/W2172075652","https://openalex.org/W2050732033"],"abstract_inverted_index":{"The":[0,65,108],"gang":[1,85],"scheduling":[2,17,86],"of":[3,39,61,99],"parallel":[4,19],"implicit-deadline":[5],"periodic":[6],"task":[7],"systems":[8],"upon":[9],"identical":[10],"multiprocessor":[11],"platforms":[12],"is":[13,54,68,74,105,111,121,139],"considered.":[14],"In":[15],"this":[16],"problem,":[18],"tasks":[20],"use":[21],"several":[22],"processors":[23,100],"simultaneously.":[24],"We":[25],"propose":[26],"two":[27,43],"DPFAIR":[28,63],"(deadline":[29],"partitioning)":[30],"algorithms":[31,47,144],"that":[32,53,120],"schedule":[33,51,133],"all":[34],"jobs":[35],"in":[36,58,91,127],"every":[37,59],"interval":[38,60],"time":[40,93],"delimited":[41],"by":[42,141],"subsequent":[44],"deadlines.":[45],"These":[46],"define":[48],"a":[49,95,117],"static":[50],"pattern":[52],"stretched":[55],"at":[56],"run-time":[57],"the":[62,75,83],"schedule.":[64],"first":[66,76],"algorithm":[67,110,114],"based":[69,115],"on":[70,116],"linear":[71],"programming":[72],"and":[73,101],"one":[77],"to":[78,129],"be":[79],"proved":[80],"optimal":[81,132],"for":[82,94],"considered":[84],"problem.":[87],"Furthermore,":[88],"it":[89],"runs":[90],"polynomial":[92],"fixed":[96],"number":[97],"m":[98],"an":[102,112,131],"efficient":[103],"implementation":[104],"fully":[106],"detailed.":[107],"second":[109],"approximation":[113],"fixed-priority":[118],"rule":[119],"competitive":[122],"under":[123],"resource":[124],"augmentation":[125],"analysis":[126],"order":[128],"compute":[130],"pattern.":[134],"Precisely,":[135],"its":[136],"speedup":[137],"factor":[138],"bounded":[140],"(2-1/m).":[142],"Both":[143],"are":[145],"also":[146],"evaluated":[147],"through":[148],"intensive":[149],"numerical":[150],"experiments.":[151]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2}],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2016-06-24T00:00:00"}