{"id":"https://openalex.org/W4220682260","doi":"https://doi.org/10.1109/cgo53902.2022.9741269","title":"F3M: Fast Focused Function Merging","display_name":"F3M: Fast Focused Function Merging","publication_year":2022,"publication_date":"2022-03-29","ids":{"openalex":"https://openalex.org/W4220682260","doi":"https://doi.org/10.1109/cgo53902.2022.9741269"},"language":"en","primary_location":{"id":"doi:10.1109/cgo53902.2022.9741269","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cgo53902.2022.9741269","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.manchester.ac.uk/en/publications/efa57a82-a6f4-4589-86ab-4e8f80b7b9a5","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045678662","display_name":"Sean Stirling","orcid":null},"institutions":[{"id":"https://openalex.org/I4210128426","display_name":"Codeplay (United Kingdom)","ror":"https://ror.org/03g46y557","country_code":"GB","type":"company","lineage":["https://openalex.org/I4210128426"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Sean Stirling","raw_affiliation_strings":["Codeplay,United Kingdom","Codeplay, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Codeplay,United Kingdom","institution_ids":["https://openalex.org/I4210128426"]},{"raw_affiliation_string":"Codeplay, United Kingdom","institution_ids":["https://openalex.org/I4210128426"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015646723","display_name":"Rocha Rodrigo C. O.","orcid":null},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Rocha Rodrigo C. O.","raw_affiliation_strings":["University of Edinburgh,United Kingdom","University of Edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh,United Kingdom","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"University of Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046756907","display_name":"Kim Hazelwood","orcid":"https://orcid.org/0000-0002-2713-8507"},"institutions":[{"id":"https://openalex.org/I2252078561","display_name":"Meta (Israel)","ror":"https://ror.org/02388em19","country_code":"IL","type":"company","lineage":["https://openalex.org/I2252078561","https://openalex.org/I4210114444"]},{"id":"https://openalex.org/I4210114444","display_name":"Meta (United States)","ror":"https://ror.org/01zbnvs85","country_code":"US","type":"company","lineage":["https://openalex.org/I4210114444"]}],"countries":["IL","US"],"is_corresponding":false,"raw_author_name":"Kim Hazelwood","raw_affiliation_strings":["Facebook AI Research,United States","Facebook AI Research, United States"],"affiliations":[{"raw_affiliation_string":"Facebook AI Research,United States","institution_ids":["https://openalex.org/I2252078561","https://openalex.org/I4210114444"]},{"raw_affiliation_string":"Facebook AI Research, United States","institution_ids":["https://openalex.org/I4210114444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053757097","display_name":"Hugh Leather","orcid":"https://orcid.org/0000-0003-0664-4176"},"institutions":[{"id":"https://openalex.org/I4210114444","display_name":"Meta (United States)","ror":"https://ror.org/01zbnvs85","country_code":"US","type":"company","lineage":["https://openalex.org/I4210114444"]},{"id":"https://openalex.org/I2252078561","display_name":"Meta (Israel)","ror":"https://ror.org/02388em19","country_code":"IL","type":"company","lineage":["https://openalex.org/I2252078561","https://openalex.org/I4210114444"]}],"countries":["IL","US"],"is_corresponding":false,"raw_author_name":"Hugh Leather","raw_affiliation_strings":["Facebook AI Research,United States","Facebook AI Research, United States"],"affiliations":[{"raw_affiliation_string":"Facebook AI Research,United States","institution_ids":["https://openalex.org/I2252078561","https://openalex.org/I4210114444"]},{"raw_affiliation_string":"Facebook AI Research, United States","institution_ids":["https://openalex.org/I4210114444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027001025","display_name":"Michael O\u2019Boyle","orcid":"https://orcid.org/0000-0003-1619-5052"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Michael O'Boyle","raw_affiliation_strings":["University of Edinburgh,United Kingdom","University of Edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh,United Kingdom","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"University of Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074058311","display_name":"Pavlos Petoumenos","orcid":"https://orcid.org/0000-0002-1497-6536"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Pavlos Petoumenos","raw_affiliation_strings":["University of Manchester,United Kingdom","University of Manchester, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Manchester,United Kingdom","institution_ids":["https://openalex.org/I28407311"]},{"raw_affiliation_string":"University of Manchester, United Kingdom","institution_ids":["https://openalex.org/I28407311"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5045678662"],"corresponding_institution_ids":["https://openalex.org/I4210128426"],"apc_list":null,"apc_paid":null,"fwci":2.1227,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.89298164,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"242","last_page":"253"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9955999851226807,"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"}},"topics":[{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9955999851226807,"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"}},{"id":"https://openalex.org/T11241","display_name":"Advanced Malware Detection Techniques","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.8306047916412354},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5989640951156616},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.5785551071166992},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5519499182701111},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.5278477668762207},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.495096355676651},{"id":"https://openalex.org/keywords/compile-time","display_name":"Compile time","score":0.4403853714466095},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4286717474460602},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3694477081298828},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3457429111003876},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2275140881538391},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14152595400810242}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8306047916412354},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5989640951156616},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.5785551071166992},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5519499182701111},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5278477668762207},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.495096355676651},{"id":"https://openalex.org/C200833197","wikidata":"https://www.wikidata.org/wiki/Q333707","display_name":"Compile time","level":3,"score":0.4403853714466095},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4286717474460602},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3694477081298828},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3457429111003876},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2275140881538391},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14152595400810242},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/cgo53902.2022.9741269","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cgo53902.2022.9741269","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire/efa57a82-a6f4-4589-86ab-4e8f80b7b9a5","is_oa":true,"landing_page_url":"https://research.manchester.ac.uk/en/publications/efa57a82-a6f4-4589-86ab-4e8f80b7b9a5","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Stirling, S, Rocha, R C O, Hazelwood, K, Leather, H, O'Boyle, M F P & Petoumenos, P 2022, F3M: Fast Focused Function Merging. in 2022 IEEE/ACM International Symposium on Code Generation and Optimization (CGO). IEEE. https://doi.org/10.1109/CGO53902.2022.9741269","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/efa57a82-a6f4-4589-86ab-4e8f80b7b9a5","is_oa":true,"landing_page_url":"https://www.research.manchester.ac.uk/portal/en/publications/f3m-fast-focused-function-merging(efa57a82-a6f4-4589-86ab-4e8f80b7b9a5).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Stirling, S, Rocha, R C O, Hazelwood, K, Leather, H, O'Boyle, M F P & Petoumenos, P 2022, F3M: Fast Focused Function Merging. in 2022 IEEE/ACM International Symposium on Code Generation and Optimization (CGO). IEEE. https://doi.org/10.1109/CGO53902.2022.9741269","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/791c73e7-930f-4686-b99f-13e65b690489","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/791c73e7-930f-4686-b99f-13e65b690489","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Stirling, S, Rocha, R C O, Hazelwood, K, Leather, H, O\u2019Boyle, M & Petoumenos, P 2022, F3M: Fast Focused Function Merging. in J W Lee, S Hack & T Shpeisman (eds), 2022 IEEE/ACM International Symposium on Code Generation and Optimization (CGO). Institute of Electrical and Electronics Engineers, pp. 242-253, 2022 International Symposium on Code Generation and Optimization, 2/04/22. https://doi.org/10.1109/CGO53902.2022.9741269","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.ed.ac.uk:publications/791c73e7-930f-4686-b99f-13e65b690489","is_oa":false,"landing_page_url":"http://hdl.handle.net/20.500.11820/791c73e7-930f-4686-b99f-13e65b690489","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/efa57a82-a6f4-4589-86ab-4e8f80b7b9a5","is_oa":true,"landing_page_url":"https://research.manchester.ac.uk/en/publications/efa57a82-a6f4-4589-86ab-4e8f80b7b9a5","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Stirling, S, Rocha, R C O, Hazelwood, K, Leather, H, O'Boyle, M F P & Petoumenos, P 2022, F3M: Fast Focused Function Merging. in 2022 IEEE/ACM International Symposium on Code Generation and Optimization (CGO). IEEE. https://doi.org/10.1109/CGO53902.2022.9741269","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"score":0.4300000071525574,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320005","display_name":"Royal Academy of Engineering","ror":"https://ror.org/0526snb40"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W2005985523","https://openalex.org/W2038276547","https://openalex.org/W2068219251","https://openalex.org/W2100087302","https://openalex.org/W2107581073","https://openalex.org/W2132069633","https://openalex.org/W2162006472","https://openalex.org/W2191186815","https://openalex.org/W2329415855","https://openalex.org/W3033154127","https://openalex.org/W3137688009","https://openalex.org/W3174413148","https://openalex.org/W4235002328","https://openalex.org/W4248255691","https://openalex.org/W4252737723","https://openalex.org/W4297751151","https://openalex.org/W4301666354","https://openalex.org/W6632127042","https://openalex.org/W6679663036","https://openalex.org/W6701507010"],"related_works":["https://openalex.org/W2371266106","https://openalex.org/W2117382851","https://openalex.org/W3006505070","https://openalex.org/W2382449560","https://openalex.org/W2767298477","https://openalex.org/W2110432562","https://openalex.org/W2025344","https://openalex.org/W2117864619","https://openalex.org/W2090337950","https://openalex.org/W2104121286"],"abstract_inverted_index":{"From":[0],"IoT":[1],"devices":[2],"to":[3,24,41,54,178,189,204],"datacenters,":[4],"code":[5,26,107,144,176],"size":[6,145,177],"is":[7,18,46],"important,":[8],"motivating":[9],"ongoing":[10],"research":[11],"in":[12,195],"binary":[13],"reduction.":[14],"A":[15],"key":[16],"technique":[17,94],"the":[19,111,116,122,142,154],"merging":[20,138,158,173],"of":[21,156],"similar":[22,97],"functions":[23,34],"reduce":[25],"redundancy.":[27],"Success,":[28],"however,":[29],"depends":[30],"on":[31,77,121,161],"accurately":[32],"identifying":[33],"that":[35,104,129,184],"can":[36],"be":[37],"profitably":[38],"merged.":[39],"Attempting":[40],"merge":[42],"all":[43,81],"function":[44,157],"pairs":[45],"prohibitively":[47],"expensive.":[48],"Current":[49],"approaches,":[50],"therefore,":[51],"employ":[52],"summaries":[53,59],"estimate":[55],"similarity.":[56],"However":[57],"these":[58],"often":[60],"give":[61],"little":[62,188],"information":[63],"about":[64],"how":[65],"well":[66],"two":[67],"programs":[68],"will":[69],"merge.":[70],"To":[71],"make":[72],"things":[73],"worse,":[74],"they":[75],"rely":[76],"exhaustive":[78],"search":[79,117],"across":[80],"summaries;":[82],"impractical":[83],"for":[84,95,169],"realworld":[85],"programs.":[86],"In":[87],"this":[88],"work,":[89],"we":[90],"propose":[91],"a":[92,101,134],"new":[93],"matching":[96],"functions.":[98],"We":[99],"use":[100],"hash-based":[102],"approach":[103,186],"better":[105,135],"captures":[106],"similarity":[108,131],"and,":[109],"at":[110,180],"same":[112],"time,":[113],"significantly":[114],"reduces":[115,153],"space":[118],"by":[119,147,159,164,202],"focusing":[120],"most":[123],"promising":[124],"candidates.":[125],"Experimental":[126],"results":[127],"show":[128],"our":[130,185],"metric":[132],"has":[133],"correlation":[136],"with":[137],"profitability.":[139],"This":[140],"improves":[141],"average":[143,162],"reduction":[146],"6":[148],"percentage":[149],"points,":[150],"while":[151,194],"it":[152,198],"overhead":[155],"1.8x":[160],"and":[163,174],"as":[165,167],"much":[166],"597x":[168],"large":[170],"applications.":[171],"Faster":[172],"reduced":[175],"compile":[179,191],"later":[181],"stages":[182],"mean":[183],"introduces":[187],"no":[190],"time":[192],"overhead,":[193],"many":[196],"cases":[197],"makes":[199],"compilation":[200],"faster":[201],"up":[203],"30%.":[205]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}