Asynchronous and implicitly parallel evolutionary computation models

نویسندگان

  • Domagoj Jakobovic
  • Marin Golub
  • Marko Cupic
چکیده

This paper presents the design and the applica1 tion of asynchronous models of parallel evolutionary algo2 rithms. An overview of the existing parallel evolutionary 3 algorithm (PEA) models and available implementations is 4 given. We present new PEA models in the form of asynchro5 nous algorithms and implicit parallelization, as well as exper6 imental data on their efficiency. The paper also discusses the 7 definition of speedup in PEAs and proposes an appropriate 8 speedup measurement procedure. The described parallel EA 9 algorithms are tested on problems with varying degrees of 10 computational complexity. The results show good efficiency 11 of asynchronous and implicit models compared to existing 12 parallel algorithms. 13

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementing Parallel Evolutionary Algorithms in a Distributed Workflow

This paper contains research focused on the utilization of evolutionary algorithms (EAs), specifically the use of the DEAP library, in the environment of an implicitly parallel language. This research was motivated primarily by a desire to allow user to implement parallel EAs without the prerequisite mastery of MPI. The computation of EAs consist of many instances of the same computational oper...

متن کامل

بررسی نقش عوامل مؤثر بر فراوانی حوادث در لوله‌های اصلی آب رسانی ‌با استفاده از الگوی رگرسیونی ترکیبی

A water distribution network is one of the important parts of infrastructure systems. The efficient management and proactive planning of capital investment of these assets are fundamental for efficient and effective service delivered by water companies. The direct economic costs (i.e. rehabilitation investment, repair costs, water loss, etc.) as well as indirect costs (i.e. service and traffic ...

متن کامل

Asynchronous Random Polling Dynamic Load Balancing

Many applications in parallel processing have to traverse large, implicitly deened trees with irregular shape. The receiver initiated load balancing algorithm random polling has long been known to be very eecient for these problems in practice. For any > 0, we prove that its parallel execution time is at most (1 +)Tseq=P + O(Tatomic + h(1 +Trout +T split)) with high probability, where Trout, T ...

متن کامل

Giraph Unchained: Barrierless Asynchronous Parallel Execution in Pregel-like Graph Processing Systems

The bulk synchronous parallel (BSP) model used by synchronous graph processing systems allows algorithms to be easily implemented and reasoned about. However, BSP can suffer from poor performance due to stale messages and frequent global synchronization barriers. Asynchronous computation models have been proposed to alleviate these overheads but existing asynchronous systems that implement such...

متن کامل

Asynchronous Master-Slave Parallelization of Differential Evolution for Multi-Objective Optimization

In this paper, we present AMS-DEMO, an asynchronous master-slave implementation of DEMO, an evolutionary algorithm for multi-objective optimization. AMS-DEMO was designed for solving time-intensive problems efficiently on both homogeneous and heterogeneous parallel computer architectures. The algorithm is used as a test case for the asynchronous master-slave parallelization of multi-objective o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Soft Comput.

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2014