Foilset Search Full Index for Scripted foilset

Second set of lectures on CPS615 Parallel Computing Overview

Given by Geoffrey C. Fox at CPS615 Basic Simulation Track for Computational Science on Fall Semester 95. Foils prepared 18 Sept 1995

This starts with a discussion of Parallel Computing using analogies from nature
It uses foils and material from CSEP chapter on Computer Architecture to discuss how and why to build a parallel computer including synchronization memory structure and network issues
SIMD and MIMD Architectures with a brief comparison of workstation networks with closely coupled systems
A look to the future is based on results from Petaflops workshop


This mixed presentation uses parts of the following base foilsets which can also be looked at on their own!
Master Material for Second set of lectures on CPS615 Parallel Computing Overview
Master Set A of Overview Material on Parallel Computing for CPS615 Foils
Master Set B of Overview Material on Parallel Computing for CPS615 Foils

Table of Contents for Second set of lectures on CPS615 Parallel Computing Overview

There are two types of foils -- html and image which are each available in basic and JavaScript enabled "focused" style
(basic:)(focus style:) Denote Foils where Image Critical
(basic:)(focus style:) Denote Foils where Image has important information
(basic:)(focus style:) Denote Foils where HTML is sufficient
Indicates Available audio which is greyed out if missing


CPS 615 Lectures 1995 Fall Semester -- set 2
1 CPS615 -- Base Course for the Simulation Track of Computational Science
Fall Semester 1995 --
Lecture Stream 2
2 Abstract of Lecture Stream 2 of CPS615

Elementary Discussion of Parallel Computing
3 Elementary Discussion of
Parallel Computing
4 Single nCUBE2 CPU Chip
5 64 Node nCUBE Board
6 CM-5 in NPAC Machine Room
7 Basic METHODOLOGY of Parallel Computing
8 Concurrent Computation as a Mapping Problem -I
9 Concurrent Computation as a Mapping Problem - II
10 Concurrent Computation as a Mapping Problem - III
11 Finite Element Mesh From Nastran
(mesh only shown in upper half)
12 A Simple Equal Area Decomposition
13 Decomposition After Annealing
(one particularly good but nonoptimal decomposition)
14 Parallel Processing and Society
15 Concurrent Construction of a Wall
Using N = 8 Bricklayers
Decomposition by Vertical Sections
16 Quantitative Speed-Up Analysis for Construction of Hadrian's Wall
17 Amdahl's law for Real World Parallel Processing
18 Pipelining --Another Parallel Processing Strategy for Hadrian's Wall
19 Hadrian's Wall Illustrates that the Topology of Processor Must Include Topology of Problem
20 General Speed Up Analysis
21 Comparison of The Complete Problem to the subproblems formed in domain decomposition
22 Hadrian's Wall Illustrating an
Irregular but Homogeneous Problem
23 Some Problems are Inhomogeneous Illustrated by:
An Inhomogeneous Hadrian Wall with Decoration
24 Global and Local Parallelism Illustrated by Hadrian's Wall
25 Parallel I/O Illustrated by
Concurrent Brick Delivery for Hadrian's Wall
Bandwidth of Trucks and Roads
Matches that of Masons
26 Nature's Concurrent Computers
27 Comparison of Concurrent Processing in Society and Computing

General Overview of Computer Architecture

28 Computational Science CPS615
Simulation Track Overview
Foilsets B 1995
29 Abstract of CPS615 Foilsets B 1995
30 Overview of
Parallel Hardware Architecture
31 3 Major Basic Hardware Architectures
32 Examples of the Three Current Concurrent Supercomputer Architectures
33 Parallel Computer Architecture Issues
34 General Types of Synchronization
35 Granularity of Parallel Components
36 Types of Parallel Memory Architectures
-- Logical Structure
37 Types of Parallel Memory Architectures -- Physical Characteristics
38 Diagrams of Shared and Distributed Memories

Overview of Interconnection Networks

39 Survey of Issues in Communication Networks
40 Glossary of Useful Concepts in Communication Systems
41 Switch and Bus based Architectures
42 Classes of Communication Network include ...
43 Point to Point Networks (Store and Forward) -- I
44 Examples of Interconnection Topologies
45 Degree and Diameter of Ring and Mesh(Torus) Architectures

Details on Hypercube and Mapping to Meshs

46 Degree and Diameter of Hypercube and Tree Architectures
47 Rules for Making Hypercube Network Topologies
48 Mapping of Hypercubes into Three Dimensional Meshes
49 Mapping of Hypercubes into One Dimensional Systems
50 The One dimensional Mapping can be thought of as for one dimensional problem solving or one dimensional layout of chips forming hypercube
51 Hypercube Versus Mesh Topologies

Practical Network Issues

52 Point to Point Networks (Store and Forward) -- II
53 Latency and Bandwidth of a Network
54 Transfer Time in Microseconds for both Shared Memory Operations and Explicit Message Passing
55 Latency/Bandwidth Space for 0-byte message(Latency) and 1 MB message(bandwidth).
56 Switches versus Processor Networks
57 Circuit Switched Networks

Parallel Architectures in More Detail
58 Let's Return to General Parallel Architectures in more detail
59 Overview of Computer Architecture Issues
60 Some Global Computer Architecture Issues
61 Two General Real World Architectural Issues

SIMD MIMD Shared versus Distributed

62 MIMD Distributed Memory Architecture
63 Some MIMD Architecture Issues
64 SIMD (Single Instruction Multiple Data) Architecture
65 SIMD Architecture Issues
66 Shared Memory Architecture
67 Shared versus Distributed Memory

Classic Vector Supercomputers

68 The General Structure of a full sized CRAY C-90
69 The General Structure of a NEC SX-3
Classic Vector Supercomputer
70 Comparison of MIMD and SIMD Parallelism seen on Classic Vector Supercomputers

Petaflop Performance in the Year 2015

71 What will happen in the year 2015 with .05 micron feature size and Petaflop Supercomputers using CMOS
72 CMOS Technology and Parallel Processor Chip Projections
73 Processor Chip Requirements for a Petaflop Machine Using 0.05 Micron Technology
74 Three Designs for a Year 2015 Petaflops machine with 0.05 micron technology
75 The Global Shared Memory Category I Petaflop Architecture
76 Category II Petaflop Architecture -- Network of microprocessors
77 Category III Petaflop Design -- Processor in Memory (PIM)
78 Necessary Latency to Support Three Categories
79 Chip Density Projections to year 2013
80 DRAM Chip count for Construction of Petaflop computer in year 2013 using 64 Gbit memory parts
81 Memory Chip Bandwidth in Gigabytes/sec
82 Power and I/O Bandwidth (I/O Connections) per Chip throught the year 2013
83 Clock Speed and I/O Speed in megabytes/sec per pin through year 2013

Full WebWisdom URL and this Foilset Search
This contains all WebWisdom links preceded by those referenced in this foilset

List of WebWisdom URL's Used in this Foilset


key cps615homepage95 URL http://www.npac.syr.edu/projects/cps615fall95/ * CPS 615 Basic Overview of Computational Science -- Simulation Track by gcf on Sept 1,1995
Times 2 Foils referenced Script Script
© Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Fri Aug 15 1997