{"id":"https://openalex.org/W2169049142","doi":"https://doi.org/10.1109/ispdc.2003.1267639","title":"Efficient code generation for automatic parallelization and optimization","display_name":"Efficient code generation for automatic parallelization and optimization","publication_year":2004,"publication_date":"2004-07-08","ids":{"openalex":"https://openalex.org/W2169049142","doi":"https://doi.org/10.1109/ispdc.2003.1267639","mag":"2169049142"},"language":"en","primary_location":{"id":"doi:10.1109/ispdc.2003.1267639","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispdc.2003.1267639","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","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/A5024483254","display_name":"C\u00e9dric Bastoul","orcid":"https://orcid.org/0000-0002-7164-8213"},"institutions":[{"id":"https://openalex.org/I195731000","display_name":"Universit\u00e9 de Versailles Saint-Quentin-en-Yvelines","ror":"https://ror.org/03mkjjy25","country_code":"FR","type":"education","lineage":["https://openalex.org/I195731000","https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"C. Bastoul","raw_affiliation_strings":["Laboratoire PRiSM, Universit\u00e9 de Versailles Saint Quentin en Yvelines, Versailles, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire PRiSM, Universit\u00e9 de Versailles Saint Quentin en Yvelines, Versailles, France","institution_ids":["https://openalex.org/I195731000"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5024483254"],"corresponding_institution_ids":["https://openalex.org/I195731000"],"apc_list":null,"apc_paid":null,"fwci":3.9496,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.93579538,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"24","issue":null,"first_page":"23","last_page":"30"},"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.9998999834060669,"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.9998999834060669,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10142","display_name":"Formal Methods in Verification","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.8107068538665771},{"id":"https://openalex.org/keywords/unimodular-matrix","display_name":"Unimodular matrix","score":0.807965874671936},{"id":"https://openalex.org/keywords/invertible-matrix","display_name":"Invertible matrix","score":0.6909257769584656},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.6741260886192322},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5977739095687866},{"id":"https://openalex.org/keywords/statement","display_name":"Statement (logic)","score":0.5724086165428162},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.5700880289077759},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5647929310798645},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.5572046637535095},{"id":"https://openalex.org/keywords/polytope-model","display_name":"Polytope model","score":0.5537145733833313},{"id":"https://openalex.org/keywords/program-transformation","display_name":"Program transformation","score":0.47899624705314636},{"id":"https://openalex.org/keywords/automatic-parallelization","display_name":"Automatic parallelization","score":0.47762531042099},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.47579631209373474},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3976789116859436},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37952905893325806},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.32583826780319214},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.13631382584571838},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13442528247833252},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.12327557802200317},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1019248366355896}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8107068538665771},{"id":"https://openalex.org/C201958917","wikidata":"https://www.wikidata.org/wiki/Q1367055","display_name":"Unimodular matrix","level":2,"score":0.807965874671936},{"id":"https://openalex.org/C96442724","wikidata":"https://www.wikidata.org/wiki/Q242188","display_name":"Invertible matrix","level":2,"score":0.6909257769584656},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.6741260886192322},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5977739095687866},{"id":"https://openalex.org/C2777026412","wikidata":"https://www.wikidata.org/wiki/Q2684591","display_name":"Statement (logic)","level":2,"score":0.5724086165428162},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.5700880289077759},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5647929310798645},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.5572046637535095},{"id":"https://openalex.org/C113391598","wikidata":"https://www.wikidata.org/wiki/Q1681391","display_name":"Polytope model","level":3,"score":0.5537145733833313},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.47899624705314636},{"id":"https://openalex.org/C164833996","wikidata":"https://www.wikidata.org/wiki/Q2323839","display_name":"Automatic parallelization","level":3,"score":0.47762531042099},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.47579631209373474},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3976789116859436},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37952905893325806},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.32583826780319214},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.13631382584571838},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13442528247833252},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.12327557802200317},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1019248366355896},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ispdc.2003.1267639","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispdc.2003.1267639","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1500590019","https://openalex.org/W1530670596","https://openalex.org/W1533186609","https://openalex.org/W1776224102","https://openalex.org/W1887913568","https://openalex.org/W1963547452","https://openalex.org/W1963741373","https://openalex.org/W1978762859","https://openalex.org/W1995270665","https://openalex.org/W2011771274","https://openalex.org/W2041294870","https://openalex.org/W2068562880","https://openalex.org/W2074367725","https://openalex.org/W2074559757","https://openalex.org/W2099758780","https://openalex.org/W2132661148","https://openalex.org/W2340604309","https://openalex.org/W2983923412","https://openalex.org/W4233558979","https://openalex.org/W4242314113","https://openalex.org/W4256280803","https://openalex.org/W6637804602","https://openalex.org/W6668983122"],"related_works":["https://openalex.org/W1504751168","https://openalex.org/W2103286319","https://openalex.org/W3146625038","https://openalex.org/W159510654","https://openalex.org/W162841629","https://openalex.org/W2623604894","https://openalex.org/W2099758780","https://openalex.org/W2125802230","https://openalex.org/W2467023998","https://openalex.org/W2299981426"],"abstract_inverted_index":{"Supercompilers":[0],"look":[1],"for":[2,45,62],"the":[3,8,12,23,33,38,92,103,109],"best":[4,93],"execution":[5],"order":[6],"of":[7,89,91,111],"statement":[9],"instances":[10],"in":[11],"most":[13],"compute":[14],"intensive":[15],"kernels.":[16],"It":[17],"has":[18],"been":[19],"extensively":[20],"shown":[21],"that":[22],"polyhedral":[24,40],"model":[25],"provides":[26],"convenient":[27],"abstractions":[28],"to":[29,78,100,114],"find":[30],"and":[31,86],"perform":[32,102],"useful":[34],"program":[35],"transformations.":[36],"Nevertheless,":[37],"current":[39],"code":[41,104],"generation":[42],"algorithms":[43,94],"lack":[44],"flexibility":[46],"by":[47],"adressing":[48],"mainly":[49],"unimodular":[50],"or":[51],"at":[52],"least":[53],"invertible":[54],"transformation":[55,75],"functions.":[56,83],"Moreover,":[57],"their":[58],"complexity":[59],"is":[60,98],"challenging":[61],"large":[63],"problems":[64],"(with":[65],"many":[66],"statements).":[67],"In":[68],"this":[69],"paper,":[70],"we":[71],"discuss":[72],"a":[73],"general":[74],"framework":[76,113],"able":[77],"deal":[79],"with":[80],"non-unimodular,":[81],"non-invertible":[82],"A":[84],"completed":[85],"improved":[87],"version":[88],"one":[90],"known":[95],"so":[96],"far":[97],"presented":[99],"actually":[101],"generation.":[105],"Experimental":[106],"evidence":[107],"proves":[108],"ability":[110],"our":[112],"handle":[115],"real-life":[116],"problems.":[117]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}