{"id":"https://openalex.org/W2008768598","doi":"https://doi.org/10.1142/s0129626495000485","title":"AUTOMATIC DATA AND COMPUTATION DECOMPOSITION FOR DISTRIBUTED-MEMORY MACHINES","display_name":"AUTOMATIC DATA AND COMPUTATION DECOMPOSITION FOR DISTRIBUTED-MEMORY MACHINES","publication_year":1995,"publication_date":"1995-12-01","ids":{"openalex":"https://openalex.org/W2008768598","doi":"https://doi.org/10.1142/s0129626495000485","mag":"2008768598"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626495000485","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626495000485","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-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/A5055385237","display_name":"Ning Qi","orcid":"https://orcid.org/0000-0003-3265-276X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"QI NING","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109544155","display_name":"Vincent Van Dongen","orcid":null},"institutions":[{"id":"https://openalex.org/I4210111842","display_name":"Computer Research Institute of Montr\u00e9al","ror":"https://ror.org/0279d5115","country_code":"CA","type":"nonprofit","lineage":["https://openalex.org/I4210111842"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"VINCENT VAN DONGEN","raw_affiliation_strings":["Centre de Recherche Informatique de Montr\u00e9al, 1801 McGill Avenue, Bureau 800, Montreal, Quebec, Canada H3A 2N4, Canada"],"affiliations":[{"raw_affiliation_string":"Centre de Recherche Informatique de Montr\u00e9al, 1801 McGill Avenue, Bureau 800, Montreal, Quebec, Canada H3A 2N4, Canada","institution_ids":["https://openalex.org/I4210111842"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046024163","display_name":"Guang R. Gao","orcid":"https://orcid.org/0000-0002-5265-7528"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"GUANG R. GAO","raw_affiliation_strings":["School of Computer Science, McGill University, Montreal, Quebec, Canada H3A 2A7, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, McGill University, Montreal, Quebec, Canada H3A 2A7, Canada","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5055385237"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5735,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.84387404,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"05","issue":"04","first_page":"539","last_page":"550"},"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.9975000023841858,"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.9975000023841858,"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/T10772","display_name":"Distributed systems and fault tolerance","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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9961000084877014,"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/locality","display_name":"Locality","score":0.8054094314575195},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7632467150688171},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6685978174209595},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6491584777832031},{"id":"https://openalex.org/keywords/nesting","display_name":"Nesting (process)","score":0.6478314995765686},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5706764459609985},{"id":"https://openalex.org/keywords/distributed-memory","display_name":"Distributed memory","score":0.542965292930603},{"id":"https://openalex.org/keywords/loop-fission","display_name":"Loop fission","score":0.5149531960487366},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4767882823944092},{"id":"https://openalex.org/keywords/compile-time","display_name":"Compile time","score":0.4650503396987915},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.45514798164367676},{"id":"https://openalex.org/keywords/locality-of-reference","display_name":"Locality of reference","score":0.45436978340148926},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44366398453712463},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41112494468688965},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.3914766013622284},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.387405127286911},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.2293541431427002},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1896967887878418},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12888029217720032}],"concepts":[{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.8054094314575195},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7632467150688171},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6685978174209595},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6491584777832031},{"id":"https://openalex.org/C2776937656","wikidata":"https://www.wikidata.org/wiki/Q2229669","display_name":"Nesting (process)","level":2,"score":0.6478314995765686},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5706764459609985},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.542965292930603},{"id":"https://openalex.org/C134718785","wikidata":"https://www.wikidata.org/wiki/Q6675821","display_name":"Loop fission","level":3,"score":0.5149531960487366},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4767882823944092},{"id":"https://openalex.org/C200833197","wikidata":"https://www.wikidata.org/wiki/Q333707","display_name":"Compile time","level":3,"score":0.4650503396987915},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.45514798164367676},{"id":"https://openalex.org/C27602214","wikidata":"https://www.wikidata.org/wiki/Q1868547","display_name":"Locality of reference","level":3,"score":0.45436978340148926},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44366398453712463},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41112494468688965},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.3914766013622284},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.387405127286911},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.2293541431427002},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1896967887878418},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12888029217720032},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C191897082","wikidata":"https://www.wikidata.org/wiki/Q11467","display_name":"Metallurgy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1142/s0129626495000485","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626495000485","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.51.6385","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.6385","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.crim.ca/apar/public/Papers/1995/HICSS28-auto-decomp.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.96.4102","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.4102","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://csdl.computer.org/comp/proceedings/hicss/1995/6935/00/69350103.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2372170743","https://openalex.org/W1522390154","https://openalex.org/W2060252920","https://openalex.org/W2184725814","https://openalex.org/W4243449889","https://openalex.org/W1524612472","https://openalex.org/W2287909995","https://openalex.org/W2032540294","https://openalex.org/W2152238706","https://openalex.org/W2008768598"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"develop":[4],"an":[5],"automatic":[6],"compile-time":[7],"computation":[8],"and":[9,23,64,101],"data":[10,49,65,89,102],"decomposition":[11,63],"technique":[12],"for":[13],"distributed-memory":[14],"machines.":[15],"Our":[16,84],"method":[17],"handles":[18],"complex":[19],"programs":[20],"containing":[21],"perfect":[22],"non-perfect":[24],"loop":[25,45,61],"nests":[26],"with":[27],"or":[28],"without":[29],"loop-carried":[30],"dependences.":[31],"Applying":[32],"our":[33],"algorithms,":[34],"a":[35,71,93,97,126],"program":[36,112],"will":[37],"be":[38],"divided":[39],"into":[40],"collections":[41],"(called":[42],"clusters)":[43],"of":[44,60,73],"nests,":[46,62],"such":[47],"that":[48],"redistributions":[50],"are":[51,68,106],"allowed":[52],"only":[53],"between":[54,99],"the":[55,110,123],"clusters.":[56],"Within":[57],"each":[58],"cluster":[59,94],"locality":[66,90],"constraints":[67,91],"formulated":[69],"as":[70],"system":[72],"homogeneous":[74],"linear":[75],"equations":[76],"which":[77],"is":[78],"solved":[79],"by":[80,108],"polynomial":[81],"time":[82],"algorithms.":[83],"algorithm":[85],"can":[86],"selectively":[87],"relax":[88],"within":[92],"to":[95,117,121],"achieve":[96],"balance":[98],"parallelism":[100],"locality.":[103],"Such":[104],"relaxations":[105],"guided":[107],"exploiting":[109],"hierarchical":[111],"nesting":[113,119],"structures":[114],"from":[115],"outer":[116],"inner":[118],"levels":[120],"keep":[122],"communications":[124],"at":[125],"outer-most":[127],"level":[128],"possible.":[129]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}