{"id":"https://openalex.org/W1604135785","doi":"https://doi.org/10.1109/icppw.2002.1039785","title":"An efficient algorithm for computing communication sets for data parallel programs with block-cyclic distribution","display_name":"An efficient algorithm for computing communication sets for data parallel programs with block-cyclic distribution","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W1604135785","doi":"https://doi.org/10.1109/icppw.2002.1039785","mag":"1604135785"},"language":"en","primary_location":{"id":"doi:10.1109/icppw.2002.1039785","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icppw.2002.1039785","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Conference on Parallel Processing Workshop","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/A5036614797","display_name":"Gwan\u2010Hwan Hwang","orcid":"https://orcid.org/0000-0003-3333-8190"},"institutions":[{"id":"https://openalex.org/I134161618","display_name":"National Taiwan Normal University","ror":"https://ror.org/059dkdx38","country_code":"TW","type":"education","lineage":["https://openalex.org/I134161618"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Gwan-Hwan Hwang","raw_affiliation_strings":["Department of Information and Computer Education, National Taiwan Normal University, Taipei, Taiwan","[Dept. of Inf. & Comput. Educ., Nat. Taiwan Normal Univ., Taipei, Taiwan]"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computer Education, National Taiwan Normal University, Taipei, Taiwan","institution_ids":["https://openalex.org/I134161618"]},{"raw_affiliation_string":"[Dept. of Inf. & Comput. Educ., Nat. Taiwan Normal Univ., Taipei, Taiwan]","institution_ids":["https://openalex.org/I134161618"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5036614797"],"corresponding_institution_ids":["https://openalex.org/I134161618"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06673161,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"623","last_page":"631"},"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.9997000098228455,"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.9997000098228455,"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/T11269","display_name":"Algorithms and Data Compression","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/T10829","display_name":"Interconnection Networks and Systems","score":0.9977999925613403,"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/diophantine-equation","display_name":"Diophantine equation","score":0.8392137289047241},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7407233119010925},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.6927791833877563},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6342272162437439},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.6237891912460327},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6218053698539734},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5608829259872437},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5031773447990417},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.48624956607818604},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.4834197759628296},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3623286485671997},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28902116417884827},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2280329167842865},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11291837692260742}],"concepts":[{"id":"https://openalex.org/C206530611","wikidata":"https://www.wikidata.org/wiki/Q905896","display_name":"Diophantine equation","level":2,"score":0.8392137289047241},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7407233119010925},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6927791833877563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6342272162437439},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.6237891912460327},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6218053698539734},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5608829259872437},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5031773447990417},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.48624956607818604},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.4834197759628296},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3623286485671997},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28902116417884827},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2280329167842865},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11291837692260742},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icppw.2002.1039785","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icppw.2002.1039785","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Conference on Parallel Processing Workshop","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1482334991","https://openalex.org/W1521571223","https://openalex.org/W1974078059","https://openalex.org/W1974470587","https://openalex.org/W1976174647","https://openalex.org/W1996384031","https://openalex.org/W2001366513","https://openalex.org/W2026841018","https://openalex.org/W2037929850","https://openalex.org/W2054009863","https://openalex.org/W2055198234","https://openalex.org/W2067566911","https://openalex.org/W2069979189","https://openalex.org/W2078911294","https://openalex.org/W2086891775","https://openalex.org/W2100132912","https://openalex.org/W2130352559","https://openalex.org/W2148120241","https://openalex.org/W2542488526","https://openalex.org/W2752885492","https://openalex.org/W2946046356","https://openalex.org/W2971491423","https://openalex.org/W4210924085","https://openalex.org/W6679404586"],"related_works":["https://openalex.org/W2025770640","https://openalex.org/W4401317798","https://openalex.org/W4298335810","https://openalex.org/W2462246956","https://openalex.org/W2379447811","https://openalex.org/W2029234250","https://openalex.org/W1553843799","https://openalex.org/W2894446991","https://openalex.org/W1755263897","https://openalex.org/W2351522589"],"abstract_inverted_index":{"We":[0,66,139],"present":[1],"an":[2],"algorithm":[3,49],"for":[4],"computing":[5],"the":[6,36,42,55,84,91,98,105,114,118,126],"communication":[7,62,106],"sets":[8,63,107],"in":[9,16,35],"array":[10,27,37],"section":[11],"movements":[12],"with":[13],"block-cyclic":[14,109],"(cyclic(k)":[15],"HPF)":[17],"distribution.":[18],"Our":[19],"framework":[20],"can":[21],"handle":[22],"multi-level":[23],"alignments,":[24],"multi-dimensional":[25],"arrays,":[26],"intrinsic":[28],"functions,":[29],"affine":[30],"indices":[31],"and":[32,70,146],"axis":[33],"exchanges":[34],"subscript.":[38],"Instead":[39],"of":[40,90,108,117,131],"employing":[41],"linear":[43,56],"diophantine":[44,57],"equation":[45,58],"solver,":[46],"a":[47,136],"new":[48],"which":[50],"does":[51],"not":[52,135],"rely":[53],"on":[54],"solver":[59],"to":[60,73,83,102,122],"calculate":[61],"is":[64,77,93,100,134],"proposed":[65],"use":[67],"formal":[68],"proof":[69],"experimental":[71,148],"results":[72],"show":[74],"that":[75,94,97],"it":[76,141],"more":[78],"efficient":[79],"than":[80],"previous":[81],"solution":[82],"same":[85],"problem.":[86],"Another":[87],"important":[88],"contribution":[89],"paper":[92],"we":[95],"prove":[96],"compiler":[99],"able":[101],"compute":[103],"efficiently":[104],"distribution":[110],"as":[111,113],"long":[112],"block":[115,132],"sizes":[116,133],"arrays":[119],"are":[120],"set":[121],"be":[123],"identical":[124],"or":[125],"lowest":[127],"common":[128],"multiple":[129],"(LCM)":[130],"huge":[137],"integer":[138],"demonstrate":[140],"by":[142],"thorough":[143],"complexity":[144],"analyses":[145],"extensive":[147],"results.":[149]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}