High-level versus low-level DO-loop parallelization: Results for one testcase of a multi-block solver on a shared memory parallel vector computer

Author(s):  
P. Wijnandts ◽  
M. E. S. Vogels
2006 ◽  
Vol 16 (02) ◽  
pp. 261-280 ◽  
Author(s):  
Nathan Thomas ◽  
Steven Saunders ◽  
Tim Smith ◽  
Gabriel Tanase ◽  
Lawrence Rauchwerger

ARMI is a communication library that provides a framework for expressing fine-grain parallelism and mapping it to a particular machine using shared-memory and message passing library calls. The library is an advanced implementation of the RMI protocol and handles low-level details such as scheduling incoming communication and aggregating outgoing communication to coarsen parallelism. These details can be tuned for different platforms to allow user codes to achieve the highest performance possible without manual modification. ARMI is used by STAPL, our generic parallel library, to provide a portable, user transparent communication layer. We present the basic design as well as the mechanisms used in the current Pthreads/OpenMP, MPI implementations and/or a combination thereof. Performance comparisons between ARMI and explicit use of Pthreads or MPI are given on a variety of machines, including an HP-V2200, Origin 3800, IBM Regatta and IBM RS/6000 SP cluster.


2017 ◽  
Vol 112 (4) ◽  
pp. 607-620 ◽  
Author(s):  
Karen E. MacGregor ◽  
Jessica J. Carnevale ◽  
Nicole E. Dusthimer ◽  
Kentaro Fujita

2016 ◽  
Vol 16 (12) ◽  
pp. 335
Author(s):  
Wietske Zuiderbaan ◽  
Jonathan van Leeuwen ◽  
Serge Dumoulin

Author(s):  
Rupak Majumdar ◽  
Ramanathan S. Thinniyam ◽  
Georg Zetzsche

AbstractThe model of asynchronous programming arises in many contexts, from low-level systems software to high-level web programming. We take a language-theoretic perspective and show general decidability and undecidability results for asynchronous programs that capture all known results as well as show decidability of new and important classes. As a main consequence, we show decidability of safety, termination and boundedness verification for higher-order asynchronous programs—such as OCaml programs using Lwt—and undecidability of liveness verification already for order-2 asynchronous programs. We show that under mild assumptions, surprisingly, safety and termination verification of asynchronous programs with handlers from a language class are decidable iff emptiness is decidable for the underlying language class. Moreover, we show that configuration reachability and liveness (fair termination) verification are equivalent, and decidability of these problems implies decidability of the well-known “equal-letters” problem on languages. Our results close the decidability frontier for asynchronous programs.


2019 ◽  
Vol 19 (3) ◽  
pp. 1 ◽  
Author(s):  
Heiko H. Schütt ◽  
Lars O. M. Rothkegel ◽  
Hans A. Trukenbrod ◽  
Ralf Engbert ◽  
Felix A. Wichmann

Sign in / Sign up

Export Citation Format

Share Document