Introduction to High Performance Computing Lecture 7

Slides:



Advertisements
Similar presentations
Prepared 7/28/2011 by T. O’Neil for 3460:677, Fall 2011, The University of Akron.
Advertisements

Practical techniques & Examples
CSCI-455/552 Introduction to High Performance Computing Lecture 11.
COMPE472 Parallel Computing Embarrassingly Parallel Computations Partitioning and Divide-and-Conquer Strategies Pipelined Computations Synchronous Computations.
1 Computer Graphics Chapter 6 2D Transformations.
Embarrassingly Parallel (or pleasantly parallel) Domain divisible into a large number of independent parts. Minimal or no communication Each processor.
Elementary 3D Transformations - a "Graphics Engine" Transformation procedures Transformations of coordinate systems Translation Scaling Rotation.
Embarrassingly Parallel Computations Partitioning and Divide-and-Conquer Strategies Pipelined Computations Synchronous Computations Asynchronous Computations.
8. Geometric Operations Geometric operations change image geometry by moving pixels around in a carefully constrained way. We might do this to remove distortions.
Characteristics of Embarrassingly Parallel Computations Easily parallelizable Little or no interaction between processes Can give maximum speedup.
High Performance Computing 1 Parallelization Strategies and Load Balancing Some material borrowed from lectures of J. Demmel, UC Berkeley.
Course Website: Computer Graphics 3: 2D Transformations.
Embarrassingly Parallel Computations Partitioning and Divide-and-Conquer Strategies Pipelined Computations Synchronous Computations Asynchronous Computations.
Slides for Parallel Programming Techniques & Applications Using Networked Workstations & Parallel Computers 2nd ed., by B. Wilkinson & M
1 of 23 New Lecture And Lab Information Lectures: –Thursday 12:00 – 13:00 (room tba) –Friday 15:00 – 16:00 (A28) Labs: –Wednesday 10:00 – 11:00 (A305)
1 Computer Graphics Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD3107 University of Palestine.
3D Geometric Transformation Point in 3D space –Position (x, y, z) –Color (r, g, b) –Normal (Nx, Ny, Nz) Homogenous Coordinates –Position (x,y,z,w) –Usually.
Slides for Parallel Programming Techniques & Applications Using Networked Workstations & Parallel Computers 2nd ed., by B. Wilkinson & M
Lecture Notes: Computer Graphics.
Autonomous Navigation for Flying Robots Lecture 2.2: 2D Geometry
Slides for Parallel Programming Techniques & Applications Using Networked Workstations & Parallel Computers 2nd ed., by B. Wilkinson & M
Embarrassingly Parallel Computations Partitioning and Divide-and-Conquer Strategies Pipelined Computations Synchronous Computations Asynchronous Computations.
GEOMETRIC TRANFORMATIONS Presented By -Lakshmi Sahithi.
Lecture 5: Introduction to 3D
Embarrassingly Parallel (or pleasantly parallel) Characteristics Domain divisible into a large number of independent parts. Little or no communication.
Network Systems Lab. Korea Advanced Institute of Science and Technology No.1 Ch. 1 Introduction EE692 Parallel and Distribution Computation | Prof. Song.
1 Teaching Innovation - Entrepreneurial - Global The Centre for Technology enabled Teaching & Learning, N Y S S, India DTEL DTEL (Department for Technology.
Advanced Java Screen Update Techniques SD’98 - Session 4406 Ted Faison Faison Computing Inc.
Transformations in 3D Lecture 17 Mon, Oct 6, 2003.
STRETCHES AND SHEARS.
Forward Projection Pipeline and Transformations CENG 477 Introduction to Computer Graphics.
Embarrassingly Parallel Computations
Modeling Transformations
Computer Graphics 3: 2D Transformations
Transformations Objectives
Computer Graphics Transformations.
Computer Graphics 3: 2D Transformations
Chapter 7: Introduction to Data Communications and Networking
3D Geometric Transformations
Embarrassingly Parallel (or pleasantly parallel)
Computer Graphics Transformations.
Normal and shear stresses in unsymmetrical cross sections
CS 584 Lecture 3 How is the assignment going?.
Introduction to Computer Graphics CS 445 / 645
Lecture 7 Geometric Transformations (Continued)
2D Transformations y y x x y x.
Course Description Algorithms are: Recipes for solving problems.
Three-Dimensional Graphics
Geometric Transformations
Embarrassingly Parallel
Chapter 1: Introduction
2D Geometric Transformations
CSC4005 – Distributed and Parallel Computing
Amdahl's law.
Geometric Transformations
Transformations Ed Angel
Monte Carlo Methods A so-called “embarrassingly parallel” computation as it decomposes into obviously independent tasks that can be done in parallel without.
Parallel Techniques • Embarrassingly Parallel Computations
Embarrassingly Parallel Computations
Transformations Ed Angel Professor Emeritus of Computer Science
3D Geometric Transformation
Chapter7 Dimensional Chain尺寸链
Isaac Gang University of Mary Hardin-Baylor
Rendering – Matrix Transformations and the Graphics Pipeline
Dilations NOT an isometry.
TWO DIMENSIONAL TRANSFORMATION
Course Description Algorithms are: Recipes for solving problems.
Introduction to High Performance Computing Lecture 8
: Chapter 7: Two Dimensional Image Transformation
Translation in Homogeneous Coordinates
Presentation transcript:

Introduction to High Performance Computing Lecture 7 CSCI-455/552 Introduction to High Performance Computing Lecture 7

Embarrassingly Parallel Computations Chapter 3 Embarrassingly Parallel Computations 3.2

Embarrassingly Parallel Computations A computation that can obviously be divided into a number of completely independent parts, each of which can be executed by a separate process(or). No communication or very little communication between processes Each process can do its tasks without any interaction with other processes 3.3

Practical Embarrassingly Parallel Computation with Static Process Creation and Master-slave Approach 3.4

Embarrassingly Parallel Computation Examples • Low level image processing • Mandelbrot set • Monte Carlo Calculations 3.6

Low Level Image Processing Many low level image processing operations only involve local data with very limited if any communication between areas of interest. 3.7

Some Geometrical Operations Shifting Object shifted by Dx in the x-dimension and Dy in the y-dimension: x¢ = x + Dx y¢ = y + Dy where x and y are the original and x¢ and y¢ are the new coordinates. Scaling Object scaled by a factor Sx in x-direction and Sy in y-direction: x¢ = xSx y¢ = ySy 3.8

Rotation Object rotated through an angle q about the origin of the coordinate system: x¢ = x cosq + y sinq y¢ = -x sinq + y cosq 3.8

Partitioning into Regions for Individual Processes Square region for each process (can also use strips) 3.9