To View Abstracts in Advance (Pdf)

Total Page:16

File Type:pdf, Size:1020Kb

To View Abstracts in Advance (Pdf) Proceedings of 23rd IEEE International Parallel and Distributed Processing Symposium IPDPS 2009 Advance Program Abstracts Abstracts for both contributed papers and all workshops have been compiled to allow authors to check accuracy and so that visitors to this website may preview the papers to be presented at the conference. Full proceedings of the conference will be published on a cdrom to be dis- tributed to registrants at the conference. Contents Session 1: Algorithms - Scheduling I 2 On Scheduling Dags to Maximize Area . 3 Efficient Scheduling of Task Graph Collections on Heterogeneous Resources . 3 Static Strategies for Worksharing with Unrecoverable Interruptions . 4 On the Complexity of Mapping Pipelined Filtering Services on Heterogeneous Platforms . 4 Session 2: Applications - Biological Applications 5 Sequence Alignment with GPU: Performance and Design Challenges . 6 Evaluating the use of GPUs in Liver Image Segmentation and HMMER Database Searches . 6 Improving MPI-HMMER’s Scalability with Parallel I/O . 7 Accelerating Leukocyte Tracking Using CUDA: A Case Study in Leveraging Manycore Coprocessors . 7 Session 3: Architecture - Memory Hierarchy and Transactional Memory 8 Efficient Shared Cache Management through Sharing-Aware Replacement and Streaming-Aware Insertion Policy . 9 Core-aware Memory Access Scheduling Schemes . 9 Using Hardware Transactional Memory for Data Race Detection . 10 Speculation-Based Conflict Resolution in Hardware Transactional Memory . 10 Session 4: Software - Fault Tolerance and Runtime Systems 11 Compiler-Enhanced Incremental Checkpointing for OpenMP Applications . 12 DMTCP: Transparent Checkpointing for Cluster Computations and the Desktop . 12 Elastic Scaling of Data Parallel Operators in Stream Processing . 13 Scalable RDMA performance in PGAS languages . 13 Session 5: Algorithms - Resource Management 14 Singular Value Decomposition on GPU using CUDA . 15 Coupled Placement in Modern Data Centers . 15 An Upload Bandwidth Threshold for Peer-to-Peer Video-on-Demand Scalability . 16 Competitive Buffer Management with Packet Dependencies . 16 Session 6: Applications - System Software and Applications 17 Annotation-Based Empirical Performance Tuning Using Orio . 18 Automatic Detection of Parallel Applications Computation Phases . 18 Handling OS Jitter on Multicore Multithreaded Systems . 19 Building a Parallel Pipelined External Memory Algorithm Library . 19 Session 7: Architecture - Power Efficiency and Process Variability 20 On Reducing Misspeculations in a Pipelined Scheduler . 21 Efficient Microarchitecture Policies for Accurately Adapting to Power Constraints . 21 An On/Off Link Activation Method for Low-Power Ethernet in PC Clusters . 22 A new mechanism to deal with process variability in NoC links . 22 Session 8: Software - Data Parallel Programming Frameworks 23 A framework for efficient and scalable execution of domain-specific templates on GPUs . 24 A Cross-Input Adaptive Framework for GPU Program Optimizations . 24 CellMR: A Framework for Supporting MapReduce on Asymmetric Cell-Based Clusters . 25 Message Passing on Data-Parallel Architectures . 25 i Session 9: Algorithms - Scheduling II 26 Online time constrained scheduling with penalties . 27 Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks . 27 Energy Minimization for Periodic Real-Time Tasks on Heterogeneous Processing Units . 28 Multi-Users Scheduling in Parallel Systems . 28 Session 10: Applications - Graph and String Applications 29 Input-independent, Scalable and Fast String Matching on the Cray XMT . 30 Compact Graph Representations and Parallel Connectivity Algorithms for Massive Dynamic Network Analysis . 30 Transitive Closure on the Cell Broadband Engine: A study on Self-Scheduling in a Multicore Processor . 31 Parallel Short Sequence Mapping for High Throughput Genome Sequencing . 31 Session 11: Architecture - Networks and Interconnects 32 TupleQ: Fully-Asynchronous and Zero-Copy MPI over InfiniBand . 33 Disjoint-Path Routing: Efficient Communication for Streaming Applications . 33 Performance Analysis of Optical Packet Switches Enhanced with Electronic Buffering . 34 An Approach for Matching Communication Patterns in Parallel Applications . 34 Session 12: Software - I/O and File Systems 35 Adaptable, Metadata Rich IO Methods for Portable High Performance IO . 36 Small-File Access in Parallel File Systems . 37 Making Resonance a Common Case: A High-Performance Implementation of Collective I/O on Parallel File Systems 38 Design, Implementation, and Evaluation of Transparent pNFS on Lustre . 38 Plenary Session: Best Papers 39 Crash Fault Detection in Celerating Environments . 40 HPCC RandomAccess Benchmark for Next Generation Supercomputers . 40 Exploring the Multiple-GPU Design Space . 41 Accommodating Bursts in Distributed Stream Processing Systems . 41 Session 13: Algorithms - General Theory 42 Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions . 43 Remote-Spanners: What to Know beyond Neighbors . 43 A Fusion-based Approach for Tolerating Faults in Finite State Machines . 44 The Weak Mutual Exclusion Problem . 44 Session 14: Applications - Data Intensive Applications 45 Best-Effort Parallel Execution Framework for Recognition and Mining Applications . 46 Multi-Dimensional Characterization of Temporal Data Mining on Graphics Processors . 46 A Partition-based Approach to Support Streaming Updates over Persistent Data in an Active Data Warehouse . 47 Architectural Implications for Spatial Object Association Algorithms . 47 Session 15: Architecture - Emerging Architectures and Performance Modeling 48 vCUDA: GPU Accelerated High Performance Computing in Virtual Machines . 49 Understanding the Design Trade-offs among Current Multicore Systems for Numerical Computations . 49 Parallel Data-Locality Aware Stencil Computations on Modern Micro-Architectures . 50 Performance Projection of HPC Applications Using SPEC CFP2006 Benchmarks . 50 Session 16: Software - Distributed Systems, Scheduling and Memory Management 51 Work-First and Help-First Scheduling Policies for Async-Finish Task Parallelism . 52 Autonomic management of non-functional concerns in distributed & parallel application programming . 52 Scheduling Resizable Parallel Applications . 53 Helgrind+: An Efficient Dynamic Race Detector . 53 ii Session 17: Algorithms - Wireless Networks 54 Sensor Network Connectivity with Multiple Directional Antennae of a Given Angular Sum . 55 Unit Disk Graph and Physical Interference Model: Putting Pieces Together . 55 Path-Robust Multi-Channel Wireless Networks . 56 Information Spreading in Stationary Markovian Evolving Graphs . 56 Session 18: Applications I - Cluster/Grid/P2P Computing 57 Multiple Priority Customer Service Guarantees in Cluster Computing . 58 Treat-Before-Trick : Free-riding Prevention for BitTorrent-like Peer-to-Peer Networks . 58 A Resource Allocation Approach for Supporting Time-Critical Applications in Grid Environments . 59 Session 19: Applications II - Multicore 60 High-Order Stencil Computations on Multicore Clusters . 61 Dynamic Iterations for the Solution of Ordinary Differential Equations on Multicore Processors . 62 Efficient Large-Scale Model Checking . 62 Session 20: Software - Parallel Compilers and Languages 63 A Scalable Auto-tuning Framework for Compiler Optimization . 64 Taking the Heat off Transactions: Dynamic Selection of Pessimistic Concurrency Control . 64 Packer: an Innovative Space-Time-Efficient Parallel Garbage Collection Algorithm Based on Virtual Spaces . 65 Concurrent SSA for General Barrier-Synchronized Parallel Programs . 65 Session 21: Algorithms - Self-Stabilization 66 Optimal Deterministic Self-stabilizing Vertex Coloring in Unidirectional Anonymous Networks . 67 Self-stabilizing minimum-degree spanning tree within one from the optimal degree . 67 A snap-stabilizing point-to-point communication protocol in message-switched networks . 68 An Asynchronous Leader Election Algorithm for Dynamic Networks . 68 Session 22: Applications - Scientific Applications 69 A Metascalable Computing Framework for Large Spatiotemporal-Scale Atomistic Simulations . 70 Scalability Challenges for Massively Parallel AMR Applications . 70 Parallel Accelerated Cartesian Expansions for Particle Dynamics Simulations . 71 Parallel Implementation of Irregular Terrain Model on IBM Cell Broadband Engine . 71 Session 23: Software - Communications Systems 72 Phaser Accumulators: a New Reduction Construct for Dynamic Parallelism . 73 NewMadeleine: An Efficient Support for High-Performance Networks in MPICH2 . 73 Scaling Communication-Intensive Applications on BlueGene/P Using One-Sided Communication and Overlap . 74 Dynamic High-Level Scripting in Parallel Applications . 74 Session 24: Algorithms - Network Algorithms 75 Map Construction and Exploration by Mobile Agents Scattered in a Dangerous Network . 76 A General Approach to Toroidal Mesh Decontamination with Local Immunity . 76 On the Tradeoff Between Playback Delay and Buffer Space in Streaming . 77 Session 25: Applications - Sorting and FFTs 78 A Performance Model for Fast Fourier Transform . 79 Designing Efficient Sorting Algorithms for Manycore GPUs . 80 Minimizing Startup Costs for Performance-Critical Threading . 80 iii Workshop 1: Heterogeneity in Computing Workshop 81 Offer-based Scheduling of Deadline-Constrained Bag-of-Tasks Applications for Utility Computing Systems . 82 Resource-aware allocation strategies for divisible loads on large-scale systems . 82 Robust Sequential Resource Allocation in Heterogeneous Distributed Systems with Random Compute Node Failures 83 Revisiting communication performance models for computational clusters . 83 Cost-Benefit Analysis of Cloud Computing versus Desktop Grids . 84 Robust Data Placement in Urgent Computing Environments . ..
Recommended publications
  • Appendix H: MOEA Software Availability
    H MOEA Software Availability H.1 Introduction This appendix describes some of the main public-domain MOEA software that is currently available. This description includes the following information: Name: Name of the software system Description: Any relevant information about the system Environment: Software environment for which the software is intended Language: Programming language in which the software is written Availability: Software availability Original sources of each of the systems analyzed are cited, but readers should be aware of the fact that many of these systems are also mirrored at the EMOO repository located at (see under Software): http://delta.cs.cinvestav.mx/~ccoello/EMOO/ with a mirror at: http://www.lania.mx/~ccoello/EMOO Note that although commercial software for multi-objective optimization also exists (e.g., iSIGHT, which is briefly described in Chapter 5), such systems are not included here, since we limited the contents of this appendix to public- domain software. 678 H MOEA Software Availability Table H.1: MOEA Software Name Description Environment Availability Metaheuristic Includes imple- Any platform Antonio J. Nebro Algorithms in mentations in supporting Java ([email protected]), or download Java (JMetal) Java of: NSGA-II at: http://neo.lcc.uma.es/metal/ [358], SPEA2 index.html [1712], PAES [858], OMOPSO [1546], AbYSS [1137], MOCell [1136]. It also includes several test functions Multiple- Includes: Pareto Linux/Unix; Andrzej Jaszkiewicz Objective Simulated An- Standard C++ ([email protected]) MetaHeuristics
    [Show full text]
  • Metaheuristic Optimization Frameworks: a Survey and Benchmarking
    Soft Comput DOI 10.1007/s00500-011-0754-8 ORIGINAL PAPER Metaheuristic optimization frameworks: a survey and benchmarking Jose´ Antonio Parejo • Antonio Ruiz-Corte´s • Sebastia´n Lozano • Pablo Fernandez Ó Springer-Verlag 2011 Abstract This paper performs an unprecedented com- and affordable time and cost. However, heuristics are parative study of Metaheuristic optimization frameworks. usually based on specific characteristics of the problem at As criteria for comparison a set of 271 features grouped in hand, which makes their design and development a com- 30 characteristics and 6 areas has been selected. These plex task. In order to solve this drawback, metaheuristics features include the different metaheuristic techniques appear as a significant advance (Glover 1977); they are covered, mechanisms for solution encoding, constraint problem-agnostic algorithms that can be adapted to incor- handling, neighborhood specification, hybridization, par- porate the problem-specific knowledge. Metaheuristics allel and distributed computation, software engineering have been remarkably developed in recent decades (Voß best practices, documentation and user interface, etc. A 2001), becoming popular and being applied to many metric has been defined for each feature so that the scores problems in diverse areas (Glover and Kochenberger 2002; obtained by a framework are averaged within each group of Back et al. 1997). However, when new are considered, features, leading to a final average score for each frame- metaheuristics should be implemented and tested, implying work. Out of 33 frameworks ten have been selected from costs and risks. the literature using well-defined filtering criteria, and the As a solution, object-oriented paradigm has become a results of the comparison are analyzed with the aim of successful mechanism used to ease the burden of applica- identifying improvement areas and gaps in specific tion development and particularly, on adapting a given frameworks and the whole set.
    [Show full text]
  • Paradiseo-MO: from Fitness Landscape Analysis to Efficient
    ParadisEO-MO: From Fitness Landscape Analysis to Efficient Local Search Algorithms Jérémie Humeau, Arnaud Liefooghe, El-Ghazali Talbi, Sébastien Verel To cite this version: Jérémie Humeau, Arnaud Liefooghe, El-Ghazali Talbi, Sébastien Verel. ParadisEO-MO: From Fitness Landscape Analysis to Efficient Local Search Algorithms. [Research Report] RR-7871, 2012. hal- 00665421v1 HAL Id: hal-00665421 https://hal.inria.fr/hal-00665421v1 Submitted on 1 Feb 2012 (v1), last revised 4 Jun 2013 (v2) HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. ParadisEO-MO: From Fitness Landscape Analysis to Efficient Local Search Algorithms Jérémie Humeau, Arnaud Liefooghe, El-Ghazali Talbi, Sébastien Verel RESEARCH REPORT N° 7871 February 2012 Project-Team Dolphin ISSN 0249-6399 ISRN INRIA/RR--7871--FR+ENG ParadisEO-MO: From Fitness Landscape Analysis to Efficient Local Search Algorithms Jérémie Humeau∗, Arnaud Liefooghe†, El-Ghazali Talbi‡, Sébastien Verel§ Project-Team Dolphin Research Report n° 7871 — February 2012 — 34 pages Abstract: This document presents a general-purpose software framework dedicated to the design, the analysis and the implementation of local search algorithms: ParadisEO-MO. A sub- stantial number of single-solution based local search metaheuristics has been proposed so far, and an attempt of unifying existing approaches is here presented.
    [Show full text]
  • Arxiv:1903.02915V2 [Cs.NE] 17 Apr 2019 an Important Factor That Has Ignited the Widespread Adop- Namic Problems
    jMetalPy: a Python Framework for Multi-Objective Optimization with Metaheuristics Antonio Ben´ıtez-Hidalgoa, Antonio J. Nebroa, Jose´ Garc´ıa-Nietoa, Izaskun Oregib, Javier Del Serb,c,d aDepartamento de Lenguajes y Ciencias de la Computaci´on,Ada Byron Research Building, University of M´alaga, 29071 M´alaga, Spain bTECNALIA, 48160 Derio, Spain cUniversity of the Basque Country (UPV/EHU), 48013 Bilbao, Spain dBasque Center for Applied Mathematics (BCAM), 48009 Bilbao, Spain Abstract This paper describes jMetalPy, an object-oriented Python-based framework for multi-objective optimization with metaheuristic techniques. Building upon our experiences with the well-known jMetal framework, we have developed a new multi-objective optimization software platform aiming not only at replicating the former one in a different programming language, but also at taking advantage of the full feature set of Python, including its facilities for fast prototyping and the large amount of available libraries for data processing, data analysis, data visualization, and high-performance computing. As a result, jMetalPy provides an environment for solving multi-objective optimization problems focused not only on traditional metaheuristics, but also on techniques supporting preference articulation and dynamic problems, along with a rich set of features related to the automatic generation of statistical data from the results generated, as well as the real-time and interactive visualization of the Pareto front approximations produced by the algorithms. jMetalPy offers additionally support for parallel computing in multicore and cluster systems. We include some use cases to explore the main features of jMetalPy and to illustrate how to work with it. Keywords: Multi-Objective Optimization, Metaheuristics, Software Framework, Python, Statistical Analysis, Visualization 1.
    [Show full text]
  • Paradiseo-MOEO Arnaud Liefooghe, Laetitia Jourdan, El-Ghazali Talbi
    A software framework based on a conceptual unified model for evolutionary multiobjective optimization: ParadisEO-MOEO Arnaud Liefooghe, Laetitia Jourdan, El-Ghazali Talbi To cite this version: Arnaud Liefooghe, Laetitia Jourdan, El-Ghazali Talbi. A software framework based on a conceptual unified model for evolutionary multiobjective optimization: ParadisEO-MOEO. European Journal of Operational Research, Elsevier, 2011, 209 (2), pp.104-112. 10.1016/j.ejor.2010.07.023. hal-00522612 HAL Id: hal-00522612 https://hal.archives-ouvertes.fr/hal-00522612 Submitted on 1 Oct 2010 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. European Journal of Operational Research xxx (2010) xxx–xxx Contents lists available at ScienceDirect European Journal of Operational Research journal homepage: www.elsevier.com/locate/ejor Decision Support A software framework based on a conceptual unified model for evolutionary multiobjective optimization: ParadisEO-MOEO ⇑ Arnaud Liefooghe a,b, , Laetitia Jourdan a, El-Ghazali Talbi a,c a Université Lille 1, Laboratoire d’Informatique Fondamentale de Lille, UMR CNRS 8022, INRIA Lille-Nord Europe, Parc Scientifique de la Haute Borne, 40 Avenue Halley, 59650 Villeneuve d’Ascq, France b University of Coimbra, CISUC, Department of Informatics Engineering, Portugal c King Saud University, Riyadh, Saudi Arabia article info abstract Article history: This paper presents a general-purpose software framework dedicated to the design and the implementa- Received 24 April 2009 tion of evolutionary multiobjective optimization techniques: ParadisEO-MOEO.
    [Show full text]
  • Parallel Evolutionary Algorithms for Multi- Objective Optimization
    Parallel evolutionary algorithms for multi- objective optimization Prof. El-Ghazali TALBI University Lille 1 [email protected] www.lifl.fr/~talbi Motivations . High-dimensional and complex optimization problems in many areas of academic and industrial concern Telecommunication, genomics, transportation, engineering design, … . Metaheuristics (ex. EAs) reduce the computational complexity of search BUT Parallel issue remains important: . More and more complex metaheuristics . Huge search space . CPU or memory intensive of the objective function Motivations . Rapid development of technology . Processors: Multi-core processors, GPU, … . Networks (LAN & WAN): Myrinet, Infiniband, Optical networks, … . Data storage . Increasing ratio performance / cost Goals . Speedup the search real-time and interactive optimization methods, dynamic optimisation, … . Improve quality of solutions cooperation, better even on a single processor . Improve robustness (different instances, design space) . Solving large problems instances, accuracy of mathematics models Taxonomy of metaheuristics Metaheuristics Single Population solution Hill Simulated Tabu Evol. Swarm Climbing annealing search algorithms optimisation . Solution-based metaheuristics: Hill Climbing, Simulated Annealing, Tabu Search, VNS, … . Population-based metaheuristics: Evolutionary Algorithms, Scatter Search, Swarm optimization, … Outline . Parallel Metaheuristics: Design issues . Parallel Metaheuristics: Implementation issues . Hardware platforms, Programming models . Performance
    [Show full text]
  • Paradiseo-MOEO Arnaud Liefooghe, Laetitia Jourdan, El-Ghazali Talbi
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by HAL - Lille 3 A Unified Model for Evolutionary Multiobjective Optimization and its Implementation in a General Purpose Software Framework: ParadisEO-MOEO Arnaud Liefooghe, Laetitia Jourdan, El-Ghazali Talbi To cite this version: Arnaud Liefooghe, Laetitia Jourdan, El-Ghazali Talbi. A Unified Model for Evolutionary Mul- tiobjective Optimization and its Implementation in a General Purpose Software Framework: ParadisEO-MOEO. [Research Report] RR-6906, INRIA. 2009. <inria-00376770> HAL Id: inria-00376770 https://hal.inria.fr/inria-00376770 Submitted on 20 Apr 2009 HAL is a multi-disciplinary open access L'archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destin´eeau d´ep^otet `ala diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publi´esou non, lished or not. The documents may come from ´emanant des ´etablissements d'enseignement et de teaching and research institutions in France or recherche fran¸caisou ´etrangers,des laboratoires abroad, or from public or private research centers. publics ou priv´es. INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE A Unified Model for Evolutionary Multiobjective Optimization and its Implementation in a General Purpose Software Framework: ParadisEO-MOEO Arnaud Liefooghe — Laetitia Jourdan — El-Ghazali Talbi N° 6906 April 2009 Thème NUM apport de recherche ISSN 0249-6399 ISRN INRIA/RR--6906--FR+ENG A Unified Model for Evolutionary Multiobjective Optimization and its Implementation in a General Purpose Software Framework: ParadisEO-MOEO Arnaud Liefooghe , Laetitia Jourdan , El-Ghazali Talbi Th`eme NUM — Syst`emes num´eriques Equipe-Projet´ Dolphin Rapport de recherche n° 6906 — April 2009 — 28 pages Abstract: This paper gives a concise overview of evolutionary algorithms for multiobjective optimization.
    [Show full text]
  • An Experimental Comparison of Metaheuristic Frameworks for Multi-Objective Optimization
    An experimental comparison of metaheuristic frameworks for multi-objective optimization | Extended study | Technical Report Aurora Ram´ırez, Rafael Barbudo and Jos´eRa´ulRomero1 Knowledge Discovery and Intelligent Systems Research Group Department of Computer Science and Numerical Analysis University of C´ordoba September 27, 2020 1Corresponding author: [email protected] An experimental comparison of metaheuristic frameworks for multi-objective optimization 1 Introduction Metaheuristic optimization frameworks (MOFs) are software tools or class libraries that provide a collection of extensible building blocks to create algorithms and experiments aimed at solving optimization problems. Several alternatives are currently available to deal with multi-objective optimization (MOO) problems, which are characterized by the definition of two or more objectives. This technical report is provided as additional material to the research paper of the same title. Therefore, the information presented in this technical report is intended to complement those aspects that have been summarized or omitted due to space limitations. Essentially, it provides further details about the evaluation of ten MOFs in terms of characteristics like the set of algorithms and operators each one offers or the availability of general utilities, among others. This document presents the information extracted from the available documentation and the source code, serving as a reference guide to domain experts and researchers interested in the application of metaheuristic algorithms to solve multi-objective problems. More specifically, the content of this technical report can be summarized as follows: • The detailed methodology followed to evaluate the frameworks, including technical details of external tools and the experimental environment. • The exhaustive evaluation of each characteristic is presented in tables.
    [Show full text]
  • Paradiseo-MOEO
    ParadisEO-MOEO: A Software Framework for Evolutionary Multi-Objective Optimization Arnaud Liefooghe, Laetitia Jourdan, Thomas Legrand, Jérémie Humeau, El-Ghazali Talbi To cite this version: Arnaud Liefooghe, Laetitia Jourdan, Thomas Legrand, Jérémie Humeau, El-Ghazali Talbi. ParadisEO-MOEO: A Software Framework for Evolutionary Multi-Objective Optimization. Ad- vances in Multi-Objective Nature Inspired Computing, Springer Berlin / Heidelberg, pp.87-117, 2010, 10.1007/978-3-642-11218-8_5. hal-00522623 HAL Id: hal-00522623 https://hal.archives-ouvertes.fr/hal-00522623 Submitted on 1 Oct 2010 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. 5 ParadisEO-MOEO: A Software Framework for Evolutionary Multi-Objective Optimization Arnaud Liefooghe1,2,LaetitiaJourdan1,2,ThomasLegrand2,J´er´emie Humeau2, and El-Ghazali Talbi1,2 1 Laboratoire d’Informatique Fondamentale de Lille (LIFL), UMR CNRS 8022, Universit´eLille1,Bˆatiment M3, 59655 Villeneuve d’Ascq cedex, France 2 INRIA Lille-Nord Europe, Parc Scientifique de la Haute Borne, 40 avenue Halley, 59650 Villeneuve d’Ascq, France [email protected], [email protected], [email protected], [email protected], [email protected] Summary. This chapter presents ParadisEO-MOEO, awhite-boxobject-orientedsoftware framework dedicated to the flexible design of metaheuristics for multi-objective optimization.
    [Show full text]
  • From Fitness Landscape Analysis to Efficient Local Search Algorithms
    ParadisEO-MO: From Fitness Landscape Analysis to Efficient Local Search Algorithms Jérémie Humeau, Arnaud Liefooghe, El-Ghazali Talbi, Sébastien Verel To cite this version: Jérémie Humeau, Arnaud Liefooghe, El-Ghazali Talbi, Sébastien Verel. ParadisEO-MO: From Fitness Landscape Analysis to Efficient Local Search Algorithms. [Research Report] RR-7871, INRIA. 2013. hal-00665421v2 HAL Id: hal-00665421 https://hal.inria.fr/hal-00665421v2 Submitted on 4 Jun 2013 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. ParadisEO-MO: From Fitness Landscape Analysis to Efficient Local Search Algorithms Jérémie Humeau, Arnaud Liefooghe, El-Ghazali Talbi, Sébastien Verel RESEARCH REPORT N° 7871 June 2013 Project-Team Dolphin ISSN 0249-6399 ISRN INRIA/RR--7871--FR+ENG ParadisEO-MO: From Fitness Landscape Analysis to Efficient Local Search Algorithms Jérémie Humeau∗, Arnaud Liefooghe†, El-Ghazali Talbi‡, Sébastien Verel§ Project-Team Dolphin Research Report n° 7871 — June 2013 — 36 pages Abstract: This document presents a general-purpose software framework dedicated to the design, the analysis and the implementation of local search algorithms: ParadisEO-MO. A sub- stantial number of single-solution based local search metaheuristics has been proposed so far, and an attempt of unifying existing approaches is here presented.
    [Show full text]
  • Analysis of Various Multi-Objective Optimization Evolutionary Algorithms for Monte Carlo Treatment Planning System Summer Student Report
    EUROPEAN ORGANIZATION FOR NUCLEAR RESEARCH EN-STI-FDA Analysis of Various Multi-Objective Optimization Evolutionary Algorithms for Monte Carlo Treatment Planning System Summer Student Report Author Supervisor M. TYDRICHOVA W. Koz lowska August 4, 2017, Geneva Introduction The principal goal of this project was to analyze various multiobjective opti- mization algorithms (MOEA) for the Monte Carlo Treatment Planning System. After doing literature research on testing and quality evaluation methods, the comparison of available frameworks was done to select the most suitable one for our test needs. Then the software for testing was developed, we tried to provide a solid objective-oriented architecture to allow easy modifications in the future, another high priority was to create an user-friendly software. From all available algorithms, candidates for testing were selected. Apart results from the literature that were taken into account to do this selection, we placed emphasis on a diverse scale of algorithms - the aim was not only to find the best performing algorithm, but also to describe the comportment, advantages and weak points of different types of algorithms, in hope that this output could be helpful and valuable for the further research. In performed tests, we focused mostly on the quality of DOSE and LET values of obtained solutions, as the main goal of the problem was to minimize these quantities. Distribution of solutions and population size were also analyzed. Another important criterion was the reliability of the algorithm. That means, we studied if the algorithm performed the same way in all seeds and if it was independent on a given data set.
    [Show full text]
  • Parallel Metaheuristics: from Design to Implementation
    Laboratoire d’Informatique Fondamentale de Lille Parallel Metaheuristics: from Design to Implementation Prof. E-G. Talbi Parallel Cooperative Optimization Research Group Motivations High-dimensional and complex optimization problems in many areas of industrial concern → Telecommunication, genomics, transportation, engineering design, … Metaheuristics reduce the computational complexity of search BUT Parallel issue remains important: More and more complex metaheuristics Huge search space CPU or memory intensive of the objective function Motivations Rapid development of technology Processors: Multi-core processors, … Networks (LAN & WAN): Myrinet, Infiniband, Optical networks, … Data storage Increasing ratio performance / cost Goals Speedup the search Æ real-time and interactive optimization methods, dynamic optimisation, … Improve quality of solutions Æ cooperation, better even on a single processor Improve robustness (different instances, design space) Solving large problems Æ instances, accuracy of mathematics models Taxonomy of metaheuristics Metaheuristics Single Population solution Hill Simulated Tabu Evol. Scatter Climbing annealing search algorithms search Solution-based metaheuristics: Hill Climbing, Simulated Annealing, Tabu Search, VNS, … Population-based metaheuristics: Evolutionary Algorithms, Scatter Search, Swarm optimization, … Outline Parallel Metaheuristics: Design issues Parallel Metaheuristics: Implementation issues Hardware platforms, Programming models Performance evaluation Adaptation to Multi-objective
    [Show full text]