A simple bridging model for high-performance computing
Chong Li, Gaétan Hains
Abstract
Chong Li, Gaétan Hains
Abstract
This paper introduces the Scatter-Gather parallel-programming and parallel execution model in the form of a simple imperative language named SGL. Its design is based on experience with Bulk-synchronous parallel (BSP) programming and BSP languages. SGL's novel features are motivated by the last decade's move to multi-level and heterogeneous parallel architectures involving multi-core processors, graphics accelerators and hierarchical routing networks. The design of SGL is coherent with Valiant's Multi-BSP while offering a programming interface even simpler than the primitives of Bulk-Synchronous parallel ML (BSML). SGL appears to cover a large subset of all BSP algorithms while avoiding complex message-passing programming. It allows automatic load balancing and like all BSP-inspired systems, predictable, portable and scalable performance.
OpenAlex reports 12 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper introduces the Scatter-Gather parallel-programming and parallel execution model in the form of a simple imperative language named SGL. Its design is based on experience with Bulk-synchronous parallel (BSP) programming and BSP languages. SGL's novel features are motivated by the last decade's move to multi-level and heterogeneous parallel architectures involving multi-core processors, graphics accelerators and hierarchical routing networks. The design of SGL is coherent with Valiant's Multi-BSP while offering a programming interface even simpler than the primitives of Bulk-Synchronous parallel ML (BSML). SGL appears to cover a large subset of all BSP algorithms while avoiding complex message-passing programming. It allows automatic load balancing and like all BSP-inspired systems, predictable, portable and scalable performance.
Key concepts: Computer science, Scalability, Parallel computing, Bridging (networking), Simple (philosophy), Load balancing (electrical power), Bulk synchronous parallel, Programming paradigm