1 IV 1 st November 2007 Beijing - China N-Queens and FlowShop results Denis Caromel INRIA, Patrick Guillemin ETSI.

Slides:



Advertisements
Similar presentations
“God Is Not…” “God is not a man” Numbers 23:19 God’s dependable nature
Advertisements

Advanced Piloting Cruise Plot.
1
1 Vorlesung Informatik 2 Algorithmen und Datenstrukturen (Parallel Algorithms) Robin Pomplun.
© 2008 Pearson Addison Wesley. All rights reserved Chapter Seven Costs.
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
Chapter 1 The Study of Body Function Image PowerPoint
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 6 Author: Julia Richards and R. Scott Hawley.
Author: Julia Richards and R. Scott Hawley
Properties Use, share, or modify this drill on mathematic properties. There is too much material for a single class, so you’ll have to select for your.
Objectives: Generate and describe sequences. Vocabulary:
UNITED NATIONS Shipment Details Report – January 2006.
Challenge the future Delft University of Technology Overprovisioning for Performance Consistency in Grids Nezih Yigitbasi and Dick Epema Parallel.
and 6.855J Spanning Tree Algorithms. 2 The Greedy Algorithm in Action
European Commission Directorate-General Information Society Unit F2 – Grid Technologies INSERT PROJECT ACRONYM HERE BY EDITING THE MASTER SLIDE (VIEW /
What causes the commodity price boom? AGRI Green Team Seminar on the Health Check May 15, 2008 AGRI-G1 Agricultural Policy Analysis and Perspectives DG.
1 RA I Sub-Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Casablanca, Morocco, 20 – 22 December 2005 Status of observing programmes in RA I.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Exit a Customer Chapter 8. Exit a Customer 8-2 Objectives Perform exit summary process consisting of the following steps: Review service records Close.
Create an Application Title 1D - Dislocated Worker Chapter 9.
Multiplying binomials You will have 20 seconds to answer each of the following multiplication problems. If you get hung up, go to the next problem when.
Prime and Composite Numbers. These are numbers that have only two factors – themselves and one. These are numbers that have only two factors – themselves.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Factorise the following 10x a – 20 36m a + 27b + 9c 9y² - 12y 30ab³ + 35a²b 24x4y³ - 40x²y.
2010 fotografiert von Jürgen Roßberg © Fr 1 Sa 2 So 3 Mo 4 Di 5 Mi 6 Do 7 Fr 8 Sa 9 So 10 Mo 11 Di 12 Mi 13 Do 14 Fr 15 Sa 16 So 17 Mo 18 Di 19.
Solve Multi-step Equations
REVIEW: Arthropod ID. 1. Name the subphylum. 2. Name the subphylum. 3. Name the order.
Artificiel Bee Colony (ABC) Algorithme Isfahan University of Technology Fall Elham Seifossadat Faegheh Javadi.
3rd Middle East Metal Conference, May 2007, Fairmont Hotel, Dubai, UAE © 2007 MEsteel.com - All Rights Reserved. Mr Hadi Hami 1 IRAN STEEL MARKET.
PP Test Review Sections 6-1 to 6-6
CME12, – Rzeszów, Poland Gergely Wintsche Generalization through problem solving Gergely Wintsche Mathematics Teaching and Didactic Center.
EU Market Situation for Eggs and Poultry Management Committee 21 June 2012.
Bellwork Do the following problem on a ½ sheet of paper and turn in.
Multiple dependency activity on node (AoN) networks ( lecture )
Problem-Solving Strategy: Look for a pattern
VOORBLAD.
Copyright © 2012, Elsevier Inc. All rights Reserved. 1 Chapter 7 Modeling Structure with Blocks.
1 RA III - Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Buenos Aires, Argentina, 25 – 27 October 2006 Status of observing programmes in RA.
Squares and Square Root WALK. Solve each problem REVIEW:
Basel-ICU-Journal Challenge18/20/ Basel-ICU-Journal Challenge8/20/2014.
1..
CONTROL VISION Set-up. Step 1 Step 2 Step 3 Step 5 Step 4.
LO: Count up to 100 objects by grouping them and counting in 5s 10s and 2s. Mrs Criddle: Westfield Middle School.
Mrs. Rivas International Studies Charter School. Worksheet Practice 7-1 to 7-5Section 7-1 Algebra Solve each proportion.
Model and Relationships 6 M 1 M M M M M M M M M M M M M M M M
25 seconds left…...
Equal or Not. Equal or Not
Januar MDMDFSSMDMDFSSS
1 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit.
Analyzing Genes and Genomes
We will resume in: 25 Minutes.
Essential Cell Biology
Intracellular Compartments and Transport
PSSA Preparation.
TASK: Skill Development A proportional relationship is a set of equivalent ratios. Equivalent ratios have equal values using different numbers. Creating.
Essential Cell Biology
Weekly Attendance by Class w/e 6 th September 2013.
Immunobiology: The Immune System in Health & Disease Sixth Edition
Energy Generation in Mitochondria and Chlorplasts
1 Decidability continued…. 2 Theorem: For a recursively enumerable language it is undecidable to determine whether is finite Proof: We will reduce the.
30 November st CoreGRID Industrial Conference 1 ETSI 3rd GRID Plugtests TM CoreGRID Conference 30 November 2006 Sophia Antipolis N-Queens and FlowShop.
Information & Electronics Technology Lab Beijing University of Posts and Telecommunications.
Presentation transcript:

1 IV 1 st November 2007 Beijing - China N-Queens and FlowShop results Denis Caromel INRIA, Patrick Guillemin ETSI

2

3 Available Grids and Nodes Grid5000 (4080 cpu) - France InTrigger (450 cpu) - Japan PoweRcost (180 cpu) – Italy DAS (300 cpu) - Netherland All jobs submitted from Beijing – China SCCAS: Supercomputing Center, Chinese Academy of Sciences

FlowShop contest Goal of the FlowShop contest (Job Scheduling) Solve the 10 Taillard instances with 20 jobs and 20 machines 2006 FlowShop contest The winner was KANBAN - Japan (553 s, 207 workers) 2007 FlowShop contest (2 teams) BUPT - Beijing University of Posts and Telecommunications -China TransPUTers - POZNAN University of Technology - Poland The winner is TransPUTers from Poland ! 2146 s, 3185 Workers FlowShop contest

N-Queens contest Goal of the N-Queens contest Solve the maximum number of N-Queens solutions in1 hour On a maximum number of machines With the most efficient algorithm 2006 N-Queens contest The winner was Eight Samouri – Japan ~6 467 Billions solutions 2193 Workers deployed Counted N=22 Queens in 27mn 2007 N-Queens contest (6 teams) ACT - The Institute of Advanced Computing Technology of Beihang University in Beijing - China BUPT - Beijing University of Posts and Telecommunications -China ChinaGrid – Tsinghua University - China Grid-TU – Tsinghua University - China MOAIS Kaapi – France outPUT - Poznan University of Technology - Poland

N-Queens contest The 1st N-Queens Prize winner is KAAPI-MOAIS - France with ~ Billions solutions found deployed on 3654 workers computed for the first time N=23 in 35 mn 7s and N=22 in 3 mn 21s The 2nd N-Queens Prize winner is ACT - Beihang University - China sucessfuly deployed 3888 workers The 3rd N-Queens Prize winners (2 teams ex-aequo) are BUPT - Beijing University of Posts and Telecommunications, China Calculated N=22 Queens in 24 mn 31s and deployed 2925 workers Grid-TU - Tsinghua University – China Calculated N=22 Queens in 19 mn 36s and deployed 1735 workers 2007 N-Queens contest

7 Thanks to all /