{"id":"https://openalex.org/W2890953589","doi":"https://doi.org/10.4230/lipics.isaac.2018.71","title":"Packing sporadic real-time tasks on identical multiprocessor systems","display_name":"Packing sporadic real-time tasks on identical multiprocessor systems","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2890953589","doi":"https://doi.org/10.4230/lipics.isaac.2018.71","mag":"2890953589"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://arxiv.org/pdf/1809.04355.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-article","indexed_in":[],"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/A5000417436","display_name":"Jian-Jia Chen","orcid":"https://orcid.org/0000-0001-8114-9760"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jian Jia Chen","raw_affiliation_strings":["Universit\u00e4t Dortmund#TAB#"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Dortmund#TAB#","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I2799411422","display_name":"Center for Discrete Mathematics and Theoretical Computer Science","ror":"https://ror.org/00k551w06","country_code":"US","type":"facility","lineage":["https://openalex.org/I102322142","https://openalex.org/I118347220","https://openalex.org/I1283103587","https://openalex.org/I1311060795","https://openalex.org/I20089843","https://openalex.org/I2799411422","https://openalex.org/I4210107353"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["Discrete Mathematics"],"affiliations":[{"raw_affiliation_string":"Discrete Mathematics","institution_ids":["https://openalex.org/I2799411422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100737286","display_name":"Samarjit Chakraborty","orcid":"https://orcid.org/0000-0002-0503-6235"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Samarjit Chakraborty","raw_affiliation_strings":["Technical University of Munich"],"affiliations":[{"raw_affiliation_string":"Technical University of Munich","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004024181","display_name":"Georg von der Br\u00fcggen","orcid":"https://orcid.org/0000-0002-8137-3612"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Georg Von Der Br\u00fcggen","raw_affiliation_strings":["Universit\u00e4t Dortmund#TAB#"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Dortmund#TAB#","institution_ids":["https://openalex.org/I200332995"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":62},"biblio":{"volume":null,"issue":null,"first_page":"71","last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9989,"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.9989,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9967,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9823,"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":[],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7521612},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7260801},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6548626},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5909901},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5838611},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5511718},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5195894},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.49517146},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4353606},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29269975},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28954804},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.28552622},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1883241},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.078857064},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://arxiv.org/pdf/1809.04355.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.42,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2997221951","https://openalex.org/W2980563077","https://openalex.org/W2964252584","https://openalex.org/W2951357266","https://openalex.org/W2919418351","https://openalex.org/W2596459939","https://openalex.org/W2505476378","https://openalex.org/W2402392918","https://openalex.org/W235936801","https://openalex.org/W2293605332","https://openalex.org/W2290120017","https://openalex.org/W2187958045","https://openalex.org/W2180298277","https://openalex.org/W2172633189","https://openalex.org/W2108309043","https://openalex.org/W2012787754","https://openalex.org/W2003792898","https://openalex.org/W1555563977","https://openalex.org/W1551866376","https://openalex.org/W124979004"],"abstract_inverted_index":{"In":[0],"real-time":[1,29],"systems,":[2,30],"in":[3,28,77,125,155],"addition":[4],"to":[5,15,55,141,148],"the":[6,17,21,32,51,58,78,127,133,137,142,146,149,156,180,196,203,213,216],"functional":[7],"correctness":[8],"recurrent":[9],"tasks":[10,33,62],"must":[11],"fulfill":[12],"timing":[13,43],"constraints":[14,44,60],"ensure":[16],"correct":[18],"behavior":[19],"of":[20,50,61,70,103,145,152,206,215],"system.":[22],"Partitioned":[23],"scheduling":[24],"is":[25,54,209],"widely":[26],"used":[27],"i.e.,":[31,93,202],"are":[34,45,86,130,139],"statically":[35],"assigned":[36],"onto":[37],"processors":[38],"while":[39],"ensuring":[40],"that":[41,112,163,179],"all":[42],"met.":[46],"The":[47],"decision":[48],"version":[49],"problem,":[52],"which":[53,126],"check":[56],"whether":[57],"deadline":[59,151,205],"can":[63],"be":[64],"satisfied":[65],"on":[66,83,88],"a":[67,110,153,169,207],"given":[68,157],"number":[69],"identical":[71],"processors,":[72,109],"has":[73,113,199],"been":[74,115],"known":[75],"NP-complete":[76],"strong":[79],"sense.":[80],"Several":[81],"studies":[82,100],"this":[84],"problem":[85,181],"based":[87],"approximations":[89],"involving":[90],"resource":[91,104],"augmentation,":[92],"speeding":[94],"up":[95],"individual":[96],"processors.":[97],"This":[98],"paper":[99],"another":[101],"type":[102],"augmentation":[105],"by":[106],"allocating":[107],"additional":[108],"topic":[111],"not":[114,183],"explored":[116],"until":[117],"recently.":[118],"We":[119,160],"provide":[120],"polynomial-time":[121,187],"algorithms":[122,165],"and":[123],"analysis,":[124],"approximation":[128,171,188],"factors":[129,138],"dependent":[131],"upon":[132],"input":[134],"instances.":[135],"Specifically,":[136],"related":[140],"maximum":[143],"ratio":[144],"period":[147,214],"relative":[150,204],"task":[154,158,197,208],"set.":[159],"also":[161],"show":[162],"these":[164],"unfortunately":[166],"cannot":[167],"achieve":[168],"constant":[170],"factor":[172],"for":[173],"general":[174],"cases.":[175],"Furthermore,":[176],"we":[177],"prove":[178],"does":[182],"admit":[184],"any":[185],"asymptotic":[186],"scheme":[189],"(APTAS)":[190],"unless":[191],"P":[192],"=":[193],"NP":[194],"when":[195],"set":[198],"constrained":[200],"deadlines,":[201],"no":[210],"more":[211],"than":[212],"task.":[217]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2890953589","counts_by_year":[],"updated_date":"2024-12-15T05:57:08.263464","created_date":"2018-09-27"}