Multicore experiment: Plurality Hypercore Processor Performed by: Anton Fulman Ze’ev Zilberman Supervised by: Mony Orbach Project’s poster Winter 2008.

Slides:



Advertisements
Similar presentations
1 Spatial Join. 2 Papers to Present “Efficient Processing of Spatial Joins using R-trees”, T. Brinkhoff, H-P Kriegel and B. Seeger, Proc. SIGMOD, 1993.
Advertisements

Silberschatz, Galvin and Gagne ©2009Operating System Concepts – 8 th Edition Chapter 4: Threads.
Modified from Silberschatz, Galvin and Gagne ©2009 Lecture 7 Chapter 4: Threads (cont)
Software Group © 2006 IBM Corporation Compiler Technology Task, thread and processor — OpenMP 3.0 and beyond Guansong Zhang, IBM Toronto Lab.
Implementation of a satellite on a Multi-Core System A project by: Daniel Aranki Mohammad Nassar Supervised by: Mony Orbach Winter 2009 Characterization.
Silberschatz, Galvin and Gagne ©2009Operating System Concepts – 8 th Edition Chapter 4: Threads.
Multicore experiment: Plurality Hypercore Processor Performed by: Anton Fulman Ze’ev Zilberman Supervised by: Mony Orbach Final presentation Winter 2008.
Chapter 4: Threads READ 4.1 & 4.2 NOT RESPONSIBLE FOR 4.3 &
Multicore experiment: Plurality Hypercore Processor Performed by: Anton Fulman Ze’ev Zilberman Supervised by: Mony Orbach Characterization presentation.
Alon Horn and Oren Ierushalmi Supervised by Mony Orbach Winter 2010 Characterization Presentation Implementation of an Engine Control Unit over Many-Core.
MapReduce. Web data sets can be very large – Tens to hundreds of terabytes Cannot mine on a single server Standard architecture emerging: – Cluster of.
Silberschatz, Galvin and Gagne ©2011Operating System Concepts Essentials – 8 th Edition Chapter 4: Threads.
Alon Horn and Oren Ierushalmi Supervised by Mony Orbach Winter 2010 Final Presentation Implementation of an Engine Control Unit over Many-Core System.
MapReduce: Simplified Data Processing on Large Clusters Jeffrey Dean and Sanjay Ghemawat.
RELATIONSHIPS Generally there are two main database types: flat-file and relational.
Threads by Dr. Amin Danial Asham. References Operating System Concepts ABRAHAM SILBERSCHATZ, PETER BAER GALVIN, and GREG GAGNE.
Outline  Over view  Design  Performance  Advantages and disadvantages  Examples  Conclusion  Bibliography.
CUDA - 2.
Fault-tolerant Control Motivation Definitions A general overview on the research area. Active Fault Tolerant Control (FTC) FTC- Analysis and Development.
Department of Computer Science MapReduce for the Cell B. E. Architecture Marc de Kruijf University of Wisconsin−Madison Advised by Professor Sankaralingam.
1 COMPUTER SCIENCE DEPARTMENT COLORADO STATE UNIVERSITY 1/9/2008 SAXS Software.
CS 351/ IT 351 Modeling and Simulation Technologies HPC Architectures Dr. Jim Holten.
SpecctraQuest Simulation Winter 2004 Winter 2004 Midterm Presentation Midterm Presentation Date : Student : Kobi Ochayon Supervisor : Moni Orbach.
Mapping of Regular Nested Loop Programs to Coarse-grained Reconfigurable Arrays – Constraints and Methodology Presented by: Luis Ortiz Department of Computer.
A Pattern Language for Parallel Programming Beverly Sanders University of Florida.
CS 420 Design of Algorithms Parallel Algorithm Design.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 4: Threads.
MapReduce Basics Chapter 2 Lin and Dyer & /tutorial/
Developing GRID Applications GRACE Project
Partitioning of a digital system.
Silberschatz, Galvin and Gagne ©2009Operating System Concepts – 8 th Edition Chapter 4: Threads.
Lecture 5. Example for periority The average waiting time : = 41/5= 8.2.
Chapter 4: Threads Modified by Dr. Neerja Mhaskar for CS 3SH3.
Partitioning of a digital system.
Chapter 4: Multithreaded Programming
Chapter 1: Introduction
Multiplication table. x
Chapter 4: Multithreaded Programming
Disaster Frontline Supervisor
Chapter 4: Threads.
Digital Principles and Design Algorithmic State Machines
Chapter 4: Threads.
Chapter 4: Threads.
3-3: Slopes of Lines.
Chapter 2 Lin and Dyer & MapReduce Basics Chapter 2 Lin and Dyer &
Designing Algorithms for Multiplication of Fractions
Chapter 2: The Linux System Part 3
Parallel Programming in C with MPI and OpenMP
CHAPTER 4:THreads Bashair Al-harthi OPERATING SYSTEM
5 × 7 = × 7 = 70 9 × 7 = CONNECTIONS IN 7 × TABLE
5 × 8 = 40 4 × 8 = 32 9 × 8 = CONNECTIONS IN 8 × TABLE
Designing Algorithms for Multiplication of Fractions
4 × 6 = 24 8 × 6 = 48 7 × 6 = CONNECTIONS IN 6 × TABLE
5 × 6 = 30 2 × 6 = 12 7 × 6 = CONNECTIONS IN 6 × TABLE
Chapter 4: Threads & Concurrency
Chapter 4: Threads.
Figure 11-1.
10 × 8 = 80 5 × 8 = 40 6 × 8 = CONNECTIONS IN 8 × TABLE MULTIPLICATION.
3 × 12 = 36 6 × 12 = 72 7 × 12 = CONNECTIONS IN 12 × TABLE
Figure Overview.
Figure Overview.
Social Practice of the language: Describe and share information
Chapter 2 Lin and Dyer & MapReduce Basics Chapter 2 Lin and Dyer &
5 × 12 = × 12 = × 12 = CONNECTIONS IN 12 × TABLE MULTIPLICATION.
Graduation Project Project Name
5 × 9 = 45 6 × 9 = 54 7 × 9 = CONNECTIONS IN 9 × TABLE
3 × 7 = 21 6 × 7 = 42 7 × 7 = CONNECTIONS IN 7 × TABLE
Let’s describe pictures !
Presentation transcript:

Multicore experiment: Plurality Hypercore Processor Performed by: Anton Fulman Ze’ev Zilberman Supervised by: Mony Orbach Project’s poster Winter 2008

System overview Plurality has developed a 256 Hypercore processor with unique architecture and programming model, suited for parallel algorithms The main project goal is to build and optimise algorithms for Plurality system, that will later be used for lab multicore experiment

System overview Task oriented programming model (TOP) The algorithm is partitioned to regular and duplicable tasks The algorithm can be described by a task map, with dependencies between the tasks Resource synchronization between tasks is managed automatically (unlike common multithread programming)

System architecture - cont

Project goals Build parallel algorithms Write documentation Provide the knowledge base for the multicore experiment

White balance algorithm Build LUT tasks build 3 look up tables, Each one contain multiplication of correction index with intensity(0-255) Balance tasks assign new values from LUT that match to original values of intensity

Performance charts – White balance