High-level abstractions for message-passing parallel programming

Chan, Fan; Cao, Jiannong; Sun, Yong

doi:10.1016/j.parco.2003.05.008

Cited by 18 publications

(7 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We chose to make the VPG primitives a super-set of the basic communication-synchronization primitives supported in some of the prominent parallel programming environments. Our choice is influenced by the MPI standard [24], PVM documentations [25], our experiences different patternbased systems, and various research articles (e.g., [10]). In the process of designing an abstract machine, the designer first chooses an architectural parallel pattern.…”

Section: Basic Elementsmentioning

confidence: 99%

A Novel Software-Built Parallel Machines and Their Interconnections

Akon

Goswami

et al. 2008

J. Inter. Net.

View full text Add to dashboard Cite

In this paper, we introduce SPM (Software-built Parallel Machines), a model to create software based virtual parallel machines. With SPM, an application developer simply selects all the required virtual parallel machines from the repository and implements the intended parallel algorithms directly without any need of complex mappings, as if the required processor interconnections are readily available. In addition, we present an implementation of the SPM model, which provides a systematic way to design new virtual machines. Our experiments show that the applications developed using the SPM model and tools give excellent performance, as compared to the applications developed using a generic communication library, such as MPI.

show abstract

Section: Basic Elementsmentioning

confidence: 99%

A Novel Software-Built Parallel Machines and Their Interconnections

Akon

Goswami

et al. 2008

J. Inter. Net.

View full text Add to dashboard Cite

show abstract

“…The GOP-XML file and the LPs are then deployed to the processors of the target platform. Independent of any particular language and platform, VisualGOP can be implemented as a library in familiar sequential languages and integrated with programming platforms such as clusters, CORBA, and the Web [13,14].…”

Section: Interoperabilitymentioning

confidence: 99%

“…This section presents the evaluation results using VisualGOP as a high-level graph-oriented programming model [13]. Our preliminary experiments involve communications between processes in a parallel application.…”

Section: Performance Evaluation Using Gopmentioning

confidence: 99%

Visual programming support for graph-oriented parallel/distributed processing

Chan

Cao

Chan

et al. 2005

Softw: Pract. Exper.

Self Cite

View full text Add to dashboard Cite

SUMMARYGOP is a graph-oriented programming model which aims at providing high-level abstractions for configuring and programming cooperative parallel processes. With GOP, the programmer can configure the logical structure of a parallel/distributed program by constructing a logical graph to represent the communication and synchronization between the local programs in a distributed processing environment. This paper describes a visual programming environment, called VisualGOP, for the design, coding, and execution of GOP programs. VisualGOP applies visual techniques to provide the programmer with automated and intelligent assistance throughout the program design and construction process. It provides a graphical interface with support for interactive graph drawing and editing, visual programming functions and automation facilities for program mapping and execution. VisualGOP is a generic programming environment independent of programming languages and platforms. GOP programs constructed under VisualGOP can run in heterogeneous parallel/distributed systems.

show abstract

“…Developers need extensive knowledge and expertise to manage the data layout, as well as the communication and synchronization requirements that are governed by the inherent dependencies in the code. These tasks have been characterized as extremely complex and errorprone [7]. Massingill et al [8] emphasize the complexity involved, arguing that, "A good data decomposition balances the competing forces of flexibility, efficiency, and simplicity.…”

Section: Introductionmentioning

confidence: 99%

Data Decomposition for Code Parallelization in Practice: What Do the Experts Need?

Meade

Deeptimahanti

Johnston

et al. 2013

2013 IEEE 10th International Conference on High Performance Computing and Communications &Amp; 2013 IEEE International Conferen

View full text Add to dashboard Cite

Abstract-Parallelizing serial software systems in order to run in a High Performance Computing (HPC) environment presents many challenges to developers. In particular, the extant literature suggests the task of decomposing large-scale data applications is particularly complex and time-consuming. In order to take stock of the state of practice of data decomposition in HPC, we conducted a two-phased study. Firstly, using focus group methodology we conducted an exploratory study at a software laboratory with an established track record in HPC. Based on the findings of this first phase, we designed a survey to assess the state of practice among experts in this field around the world. Our study shows that approximately 75% of parallelized applications use some form of data decomposition. Furthermore, data decomposition was found to be the most challenging phase in the parallelization process, consuming approximately 40% of the total time. A key finding of our study is that experts do not use any of the available tools and formal representations, and in fact, are not aware of them. We discuss why existing tools have not been adopted in industry and based on our findings, provide a number of recommendations for future tool support.

show abstract

High-level abstractions for message-passing parallel programming

Cited by 18 publications

References 10 publications

A Novel Software-Built Parallel Machines and Their Interconnections

A Novel Software-Built Parallel Machines and Their Interconnections

Visual programming support for graph-oriented parallel/distributed processing

Data Decomposition for Code Parallelization in Practice: What Do the Experts Need?

Contact Info

Product

Resources

About