ADaPT: An Event-Passing Protocol for Reducing Delivery Costs in Scatter-Gather Parallel Processes
نویسندگان
چکیده
The scatter-gather event pattern is commonly used in many high-performance codes to deliver data subsets for use in data-parallel processes and return the results. There are a number of collective algorithms and multiple collective calls in the ubiquitous Message Passing Interface standards which perform aspects of gathering. Programmers have traditionally been left to their own devices, however, to perform complex scatterings of data subsets to processors executing the dataparallel computation. We have developed ADaPT, an Adaptive Data-parallel Publication/Subscription Transport protocol, to reduce the time lost to excessive synchronization with the unicast event-passing commands often employed to scatter data.
منابع مشابه
Design of a Hybrid Genetic Algorithm for Parallel Machines Scheduling to Minimize Job Tardiness and Machine Deteriorating Costs with Deteriorating Jobs in a Batched Delivery System
This paper studies the parallel machine scheduling problem subject to machine and job deterioration in a batched delivery system. By the machine deterioration effect, we mean that each machine deteriorates over time, at a different rate. Moreover, job processing times are increasing functions of their starting times and follow a simple linear deterioration. The objective functions are minimizin...
متن کاملParallel and Distributed Scatter-Gather Clustering System Development Proposal
From the process of scatter-gather algorithm explained above, we can easily find the essence of the parallel version of this algorithm is the parallel clustering algorithm used in the scatter phase. Frieder, et al. implements a parallel version of the buckshot clustering algorithm [1]. Their work meets the need of the parallel scatter-gather clustering algorithm pretty well, although we can des...
متن کاملAn Interface for Eecient Vector Scatters and Gathers on Parallel Machines
An Interface for E cient Vector Scatters and Gathers on Parallel Machines Barry F. Smith Abstract| Scatter and gather type operations form the heart of most communication kernels in parallel partial differential equation solvers. This paper introduces a simple interface for de ning and applying scatter and gather operations on both distributed and shared memory computers. A key feature of the i...
متن کاملToward Optimal Complete Exchange on Wormhole-Routed Tori
ÐIn this paper, we propose new routing schemes to perform all-to-all personalized communication (or known as complete exchange) in wormhole-routed, one-port tori. On tori of equal size along each dimension, our algorithms use both asymptotically optimal startup and transmission time. The results are characterized by several interesting features: 1) the use of gather-scatter tree to achieve opti...
متن کاملAn events based algorithm for distributing concurrent tasks on multi-core architectures
In this paper, a programming model is presented which enables scalable parallel performance on multi-core shared memory architectures. The model has been developed for application to a wide range of numerical simulation problems. Such problems involve time stepping or iteration algorithms where synchronization of multiple threads of execution is required. It is shown that traditional approaches...
متن کامل