scholarly journals The Pandore data-parallel compiler and its portable runtime

1995 ◽  
pp. 176-183 ◽  
Author(s):  
Franç;oise André ◽  
Marc Le Fur ◽  
Yves Mahéo ◽  
Jean-Louis Pazat
Keyword(s):  
Data Parallel ◽  
Parallel Compiler

scholarly journals Experiences in Data-Parallel Programming

1997 ◽  
Vol 6 (1) ◽  
pp. 153-158 ◽  
Author(s):  
Terry W. Clark ◽  
Reinhard v. Hanxleden ◽  
Ken Kennedy
Keyword(s):  
High Performance ◽  
Parallel Applications ◽  
Scientific Application ◽  
Data Parallel ◽  
High Performance Fortran ◽  
Engineering Data ◽  
Source Program ◽  
Parallel Compiler ◽  
Fortran D ◽  
Near Future

To efficiently parallelize a scientific application with a data-parallel compiler requires certain structural properties in the source program, and conversely, the absence of others. A recent parallelization effort of ours reinforced this observation and motivated this correspondence. Specifically, we have transformed a Fortran 77 version of GROMOS, a popular dusty-deck program for molecular dynamics, into Fortran D, a data-parallel dialect of Fortran. During this transformation we have encountered a number of difficulties that probably are neither limited to this particular application nor do they seem likely to be addressed by improved compiler technology in the near future. Our experience with GROMOS suggests a number of points to keep in mind when developing software that may at some time in its life cycle be parallelized with a data-parallel compiler. This note presents some guidelines for engineering data-parallel applications that are compatible with Fortran D or High Performance Fortran compilers.

Data-Parallel Compiler Support for Multipartitioning

2001 ◽  
pp. 241-253 ◽  
Author(s):  
Daniel Chavarría-Miranda ◽  
John Mellor-Crummey ◽  
Trushar Sarang
Keyword(s):  
Compiler Support ◽  
Data Parallel ◽  
Parallel Compiler

Data-parallel line relaxation method for the Navier-Stokes equations

AIAA Journal ◽  
1998 ◽  
Vol 36 ◽  
pp. 1603-1609 ◽  
Author(s):  
Michael J. Wright ◽  
Graham V. Candler ◽  
Deepak Bose
Keyword(s):  
Stokes Equations ◽  
Relaxation Method ◽  
Parallel Line ◽  
Navier Stokes ◽  
Navier Stokes Equations ◽  
Data Parallel

scholarly journals Multi-GPU approach to global induction of classification trees for large-scale data mining

2021 ◽  
Author(s):  
Krzysztof Jurczuk ◽  
Marcin Czajkowski ◽  
Marek Kretowski
Keyword(s):  
Data Mining ◽  
Large Scale ◽  
Real Life ◽  
Population Based ◽  
Tree Structure ◽  
Global Approach ◽  
Data Parallel ◽  
Large Scale Data ◽  
The Impact ◽  
Scale Data

AbstractThis paper concerns the evolutionary induction of decision trees (DT) for large-scale data. Such a global approach is one of the alternatives to the top-down inducers. It searches for the tree structure and tests simultaneously and thus gives improvements in the prediction and size of resulting classifiers in many situations. However, it is the population-based and iterative approach that can be too computationally demanding to apply for big data mining directly. The paper demonstrates that this barrier can be overcome by smart distributed/parallel processing. Moreover, we ask the question whether the global approach can truly compete with the greedy systems for large-scale data. For this purpose, we propose a novel multi-GPU approach. It incorporates the knowledge of global DT induction and evolutionary algorithm parallelization together with efficient utilization of memory and computing GPU’s resources. The searches for the tree structure and tests are performed simultaneously on a CPU, while the fitness calculations are delegated to GPUs. Data-parallel decomposition strategy and CUDA framework are applied. Experimental validation is performed on both artificial and real-life datasets. In both cases, the obtained acceleration is very satisfactory. The solution is able to process even billions of instances in a few hours on a single workstation equipped with 4 GPUs. The impact of data characteristics (size and dimension) on convergence and speedup of the evolutionary search is also shown. When the number of GPUs grows, nearly linear scalability is observed what suggests that data size boundaries for evolutionary DT mining are fading.

Sign in / Sign up

Export Citation Format

Share Document