DAEDALUS – A Peer-to-Peer Shared Memory System for Ubiquitous Computing

2006 ◽  
pp. 961-970 ◽  
Author(s):  
Peter Ibach ◽  
Vladimir Stantchev ◽  
Christian Keller
Keyword(s):  
Ubiquitous Computing ◽  
Shared Memory ◽  
Memory System ◽  
Peer To Peer ◽  
Shared Memory System

PARALLEL HYBRID METAHEURISTIC ON SHARED MEMORY SYSTEM FOR REAL-TIME UAV PATH PLANNING

2014 ◽  
Vol 13 (02) ◽  
pp. 1450008 ◽  
Author(s):  
VINCENT ROBERGE ◽  
MOHAMMED TARBOUCHI ◽  
FRANÇOIS ALLAIRE
Keyword(s):  
Real Time ◽  
Shared Memory ◽  
Execution Time ◽  
Hybrid Algorithm ◽  
Statistical Significance ◽  
Optimization Methods ◽  
Memory System ◽  
Hybrid Metaheuristic ◽  
Parallel Hybrid ◽  
Shared Memory System

In this paper, we present a parallel hybrid metaheuristic that combines the strengths of the particle swarm optimization (PSO) and the genetic algorithm (GA) to produce an improved path-planner algorithm for fixed wing unmanned aerial vehicles (UAVs). The proposed solution uses a multi-objective cost function we developed and generates in real-time feasible and quasi-optimal trajectories in complex 3D environments. Our parallel hybrid algorithm simulates multiple GA populations and PSO swarms in parallel while allowing migration of solutions. This collaboration between the GA and the PSO leads to an algorithm that exhibits the strengths of both optimization methods and produces superior solutions. Moreover, by using the "single-program, multiple-data" parallel programming paradigm, we maximize the use of today's multicore CPU and significantly reduce the execution time of the parallel program compared to a sequential implementation. We observed a quasi-linear speedup of 10.7 times faster on a 12-core shared memory system resulting in an execution time of 5 s which allows in-flight planning. Finally, we show with statistical significance that our parallel hybrid algorithm produces superior trajectories to the parallel GA or the parallel PSO we previously developed.

scholarly journals Cluster-Enabled OpenMP: An OpenMP Compiler for the SCASH Software Distributed Shared Memory System

2001 ◽  
Vol 9 (2-3) ◽  
pp. 123-130 ◽  
Author(s):  
Mitsuhisa Sato ◽  
Hiroshi Harada ◽  
Atsushi Hasegawa ◽  
Yutaka Ishikawa
Keyword(s):  
Shared Memory ◽  
Programming Model ◽  
Distributed Shared Memory ◽  
Memory System ◽  
Data Mapping ◽  
Loop Scheduling ◽  
Parallel Programming Model ◽  
Scheduling Method ◽  
Shared Memory System ◽  
Software Distributed Shared Memory

OpenMP is attracting wide-spread interest because of its easy-to-use parallel programming model for shared memory multiprocessors. We have implemented a "cluster-enabled" OpenMP compiler for a page-based software distributed shared memory system, SCASH, which works on a cluster of PCs. It allows OpenMP programs to run transparently in a distributed memory environment. The compiler transforms OpenMP programs into parallel programs using SCASH so that shared global variables are allocated at run time in the shared address space of SCASH. A set of directives is added to specify data mapping and loop scheduling method which schedules iterations onto threads associated with the data mapping. Our experimental results show that the data mapping may greatly impact on the performance of OpenMP programs in the software distributed shared memory system. The performance of some NAS parallel benchmark programs in OpenMP is improved by using our extended directives.

Parallelization and optimization of Mfold on shared memory system

2010 ◽  
Vol 36 (9) ◽  
pp. 487-494 ◽  
Author(s):  
Qiankun Miao ◽  
Guangzhong Sun ◽  
Jiulong Shan ◽  
Guoliang Chen
Keyword(s):  
Shared Memory ◽  
Memory System ◽  
Shared Memory System
Sign in / Sign up

Export Citation Format

Share Document