Follow-the-moon optimization with Condor-enabled genetic algorithms

Slides:



Advertisements
Similar presentations
MOEAs University of Missouri - Rolla Dr. T’s Course in Evolutionary Computation Matt D. Johnson November 6, 2006.
Advertisements

Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Dan Bradley Computer Sciences Department University of Wisconsin-Madison Schedd On The Side.
Tetris – Genetic Algorithm Presented by, Jeethan & Jun.
DETERMINATION OF UNSTEADY CONTAINER TEMPERATURES DURING FREEZING OF THREE-DIMENSIONAL ORGANS WITH CONSTRAINED THERMAL STRESSES Brian Dennis Aerospace Engineering.
Spie98-1 Evolutionary Algorithms, Simulated Annealing, and Tabu Search: A Comparative Study H. Youssef, S. M. Sait, H. Adiche
Selecting Informative Genes with Parallel Genetic Algorithms Deodatta Bhoite Prashant Jain.
MCTS Guide to Microsoft Windows Server 2008 Network Infrastructure Configuration Chapter 8 Introduction to Printers in a Windows Server 2008 Network.
1 Memory Management in Representative Operating Systems.
Budapesti Műszaki és Gazdaságtudományi Egyetem Méréstechnika és Információs Rendszerek Tanszék Scheduling in Windows Zoltan Micskei
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Universidad de los Andes-CODENSA The Continuous Genetic Algorithm.
Yavor Todorov. Introduction How it works OS level checkpointing Application level checkpointing CPR for parallel programing CPR functionality References.
Ranga Rodrigo April 6, 2014 Most of the sides are from the Matlab tutorial. 1.
Genetic Algorithm.
Efficient Model Selection for Support Vector Machines
Yi Shen Mar 18 th, Backup workshop Stanford Exploration Project.
A Comparison of Nature Inspired Intelligent Optimization Methods in Aerial Spray Deposition Management Lei Wu Master’s Thesis Artificial Intelligence Center.
Condor Week 2005Optimizing Workflows on the Grid1 Optimizing workflow execution on the Grid Gaurang Mehta - Based on “Optimizing.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
Fuzzy Genetic Algorithm
 Genetic Algorithms  A class of evolutionary algorithms  Efficiently solves optimization tasks  Potential Applications in many fields  Challenges.
