scholarly journals Supporting irregular distributions using data-parallel languages

1995 ◽  
Vol 3 (1) ◽  
pp. 12-24 ◽  
Author(s):  
R. Ponnusamy ◽  
Yuan-Shin Hwang ◽  
R. Das ◽  
J.H. Saltz ◽  
A. Choudhary ◽  
...  
Keyword(s):  
Data Parallel ◽  
Parallel Languages ◽  
Using Data

scholarly journals Opus: A Coordination Language for Multidisciplinary Applications

1997 ◽  
Vol 6 (4) ◽  
pp. 345-362 ◽  
Author(s):  
Barbara Chapman ◽  
Matthew Haines ◽  
Piyush Mehrotra ◽  
Hans Zima ◽  
John Van Rosendale
Keyword(s):  
High Performance ◽  
Data Repository ◽  
Task Parallelism ◽  
Central Concept ◽  
Coordination Language ◽  
Data Parallel ◽  
High Performance Fortran ◽  
Parallel Languages ◽  
Wide Range ◽  
And Task

Data parallel languages, such as High Performance Fortran, can be successfully applied to a wide range of numerical applications.However, many advanced scientific and engineering applications are multidisciplinary and heterogeneous in nature, and thus do not fit well into the data parallel paradigm. In this paper we present Opus, a language designed to fill this gap. The central concept of Opus is a mechanism called ShareD Abstractions (SDA). An SDA can be used as a computation server, i.e., a locus of computational activity, or as a data repository for sharing data between asynchronous tasks. SDAs can be internally data parallel, providing support for the integration of data and task parallelism as well as nested task parallelism. They can thus be used to express multidisciplinary applications in a natural and efficient way. In this paper we describe the features of the language through a series of examples and give an overview of the runtime support required to implement these concepts in parallel and distributed environments.

A formal approach to the compilation of data-parallel languages

1995 ◽  
pp. 155-169
Author(s):  
J. A. Trescher ◽  
L. C. Breebaart ◽  
P. F. G. Dechering ◽  
A. B. Poelman ◽  
J. P. M. de Vreught ◽  
...  
Keyword(s):  
Formal Approach ◽  
Data Parallel ◽  
Parallel Languages

An Efficient Parallel Montgemery Cryptography for Multi-Core Processor

2013 ◽  
Vol 385-386 ◽  
pp. 1804-1807
Author(s):  
Shi Ji Yuan ◽  
Ming Feng Sun ◽  
Zhi Hua Liu ◽  
Wen Jing Huang
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Processing Efficiency ◽  
Loop Unrolling ◽  
Data Parallel ◽  
Montgomery Ladder ◽  
Encryption And Decryption ◽  
Using Data ◽  
Multi Core Processor ◽  
And Task

The classical Montgomery ladder algorithm (MPL) is an effective way to improve the operational efficiency of elliptic curve cryptography. First, an improved MPL is proposed by loop unrolling, and then the Montgomery elliptic curve encryption and decryption process is realized using data parallel and task parallel. The experimental results show that the ratio of acceleration parallel processing efficiency can reach 70%, and the method can effectively improve the speed of elliptic curve encryption algorithm.

Sign in / Sign up

Export Citation Format

Share Document