Foilset Search Full Index for Scripted foilset

CPS615-Introduction-Course,Driving Technology and HPCC Current Status and Futures

Given by Geoffrey C. Fox, (Some Culler, Koelbel material) at CPS615 Basic Simulation Track for Computational Science on Fall Semester 98. Foils prepared 23 August 1998

We Introduce Computational Science and Driving Forces
  • Technology Advances and Commodity Trends
  • Inevitability of Parallelism
  • Integration of Distributed and Parallel Computing
  • Comparison with Internetics
We give a simple overview of parallel architectures today with distributed, shared or distributed shared memory
We describe data, functional and pleasing parallelism
We describe principles of parallel programming using atmospheric simulation as an example
We describe the growing importance of Java
We explain pragmatic choices
  • MPI with Fortran and C today
  • Java Grande is future?


This mixed presentation uses parts of the following base foilsets which can also be looked at on their own!
General Collection of Foils in Second Half of 1998
Master Foilset for CPS615 Introduction -- Material from Culler and Koelbel
Master Set of Foils for 1996 Session of CPS615
Master Set B of Overview Material on Parallel Computing for CPS615 Foils
Master Foils for A Short Overview of HPCC -- From GigaFlops to PetaFlops and From Tightly Coupled MPP's to the World Wide Web
Part A:Overview of Programming Paradigms and Relation to Applications
Master Set A of Overview Material on Parallel Computing for CPS615 Foils
Title and Abstract of FakeFoilset

Table of Contents for CPS615-Introduction-Course,Driving Technology and HPCC Current Status and Futures

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
(basic:(focus style:) Denote Foils where Image is not available
Indicates Available audio which is greyed out if missing


CPS 615 Lectures 1998 Fall Semester -- Introduction

Start new Section:Overall Structure of Course
1 Overview of Computational Science
2 Abstract of Computational Science Presentation

Technology Snapshot
3 Some Notes on Lecture Technology

What is Course
4 What is Computational Science ?
5 Synergy of Parallel Computing and Web Internetics as Unifying Principle
6 Basic CPS615 Contact Points
7 Course Organization
8 Material Covered in this Course
9 Structure of CPS615 - II
10 Basic Structure of Complete CPS615 Base Course on Computational Science Simulation Track -- III

What is Parallel Computing and Parallel Application
11 What are Parallel and Distributed Computing?
12 Why Parallel Computing?
13 Parallel Computing Technology Rationale
14 Motivating Applications

Performance Reality/Dreams
15 Performance of High End Machines Years 1940-2000
16 Performance of High End Machines Years 1980-2000
17 Peak Supercomputer Performance

Start new Section: Overview of HPCC Nationally
18 Some Comments on Simulation and HPCC

Start new Subsection:General Overview of Parallel Computing Technology
19 The Multicomputer: an Idealized Parallel Computer
20 Multicomputer Architecture
21 Multicomputer Cost Model
22 Sequential Memory Structure
23 Parallel Computer Memory Structure
24 Real Parallel Computers Architectures
25 Parallel Computers -- Classic Overview
26 Distributed Memory MIMD Multiprocessor
27 Distributed Memory Machines
28 Distributed Memory Machines -- Notes
29 Shared Memory MIMD Multiprocessor
30 Shared-Memory Machines
31 Shared-Memory Machines -- Notes
32 Distributed Shared Memory (DSM)
33 Distributed Shared Memory Machines
34 Workstation Clusters

Categories of Algorithms
35 Parallel Algorithms
36 Data Parallelism in Algorithms

Data Parallel application Examples:The Fundamental Reasons Why Parallel Computing is Easy
37 Some Illustrative Examples of Parallel Applications!
38 Concurrent Computation as a Mapping Problem -I
39 Concurrent Computation as a Mapping Problem - II
40 Concurrent Computation as a Mapping Problem - III
41 Finite Element Mesh From Nastran
(mesh only shown in upper half)
42 A Simple Equal Area Decomposition
43 Decomposition After Annealing
(one particularly good but nonoptimal decomposition)

Functional and Pleasingly Parallel Parallelism
44 Functional Parallelism in Algorithms
45 Structure(Architecture) of Applications - I
46 Structure(Architecture) of Applications - II
47 Multi Server Model for metaproblems
48 Multi-Server Gateway Tier
49 Pleasingly Parallel Algorithms

Parallel Computing Software
50 Parallel Languages
51 Data-Parallel Languages
52 Message-Passing Systems
53 A Simple Parallel Programming Model
54 Properties of Programming Model
55 Some Steps in Parallel Programming
56 Partitioning
57 Communication
58 Agglomeration
59 Mapping

Computer architectures and Technology Trends
60 What is Parallel Architecture?
61 Why Study Parallel Architecture as a computer scientist?
62 Why Study Architecture Today?
63 Inevitability of Parallel Computing
64 Application Trends
65 TPC-C (database transaction processing)
66 Summary of Application Trends
67 Technology Trends -- CPU's
68 General Technology Trends
69 Technology: A Closer Look
70 Clock Frequency Growth Rate
71 Transistor Count Growth Rate
72 Similar Story for Storage

Elementary Discussion of Parallel Computing
73 Parallel Processing and Society
74 Concurrent Construction of a Wall
Using N = 8 Bricklayers
Decomposition by Vertical Sections
75 Quantitative Speed-Up Analysis for Construction of Hadrian's Wall
76 Amdahl's law for Real World Parallel Processing
77 Pipelining --Another Parallel Processing Strategy for Hadrian's Wall
78 Hadrian's Wall Illustrates that the Topology of Processor Must Include Topology of Problem
79 General Speed Up Analysis
80 Nature's Concurrent Computers
81 Comparison of Concurrent Processing in Society and Computing

More Complex Problem Issues in the Society Analogy
82 Comparison of The Complete Problem to the subproblems formed in domain decomposition
83 Hadrian's Wall Illustrating an
Irregular but Homogeneous Problem
84 Some Problems are Inhomogeneous Illustrated by:
An Inhomogeneous Hadrian Wall with Decoration
85 Global and Local Parallelism Illustrated by Hadrian's Wall
86 Parallel I/O Illustrated by
Concurrent Brick Delivery for Hadrian's Wall
Bandwidth of Trucks and Roads
Matches that of Masons

A Real Example
87 Example: Atmosphere Model
88 Atmosphere Model: Numerical Methods
89 Atmosphere Model: Partition
90 Atmosphere Model: Communication
91 Atmosphere Model: Agglomeration
92 Atmosphere Model: Mapping

Web and Java -- The Future
93 The HPCC Dilemma and its Solution
94 What is Commodity Software
95 The Computing Pyramid
96 Implications of the Computing Pyramid
97 The 3 Roles of Java
98 Why is Java Worth Looking at?
99 What is Java Grande?
100 Java and Parallelism?
101 "Pure" Java Model For Parallelism

See Java in HPCC resource
102 Java for Scientific Computing Resource

Pragmaticism
103 Pragmatic Computational Science August 1998

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 cps615homepage97 URL http://www.npac.syr.edu/projects/cps615fall97/ * 1997 Session of CPS 615 Basic Overview of Computational Science -- Simulation Track by gcf on Aug 27 1997
Times 1 Foils referenced 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 Sat Aug 29 1998