{"id":"https://openalex.org/W7096899363","doi":null,"title":"Efficient code generation for automatic parallelization and optimization (long version","display_name":"Efficient code generation for automatic parallelization and optimization (long version","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7096899363"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.162.1737","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.162.1737","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lri.fr/~bastoul/research/papers/Bas03-ISPDC.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7096899363"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5024483254","display_name":"C\u00e9dric Bastoul","orcid":"https://orcid.org/0000-0002-7164-8213","observed_orcids":["https://orcid.org/0000-0002-7164-8213"]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"C\u00e9dric Bastoul","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5024483254"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"reviewed_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9976000189781189,"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.9976000189781189,"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.0010000000474974513,"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.0003000000142492354,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/polyhedral-models","display_name":"polyhedral models","score":0.8429999947547913},{"id":"https://openalex.org/keywords/code-generation","display_name":"code generation","score":0.7820000052452087},{"id":"https://openalex.org/keywords/automatic-parallelization","display_name":"automatic parallelization","score":0.8799999952316284},{"id":"https://openalex.org/keywords/program-optimization","display_name":"program optimization","score":0.8059999942779541},{"id":"https://openalex.org/keywords/program-transformation","display_name":"program transformation","score":0.4909999966621399},{"id":"https://openalex.org/keywords/execution-order","display_name":"execution order","score":0.4429999887943268}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7901999950408936},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.6409000158309937},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6031000018119812},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5674999952316284},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.5055999755859375},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.49810001254081726},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.478300005197525},{"id":"https://openalex.org/C164833996","wikidata":"https://www.wikidata.org/wiki/Q2323839","display_name":"Automatic parallelization","level":3,"score":0.4512999951839447},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.43389999866485596},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43149998784065247},{"id":"https://openalex.org/C96442724","wikidata":"https://www.wikidata.org/wiki/Q242188","display_name":"Invertible matrix","level":2,"score":0.4235000014305115},{"id":"https://openalex.org/C113391598","wikidata":"https://www.wikidata.org/wiki/Q1681391","display_name":"Polytope model","level":3,"score":0.4140999913215637},{"id":"https://openalex.org/C201958917","wikidata":"https://www.wikidata.org/wiki/Q1367055","display_name":"Unimodular matrix","level":2,"score":0.397599995136261},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39309999346733093},{"id":"https://openalex.org/C2777026412","wikidata":"https://www.wikidata.org/wiki/Q2684591","display_name":"Statement (logic)","level":2,"score":0.3864000141620636},{"id":"https://openalex.org/C139571649","wikidata":"https://www.wikidata.org/wiki/Q1156793","display_name":"Program optimization","level":3,"score":0.3849000036716461},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.3578000068664551},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.3312000036239624},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.32760000228881836},{"id":"https://openalex.org/C47434764","wikidata":"https://www.wikidata.org/wiki/Q1770035","display_name":"Dead code","level":5,"score":0.30059999227523804},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.2989000082015991},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.29490000009536743},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2786000072956085}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.162.1737","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.162.1737","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lri.fr/~bastoul/research/papers/Bas03-ISPDC.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2169049142","https://openalex.org/W2076485607","https://openalex.org/W2141667686","https://openalex.org/W7096347409","https://openalex.org/W162841629","https://openalex.org/W1486289306","https://openalex.org/W4242314113","https://openalex.org/W1533186609","https://openalex.org/W2298668594","https://openalex.org/W7095879916"],"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],"I":[118]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7096899363","counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2025-10-27T00:00:00"}
