Network interface for message-passing parallel computation on a workstation cluster

2005 ◽  
Author(s):  
J.C. Hoe
Keyword(s):  
Parallel Computation ◽  
Message Passing ◽  
Network Interface ◽  
Workstation Cluster

TRIPWIRE: A SYNCHRONISATION PRIMITIVE FOR VIRTUAL MEMORY MAPPED COMMUNICATION

2001 ◽  
Vol 02 (03) ◽  
pp. 345-364 ◽  
Author(s):  
DAVID RIDDOCH ◽  
STEVE POPE ◽  
DEREK ROBERTS ◽  
GLENFORD MAPP ◽  
DAVID CLARKE ◽  
...  
Keyword(s):  
Message Passing ◽  
Data Transfer ◽  
Distributed Shared Memory ◽  
Virtual Memory ◽  
Communication Styles ◽  
Network Interface ◽  
High Bandwidth ◽  
Memory Network ◽  
Network Abstraction ◽  
Network Interfaces

Existing user-level network interfaces deliver high bandwidth, low latency performance to applications, but are typically unable to support diverse styles of communication and are unsuitable for use in multiprogrammed environments. Often this is because the network abstraction is presented at too high a level, and support for synchronisation is inflexible. In this paper we present a new primitive for in-band synchronisation: the Tripwire. Tripwires provide a flexible, efficient and scalable means for synchronisation that is orthogonal to data transfer. We describe the implementation of a non-coherent distributed shared memory network interface, with Tripwires for synchronisation. This interface provides a low-level communications model with gigabit class bandwidth and very low overhead and latency. We show how it supports a variety of communication styles, including remote procedure call, message passing and streaming.

scholarly journals Parallelization of a 3-Dimensional Hydrodynamics Model Using a Hybrid Method with MPI and OpenMP

Processes ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 1548
Author(s):  
Jung Min Ahn ◽  
Hongtae Kim ◽  
Jae Gab Cho ◽  
Taegu Kang ◽  
Yong-seok Kim ◽  
...  
Keyword(s):  
Water Pollution ◽  
Decision Making ◽  
Parallel Computation ◽  
Message Passing ◽  
Message Passing Interface ◽  
Numerical Models ◽  
Source Code ◽  
Computation Time ◽  
Environmental Research ◽  
Quality Analysis

Process-based numerical models developed to perform hydraulic/hydrologic/water quality analysis of watersheds and rivers have become highly sophisticated, with a corresponding increase in their computation time. However, for incidents such as water pollution, rapid analysis and decision-making are critical. This paper proposes an optimized parallelization scheme to reduce the computation time of the Environmental Fluid Dynamics Code-National Institute of Environmental Research (EFDC-NIER) model, which has been continuously developed for water pollution or algal bloom prediction in rivers. An existing source code and a parallel computational code with open multi-processing (OpenMP) and a message passing interface (MPI) were optimized, and their computation times compared. Subsequently, the simulation results for the existing EFDC model and the model with the parallel computation code were compared. Furthermore, the optimal parallel combination for hybrid parallel computation was evaluated by comparing the simulation time based on the number of cores and threads. When code parallelization was applied, the performance improved by a factor of approximately five compared to the existing source code. Thus, if the parallel computational source code applied in this study is used, urgent decision-making will be easier for events such as water pollution incidents.

scholarly journals Dekripsi Algoritma Rivest-Shamir-Adleman Dengan Komputasi Paralel Menggunakan Message Parsing Interface

2017 ◽  
Vol 8 (1) ◽  
Author(s):  
Evangs Mailoa
Keyword(s):  
Parallel Computing ◽  
Parallel Computation ◽  
Message Passing ◽  
Message Passing Interface ◽  
Prime Numbers ◽  
Brute Force ◽  
Cryptographic Algorithm ◽  
Large Numbers ◽  
Long Time ◽  
Brute Force Attack

Abstract. Rivest-Shamir-Adleman algorithm is a cryptographic algorithm that is difficult to be dismantled. This is due to the difficulty of factoring large numbers modulus n into prime factors (p and q). The process of modulus factoring requires a very long time if solved by serial computation. Brute Force Attack method is used to find large prime numbers p and q with parallel computation. Applications for the factorization of prime numbers p and q are developed using Visual C ++ and Message Passing Interface, while the decryption process developed with Java. The results show a parallel computing process faster than a serial for factoring very large numbers n, and very slow if the n is too small.Keywords: Rivest-Shamir-Adleman Algorithm, Brute Force Attack, Message Passing Interface. Abstrak. Algoritma Rivest-Shamir-Adleman merupakan salah satu algoritma kriptografi yang sukar untuk dibongkar. Hal ini dikarenakan sulitnya memfaktorkan bilangan modulus n yang besar menjadi faktor-faktor prima (nilai p dan q). Proses untuk faktorisasi modulus n membutuhkan waktu yang sangat lama apabila diselesaikan dengan komputasi serial. Penelitian ini menggunakan metode Brute Force Attack untuk menemukan bilangan prima p dan q yang sangat besar yang dikerjakan secara paralel. Aplikasi untuk faktorisasi bilangan prima p dan q dikembangkan menggunakan Visual C++ memanfaatkan Message Passing Interface, sedangkan aplikasi proses dekripsi dengan Java. Hasil ujicoba menunjukkan proses komputasi paralel lebih cepat dibandingkan secara serial untuk memfaktorkan bilangan n yang sangat besar, dan menjadi sangat lambat apabila bilangan n terlalu kecil. Kata kunci: Algoritma Rivest-Shamir-Adleman, Brute Force Attack, Message Passing Interface.

Application of Parallel Computation in Numerical Simulation of Laser Propulsion

2011 ◽  
Vol 130-134 ◽  
pp. 3027-3031
Author(s):  
Yao Yuan Zeng ◽  
Zheng Hua Wang ◽  
Wen Tao Zhao
Keyword(s):  
Numerical Simulation ◽  
Domain Decomposition ◽  
Euler Equation ◽  
Parallel Computation ◽  
Message Passing ◽  
Three Dimensions ◽  
Integral Model ◽  
Finite Volume Scheme ◽  
Inviscid Fluid ◽  
Laser Propulsion

As for the problem of numerical simulation oflaser propulsion of three dimensions and multi-sub domains, the domain decomposition strategy based on message passing mechanismis applied in this paper to realize parallelization. The cell-centered finite volume scheme is performed to solve Euler equation. A five-step Runge-Kutta scheme of explicit integral model is used for time advancement. The spatial discretization of inviscid fluid is estimated byhigh-order Godunov-type scheme. We test some different examples on a cluster system and the results show the smallest number of speedup is more than 5.19 when the degree of parallelism is 8. In a word, parallel computation is an inevitable choice to achieve the aim of accelerating the study of the mechanism of laser propulsion.

Sign in / Sign up

Export Citation Format

Share Document