{"id":"https://openalex.org/W2159490513","doi":"https://doi.org/10.1109/clustr.2007.4629255","title":"Optimized scheduling for group communication in data parallelism","display_name":"Optimized scheduling for group communication in data parallelism","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2159490513","doi":"https://doi.org/10.1109/clustr.2007.4629255","mag":"2159490513"},"language":"en","primary_location":{"id":"doi:10.1109/clustr.2007.4629255","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clustr.2007.4629255","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Conference on Cluster Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100440589","display_name":"Jue Wang","orcid":"https://orcid.org/0000-0001-8013-0486"},"institutions":[{"id":"https://openalex.org/I92403157","display_name":"University of Science and Technology Beijing","ror":"https://ror.org/02egmk993","country_code":"CN","type":"education","lineage":["https://openalex.org/I92403157"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jue Wang","raw_affiliation_strings":["School of Information Engineering, University of Science and Technology, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Engineering, University of Science and Technology, Beijing, China","institution_ids":["https://openalex.org/I92403157"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103142109","display_name":"Changjun Hu","orcid":"https://orcid.org/0000-0003-3857-7262"},"institutions":[{"id":"https://openalex.org/I92403157","display_name":"University of Science and Technology Beijing","ror":"https://ror.org/02egmk993","country_code":"CN","type":"education","lineage":["https://openalex.org/I92403157"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Changjun Hu","raw_affiliation_strings":["School of Information Engineering, University of Science and Technology, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Engineering, University of Science and Technology, Beijing, China","institution_ids":["https://openalex.org/I92403157"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100624320","display_name":"Jilin Zhang","orcid":"https://orcid.org/0000-0002-0423-9356"},"institutions":[{"id":"https://openalex.org/I92403157","display_name":"University of Science and Technology Beijing","ror":"https://ror.org/02egmk993","country_code":"CN","type":"education","lineage":["https://openalex.org/I92403157"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jilin Zhang","raw_affiliation_strings":["School of Information Engineering, University of Science and Technology, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Engineering, University of Science and Technology, Beijing, China","institution_ids":["https://openalex.org/I92403157"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I92403157"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19122392,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":null,"first_page":"398","last_page":"403"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9994999766349792,"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/computer-science","display_name":"Computer science","score":0.8170177936553955},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.7402379512786865},{"id":"https://openalex.org/keywords/communication-in-small-groups","display_name":"Communication in small groups","score":0.5770012736320496},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5340221524238586},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5267414450645447},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5212922096252441},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.46069571375846863},{"id":"https://openalex.org/keywords/communications-system","display_name":"Communications system","score":0.45580601692199707},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3601268231868744},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23347261548042297},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2173861861228943},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.09825161099433899},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0884164571762085}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8170177936553955},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7402379512786865},{"id":"https://openalex.org/C44871818","wikidata":"https://www.wikidata.org/wiki/Q5154139","display_name":"Communication in small groups","level":2,"score":0.5770012736320496},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5340221524238586},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5267414450645447},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5212922096252441},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.46069571375846863},{"id":"https://openalex.org/C101765175","wikidata":"https://www.wikidata.org/wiki/Q577764","display_name":"Communications system","level":2,"score":0.45580601692199707},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3601268231868744},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23347261548042297},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2173861861228943},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.09825161099433899},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0884164571762085}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/clustr.2007.4629255","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clustr.2007.4629255","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Conference on Cluster Computing","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":12,"referenced_works":["https://openalex.org/W155125600","https://openalex.org/W1968495897","https://openalex.org/W2086891775","https://openalex.org/W2106914245","https://openalex.org/W2108879934","https://openalex.org/W2113393807","https://openalex.org/W2141279944","https://openalex.org/W2154777588","https://openalex.org/W2157666429","https://openalex.org/W2380289579","https://openalex.org/W3007497337","https://openalex.org/W6606390682"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W1607682696","https://openalex.org/W1486931463","https://openalex.org/W1032007"],"abstract_inverted_index":{"Group":[0,46],"communication":[1,20,26,44,47,62,102,109,125,138,159,163],"significantly":[2],"influences":[3,15],"the":[4,11,16,86,95,98,128,131,176,180],"performance":[5,174],"of":[6,18,101,119,182],"data":[7],"parallel":[8],"applications.":[9],"Nevertheless,":[10],"important":[12],"factor":[13],"that":[14,113,146,169],"efficiency":[17],"group":[19],"is":[21,33,74,116],"often":[22],"neglected:":[23],"a":[24,78,108,117,137],"larger":[25],"idle":[27],"time":[28],"may":[29],"occur":[30],"when":[31],"there":[32],"node":[34,121],"contention":[35],"and":[36,52,80,179,186],"difference":[37],"among":[38],"message":[39],"lengths":[40],"during":[41],"one":[42],"particular":[43],"step.":[45,126,164],"scheduling":[48,82,110],"has":[49,172],"attracted":[50],"more":[51,53],"attentions.":[54],"In":[55],"previous":[56],"works,":[57],"researchers":[58],"canpsilat":[59],"completely":[60],"avoid":[61],"conflict":[63],"or":[64],"they":[65],"only":[66,150],"focus":[67],"on":[68,94],"some":[69],"special":[70],"cases.":[71],"This":[72,144],"paper":[73],"devoted":[75],"to":[76],"develop":[77],"universal":[79],"efficient":[81],"strategy":[83,106,148,171],"concerning":[84],"with":[85,130],"situation":[87],"where":[88],"array":[89],"distributions":[90],"are":[91,134],"block-cyclic.":[92],"Base":[93],"proof":[96],"for":[97],"recursive":[99],"theorems":[100],"table":[103,111],"elements,":[104],"this":[105],"generates":[107],"so":[112],"each":[114,124,162],"column":[115],"permutation":[118],"receiving":[120],"number":[122],"in":[123,161],"And":[127],"messages":[129],"close":[132],"size":[133],"put":[135],"into":[136],"step":[139],"as":[140,142],"near":[141],"possible.":[143],"indicates":[145],"our":[147,170],"not":[149],"avoids":[151],"inter-processor":[152],"contention,":[153],"but":[154],"it":[155],"also":[156],"minimizes":[157],"real":[158],"cost":[160],"Finally,":[165],"experimental":[166],"results":[167],"show":[168],"better":[173],"than":[175],"general":[177],"method":[178],"implementation":[181],"all-to-all":[183],"based":[184],"scheduling,":[185],"greedy":[187],"scheduling.":[188]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}