Search results for "message-combining"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
38	Young-Joo Suh, Kang G. Shin	All-to-All Personalized Communication in Multidimensional Torus and Mesh Networks.	IEEE Trans. Parallel Distributed Syst.	2001	DBLP DOI BibTeX RDF	direct exchange, message-combining, Collective communication, interprocessor communication, complete exchange, all-to-all personalized communication
32	Young-Joo Suh, Sudhakar Yalamanchili	Configurable Algorithms for Complete Exchange in 2D Meshes.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	parallel algorithms, collective communication, Interprocessor communication, all-to-all communication, complete exchange, all-to-all personalized exchange
29	Jean-Pierre Jung, Ibrahima Sakho	A Methodology for Devising Optimal All-port All-to-all Broadcast Algorithms in 2-Dimensional Tori.	LCN	2003	DBLP DOI BibTeX RDF	Multidimensional tori, NODUP, Message combining, Distributed Memory Parallel Computers, all-to-all broadcast, Store-and-Forward routing
24	Christoph W. Keßler	NestStep: Nested Parallelism and Virtual Shared Memory for the BSP Model.	J. Supercomput.	2000	DBLP DOI BibTeX RDF	BSP model of parallel computation, message combining, parallel Java extension, nested parallelism, virtual shared memory, distributed arrays
22	Constantine Katsinis, Diana Hecht	Fault-Tolerant DSM on the SOME-Bus Multiprocessor Architecture with Message Combining.	IPDPS	2004	DBLP DOI BibTeX RDF
21	N. S. Sundar, Doddaballapur Narasimha-Murthy Jayasimha, Dhabaleswar K. Panda 0001	Hybrid Algorithms for Complete Exchange in 2D Meshes.	IEEE Trans. Parallel Distributed Syst.	2001	DBLP DOI BibTeX RDF	direct exchange, message contention, wormhole routing, Collective communication, hybrid algorithms, combining, barrier synchronization, complete exchange, mesh topology
20	Young-Joo Suh, Sudhakar Yalamanchili	All-To-All Communication with Minimum Start-Up Costs in 2D/3D Tori and Meshes.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	parallel algorithms, collective communication, Interprocessor communication, all-to-all communication, all-to-all broadcast, complete exchange, all-to-all personalized exchange
13	Tobias Monsees, Dirk Wübben, Armin Dekorsy	Relative Entropy based Message Combining for Exploiting Diversity in Information Optimized Processing.	WSA	2021	DBLP BibTeX RDF
13	Jesper Larsson Träff, Alexandra Carpen-Amarie, Sascha Hunold, Antoine Rougier	Message-Combining Algorithms for Isomorphic, Sparse Collective Communication.	CoRR	2016	DBLP BibTeX RDF
13	Tobias Volkhausen, Kai Schinköthe, Holger Karl	Quantization techniques for accurate soft message combining.	WCNC	2012	DBLP DOI BibTeX RDF
13	Stavros Souravlas, Manos Roumeliotis	A message combining approach for efficient array redistribution in non-all-to-all communication networks.	Int. J. Comput. Math.	2008	DBLP DOI BibTeX RDF
13	Constantine Katsinis, Diana Hecht	Hot-Spots and Message Combining in An Interconnection Network for Broadcast Communication.	PDPTA	2000	DBLP BibTeX RDF
13	Toshihiro Hanawa, Takashi Fujiwara, Hideharu Amano	Hot spot contention and message combining in the simple serial synchronized multistage interconnection network.	SPDP	1996	DBLP DOI BibTeX RDF
13	Kalidou Gaye, Toshihiro Hanawa, Hideharu Amano	An analysis of the hot spot contention and message combining on the simple serial synchronized-multistage interconnection network.	Syst. Comput. Jpn.	1995	DBLP DOI BibTeX RDF
13	Stephen Shafer, Kanad Ghose	Static Message Combining in Task Graph Schedules.	ICPP (2)	1995	DBLP BibTeX RDF
12	Young-Joo Suh, Sudhakar Yalamanchili	Algorithms for All-to-All Personalized Exchange in 2D and 3D Tori.	IPPS	1996	DBLP DOI BibTeX RDF
9	Yu-Chee Tseng, Ting-Hsien Lin, Sandeep K. S. Gupta, Dhabaleswar K. Panda 0001	Bandwidth-Optimal Complete Exchange on Wormhole-Routed 2D/3D Torus Networks: A Diagonal-Propagation Approach.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	parallel computing, wormhole routing, distributed memory systems, Collective communication, torus, interprocessor communication, complete exchange
6	Stavros Souravlas, Manos Roumeliotis	A message passing strategy for array redistributions in a torus network.	J. Supercomput.	2008	DBLP DOI BibTeX RDF	Superclasses, Pipeline, High performance Fortran, Communication scheduling, Array redistribution
6	M. T. Raghunath, Abhiram G. Ranade	A Simulation-Based Comparison of Interconnection Networks.	SPDP	1990	DBLP DOI BibTeX RDF