4. Design Space Exploration of Embedded Systems


 Candace Preston
 2 years ago
 Views:
Transcription
1 4. Design Space Exploration of Embedded Systems Lothar Thiele ETH Zurich, Switzerland 41
2 Contents of Lectures (Lothar Thiele) 1. Introduction to Embedded System Design 2. Software for Embedded Systems 3. RealTime Scheduling 4. Design Space Exploration 5. Performance Analysis 42
3 Topics MultiObjective Optimization! Introduction! MultiObjective Optimization! Algorithm Design Design Choices Representation Fitness and Selection Variation Operators! Implementation Design Space Exploration! System Design! Problem Specification! Example 43
4 Evolutionary Multiobjective Optimization Algorithms What are Evolutionary Algorithms? randomized, problemindependent search heuristics applicable to blackbox optimization problems How do they work? by iteratively improving a population of solutions by variation and selection can find many different optimal solution in a single run 44
5 BlackBox Box Optimization StretchModule objective function DecisionModule HandlingModule 100 DX lane ψ DV lane v, a a require decision vector x v v=f(t) lane x, v, a t point of gear change n gear 4 R? gear VehicleModule α α Br Dr α Dr gear s clutch objective vector f(x) lane, x, v a,gear, n (e.g. simulation model) Optimization Algorithm: only allowed to evaluate f (direct search) 45
6 The Knapsack Problem weight = 750g profit = 5 weight = 1500g profit = 8 weight = 300g profit = 7 weight = 1000g profit = 3? Goal: choose subset that maximizes overall profit minimizes total weight 46
7 The Solution Space profit g 1000g 1500g 2000g 2500g 3000g 3500g weight 47
8 The Tradeoff Front Observations: " there is no single optimal solution, but # some solutions ( ) are better than others ( ) profit 20 selecting a solution finding the good solutions 5 500g 1000g 1500g 2000g 2500g 3000g 3500g 48 weight
9 Decision Making: Selecting a Solution Approaches: profit more important than cost (ranking) weight must not exceed 2400g (constraint) profit too heavy 5 500g 1000g 1500g 2000g 2500g 3000g 3500g 49 weight
10 Optimization Alternatives Use of classical single objective optimization methods simulated annealing, tabu search integer linear program other constructive or iterative heuristic methods Decision making (weighting the different objectives) is done before the optimization. Population based optimization methods evolutionary algorithms genetic algorithms Decision making is done after the optimization. 410
11 Optimization Alternatives scalarization weighted sum populationbased SPEA2 y2 y2 y1 y1 parameteroriented scalingdependent 411 setoriented scalingindependent
12 Scalarization Approach multiple objectives (y1, y2,, yk) parameters transformation single objective y example: weighting approach y2 maximization problem (w1, w2,, wk) y = w 1 y w k y k 412 y1
13 A Generic Multiobjective EA population archive evaluate sample vary update truncate new population 413 new archive
14 An Evolutionary Algorithm in Action max. y2 hypothetical tradeoff front 414 min. y1
15 Design Space Exploration Specification Optimization Evaluation Implementation power consumption latency cost 415
16 Packet Processing in Networks Embedded Internet Devices UCB Rabaey method (a)(fsd) for I=1 to n do nothing call comm(a,dsf,*e); end for Wearable Computing Access Core Mobile Mobile Internet 416
17 Network Processors Network processor = highperformance, programmable device designed to efficiently execute communication workloads [Crowley et al.: 2003] incoming flows (packet streams) routing / forwarding transcoding encryption / decryption outgoing flows (processed packets) e.g., voice e.g., sftp realtime flows nonrealtime flows network processor (NP)? 417
18 Optimization Scenario: Overview Given: " specification of the task structure (task model) = for each flow the corresponding tasks to be executed # different usage scenarios (flow model) = sets of flows with different characteristics Sought: network processor implementation (resource model) = architecture + task mapping + scheduling Objectives: " maximize performance # minimize cost Subject to: " memory constraint # delay constraints (performance model) 418
19 Topics MultiObjective Optimization Introduction MultiObjective Optimization Algorithm Design Design Choices Representation Fitness and Selection Variation Operators Implementation Design Space Exploration System Design Problem Specification Example 419
20 Dominance, Pareto Points A (design) point J k is dominated by J i, if J i is better or equal than J k in all criteria and better in at least one criterion. A point is Paretooptimal or a Paretopoint, if it is not dominated. The domination relation imposes a partial order on all design points We are faced with a set of optimal solutions. Divergence of solutions vs. convergence. 420
21 Multiobjective Optimization 421
22 Multiobjective Optimization Maximize (y1, y2,, yk) = ƒ(x1, x2,, xn) y2 y2 Pareto optimal = not dominated better incomparable dominated worse incomparable y1 y1 Pareto set = set of all Paretooptimal solutions 422
23 Randomized (Black Box) Search Algorithms Idea: find good solutions without investigating all solutions Assumptions:better solutions can be found in the neighborhood of good solutions information available only by function evaluations Randomized search algorithm t = 1: (randomly) choose a solution x 1 to start with ƒ t t+1: (randomly) choose a solution x t+1 using solutions x 1,, x t 423
24 Types of Randomized Search Algorithms memory selection variation mating selection environmental selection EA 1 both evolutionary algorithm TS tabu search 1 no mating selection SA simulated annealing 1 no mating selection 424
25 Limitations of Randomized Search Algorithms The NoFreeLunch Theorem All search algorithms provide in average the same performance on a all possible functions with finite search and objective spaces. Remarks: [Wolpert, McReady: 1997] Not all functions equally likely and realistic We cannot expect to design the algorithm beating all others Ongoing research: which algorithm suited for which class of problem? 425
26 Topics MultiObjective Optimization Introduction MultiObjective Optimization Algorithm Design Design Choices Representation Fitness and Selection Variation Operators Implementation Design Space Exploration System Design Problem Specification Example 426
27 Design Choices representation fitness assignment mating selection parameters environmental selection variation operators 427
28 Issues in MultiObjective Optimization y2 Diversity How to maintain a diverse Pareto set approximation? # density estimation How to prevent nondominated solutions from being lost? $ environmental selection y1 Convergence How to guide the population towards the Pareto set? " fitness assignment 428
29 Comparison of Three Implementations 2objective knapsack problem SPEA2 VEGA extended VEGA Tradeoff between distance and diversity? 429
30 Topics MultiObjective Optimization Introduction MultiObjective Optimization Algorithm Design Design Choices Representation Fitness Variation Operators Implementation Design Space Exploration System Design Problem Specification Example 430
31 Representation search space decoder solution space objectives objective space m ƒ solutions encoded by vectors, matrices, trees, lists,... Issues: 431 fixed length variable length completeness (each solution has an encoding) uniformity (all solutions are represented equally) redundancy (cardinality of search space vs. solution space) feasibility (each encoding maps to a feasible solution)
32 Example: Binary Vector Encoding Given: graph Goal: find minimum subset of nodes such that each edge is connected to at least one node of this subset (minimum vertex cover) A B C D E nodes selected? A 1 B 0 C 1 D 1 E 1 F
33 Example: Integer Vector Encoding Given: graph, k colors Goal: assign each node one of the k colors such that the number of connected nodes with the same color is minimized (graph coloring problem) A B C D E nodes colors A 1 B 2 C 1 D 3 E 1 F
34 Example: Real Vector Encoding parameters values [Michalewicz, Fogel: How to Solve it. Springer 2000] x 1 x 2 x 3 x x n 9.83
35 Tree Example: Parking a Truck steering angle u dock trailer cab d position (x,y) t constant speed 435 Goal: find function c with u = c(x, y, d, t)
36 Operators: Search Space for the Truck Problem Arguments: X position x Y position y DIFF cab angle d TANG trailer angle t Search space :set of symbolic expression using the above operators and arguments 436
37 Example Solution: Tree Representation MULT MINUS PLUS X DIFF Y TANG encodes the function (symbolic expression): u = (x d) * (y + t) 437
38 A Solution Found by an EA truck simulation encoded tree 438
39 Topics MultiObjective Optimization Introduction MultiObjective Optimization Algorithm Design Design Choices Representation Fitness and Selection Variation Operators Implementation Design Space Exploration System Design Problem Specification Example 439
40 Fitness Assignment Fitness = scalar value representing quality of an individual (usually). Used for mating and environmental selection F i = f ( m (i) ) Difficulties: multiple objectives have to be considered (Pareto set is sought) multiple optima need to be approximated (how to consider diversity?) constraints are involved which have to be met 440
41 Example Pareto Ranking Fitness function: execution time F (1) = F F F (2) (3) (4) = 1 = 1 = 2 4 F (5) = 1 F 5 (6) 0 = cost 441
42 Constraint Handling feasible Constraint = g(x1, x2,, xn) 0 g 0 infeasible g < 0 Approaches: construct initialization and variation such that infeasible solutions are not generated (resp. not inserted) representation is such that decoding always yields a feasible solution calculate constraint violation ( g(x1, x2,, xn) ) and incorporate it into fitness, e.g., F i = f ( m (i) )  g(x1, x2,, xn) (fitness to be maximized) code constraint as a new objective 442
43 Selection Two conflicting goals: exploitation (converge fast) tradeoff exploration (avoid getting stuck) Two types of selection: mating selection = select for variation environmental selection = select for survival 443
44 Example: Tournament Selection = integrated sampling rate assignment and sampling population mating pool " uniformly choose T individuals at random independently of fitness # compare fitness and copy best individual in mating pool T = tournament size (binary tournament selection means T=2) 444
45 Topics MultiObjective Optimization Introduction MultiObjective Optimization Algorithm Design Design Choices Representation Fitness and Selection Variation Operators Implementation Design Space Exploration System Design Problem Specification Example 445
46 Example: Vector Mutation Bit vectors: each bit is flipped with probability 1/6 Permutations: swap rearrange 446
47 Example: Vector Recombination Bit vectors: Permutations: parents child
48 Example: Recombination of Trees MULT PLUS MINUS PLUS TANG MINUS MINUS DIFF Y TANG PLUS DIFF X Y MULT DIFF exchange Y TANG 448
49 Step 1: Generate initial population P0 and empty archive (external set) A 0. Set t = 0. Step 2: Calculate fitness values of individuals in P t and A t. Step 3: A t+1 = nondominated individuals in P t and A t. If size of A t+1 > N then reduce A t+1, else if size of A t+1 < N then fill A t+1 with dominated individuals in P t and A t. Step 4: If t > T then output the nondominated set of A t+1. Stop. Step 5: Fill mating pool by binary tournament selection. Step 6: Example: SPEA2 Algorithm Apply recombination and mutation operators to the mating pool and set P t+1 to the resulting population. Set t = t + 1 and go to Step
50 SPEA2 Fitness Assignment Idea (Step 2): calculate dominance rank weighted by dominance count y nondominated solutions: F = #dominated solutions dominated solutions F = # of nonpareto solutions + strengths of dominators y1 Note: lower raw fitness = better quality 450
51 Topics MultiObjective Optimization Introduction MultiObjective Optimization Algorithm Design Design Choices Representation Fitness and Selection Variation Operators Implementation Design Space Exploration System Design Problem Specification Example 451
52 A framework that What Is Needed Provides readytouse modules (algorithms / applications) Is simple to use Is independent of programming language and OS Comes with minimum overhead Idea: separate problemdependent from problemindependent part cut Selection Fitness assignment Archiving Representation Recombination Mutation Objective functions 452
53 PISA: Implementation shared file file system selector process text files variator process application independent: mating / environmental selection individuals are described by IDs and objective vectors handshake protocol: state / action individual IDs objective vectors parameters 453 application dependent: variation operators stores and manages individuals
54 PISA Installation 454
55 Topics MultiObjective Optimization Introduction MultiObjective Optimization Algorithm Design Design Choices Representation Fitness and Selection Variation Operators Implementation Design Space Exploration System Design Problem Specification Example 455
56 Design Space Exploration Application Architecture Mapping Estimation 456
57 Embedded System Design evaluation architecture template task graph binding restrictions allocation bindings performance / cost vector construct architecture map application estimate performance multiobjective optimization architecture performance 457
58 Example: System Synthesis Given: algorithm mappings architectures f 1, f 2,K Goal: schedule mapping architecture Objectives: cost, latency, power consumption 458
59 Evolutionary Algorithms for DSE individual EA " selection # recombination $ mutation allocation binding decode allocation decode binding scheduling chromosome = encoded allocation + binding design point (implementation) fitness fitness evaluation user constraints 459
60 Topics MultiObjective Optimization Introduction MultiObjective Optimization Algorithm Design Design Choices Representation Fitness and Selection Variation Operators Implementation Design Space Exploration System Design Problem Specification Example 460
61 Basic Model Problem Graph Problem graph G P (V P,E P ): Interpretation: V P consists of functional nodes V f P (task, procedure) and communication nodes V c P. E P represent data dependencies 461
62 Basic model architecture graph Architecture graph G A (V A,E A ): RISC HWM1 RISC HWM1 shared bus HWM2 Architecture PTP bus shared bus HWM2 Architecture graph PTP bus V A consists of functional resources V A f (RISC, ASIC) and bus resources V A c. These components are potentially allocatable. E A model directed communication. 462
63 Basic model specification graph Definition: Aspecification graph is a graph G S =(V S,E S ) consisting of a problem graph G P, an architecture graph G A, and edges E M.In particular, V S =V P V A, E S =E P E A E M G P E M G A RISC SB HWM1 PTP HWM2 463
64 Basic model  synthesis Three main tasks of synthesis: Allocation α is a subset of V A. Binding β is a subset of E M, i.e., a mapping of functional nodes of V P onto resource nodes of V A. Schedule τ is a function that assigns a number (start time) to each functional node. 464
65 Basic model  implementation Definition: Givena specification graph G S an implementation is a triple (α,β,τ), where α is a feasible allocation, β is a feasible binding, and τ is a schedule τ α β RISC HWM1 shared bus HWM2 RISC SB HWM1 PTP bus 465
66 Example P 466
67 Challenges Encoding of (allocation+binding) simple encoding eg. one bit per resource, one variable per binding easy to implement many infeasible partitionings encoding + repair eg. simple encoding and modify such that for each v p V P there exists at least one v a V A with a β(v p ) = v a reduces number of infeasible partitionings Generation of the initial population, mutation Recombination 467
68 Topics MultiObjective Optimization Introduction MultiObjective Optimization Algorithm Design Design Choices Representation Fitness and Selection Variation Operators Implementation Design Space Exploration System Design Problem Specification Example 468
69 Exploration  Case Study (1) 469
70 Exploration  Case Study (2) 470
71 Exploration  Case Study (3) frame memory dual ported frame memory block matching module input module subtract/add module DCT/IDCT module Huffman encoder output module 471
72 EA Case Study  Design Space power consumption latency cost
73 Exploration Case Study  Solution 1 INM OUTM FM RISC2 SBS 473
74 Exploration Case Study  Solution 2 INM OUTM DPFM HC DCTM BMM SAM SBF 474
Multiobjective Optimization and Evolutionary Algorithms for the Application Mapping Problem in Multiprocessor SystemonChip Design
358 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 10, NO. 3, JUNE 2006 Multiobjective Optimization and Evolutionary Algorithms for the Application Mapping Problem in Multiprocessor SystemonChip
More informationGenetic Algorithm. Based on Darwinian Paradigm. Intrinsically a robust search and optimization mechanism. Conceptual Algorithm
24 Genetic Algorithm Based on Darwinian Paradigm Reproduction Competition Survive Selection Intrinsically a robust search and optimization mechanism Slide 47  Conceptual Algorithm Slide 48  25 Genetic
More informationGenetic Algorithms commonly used selection, replacement, and variation operators Fernando Lobo University of Algarve
Genetic Algorithms commonly used selection, replacement, and variation operators Fernando Lobo University of Algarve Outline Selection methods Replacement methods Variation operators Selection Methods
More informationMULTIOBJECTIVE OPTIMIZATION USING PARALLEL COMPUTATIONS
MULTIOBJECTIVE OPTIMIZATION USING PARALLEL COMPUTATIONS Ausra MackuteVaroneckiene, Antanas Zilinskas Institute of Mathematics and Informatics, Akademijos str. 4, LT08663 Vilnius, Lithuania, ausra.mackute@gmail.com,
More informationCombinatorial Optimization and the Analysis of Randomized Search Heuristics
Combinatorial Optimization and the Analysis of Randomized Search Heuristics Dissertation zur Erlangung des akademischen Grades Doktor der Ingenieurwissenschaften (Dr. Ing.) der Technischen Fakultät der
More informationOn SetBased Multiobjective Optimization
1 On SetBased Multiobjective Optimization Eckart Zitzler, Lothar Thiele, and Johannes Bader Abstract Assuming that evolutionary multiobjective optimization (EMO) mainly deals with set problems, one can
More informationAn Interactive Visualization Tool for the Analysis of MultiObjective Embedded Systems Design Space Exploration
An Interactive Visualization Tool for the Analysis of MultiObjective Embedded Systems Design Space Exploration Toktam Taghavi, Andy D. Pimentel Computer Systems Architecture Group, Informatics Institute
More informationSelecting Best Investment Opportunities from Stock Portfolios Optimized by a Multiobjective Evolutionary Algorithm
Selecting Best Investment Opportunities from Stock Portfolios Optimized by a Multiobjective Evolutionary Algorithm Krzysztof Michalak Department of Information Technologies, Institute of Business Informatics,
More informationA Fast and Elitist Multiobjective Genetic Algorithm: NSGAII
182 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 6, NO. 2, APRIL 2002 A Fast and Elitist Multiobjective Genetic Algorithm: NSGAII Kalyanmoy Deb, Associate Member, IEEE, Amrit Pratap, Sameer Agarwal,
More informationGenetic Algorithms for Bridge Maintenance Scheduling. Master Thesis
Genetic Algorithms for Bridge Maintenance Scheduling Yan ZHANG Master Thesis 1st Examiner: Prof. Dr. HansJoachim Bungartz 2nd Examiner: Prof. Dr. rer.nat. Ernst Rank Assistant Advisor: DIPL.ING. Katharina
More informationMultiobjective Multicast Routing Algorithm
Multiobjective Multicast Routing Algorithm Jorge Crichigno, Benjamín Barán P. O. Box 9  National University of Asunción Asunción Paraguay. Tel/Fax: (+9) 89 {jcrichigno, bbaran}@cnc.una.py http://www.una.py
More informationArithmetic Coding: Introduction
Data Compression Arithmetic coding Arithmetic Coding: Introduction Allows using fractional parts of bits!! Used in PPM, JPEG/MPEG (as option), Bzip More time costly than Huffman, but integer implementation
More informationDistributed Computing over Communication Networks: Topology. (with an excursion to P2P)
Distributed Computing over Communication Networks: Topology (with an excursion to P2P) Some administrative comments... There will be a Skript for this part of the lecture. (Same as slides, except for today...
More informationSolving the Vehicle Routing Problem with Genetic Algorithms
Solving the Vehicle Routing Problem with Genetic Algorithms Áslaug Sóley Bjarnadóttir April 2004 Informatics and Mathematical Modelling, IMM Technical University of Denmark, DTU Printed by IMM, DTU 3 Preface
More information6 Creating the Animation
6 Creating the Animation Now that the animation can be represented, stored, and played back, all that is left to do is understand how it is created. This is where we will use genetic algorithms, and this
More information! Solve problem to optimality. ! Solve problem in polytime. ! Solve arbitrary instances of the problem. #approximation algorithm.
Approximation Algorithms 11 Approximation Algorithms Q Suppose I need to solve an NPhard problem What should I do? A Theory says you're unlikely to find a polytime algorithm Must sacrifice one of three
More informationLecture. Simulation and optimization
Course Simulation Lecture Simulation and optimization 1 4/3/2015 Simulation and optimization Platform busses at Schiphol Optimization: Find a feasible assignment of bus trips to bus shifts (driver and
More informationAn Energyaware Multistart Local Search Metaheuristic for Scheduling VMs within the OpenNebula Cloud Distribution
An Energyaware Multistart Local Search Metaheuristic for Scheduling VMs within the OpenNebula Cloud Distribution Y. Kessaci, N. Melab et EG. Talbi Dolphin Project Team, Université Lille 1, LIFLCNRS,
More informationGenetic Algorithm Based Interconnection Network Topology Optimization Analysis
Genetic Algorithm Based Interconnection Network Topology Optimization Analysis 1 WANG Peng, 2 Wang XueFei, 3 Wu YaMing 1,3 College of Information Engineering, Suihua University, Suihua Heilongjiang, 152061
More informationHow Can Metaheuristics Help Software Engineers
and Software How Can Help Software Engineers Enrique Alba eat@lcc.uma.es http://www.lcc.uma.es/~eat Universidad de Málaga, ESPAÑA Enrique Alba How Can Help Software Engineers of 8 and Software What s a
More informationLab 4: 26 th March 2012. Exercise 1: Evolutionary algorithms
Lab 4: 26 th March 2012 Exercise 1: Evolutionary algorithms 1. Found a problem where EAs would certainly perform very poorly compared to alternative approaches. Explain why. Suppose that we want to find
More informationA New Multiobjective Evolutionary Optimisation Algorithm: The TwoArchive Algorithm
A New Multiobjective Evolutionary Optimisation Algorithm: The TwoArchive Algorithm Kata Praditwong 1 and Xin Yao 2 The Centre of Excellence for Research in Computational Intelligence and Applications(CERCIA),
More information14.10.2014. Overview. Swarms in nature. Fish, birds, ants, termites, Introduction to swarm intelligence principles Particle Swarm Optimization (PSO)
Overview Kyrre Glette kyrrehg@ifi INF3490 Swarm Intelligence Particle Swarm Optimization Introduction to swarm intelligence principles Particle Swarm Optimization (PSO) 3 Swarms in nature Fish, birds,
More informationA Service Revenueoriented Task Scheduling Model of Cloud Computing
Journal of Information & Computational Science 10:10 (2013) 3153 3161 July 1, 2013 Available at http://www.joics.com A Service Revenueoriented Task Scheduling Model of Cloud Computing Jianguang Deng a,b,,
More informationD A T A M I N I N G C L A S S I F I C A T I O N
D A T A M I N I N G C L A S S I F I C A T I O N FABRICIO VOZNIKA LEO NARDO VIA NA INTRODUCTION Nowadays there is huge amount of data being collected and stored in databases everywhere across the globe.
More informationA Study of Local Optima in the Biobjective Travelling Salesman Problem
A Study of Local Optima in the Biobjective Travelling Salesman Problem Luis Paquete, Marco Chiarandini and Thomas Stützle FG Intellektik, Technische Universität Darmstadt, Alexanderstr. 10, Darmstadt,
More informationPackage NHEMOtree. February 19, 2015
Type Package Package NHEMOtree February 19, 2015 Title Nonhierarchical evolutionary multiobjective tree learner to perform costsensitive classification Depends partykit, emoa, sets, rpart Version 1.0
More informationThe ACO Encoding. Alberto Moraglio, Fernando E. B. Otero, and Colin G. Johnson
The ACO Encoding Alberto Moraglio, Fernando E. B. Otero, and Colin G. Johnson School of Computing and Centre for Reasoning, University of Kent, Canterbury, UK {A.Moraglio, F.E.B.Otero, C.G.Johnson}@kent.ac.uk
More informationThe Goldberg Rao Algorithm for the Maximum Flow Problem
The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }
More informationMapReduce and Distributed Data Analysis. Sergei Vassilvitskii Google Research
MapReduce and Distributed Data Analysis Google Research 1 Dealing With Massive Data 2 2 Dealing With Massive Data Polynomial Memory Sublinear RAM Sketches External Memory Property Testing 3 3 Dealing With
More information4. Zastosowania Optymalizacja wielokryterialna
4. Zastosowania Optymalizacja wielokryterialna Tadeusz Burczyński 1,2) 1), Department for Strength of Materials and Computational Mechanics, Konarskiego 18a, 44100 Gliwice, Poland 2) Cracow University
More informationNew Modifications of Selection Operator in Genetic Algorithms for the Traveling Salesman Problem
New Modifications of Selection Operator in Genetic Algorithms for the Traveling Salesman Problem Radovic, Marija; and Milutinovic, Veljko Abstract One of the algorithms used for solving Traveling Salesman
More informationCollege of information technology Department of software
University of Babylon Undergraduate: third class College of information technology Department of software Subj.: Application of AI lecture notes/20112012 ***************************************************************************
More informationAn Improved ACO Algorithm for Multicast Routing
An Improved ACO Algorithm for Multicast Routing Ziqiang Wang and Dexian Zhang School of Information Science and Engineering, Henan University of Technology, Zheng Zhou 450052,China wzqagent@xinhuanet.com
More informationThe BiObjective Pareto Constraint
The BiObjective Pareto Constraint Renaud Hartert and Pierre Schaus UCLouvain, ICTEAM, Place Sainte Barbe 2, 1348 LouvainlaNeuve, Belgium {renaud.hartert,pierre.schaus}@uclouvain.be Abstract. MultiObjective
More informationA Multiobjective Scheduling Model for Solving the Resourceconstrained Project Scheduling and Resource Leveling Problems. Jia Hu 1 and Ian Flood 2
A Multiobjective Scheduling Model for Solving the Resourceconstrained Project Scheduling and Resource Leveling Problems Jia Hu 1 and Ian Flood 2 1 Ph.D. student, Rinker School of Building Construction,
More informationParametric Analysis of Mobile Cloud Computing using Simulation Modeling
Parametric Analysis of Mobile Cloud Computing using Simulation Modeling Arani Bhattacharya Pradipta De Mobile System and Solutions Lab (MoSyS) The State University of New York, Korea (SUNY Korea) StonyBrook
More informationProximal mapping via network optimization
L. Vandenberghe EE236C (Spring 234) Proximal mapping via network optimization minimum cut and maximum flow problems parametric minimum cut problem application to proximal mapping Introduction this lecture:
More informationAlpha Cut based Novel Selection for Genetic Algorithm
Alpha Cut based Novel for Genetic Algorithm Rakesh Kumar Professor Girdhar Gopal Research Scholar Rajesh Kumar Assistant Professor ABSTRACT Genetic algorithm (GA) has several genetic operators that can
More informationSoftware Engineering and Service Design: courses in ITMO University
Software Engineering and Service Design: courses in ITMO University Igor Buzhinsky igor.buzhinsky@gmail.com Computer Technologies Department Department of Computer Science and Information Systems December
More informationCisco Integrated Services Routers Performance Overview
Integrated Services Routers Performance Overview What You Will Learn The Integrated Services Routers Generation 2 (ISR G2) provide a robust platform for delivering WAN services, unified communications,
More informationLoad Balancing. Load Balancing 1 / 24
Load Balancing Backtracking, branch & bound and alphabeta pruning: how to assign work to idle processes without much communication? Additionally for alphabeta pruning: implementing the youngbrotherswait
More informationGameTime: A Toolkit for Timing Analysis of Software
GameTime: A Toolkit for Timing Analysis of Software Sanjit A. Seshia and Jonathan Kotker EECS Department, UC Berkeley {sseshia,jamhoot}@eecs.berkeley.edu Abstract. Timing analysis is a key step in the
More informationSolving the Vehicle Routing Problem with Multiple Trips by Adaptive Memory Programming
Solving the Vehicle Routing Problem with Multiple Trips by Adaptive Memory Programming Alfredo Olivera and Omar Viera Universidad de la República Montevideo, Uruguay ICIL 05, Montevideo, Uruguay, February
More informationLecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs
CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like
More informationDistributed Computing over Communication Networks: Maximal Independent Set
Distributed Computing over Communication Networks: Maximal Independent Set What is a MIS? MIS An independent set (IS) of an undirected graph is a subset U of nodes such that no two nodes in U are adjacent.
More informationNetwork Algorithms for Homeland Security
Network Algorithms for Homeland Security Mark Goldberg and Malik MagdonIsmail Rensselaer Polytechnic Institute September 27, 2004. Collaborators J. Baumes, M. Krishmamoorthy, N. Preston, W. Wallace. Partially
More informationTimeline based model for software project scheduling
Timeline based model for software project scheduling with genetic algorithms Carl K. Chang, Hsinyi Jiang, Yu Di, Dan Zhu, Yujia Ge Information and Software Technology(IST), 2008 2010. 3. 9 Presented
More informationDefining and Optimizing Indicatorbased Diversity Measures in Multiobjective Search
Defining and Optimizing Indicatorbased Diversity Measures in Multiobjective Search Tamara Ulrich, Johannes Bader, and Lothar Thiele Computer Engineering and Networks Laboratory, ETH Zurich 8092 Zurich,
More informationArchitectures and Platforms
Hardware/Software Codesign Arch&Platf.  1 Architectures and Platforms 1. Architecture Selection: The Basic TradeOffs 2. General Purpose vs. ApplicationSpecific Processors 3. Processor Specialisation
More information! Solve problem to optimality. ! Solve problem in polytime. ! Solve arbitrary instances of the problem. !approximation algorithm.
Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NPhard problem What should I do? A Theory says you're unlikely to find a polytime algorithm Must sacrifice one of
More informationAn Alternative Archiving Technique for Evolutionary Polygonal Approximation
An Alternative Archiving Technique for Evolutionary Polygonal Approximation José Luis Guerrero, Antonio Berlanga and José Manuel Molina Computer Science Department, Group of Applied Artificial Intelligence
More informationLoad Balancing and Switch Scheduling
EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load
More informationApproximation Algorithms
Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NPCompleteness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms
More informationOffline sorting buffers on Line
Offline sorting buffers on Line Rohit Khandekar 1 and Vinayaka Pandit 2 1 University of Waterloo, ON, Canada. email: rkhandekar@gmail.com 2 IBM India Research Lab, New Delhi. email: pvinayak@in.ibm.com
More informationManagement of Software Projects with GAs
MIC05: The Sixth Metaheuristics International Conference 11521 Management of Software Projects with GAs Enrique Alba J. Francisco Chicano Departamento de Lenguajes y Ciencias de la Computación, Universidad
More informationA MultiObjective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms
A MultiObjective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms MIGUEL CAMELO, YEZID DONOSO, HAROLD CASTRO Systems and Computer Engineering Department Universidad de los
More informationContents. System Development Models and Methods. Design Abstraction and Views. Synthesis. Control/DataFlow Models. System Synthesis Models
System Development Models and Methods Dipl.Inf. Mirko Caspar Version: 10.02.L.r1.0100929 Contents HW/SW Codesign Process Design Abstraction and Views Synthesis Control/DataFlow Models System Synthesis
More informationBranchandPrice Approach to the Vehicle Routing Problem with Time Windows
TECHNISCHE UNIVERSITEIT EINDHOVEN BranchandPrice Approach to the Vehicle Routing Problem with Time Windows Lloyd A. Fasting May 2014 Supervisors: dr. M. Firat dr.ir. M.A.A. Boon J. van Twist MSc. Contents
More informationAnalyzing Mission Critical Voice over IP Networks. Michael Todd Gardner
Analyzing Mission Critical Voice over IP Networks Michael Todd Gardner Organization What is Mission Critical Voice? Why Study Mission Critical Voice over IP? Approach to Analyze Mission Critical Voice
More informationMultiobjective Traffic Engineering for Data Center Networks
Noname manuscript No. (will be inserted by the editor) Multiobjective Traffic Engineering for Data Center Networks TrongViet Ho Yves Deville Olivier Bonaventure Received: date / Accepted: date Abstract
More informationTraffic Engineering approaches using Multicriteria Optimization Techniques
Traffic Engineering approaches using Multicriteria Optimization Techniques Pedro Sousa, Paulo Cortez 3, Miguel Rio 2, Miguel Rocha Dept. of Informatics, University of Minho, Portugal, {pns,mrocha}@di.uminho.pt
More informationAn Efficient Approach for Task Scheduling Based on MultiObjective Genetic Algorithm in Cloud Computing Environment
IJCSC VOLUME 5 NUMBER 2 JULYSEPT 2014 PP. 110115 ISSN09737391 An Efficient Approach for Task Scheduling Based on MultiObjective Genetic Algorithm in Cloud Computing Environment 1 Sourabh Budhiraja,
More informationLinear Codes. Chapter 3. 3.1 Basics
Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length
More informationAn Evolutionary Algorithm in Grid Scheduling by multiobjective Optimization using variants of NSGA
International Journal of Scientific and Research Publications, Volume 2, Issue 9, September 2012 1 An Evolutionary Algorithm in Grid Scheduling by multiobjective Optimization using variants of NSGA Shahista
More informationARTICLE IN PRESS. Applied Soft Computing xxx (2010) xxx xxx. Contents lists available at ScienceDirect. Applied Soft Computing
Applied Soft Computing xxx (2010) xxx xxx Contents lists available at ScienceDirect Applied Soft Computing journal homepage: www.elsevier.com/locate/asoc Software project portfolio optimization with advanced
More informationChapter 11. 11.1 Load Balancing. Approximation Algorithms. Load Balancing. Load Balancing on 2 Machines. Load Balancing: Greedy Scheduling
Approximation Algorithms Chapter Approximation Algorithms Q. Suppose I need to solve an NPhard problem. What should I do? A. Theory says you're unlikely to find a polytime algorithm. Must sacrifice one
More information8.1 Min Degree Spanning Tree
CS880: Approximations Algorithms Scribe: Siddharth Barman Lecturer: Shuchi Chawla Topic: Min Degree Spanning Tree Date: 02/15/07 In this lecture we give a local search based algorithm for the Min Degree
More informationFinding Liveness Errors with ACO
Hong Kong, June 16, 2008 1 / 24 Finding Liveness Errors with ACO Francisco Chicano and Enrique Alba Motivation Motivation Nowadays software is very complex An error in a software system can imply the
More informationHiroyuki Sato. Minami Miyakawa. Keiki Takadama ABSTRACT. Categories and Subject Descriptors. General Terms
Controlling election Area of Useful Infeasible olutions and Their Archive for Directed Mating in Evolutionary Constrained Multiobjective Optimization Minami Miyakawa The University of ElectroCommunications
More informationAS part of the development process, software needs to
Dynamic WhiteBox Software Testing using a Recursive Hybrid Evolutionary Strategy/Genetic Algorithm Ashwin Panchapakesan, Graduate Student Member, Rami Abielmona, Senior Member, IEEE, and Emil Petriu,
More informationLoad balancing in a heterogeneous computer system by selforganizing Kohonen network
Bull. Nov. Comp. Center, Comp. Science, 25 (2006), 69 74 c 2006 NCC Publisher Load balancing in a heterogeneous computer system by selforganizing Kohonen network Mikhail S. Tarkov, Yakov S. Bezrukov Abstract.
More informationChapter 2 Optimization Problems
Chapter 2 Optimization Problems Optimization problems are common in many disciplines and various domains. In optimization problems, we have to find solutions which are optimal or nearoptimal with respect
More informationLOAD BALANCING MECHANISMS IN DATA CENTER NETWORKS
LOAD BALANCING Load Balancing Mechanisms in Data Center Networks Load balancing vs. distributed rate limiting: an unifying framework for cloud control Load Balancing for Internet Distributed Services using
More informationResearch on a Heuristic GABased Decision Support System for Rice in Heilongjiang Province
Research on a Heuristic GABased Decision Support System for Rice in Heilongjiang Province Ran Cao 1,1, Yushu Yang 1, Wei Guo 1, 1 Engineering college of Northeast Agricultural University, Haerbin, China
More informationCoding and decoding with convolutional codes. The Viterbi Algor
Coding and decoding with convolutional codes. The Viterbi Algorithm. 8 Block codes: main ideas Principles st point of view: infinite length block code nd point of view: convolutions Some examples Repetition
More information24. The Branch and Bound Method
24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NPcomplete. Then one can conclude according to the present state of science that no
More informationKey words. multiobjective optimization, approximate Pareto set, biobjective shortest path
SMALL APPROXIMATE PARETO SETS FOR BI OBJECTIVE SHORTEST PATHS AND OTHER PROBLEMS ILIAS DIAKONIKOLAS AND MIHALIS YANNAKAKIS Abstract. We investigate the problem of computing a minimum set of solutions that
More informationCSC2420 Fall 2012: Algorithm Design, Analysis and Theory
CSC2420 Fall 2012: Algorithm Design, Analysis and Theory Allan Borodin November 15, 2012; Lecture 10 1 / 27 Randomized online bipartite matching and the adwords problem. We briefly return to online algorithms
More informationFUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM
International Journal of Innovative Computing, Information and Control ICIC International c 0 ISSN 3448 Volume 8, Number 8, August 0 pp. 4 FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT
More informationVolume 3, Issue 2, February 2015 International Journal of Advance Research in Computer Science and Management Studies
Volume 3, Issue 2, February 2015 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com
More informationOptimizing Configuration and Application Mapping for MPSoC Architectures
Optimizing Configuration and Application Mapping for MPSoC Architectures École Polytechnique de Montréal, Canada Email : Sebastien.LeBeux@polymtl.ca 1 MultiProcessor Systems on Chip (MPSoC) Design Trends
More informationCompetitive Analysis of On line Randomized Call Control in Cellular Networks
Competitive Analysis of On line Randomized Call Control in Cellular Networks Ioannis Caragiannis Christos Kaklamanis Evi Papaioannou Abstract In this paper we address an important communication issue arising
More informationA Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem
A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem Sayedmohammadreza Vaghefinezhad 1, Kuan Yew Wong 2 1 Department of Manufacturing & Industrial Engineering, Faculty of Mechanical
More informationResearch Article QoSAware Multiobjective Optimization Algorithm for Web Services Selection with Deadline and Budget Constraints
Hindawi Publishing Corporation Advances in Mechanical Engineering Volume 214, Article ID 361298, 7 pages http://dx.doi.org/1.1155/214/361298 Research Article QoSAware Multiobjective Optimization Algorithm
More informationOptimising Patient Transportation in Hospitals
Optimising Patient Transportation in Hospitals Thomas Hanne 1 Fraunhofer Institute for Industrial Mathematics (ITWM), FraunhoferPlatz 1, 67663 Kaiserslautern, Germany, hanne@itwm.fhg.de 1 Introduction
More informationCROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING
CHAPTER 6 CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING 6.1 INTRODUCTION The technical challenges in WMNs are load balancing, optimal routing, fairness, network autoconfiguration and mobility
More informationA Survey on SearchBased Software Design
Outi Räihä A Survey on SearchBased Software Design DEPARTMENT OF COMPUTER SCIENCES UNIVERSITY OF TAMPERE D 2009 1 TAMPERE 2009 UNIVERSITY OF TAMPERE DEPARTMENT OF COMPUTER SCIENCES SERIES OF PUBLICATIONS
More informationNotes from Week 1: Algorithms for sequential prediction
CS 683 Learning, Games, and Electronic Markets Spring 2007 Notes from Week 1: Algorithms for sequential prediction Instructor: Robert Kleinberg 2226 Jan 2007 1 Introduction In this course we will be looking
More informationCloud Storage and Online Bin Packing
Cloud Storage and Online Bin Packing Doina Bein, Wolfgang Bein, and Swathi Venigella Abstract We study the problem of allocating memory of servers in a data center based on online requests for storage.
More informationOptimizing the Dynamic Composition of Web Service Components
Optimizing the Dynamic Composition of Web Service Components WeiChun Chang* Department and Graduate School of Information Management, ShuTe University, Taiwan changwc@mailstuedutw ChingSeh Wu Department
More informationInformation Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay
Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture  17 ShannonFanoElias Coding and Introduction to Arithmetic Coding
More informationBig Data & Scripting Part II Streaming Algorithms
Big Data & Scripting Part II Streaming Algorithms 1, 2, a note on sampling and filtering sampling: (randomly) choose a representative subset filtering: given some criterion (e.g. membership in a set),
More informationModified Version of Roulette Selection for Evolution Algorithms  the Fan Selection
Modified Version of Roulette Selection for Evolution Algorithms  the Fan Selection Adam S lowik, Micha l Bia lko Department of Electronic, Technical University of Koszalin, ul. Śniadeckich 2, 75453 Koszalin,
More informationWeb Service Selection using Particle Swarm Optimization and Genetic Algorithms
Web Service Selection using Particle Swarm Optimization and Genetic Algorithms Simone A. Ludwig Department of Computer Science North Dakota State University Fargo, ND, USA simone.ludwig@ndsu.edu Thomas
More informationResource Allocation in a Client/Server System for Massive MultiPlayer Online Games
IEEE TRANSACTIONS ON COMPUTERS, VOL. 63, NO. 12, DECEMBER 2014 3127 Resource Allocation in a Client/Server System for Massive MultiPlayer Online Games Luis Diego Briceño, Howard Jay Siegel, Fellow, IEEE,
More informationA Genetic Algorithm Processor Based on Redundant Binary Numbers (GAPBRBN)
ISSN: 2278 1323 All Rights Reserved 2014 IJARCET 3910 A Genetic Algorithm Processor Based on Redundant Binary Numbers (GAPBRBN) Miss: KIRTI JOSHI Abstract A Genetic Algorithm (GA) is an intelligent search
More informationRandom vs. StructureBased Testing of AnswerSet Programs: An Experimental Comparison
Random vs. StructureBased Testing of AnswerSet Programs: An Experimental Comparison Tomi Janhunen 1, Ilkka Niemelä 1, Johannes Oetsch 2, Jörg Pührer 2, and Hans Tompits 2 1 Aalto University, Department
More informationUSING THE EVOLUTION STRATEGIES' SELFADAPTATION MECHANISM AND TOURNAMENT SELECTION FOR GLOBAL OPTIMIZATION
1 USING THE EVOLUTION STRATEGIES' SELFADAPTATION MECHANISM AND TOURNAMENT SELECTION FOR GLOBAL OPTIMIZATION EFRÉN MEZURAMONTES AND CARLOS A. COELLO COELLO Evolutionary Computation Group at CINVESTAVIPN
More informationThe Trip Scheduling Problem
The Trip Scheduling Problem Claudia Archetti Department of Quantitative Methods, University of Brescia Contrada Santa Chiara 50, 25122 Brescia, Italy Martin Savelsbergh School of Industrial and Systems
More information