Design Space Exploration

Slides:



Advertisements
Similar presentations
Pareto Points Karl Lieberherr Slides from Peter Marwedel University of Dortmund.
Advertisements

Local Search Algorithms
Neural and Evolutionary Computing - Lecture 4 1 Random Search Algorithms. Simulated Annealing Motivation Simple Random Search Algorithms Simulated Annealing.
*time Optimization Heiko, Diego, Thomas, Kevin, Andreas, Jens.
1 HW/SW Partitioning Embedded Systems Design. 2 Hardware/Software Codesign “Exploration of the system design space formed by combinations of hardware.
Design Space Exploration using Time and Resource Duality with the Ant Colony Optimization Gang Wang, Wenrui Gong, Brian DeRenzi and Ryan Kastner Dept.
System Partitioning Kris Kuchcinski
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
By Rohit Ray ESE 251.  Most minimization (maximization) strategies work to find the nearest local minimum  Trapped at local minimums (maxima)  Standard.
Metaheuristics The idea: search the solution space directly. No math models, only a set of algorithmic steps, iterative method. Find a feasible solution.
Elements of the Heuristic Approach
October 26, 2006 Parallel Image Processing Programming and Architecture IST PhD Lunch Seminar Wouter Caarls Quantitative Imaging Group.
1 Exploring Custom Instruction Synthesis for Application-Specific Instruction Set Processors with Multiple Design Objectives Lin, Hai Fei, Yunsi ACM/IEEE.
Simulation in Wind Turbine Vibrations: A Data Driven Analysis Graduate Students: Zijun Zhang PI: Andrew Kusiak Intelligent Systems Laboratory The University.
1 Franck FONTANILI - CGI IMSM'07 Content of the presentation Introduction and context Problem Proposed solution Results Conclusions and perspectives discrete-event.
Resource Mapping and Scheduling for Heterogeneous Network Processor Systems Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinha, Arunabha Sen and Andrea.
Iterative Improvement Algorithm 2012/03/20. Outline Local Search Algorithms Hill-Climbing Search Simulated Annealing Search Local Beam Search Genetic.
C OMPARING T HREE H EURISTIC S EARCH M ETHODS FOR F UNCTIONAL P ARTITIONING IN H ARDWARE -S OFTWARE C ODESIGN Theerayod Wiangtong, Peter Y. K. Cheung and.
1 SYNTHESIS of PIPELINED SYSTEMS for the CONTEMPORANEOUS EXECUTION of PERIODIC and APERIODIC TASKS with HARD REAL-TIME CONSTRAINTS Paolo Palazzari Luca.
Advanced Computer Architecture & Processing Systems Research Lab Framework for Automatic Design Space Exploration.
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
Optimization Problems
Parameter Sweep and Resources Scaling Automation in Scalarm Data Farming Platform J. Liput, M. Paciorek, M. Wrona, M. Orzechowski, R. Slota, and J. Kitowski.
Multi-cellular paradigm The molecular level can support self- replication (and self- repair). But we also need cells that can be designed to fit the specific.
Sub-fields of computer science. Sub-fields of computer science.
Optimization Problems
CSCI 4310 Lecture 10: Local Search Algorithms
MAE 552 Heuristic Optimization
Department of Computer Science
COMPUTATIONAL MODELS.
Van Laarhoven, Aarts Version 1, October 2000
Last time: Problem-Solving
School of Computer Science & Engineering
Artificial Intelligence (CS 370D)
April 6, 2001 Gary Kimura Lecture #6 April 6, 2001
Title: Suggestion Strategies for Constraint- Based Matchmaker Agents
Parallel Cooperative Optimization Research Group
Local Search Algorithms
Tabu Search Review: Branch and bound has a “rigid” memory structure (i.e. all branches are completed or fathomed). Simulated Annealing has no memory structure.
By Rohit Ray ESE 251 Simulated Annealing.
ME 521 Computer Aided Design 15-Optimization
Clustering (3) Center-based algorithms Fuzzy k-means
Computer Science cpsc322, Lecture 14
Artificial Intelligence (CS 370D)
Gabor Madl Ph.D. Candidate, UC Irvine Advisor: Nikil Dutt
HW #1 Due 29/9/2008 Write Java Applet to solve Goats and Cabbage “Missionaries and cannibals” problem with the following search algorithms: Breadth first.
Computer Science cpsc322, Lecture 14
Optimization Problems
Heuristic Optimization Methods Pareto Multiobjective Optimization
COMP60621 Designing for Parallelism
Multi-Objective Optimization
Discrete Mathematics CMP-101 Lecture 12 Sorting, Bubble Sort, Insertion Sort, Greedy Algorithms Abdul Hameed
The use of Neural Networks to schedule flow-shop with dynamic job arrival ‘A Multi-Neural Network Learning for lot Sizing and Sequencing on a Flow-Shop’
Professor Ioana Banicescu CSE 8843
Architecture & System Performance
Xin-She Yang, Nature-Inspired Optimization Algorithms, Elsevier, 2014
Chapter 5. Advanced Search
Presented By: Darlene Banta
More on HW 2 (due Jan 26) Again, it must be in Python 2.7.
Md. Tanveer Anwar University of Arkansas
First Exam 18/10/2010.
Local Search Algorithms
Search.
Search.
CSC 380: Design and Analysis of Algorithms
Beyond Classical Search
Area Coverage Problem Optimization by (local) Search
Some issues of design philosophy…
Stochastic Methods.
Multiobjective Optimization
Presentation transcript:

Design Space Exploration Wouter Caarls Max Planck Institute for Biophysical Chemistry EVA project meeting, 29-6-2009

What is DSE? Explore the space of possible processing architectures in order to determine an optimal design for solving a certain problem. What is optimal? May also include different algorithms for solving the problem Is not necessarily automated

Why DSE? Tailor architecture to program, instead of other way around Consider many architectures, instead of just what’s familiar Application may change Product requirements Implementation/algorithms

How does it work? Take an initial set of architectures Predict the performance of the application on those architectures Evaluate the performance according to some evaluation criterion. If satisfied, go to 5 Find new architectures based on the best scoring ones and go to 2 Choose an architecture Execute the application on the chosen architecture

1. Generating initial architectures Random Increasing complexity Decreasing complexity

2. Performance prediction Must work for many possible architectures Different processor architectures Processor parameters (Heterogeneous) multiprocessing Interconnect Implementation strategies OS parameters (mapping & scheduling) For each function Benchmarking Annotation For the application Discrete event simulation

3. Evaluation Criteria Optimization strategy Speed Power consumption Cost Optimization strategy Some minimal requirements are often known beforehand But tradeoff must always be made manually Requires optimization of a tradeoff (Pareto) curve

Optimization strategy Constrained single objective performance cost minimum performance

Optimization strategy Multiobjective tradeoff iteration performance cost

Optimization strategy Strength Pareto performance cost

4. Exploration Hill climbing Simulated annealing Evolutionary algorithm

5. Selection Ultimate tradeoff made by human

6. Execution Different processor parameters Multiple processors High-level programming language Multiple processors Parallel language Multiple processing paradigms Multiple implementations Very high level language