Literature Review Dongdong Chen Peng Huang

Slides:



Advertisements
Similar presentations
Parallelism Lecture notes from MKP and S. Yalamanchili.
Advertisements

Prepared 7/28/2011 by T. O’Neil for 3460:677, Fall 2011, The University of Akron.
1 Efficient Self-Healing Group Key Distribution with Revocation Capability by Donggang Liu, Peng Ning, Kun Sun Presented by Haihui Huang
Princess Sumaya Univ. Computer Engineering Dept. Chapter 7:
Improving Placement under the Constant Delay Model Kolja Sulimma 1, Ingmar Neumann 1, Lukas Van Ginneken 2, Wolfgang Kunz 1 1 EE and IT Department University.
Potential for parallel computers/parallel programming
Copyright 2014 – Noah Mendelsohn Introduction to Software Performance & Tuning Noah Mendelsohn Tufts University
11Sahalu JunaiduICS 573: High Performance Computing5.1 Analytical Modeling of Parallel Programs Sources of Overhead in Parallel Programs Performance Metrics.
Example (1) Two computer systems have been tested using three benchmarks. Using the normalized ratio formula and the following tables below, find which.
1 COMP 206: Computer Architecture and Implementation Montek Singh Mon., Sep 5, 2005 Lecture 2.
11/14/05ELEC Fall Multi-processor SoCs Yijing Chen.
GEOS-CHEM: Platforms and Resolution 4x5 is under control, many platform options exist. 2x2.5 is a factor of 5-6 slower than 4x5, but useful. global 1x1.
Chair of Software Engineering Concurrent Object-Oriented Programming Prof. Dr. Bertrand Meyer Exercise Session 2: Introduction.
Chapter 5. Operations on Multiple R. V.'s 1 Chapter 5. Operations on Multiple Random Variables 0. Introduction 1. Expected Value of a Function of Random.
Lecture 37: Chapter 7: Multiprocessors Today’s topic –Introduction to multiprocessors –Parallelism in software –Memory organization –Cache coherence 1.
Writing the Research Paper
CPU Performance Assessment As-Bahiya Abu-Samra *Moore’s Law *Clock Speed *Instruction Execution Rate - MIPS - MFLOPS *SPEC Speed Metric *Amdahl’s.
Computer Science 320 Measuring Speedup. What Is Running Time? T(N, K) says that the running time T is a function of the problem size N and the number.
Problem (Question) (Difficulty). Decisions Problem (Question) (Difficulty) Decisions Research.
Empowering efficient HPC with Dell Martin Hilgeman HPC Consultant EMEA.
Amdahl's Law Validity of the single processor approach to achieving large scale computing capabilities Presented By: Mohinderpartap Salooja.
2015/10/14Part-I1 Introduction to Parallel Processing.
Compiled by Maria Ramila Jimenez
555 Review. Chapter 2: Introduction The sequence of 8 types of research Differences between qualitative and quantitative research – Components of qualitative.
Some Notes on Performance Noah Mendelsohn Tufts University Web: COMP 40: Machine.
Scaling Area Under a Curve. Why do parallelism? Speedup – solve a problem faster. Accuracy – solve a problem better. Scaling – solve a bigger problem.
Practical Strategies for Power-Efficient Computing Technologies Karim Al-Sheraidah December 8 th 2011.
CCSM Performance, Successes and Challenges Tony Craig NCAR RIST Meeting March 12-14, 2002 Boulder, Colorado, USA.
CSIS Parallel Architectures and Algorithms Dr. Hoganson Speedup Summary Balance Point The basis for the argument against “putting all your (speedup)
Computer Organization CS224 Fall 2012 Lesson 52. Introduction  Goal: connecting multiple computers to get higher performance l Multiprocessors l Scalability,
3/12/2013Computer Engg, IIT(BHU)1 INTRODUCTION-1.
Scaling Conway’s Game of Life. Why do parallelism? Speedup – solve a problem faster. Accuracy – solve a problem better. Scaling – solve a bigger problem.
Scale-Space and Edge Detection Using Anisotropic Diffusion Presented By:Deepika Madupu Reference: Pietro Perona & Jitendra Malik.
Parallel IO for Cluster Computing Tran, Van Hoai.
Computer Science 320 Measuring Sizeup. Speedup vs Sizeup If we add more processors, we should be able to solve a problem of a given size faster If we.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 February Session 7.
1 Potential for Parallel Computation Chapter 2 – Part 2 Jordan & Alaghband.
Introduction to Parallel Processing
Potential for parallel computers/parallel programming
PERFORMANCE EVALUATIONS
Introduction to Parallel Computing: MPI, OpenMP and Hybrid Programming
CHAPTER SEVEN PARALLEL PROCESSING © Prepared By: Razif Razali.
18-447: Computer Architecture Lecture 30B: Multiprocessors
Lecture 5 Approaches to Concurrency: The Multiprocessor
4- Performance Analysis of Parallel Programs
Introduction to Algebra
Introduction to Parallelism.
Quality Systems Management
Quality Systems Management
Quality Systems Management
Quality Systems Management
Array Processor.
The Nature of Probability and Statistics
مناهج البحث العلمي Scientific Research Methods
Overview Parallel Processing Pipelining
Numerical Algorithms Quiz questions
Quiz Questions Parallel Programming Parallel Computing Potential
Chapter 4 Multiprocessors
Parallel Computing and Parallel Computers
Parallelism Can we make it faster? 27-Apr-19.
Potential for parallel computers/parallel programming
Potential for parallel computers/parallel programming
Parallelism Can we make it faster? 8-May-19.
Potential for parallel computers/parallel programming
Quiz Questions Parallel Programming Parallel Computing Potential
Quiz Questions Parallel Programming Parallel Computing Potential
Quiz Questions Parallel Programming Parallel Computing Potential
Potential for parallel computers/parallel programming
Jianmin Chen, Zhuo Huang, Feiqi Su, Jih-Kwon Peir and Jeff Ho
Presentation transcript:

Literature Review Dongdong Chen Peng Huang Validity of the single processor approach to achieving large scale computing capabilities Gene M. Amdahl Literature Review Dongdong Chen Peng Huang

Introduction Single VS Multiple Interconnection of computers Validity of the single processor approach Weakness of the multiple processor approach

Arguments Description Statistical characteristics of computation The fraction of the computational load is constant (~40%). Sequential ( unlikely to be amenable to parallel processing technique)

Arguments Description Physical Problems Irregular boundaries Inhomogeneous interior Computation maybe dependent on the states of the variables at each point Propagation rate may be quite different The rate of convergence may be strongly dependent on sweeping through array.

Conclusion (1) Amdahl’s Law

Amdahl’s Law (Con)