Improving the Genetic Algorithm Performance in Aerial Spray Deposition Management University of Georgia L. Wu, W.D. Potter, K. Rasheed USDA Forest Service.
Condor Week 2004 The use of Condor at the CDF Analysis Farm Presented by Sfiligoi Igor on behalf of the CAF group.
Robot Intelligence Technology Lab. Generalized game of life YongDuk Kim.
Automated discovery in math Machine learning techniques (GP, ILP, etc.) have been successfully applied in science Machine learning techniques (GP, ILP,
FATCOP: A Mixed Integer Program Solver Michael FerrisQun Chen University of Wisconsin-Madison Jeffrey Linderoth Argonne National Laboratories.
Introduction Metaheuristics: increasingly popular in research and industry mimic natural metaphors to solve complex optimization problems efficient and.
1 Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations Genetic Algorithm (GA)
Tutorial 2, Part 2: Calibration of a damped oscillator.
Genetic Algorithms and TSP Thomas Jefferson Computer Research Project by Karl Leswing.
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Local Search Algorithms CMPT 463. When: Tuesday, April 5 3:30PM Where: RLC 105 Team based: one, two or three people per team Languages: Python, C++ and.
Enabling Grids for E-sciencE LRMN ThIS on the Grid Sorina CAMARASU.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Genetic Algorithm(GA)
Constraints Satisfaction Edmondo Trentin, DIISM. Constraint Satisfaction Problems: Local Search In many optimization problems, the path to the goal is.
Local search algorithms In many optimization problems, the path to the goal is irrelevant; the goal state itself is the solution State space = set of "complete"
Lessons from LEAD/VGrADS Demo Yang-suk Kee, Carl Kesselman ISI/USC.
A MapReduced Based Hybrid Genetic Algorithm Using Island Approach for Solving Large Scale Time Dependent Vehicle Routing Problem Rohit Kondekar BT08CSE053.
Selected Topics in CI I Genetic Programming Dr. Widodo Budiharto 2014.
Optimization Of Robot Motion Planning Using Genetic Algorithm
An Evolutionary Approach
Decision Support System for School Cricket in Sri Lanka (CricDSS)
Operating a glideinWMS frontend by Igor Sfiligoi (UCSD)
Ec1818 Economics of Discontinuous Change Section 2 [Lectures 5-7]
CyberShake Study 16.9 Discussion
Traffic Simulator Calibration
Building Grids with Condor
US CMS Testbed.
Grid Computing in the Enterprise: Micron Technology, Inc.
Bin Packing Optimization
Comparing Genetic Algorithm and Guided Local Search Methods
Prof. Marie desJardins September 20, 2010
Grid Means Business OGF-20, Manchester, May 2007
Brooklin J. Gore Senior Fellow May
Semiconductor Manufacturing (and other stuff) with Condor
Understanding Supernovae with Condor
Benefits of Condor-Enabled Process Control Micron Technology, Inc.
OpenEMS: Automating the Data Center with Condor
Example of usage in Micron Italy (MIT)
Follow-the-moon optimization with Condor-enabled genetic algorithms
EE368 Soft Computing Genetic Algorithms.
Searching for solutions: Genetic Algorithms
General Purpose Computing with Condor
Genetic algorithms: case study
Md. Tanveer Anwar University of Arkansas
M. Kezunovic (P.I.) S. S. Luo D. Ristanovic Texas A&M University
Yupei Xiong Bruce Golden Edward Wasil INFORMS Annual Meeting
Presentation transcript:

Follow-the-moon optimization with Condor-enabled genetic algorithms Condor Week Presentation April, 2006 Follow-the-moon optimization with Condor-enabled genetic algorithms Brooklin J. Gore Senior Fellow, Advanced Computing 2004 Micron Technology, Inc. All rights reserved. Information is subject to change without notice. 1 1

Condor Week 2006 Agenda Introductions A GA Optimization Problem A ‘perfect’ Grid app Follow-the-moon computing Q/A 12/3/2018

Condor Week 2006 Overview of Micron’s Grid 11k+ processors in 11 “pools” Linux, Solaris, Windows ~65th Top500 Rank 5.7 TeraFLOPS Built in-house Open Source Grid Centralized governance Distributed management 20+ applications Self developed Micron’s Global Grid 12/3/2018

Condor Week 2006 Example Grid Application at Micron Probe Card Optimization Given: A wafer map A probe card Max DUT1s on card 1 DUT = Device Under Test Find: A probe card configuration Probe vector That minimizes: DUTs on card Touchdowns Reprobed die Maximum die contacts 12/3/2018

Condor Week 2006 Example Grid Application at Micron Probe Card Optimization is a HARD Problem Given: A wafer W of size Wx,Wy A card C of size Cx, Cy and V probe vectors C C! Configurations = Σ ------- = 2C k=0 k!(C-k)! W! Vectors = -------- ~ WV V!(W-V)! Total Complexity = 2CWV Search Space(100,500,5) = 2100*5005 ~ 4x1043 So, maybe a Genetic Algorithm would be good. 12/3/2018

Condor Week 2006 Follow-the-Moon Computing For a single execution of the GA 1-5 ‘tries’ to find optimal solution (minimize fitness function) Shoot for 20-40 minute run time (thorough yet responsive) Only output ‘good’ solutions (to avoid clutter) with ‘fitness’ filename Since GAs are probabilistic with variable run-times: The more ‘copies’ we run the better and faster we explore the solution space So, let’s run a bunch (600-1200) overnight 3 tries/job * 600 jobs * 2/hour * 12 hours ~=> 40,000 tries So, submit 600 jobs Leave in queue (run over and over), remove after 12 hours Good solutions just ‘show up’ in submit directory -- view ‘Top 10’ 12/3/2018

Condor Week 2006 Follow-the-Moon Computing Let’s take a look at an actual run… 12/3/2018

Condor Week 2006 Example Grid Application at Micron Probe Card Optimization with CGA Genetic Algorithm m49a: 29x14 wafer map 23x14 probe card 126 DUT1s on card 2 Re-probes 3 Touchdowns 12/3/2018

Condor Week 2006 Follow-the-Moon Computing ‘Perfect’ Grid app: Low data in/out Compute bound So: Direct jobs to sites Where the workers aren’t 12/3/2018

Condor Week 2006 Follow-the-Moon Computing STARTD_CRON_JOBS = $(STARTD_CRON_JOBS) flockmgr:MU_:$(MODULES)/MU_FlockMgr:30m The STARTD_CRON_JOBS above run on ALL systems, but existence of certain files trigger specific behavior, like dynamic flocking below: -rw-r--r-- 1 condor condor 201 Jul 13 2004 bgore2-lnx.ClassAds -rw-r--r-- 1 condor condor 1810 Dec 9 14:59 bgore2-lnx.Flocking -rw-r--r-- 1 condor condor 2601 Feb 21 07:42 bgore2-lnx.local 12/3/2018

Condor Week 2006 Follow-the-Moon Computing # Flocking schedule for bgore2-lnx # 12/09/2005/BJGore # # First column is seconds after midnight. Seconds after midnight key: # Midnight: 0 1am: 3600 2am: 7200 3am: 10800 4am: 14400 5am: 18000 # 6am: 21600 7am: 25200 8am: 28800 9am: 32400 10am: 36000 11am: 39600 # Noon: 43200 1pm: 46800 2pm: 50400 3pm: 54000 4pm: 57600 5pm: 61200 # 6pm: 64800 7pm: 68400 8pm: 72000 9pm: 75600 10pm: 79200 11pm: 82800 # Subsequent columns are comma-separated list of pools to flock to # This is a good flocking schedule for Boise-based submitters. # We flock to pools where it's between 6pm and 6am. # Midnight 0 condor-mava.mava, condor-mndc, condor-backend, condor-is, condor-rnd, condor-lehi.lehi condor-mava.mava, condor-mndc, condor-backend, condor-is, condor-rnd, condor-lehi.lehi, condor-nijp.nijp : (etc) 12/3/2018

Condor Week 2006 Follow-the-Moon Computing if ( $current_flist ne $new_flist ) { # Need to update FLOCK_TO $cmd_output= `$ccv_cmd -rset 'FLOCK_TO=$new_flist'`; if ( $cmd_output =~ m/Successfully/ ) { $cmd_output= `$cr_cmd`; # and reconfig the schedd to take the change print "$ca_prefix = \"FLOCK_TO updated\"\n"; } else { print "$ca_prefix = \"FLOCK_TO update failed\"\n"; print "$ca_prefix = \"FLOCK_TO is current\"\n"; 12/3/2018

Condor Week 2006 Example Grid Application at Micron Solving Probe Card Optimization What about the ‘GA Knobs’? Parameter Reasonable Values Population, P 200, 400, 800 Tournament Size, Ts 2, 4, 8 Probability of Crossover, Pc 0.00, 0.33, 0.66, 1.00 Probability of Mutation, Pm Parameter Sweep: 133 Unique combinations (Pc=Pm=0 degenerate case) Did 40, six-hour runs for each combination 31,920 hours – 3.6 years on one CPU Ran in 7 days on Grid! 12/3/2018

Condor Week 2006 Example Grid Application at Micron Solving Probe Card Optimization Derived Defaults: P = 400 Ts = 4 Pc = 0.66 Pm = 1.00 * 12/3/2018

Thank you! Questions? Micron and the Micron logo are trademarks and/or service marks of Micron Technology, Inc. All other trademarks are the property of their respective owners.