scholarly journals A Skeleton Based Programming Paradigm for Mobile Multi-Agents on Distributed Systems and Its Realization within the MAGDA Mobile Agents Platform

2008 ◽  
Vol 4 (2) ◽  
pp. 131-146 ◽  
Author(s):  
R. Aversa ◽  
B. Di Martino ◽  
N. Mazzocca ◽  
S. Venticinque
Keyword(s):  
Parallel Programming ◽  
Mobile Agent ◽  
Heterogeneous Systems ◽  
Distributed Applications ◽  
Programming Environment ◽  
Agent Based ◽  
Workload Balancing ◽  
Programming Effort ◽  
High Level ◽  
Multi Agents

Parallel programming effort can be reduced by using high level constructs such as algorithmic skeletons. Within the MAGDA toolset, supporting programming and execution of mobile agent based distributed applications, we provide a skeleton-based parallel programming environment, based on specialization of Algorithmic Skeleton Java interfaces and classes. Their implementation include mobile agent features for execution on heterogeneous systems, such as clusters of WSs and PCs, and support reliability and dynamic workload balancing. The user can thus develop a parallel, mobile agent based application by simply specialising a given set of classes and methods and using a set of added functionalities.

scholarly journals Workload Decomposition Strategies for Shared Memory Parallel Systems with OpenMP

2001 ◽  
Vol 9 (2-3) ◽  
pp. 109-122 ◽  
Author(s):  
Beniamino Di Martino ◽  
Sergio Briguglio ◽  
Gregorio Vlad ◽  
Giuliana Fogaccia
Keyword(s):  
Programming Languages ◽  
Parallel Programming ◽  
Shared Memory ◽  
Memory Systems ◽  
Particle In Cell ◽  
Decomposition Strategies ◽  
Programming Effort ◽  
High Level ◽  
Memory Architectures

A crucial issue in parallel programming (both for distributed and shared memory architectures) is work decomposition. Work decomposition task can be accomplished without large programming effort with use of high-level parallel programming languages, such as OpenMP. Anyway particular care must still be payed on achieving performance goals. In this paper we introduce and compare two decomposition strategies, in the framework of shared memory systems, as applied to a case study particle in cell application. A number of different implementations of them, based on the OpenMP language, are discussed with regard to time efficiency, memory occupancy, and program restructuring effort.

NoT: a high-level no-threading parallel programming method for heterogeneous systems

2019 ◽  
Vol 75 (7) ◽  
pp. 3810-3841 ◽  
Author(s):  
Shusen Wu ◽  
Xiaoshe Dong ◽  
Xingjun Zhang ◽  
Zhengdong Zhu
Keyword(s):  
Parallel Programming ◽  
Heterogeneous Systems ◽  
Programming Method ◽  
High Level
Sign in / Sign up

Export Citation Format

Share Document