{"id":"https://openalex.org/W4290714163","doi":"https://doi.org/10.1109/tc.2022.3197094","title":"ROLLED: <u>R</u>acetrack Memory <u>O</u>ptimized <u>L</u>inear <u>L</u>ayout and <u>E</u>fficient <u>D</u>ecomposition of Decision Trees","display_name":"ROLLED: <u>R</u>acetrack Memory <u>O</u>ptimized <u>L</u>inear <u>L</u>ayout and <u>E</u>fficient <u>D</u>ecomposition of Decision Trees","publication_year":2022,"publication_date":"2022-08-08","ids":{"openalex":"https://openalex.org/W4290714163","doi":"https://doi.org/10.1109/tc.2022.3197094"},"language":"en","primary_location":{"id":"doi:10.1109/tc.2022.3197094","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tc.2022.3197094","pdf_url":"https://ieeexplore.ieee.org/ielx7/12/4358213/09851943.pdf","source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://ieeexplore.ieee.org/ielx7/12/4358213/09851943.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026855001","display_name":"Christian Hakert","orcid":"https://orcid.org/0000-0001-9992-9415"},"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":"Christian Hakert","raw_affiliation_strings":["Department of Computer Science, Technische Universitat Dortmund, Dortmund, Germany"],"raw_orcid":"https://orcid.org/0000-0001-9992-9415","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technische Universitat Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090070224","display_name":"Asif Ali Khan","orcid":"https://orcid.org/0000-0002-5130-9855"},"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":"Asif Ali Khan","raw_affiliation_strings":["Department of Computer Science, Technische Universitat Dortmund, Dortmund, Germany"],"raw_orcid":"https://orcid.org/0000-0002-5130-9855","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technische Universitat Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040715141","display_name":"Kuan-Hsun Chen","orcid":"https://orcid.org/0000-0002-7110-921X"},"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":"Kuan-Hsun Chen","raw_affiliation_strings":["Informatik 12, TU-Dortmund, Dortmund, Germany"],"raw_orcid":"https://orcid.org/0000-0002-7110-921X","affiliations":[{"raw_affiliation_string":"Informatik 12, TU-Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070038996","display_name":"Fazal Hameed","orcid":"https://orcid.org/0000-0002-2763-8755"},"institutions":[{"id":"https://openalex.org/I197827452","display_name":"Institute of Space Technology","ror":"https://ror.org/01tmmzv45","country_code":"PK","type":"education","lineage":["https://openalex.org/I197827452"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Fazal Hameed","raw_affiliation_strings":["Department of Electrical Engineering, Institute of Space Technology, Islamabad, Pakistan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Institute of Space Technology, Islamabad, Pakistan","institution_ids":["https://openalex.org/I197827452"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030115692","display_name":"Jer\u00f3nimo Castrill\u00f3n","orcid":"https://orcid.org/0000-0002-5007-445X"},"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":"Jeronimo Castrillon","raw_affiliation_strings":["Department of Computer Science, Technische Universitat Dortmund, Dortmund, Germany"],"raw_orcid":"https://orcid.org/0000-0002-5007-445X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technische Universitat Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","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":["Design Automation of Embedded Systems, TU Dortmund, Dortmund, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Design Automation of Embedded Systems, TU Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2197,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.77231995,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"72","issue":"5","first_page":"1488","last_page":"1502"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.6948881149291992},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5034417510032654},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4996459484100342},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.4726506769657135},{"id":"https://openalex.org/keywords/energy-consumption","display_name":"Energy consumption","score":0.4624936878681183},{"id":"https://openalex.org/keywords/power-consumption","display_name":"Power consumption","score":0.44551989436149597},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.43777960538864136},{"id":"https://openalex.org/keywords/decision-tree","display_name":"Decision tree","score":0.4200509786605835},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3700566589832306},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.23664233088493347},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23254665732383728},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1964622437953949},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12595781683921814},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.10044413805007935},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08984455466270447}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6948881149291992},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5034417510032654},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4996459484100342},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.4726506769657135},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.4624936878681183},{"id":"https://openalex.org/C2984118289","wikidata":"https://www.wikidata.org/wiki/Q29954","display_name":"Power consumption","level":3,"score":0.44551989436149597},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.43777960538864136},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.4200509786605835},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3700566589832306},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.23664233088493347},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23254665732383728},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1964622437953949},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12595781683921814},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.10044413805007935},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08984455466270447},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tc.2022.3197094","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tc.2022.3197094","pdf_url":"https://ieeexplore.ieee.org/ielx7/12/4358213/09851943.pdf","source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:openaire/579ee6ad-a9a6-484f-b094-90bbb611b30d","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/579ee6ad-a9a6-484f-b094-90bbb611b30d","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Hakert, C, Khan, A A, Chen, K, Hameed, F, Castrillon, J & Chen, J-J 2023, 'ROLLED : Racetrack Memory Optimized Linear Layout and Efficient Decomposition of Decision Trees', IEEE transactions on computers, vol. 72, no. 5, pp. 1488-1502. https://doi.org/10.1109/TC.2022.3197094","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:ris.utwente.nl:publications/579ee6ad-a9a6-484f-b094-90bbb611b30d","is_oa":true,"landing_page_url":"https://research.utwente.nl/files/346392346/ROLLED_Racetrack_Memory_Optimized_Linear_Layout_and_Efficient_Decomposition_of_Decision_Trees.pdf","pdf_url":"https://ris.utwente.nl/ws/files/346392346/ROLLED_Racetrack_Memory_Optimized_Linear_Layout_and_Efficient_Decomposition_of_Decision_Trees.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hakert, C, Khan, A A, Chen, K, Hameed, F, Castrillon, J & Chen, J-J 2023, 'ROLLED : Racetrack Memory Optimized Linear Layout and Efficient Decomposition of Decision Trees', IEEE transactions on computers, vol. 72, no. 5, pp. 1488-1502. https://doi.org/10.1109/TC.2022.3197094","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1109/tc.2022.3197094","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tc.2022.3197094","pdf_url":"https://ieeexplore.ieee.org/ielx7/12/4358213/09851943.pdf","source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.9200000166893005,"id":"https://metadata.un.org/sdg/7"}],"awards":[{"id":"https://openalex.org/G1781150893","display_name":"CompilerOptimierung f\u00fcr RTMbasierte Rechensysteme","funder_award_id":"450944241","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G1917707656","display_name":"Methodik, die basierend auf die Analyse von Ausf\u00fchrungsTraces von Anwendungen und Problemsymmetrien eine bessere Abbildung auf heterogene MultiprozessorSysteme erm\u00f6glicht","funder_award_id":"366764507","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G3374201210","display_name":"Entwurf und Architektur f\u00fcr Racetrack basierte Hybrid Speichersysteme","funder_award_id":"437232907","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G3988035882","display_name":"SFB 876: Verf\u00fcgbarkeit von Information durch Analyse unter Ressourcenbeschr\u00e4nkung","funder_award_id":"124020371","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G4104976561","display_name":"Design und Optimierung von nichtfl\u00fcchtigen Einspeicherarchitekturen","funder_award_id":"405422836","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G617271991","display_name":null,"funder_award_id":"SFB876","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4290714163.pdf","grobid_xml":"https://content.openalex.org/works/W4290714163.grobid-xml"},"referenced_works_count":43,"referenced_works":["https://openalex.org/W168643453","https://openalex.org/W1602793287","https://openalex.org/W1935056755","https://openalex.org/W1975695617","https://openalex.org/W1992058205","https://openalex.org/W1992775315","https://openalex.org/W2005242923","https://openalex.org/W2007339694","https://openalex.org/W2011039300","https://openalex.org/W2012951995","https://openalex.org/W2017836239","https://openalex.org/W2033631673","https://openalex.org/W2050628119","https://openalex.org/W2055803638","https://openalex.org/W2064535593","https://openalex.org/W2079966248","https://openalex.org/W2105433081","https://openalex.org/W2156507858","https://openalex.org/W2299560900","https://openalex.org/W2313799937","https://openalex.org/W2320746669","https://openalex.org/W2332575196","https://openalex.org/W2364162979","https://openalex.org/W2733186554","https://openalex.org/W2907415261","https://openalex.org/W2955510233","https://openalex.org/W2969383588","https://openalex.org/W2971735931","https://openalex.org/W2971784102","https://openalex.org/W2997591727","https://openalex.org/W3013588319","https://openalex.org/W3036842261","https://openalex.org/W3120740533","https://openalex.org/W3121235808","https://openalex.org/W3214446523","https://openalex.org/W4234969462","https://openalex.org/W4249436712","https://openalex.org/W4288083819","https://openalex.org/W4301046644","https://openalex.org/W6662160204","https://openalex.org/W6670089854","https://openalex.org/W6680320015","https://openalex.org/W6732554391"],"related_works":["https://openalex.org/W2938514635","https://openalex.org/W2049261842","https://openalex.org/W4360764540","https://openalex.org/W4231657010","https://openalex.org/W2007917622","https://openalex.org/W1994552539","https://openalex.org/W2983245704","https://openalex.org/W2385305544","https://openalex.org/W2159099865","https://openalex.org/W2166666222"],"abstract_inverted_index":{"Modern":[0],"low":[1],"power":[2],"distributed":[3],"systems":[4],"tend":[5],"to":[6,20,32,49,56,68,93,169,173,192,204],"integrate":[7],"machine":[8],"learning":[9],"algorithms.":[10],"In":[11],"resource-constrained":[12],"setups,":[13],"the":[14,17,70,97,149,156,160,174,185,195,200],"execution":[15],"of":[16,73,100,187],"models":[18,138],"has":[19],"be":[21],"optimized":[22],"for":[23,139],"performance":[24],"and":[25,44,64,118,124,151],"energy":[26,46,201],"consumption.":[27,47],"Racetrack":[28],"memory":[29],"(RTM)":[30],"promises":[31],"achieve":[33],"these":[34],"goals":[35],"by":[36],"offering":[37],"unprecedented":[38],"integration":[39],"density,":[40],"smaller":[41],"access":[42,50,87],"latency,":[43],"reduced":[45],"However,":[48],"data":[51],"in":[52,75,84,194,199],"RTM,":[53],"it":[54],"needs":[55],"beshiftedto":[57],"theaccess":[58],"portfirst.":[59],"We":[60,89,134,163],"investigate":[61],"decision":[62,127],"trees":[63,78],"develop":[65],"placement":[66,109,176],"strategies":[67,177],"reduce":[69,184],"total":[71,98],"number":[72,99,186],"shifts":[74,101,188],"RTM.":[76],"Decision":[77],"allow":[79],"profiling":[80],"during":[81],"training,":[82],"resulting":[83],"tree":[85,91,113,128],"paths&#x0027;":[86],"probabilities.":[88],"map":[90],"nodes":[92,114,129],"RTM":[94,122,132],"so":[95],"that":[96,182],"is":[102],"minimal.":[103],"Concretely,":[104],"we":[105,142],"present":[106],"two":[107],"different":[108],"approaches:":[110],"1)":[111],"where":[112,126],"are":[115],"closely":[116],"packed":[117],"placeduniformlyin":[119],"a":[120,165,205],"single":[121],"location":[123],"2)":[125],"aredecomposedto":[130],"separate":[131],"blocks.":[133],"discuss":[135],"theoretical":[136],"cost":[137],"both":[140],"approaches,":[141],"formally":[143],"prove":[144],"an":[145,152],"upper":[146,153],"bound":[147,154],"of$4\\times$for":[148],"unified":[150],"of$12\\times$for":[155],"decomposed":[157],"organization":[158],"towards":[159],"optimal":[161],"placement.":[162],"conduct":[164],"thorough":[166],"experimental":[167,179],"evaluation":[168],"compare":[170],"our":[171],"algorithms":[172],"state-of-the-art":[175],"Our":[178],"evaluations":[180],"show":[181],"theunifiedanddecomposedsolutions":[183],"by$58.1\\%$and$80.1\\%$,":[189],"respectively,":[190],"leading":[191],"a$53.8\\%$and$46.3\\%$reduction":[193],"overall":[196],"runtime":[197],"and$52.6\\%$and$61.7\\%$reduction":[198],"consumption,":[202],"compared":[203],"naive":[206],"baseline.":[207]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}