A HYBRID SHARED MEMORY EXECUTION MODEL FOR A DATA PARALLEL LANGUAGE WITH I/O

2008 ◽  
Vol 18 (01) ◽  
pp. 23-37 ◽  
Author(s):  
CLEMENS GRELCK ◽  
STEFFEN KUTHE ◽  
SVEN-BODO SCHOLZ

We propose a novel execution model for the implicitly parallel execution of data parallel programs in the presence of general I/O operations. This model is called hybrid because it combines the advantages of the standard execution models fork/join and SPMD. Based on program analysis the hybrid model adapts itself to one or the other on the granularity of individual instructions. We outline compilation techniques that systematically derive the organization of parallel code from data flow characteristics aiming at the reduction of execution mode switches in general and synchronization/communication requirements in particular. Experiments based on a prototype implementation show the effectiveness of the hybrid execution model for reducing parallel overhead.

Author(s):  
Yann Le Guyadec ◽  
Emmanuel Melin ◽  
Bruno Raffin ◽  
Xavier Rebeuf ◽  
Bernard Virot

2001 ◽  
Vol 11 (04) ◽  
pp. 423-437 ◽  
Author(s):  
F. LOULERGUE

The BS λp-calculus is a calculus of functional bulk synchronous parallel (BSP) programs. It is the basis for the design of a bulk synchronous parallel ML language. For data-parallel languages, there are two points of view: the programming model where a program is seen as a sequence of operations on parallel vectors, and the execution model where the program is a parallel composition of programs run on each processor of the parallel machine. BSP algorithms are defined by data-parallel algorithms with explicit (physical) processes in order to allow their parallel execution time to be estimated. We present here a distributed evaluation minimally synchronous for BSP execution (which corresponds to the execution model). This distributed evaluation is correct w.r.t. the call-by-value strategy of the BS λp-calculus (which corresponds to the programming model).


1983 ◽  
Vol 11 (3) ◽  
pp. 349-355 ◽  
Author(s):  
Shinji Umeyama ◽  
Koichiro Tamura

2021 ◽  
Author(s):  
Hemant Priyadarshi ◽  
Daniel Nickel ◽  
Seban Jose

Abstract The paper provides a detailed estimation of the interfaces that exist in a split SURF-SPS execution model and provides a qualitative comparison to an integrated SURF-SPS execution model. A comprehensive matrix of dependencies between SURF and SPS is presented and is categorized into engineering, procurement, construction/fabrication and installation work packages. The matrix is used to illustrate the exact scope dependencies and thus, the sources of interfaces. A hypothetical greenfield development has been assumed to develop the interface matrix and to use it for comparison of the two execution models. The comparison also reveals how interfaces are naturally eliminated in an integrated SURF-SPS execution model. In each of the workstreams (E-P-C-I), top risks have been identified and monetary liability estimates for those risks have been provided. By transfer of these risks from company to contractor, monetary liability gets transferred to the contractor, thus, resulting in significant savings for operating companies. The following tangible results are provided in the paper: a) % of interface(s) reduced in the E-P-C-I areas; b) Risk reduction in monetary terms for operators – estimated values. This paper justifies the fact that there is a significant interface scope and risk reduction for operators, if they adopt an integrated SURF-SPS execution model.


Sign in / Sign up

Export Citation Format

Share Document