{"id":"https://openalex.org/W2122553095","doi":"https://doi.org/10.1145/1176760.1176779","title":"Scalable subgraph mapping for acyclic computation accelerators","display_name":"Scalable subgraph mapping for acyclic computation accelerators","publication_year":2006,"publication_date":"2006-10-22","ids":{"openalex":"https://openalex.org/W2122553095","doi":"https://doi.org/10.1145/1176760.1176779","mag":"2122553095"},"language":"en","primary_location":{"id":"doi:10.1145/1176760.1176779","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1176760.1176779","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems","raw_type":"proceedings-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/A5021259549","display_name":"Nathan Clark","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nathan Clark","raw_affiliation_strings":["University of Michigan - Ann Arbor, MI"],"affiliations":[{"raw_affiliation_string":"University of Michigan - Ann Arbor, MI","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071212745","display_name":"Amir Hormati","orcid":"https://orcid.org/0009-0002-5786-3301"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amir Hormati","raw_affiliation_strings":["University of Michigan - Ann Arbor, MI"],"affiliations":[{"raw_affiliation_string":"University of Michigan - Ann Arbor, MI","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002075773","display_name":"Scott Mahlke","orcid":"https://orcid.org/0000-0002-0438-0616"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Scott Mahlke","raw_affiliation_strings":["University of Michigan - Ann Arbor, MI"],"affiliations":[{"raw_affiliation_string":"University of Michigan - Ann Arbor, MI","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026413671","display_name":"Sami Yehia","orcid":null},"institutions":[{"id":"https://openalex.org/I2801109035","display_name":"ARM (United Kingdom)","ror":"https://ror.org/04mmhzs81","country_code":"GB","type":"company","lineage":["https://openalex.org/I2801109035"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sami Yehia","raw_affiliation_strings":["ARM Ltd., Cambridge, United Kingdom"],"affiliations":[{"raw_affiliation_string":"ARM Ltd., Cambridge, United Kingdom","institution_ids":["https://openalex.org/I2801109035"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5021259549"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":4.541,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.94945591,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"147","last_page":"157"},"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.9991999864578247,"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.9991999864578247,"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.9984999895095825,"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.9969000220298767,"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.8601245880126953},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7575867176055908},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.7404723167419434},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5964276194572449},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5941530466079712},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5679178833961487},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.547034740447998},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4969530403614044},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3801378607749939},{"id":"https://openalex.org/keywords/computer-architecture","display_name":"Computer architecture","score":0.32204005122184753},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23867270350456238},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.12670093774795532}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8601245880126953},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7575867176055908},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.7404723167419434},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5964276194572449},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5941530466079712},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5679178833961487},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.547034740447998},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4969530403614044},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3801378607749939},{"id":"https://openalex.org/C118524514","wikidata":"https://www.wikidata.org/wiki/Q173212","display_name":"Computer architecture","level":1,"score":0.32204005122184753},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23867270350456238},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.12670093774795532},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1176760.1176779","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1176760.1176779","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.61.9653","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.9653","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cccp.eecs.umich.edu/papers/ntclark-cases06.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.96.8591","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.8591","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://samiyehia.free.fr/WebPage/clark_yehia_cases06.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1569554415","https://openalex.org/W1950173375","https://openalex.org/W2001854883","https://openalex.org/W2011039300","https://openalex.org/W2022341273","https://openalex.org/W2030224590","https://openalex.org/W2056477044","https://openalex.org/W2057455870","https://openalex.org/W2075921636","https://openalex.org/W2098363613","https://openalex.org/W2101285334","https://openalex.org/W2107923684","https://openalex.org/W2111578721","https://openalex.org/W2114104081","https://openalex.org/W2120142281","https://openalex.org/W2120525597","https://openalex.org/W2123352201","https://openalex.org/W2126359798","https://openalex.org/W2130703378","https://openalex.org/W2130766965","https://openalex.org/W2132660104","https://openalex.org/W2136937603","https://openalex.org/W2145946269","https://openalex.org/W2148911285","https://openalex.org/W2149726289","https://openalex.org/W2152631561","https://openalex.org/W2154051217","https://openalex.org/W2155509874","https://openalex.org/W2165099691","https://openalex.org/W2169406908","https://openalex.org/W2535965777","https://openalex.org/W4250370106"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W2768256330","https://openalex.org/W2295196644","https://openalex.org/W121182129"],"abstract_inverted_index":{"Computer":[0],"architects":[1],"are":[2,115],"constantly":[3],"faced":[4],"with":[5,40,87],"the":[6,13,99,106],"need":[7],"to":[8,27,43,51,85,117,139],"improve":[9],"performance":[10],"and":[11,62,123,137],"increase":[12],"efficiency":[14],"of":[15,159],"computation":[16],"in":[17,33,102,150],"their":[18],"designs.":[19,36],"To":[20],"this":[21,76,103],"end,":[22],"it":[23,48,68],"is":[24,46,49,60,69,120],"increasingly":[25],"common":[26],"see":[28],"acyclic":[29,88],"com-putation":[30],"accelerators":[31,42],"appear":[32],"embedded":[34],"processor":[35],"One":[37],"major":[38],"problem":[39],"adding":[41],"a":[44],"design":[45,108],"that":[47,132],"difficult":[50],"generate":[52],"high-quality":[53],"code":[54,59,131],"utilizing":[55],"them.":[56],"Hand-written":[57],"assembly":[58],"typical,":[61],"if":[63],"compiler":[64],"support":[65],"does":[66],"exist,":[67],"implemented":[70],"using":[71],"only":[72,94],"greedy":[73,92,144],"algorithms.":[74],"In":[75],"work,":[77],"we":[78],"investigate":[79],"more":[80,156],"thorough":[81],"techniques":[82,100],"for":[83,155],"compiling":[84],"processors":[86],"accelerators.":[89],"Where":[90],"as":[91],"solutions":[93],"explore":[95,105],"one":[96,153],"possible":[97],"solution,":[98],"presented":[101],"paper":[104],"entire":[107],"space,":[109],"when":[110],"possible.":[111],"Intelligent":[112],"pruning":[113],"methods":[114],"employed":[116],"ensure":[118],"compilation":[119,128],"both":[121],"tractable":[122],"scalable.":[124],"Overall,":[125],"our":[126],"new":[127],"algorithms":[129,147],"produce":[130],"performs":[133],"on":[134],"average":[135],"10%,":[136],"up":[138],"32%":[140],"better":[141],"than":[142,152,157],"standard":[143],"methods.":[145],"These":[146],"also":[148],"run":[149],"less":[151],"second":[154],"98%":[158],"basic":[160],"blocks":[161],"tested.":[162]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}