Kang et al., 2018 - Google Patents
Full-duplex inter-group all-to-all broadcast algorithms with optimal bandwidthKang et al., 2018
View PDF- Document ID
- 5576120624682297893
- Author
- Kang Q
- Träff J
- Al-Bahrani R
- Agrawal A
- Choudhary A
- Liao W
- Publication year
- Publication venue
- Proceedings of the 25th European MPI Users' Group Meeting
External Links
Snippet
MPI inter-group collective communication patterns can be viewed as bipartite graphs that divide processes into two disjoint groups in which messages are transferred between but not within the groups. Such communication patterns can serve as basic operations for scientific …
- 238000000034 method 0 abstract description 107
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
- G06F15/163—Interprocessor communication
- G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
- G06F15/17337—Direct connection machines, e.g. completely connected computers, point to point communication networks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
- G06F15/163—Interprocessor communication
- G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
- G06F15/17356—Indirect interconnection networks
- G06F15/17368—Indirect interconnection networks non hierarchical topologies
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
- G06F17/30958—Graphs; Linked lists
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/76—Architectures of general purpose stored programme computers
- G06F15/78—Architectures of general purpose stored programme computers comprising a single central processing unit
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/76—Architectures of general purpose stored programme computers
- G06F15/80—Architectures of general purpose stored programme computers comprising an array of processing units with common control, e.g. single instruction multiple data processors
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
- G06F8/41—Compilation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F1/00—Details of data-processing equipment not covered by groups G06F3/00 - G06F13/00, e.g. cooling, packaging or power supply specially adapted for computer application
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Solomonik et al. | Improving communication performance in dense linear algebra via topology aware collectives | |
Anderson et al. | Graphpad: Optimized graph primitives for parallel and distributed platforms | |
US8447954B2 (en) | Parallel pipelined vector reduction in a data processing system | |
CN110968920B (en) | Method for placing chain type service entity in edge computing and edge computing equipment | |
Kang et al. | Scalable algorithms for MPI intergroup Allgather and Allgatherv | |
Kang et al. | Full-duplex inter-group all-to-all broadcast algorithms with optimal bandwidth | |
Gropp | Using node and socket information to implement MPI Cartesian topologies | |
Ziantz et al. | Run-time optimization of sparse matrix-vector multiplication on SIMD machines | |
Alfatafta et al. | Cool: A cloud-optimized structure for mpi collective operations | |
Buluç et al. | Highly parallel sparse matrix-matrix multiplication | |
Park et al. | Buffer-space efficient and deadlock-free scheduling of stream applications on multi-core architectures | |
Khalilov et al. | Optimization of MPI-process mapping for clusters with Angara interconnect | |
Güler et al. | TACC: Topology-aware coded computing for distributed graph processing | |
Wu et al. | Optimizing network performance of computing pipelines in distributed environments | |
Ranka et al. | Static and run-time algorithms for all-to-many personalized communication on permutation networks | |
Kostin et al. | Winsim: a tool for performance evaluation of parallel and distributed systems | |
Hall et al. | Scheduling in broadcast networks | |
Luo et al. | Implementation of a parallel graph partition algorithm to speed up BSP computing | |
Lavault et al. | A distributed approximation algorithm for the minimum degree minimum weight spanning trees | |
Kang et al. | Optimal algorithms for half-duplex inter-group all-to-all broadcast on fully connected and ring topologies | |
Proficz et al. | Improving Clairvoyant: reduction algorithm resilient to imbalanced process arrival patterns | |
Álvarez-Llorente et al. | Formal modeling and performance evaluation of a run-time rank remapping technique in broadcast, Allgather and Allreduce MPI collective operations | |
WO2023173912A1 (en) | Configuration method for processing element (pe) array and related device | |
Hanuliak | On the analysis and modelling of computer communication systems | |
Reed | A simulation study of multimicrocomputer networks |