1 MA471 Introduction To Scientific Computing Fall 2003 Prof. Tim Warburton

Slides:



Advertisements
Similar presentations
Introduction to MATLAB Northeastern University: College of Computer and Information Science Co-op Preparation University (CPU) 10/20/2003.
Advertisements

Introduction to Computer Programming I CSE 113
CS 46101–600/CS Design and Analysis of Algorithms Dr. Angela Guercio Spring 2010.
1 Course Information Parallel Computing Fall 2008.
1 Course Information Parallel Computing Spring 2010.
CS/CMPE 535 – Machine Learning Outline. CS Machine Learning (Wi ) - Asim LUMS2 Description A course on the fundamentals of machine.
Math 115b Section 1 (Summer 07)  Instructor: Kerima Ratnayaka   Phone :  Office.
1 CS 425 / CS 625 Software Engineering Fall 2007 Course Syllabus August 27, 2007.
Quantitative Methods II Instructor: Michael Moore.
CS – 600 Introduction to Computer Science Prof. Angela Guercio Spring 2008.
MIS 470: Information Systems Project Yong Choi School of Business Administration CSU, Bakersfield.
COMP171 Data Structures and Algorithm Qiang Yang Lecture 1 ( Fall 2006)
1 MA375 Introduction To Numerical Computing Fall 2003 Prof. Tim Warburton
CSS-304: Computer Systems Interface Duisebekov Zhasdauren Faculty of Engineering Suleyman Demirel University.
IS 320: Data Structures Spring Quarter DESCRIPTION This class is an introduction to data structures. The primary data structures—list, stack, queue,
A Brief Calculus Course
CPSC 100 – Personal Computers & Their Uses Fall 2010 Dongsheng Che Department of Computer Science East Stroudsburg University.
COMPSCI 101 S Principles of Programming Lecture 1 – Introduction.
Welcome to the Course CPSC 5155 Computer Architecture Edward Bosworth, Ph.D. Associate Professor Computer Science.
Log into your account Go to Locate MAT 2401 and the First Day PPT.
Introduction to MA Day 1. Name: Charlotte Bailey Office: MATH 802 Office Phone: (765)
Introduction to MA Introduction to Calculus
CS223 Algorithms D-Term 2013 Instructor: Mohamed Eltabakh WPI, CS Introduction Slide 1.
MATH 310, FALL 2003 (Combinatorial Problem Solving) MoWeFr 1:20 McGregory 214.
1 MSCS 237 Distributed Computing Spring 2006 INSTRUCTOR: Dr. Sheikh Iqbal Ahamed Office: Cudahy Hall 386 Phone: Office Hours: Monday 2:00-3:00pm.
MAT 0145 College Readiness Math II Spring 2015
1 MA557/MA578/CS557 Numerical Partial Differential Equations Spring 2002 Prof. Tim Warburton
Please initial the appropriate attendance roster near the door. If you are on the Wait List you will find your name at the bottom. If you are not on the.
ITCS 4/5145 Cluster Computing, UNC-Charlotte, B. Wilkinson, 2006outline.1 ITCS 4145/5145 Parallel Programming (Cluster Computing) Fall 2006 Barry Wilkinson.
CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)
Prof. Barbara Bernal NEW Office in J 126 Office Hours: M 4pm - 5:30 PM Class Lecture: M 6 PM - 8:30 in J133 Weekly Web Lecture between Tuesday to Sunday.
CST 320 Compiler Methods Dr. Sherry Yang PV 171 (541)
CS 23021–600 Computer Science I Dr. Angela Guercio Spring 2010.
AB Accounting 1 Unit 1 Seminar July 5, 2012 School of Business and Management.
Principles of Financial Accounting I Fall Semester 2007 Orientation Welcome – We are glad you are here! Let’s look at the syllabus for this course.
S H E R I D A N A L L P R E P A C A D E M Y Orientation.
Course Information Sarah Diesburg Operating Systems COP 4610.
Course Information Andy Wang Operating Systems COP 4610 / CGS 5765.
Course Introduction Andy Wang COP 4530 / CGS 5425 Fall 2003, Section 4.
CS-2851 Dr. Mark L. Hornick 1 CS-2852 Data Structures Dr. Mark L. Hornick Office: L341 Phone: web: people.msoe.edu/hornick/
Object Oriented Programming (OOP) Design Lecture 1 : Course Overview Bong-Soo Sohn Associate Professor School of Computer Science and Engineering Chung-Ang.
IST 210: Organization of Data
CS Introduction to Computer Science Spring 2011 Dr. Angela Guercio (
Introduction to MA Introduction to Calculus A Brief Calculus Course Spring 2016 Semester.
MATH 96 Winter 2016 Course Syllabus Cathy Mulleary.
Welcome to Numerical Analysis Math 448/548 Cpt S 430/530 Fall 2016 Instructor: John Miller, West 134E Class web page can be found.
Introduction to Financial Management. Overview of Financial Management Introduction Keys to Success Recitations Class Structure - Syllabus Text – Financial.
Computer Networks CNT5106C
Operating Systems CMPSC 473 Introduction and Overview August 24, Lecture 1 Instructor: Bhuvan Urgaonkar.
Physics 211 College Physics I. Introduction  Instructor:Larry Watson  Office:105 Witmer  Phone:   web:und.nodak.edu/instruct/lwatson/211.
MATH 96 Fall 2015 Course Syllabus Cathy Mulleary.
IST 210: ORGANIZATION OF DATA Introduction IST210 1.
MATH 63 Spring 2016 Course Syllabus Highlights Cathy Mulleary.
Course Overview Stephen M. Thebaut, Ph.D. University of Florida Software Engineering.
CSE6339 DATA MANAGEMENT AND ANALYSIS FOR COMPUTATIONAL JOURNALISM CSE6339, Spring 2012 Department of Computer Science and Engineering, University of Texas.
Welcome to MT140 Introduction to Management Unit 1 Seminar – Introduction to Management.
Computer Network Fundamentals CNT4007C
Computer Engineering Department Islamic University of Gaza
Computer Networks CNT5106C
Course Information Mark Stanovich Principles of Operating Systems
Introduction to MA Day 1.
Introduction to MA Day 1.
Andy Wang Operating Systems COP 4610 / CGS 5765
Andy Wang Operating Systems COP 4610 / CGS 5765
Andy Wang Operating Systems COP 4610 / CGS 5765
Andy Wang Operating Systems COP 4610 / CGS 5765
CSS-304: Computer Systems Interface
Andy Wang Operating Systems COP 4610 / CGS 5765
Andy Wang Operating Systems COP 4610 / CGS 5765
Presentation transcript:

1 MA471 Introduction To Scientific Computing Fall 2003 Prof. Tim Warburton

2 Class and Lab Schedule Class: –Room 221, Miller Hall Monday, Wednesday 3:00pm to 3:50pm –ESCP 110 Monday, Wednesday 4:00pm to 5:15pm Office hours: –By appointment -- OR -- –Room 450, Humanities Building Tuesday, Thursday 1:30pm – 3:00pm

3 Grade Distribution 10 % class attendance and participation 40 % homework assignments 50 % project work

4 Textbook Notes will be available after every lecture.. Other materials covered will be supplemented with handouts available at: I will post this material as promptly as possible after the class. Web Page

5 Attendance Policy I will endeavor to make this course as interactive as possible. Most of the ground covered will be accompanied by class demonstrations. It is strongly recommended that you attend all classes. Projects will be group based – non-attendance will effect your grade and will hinder the performance of your group.

6 Minimal Homework and Project Presentation Standards All homework handed in must comply with the following format: Student name, top left hand corner of every page All sheets of paper must be stapled All homework must be typed (I.e. use Word or Latex) Math symbols may be inserted by hand Structure of work must be: 1) Introduction (description of homework problem or project) 2) Results including graphs, images and diagrams 3) Discussion 4) Computer code print outs Graphs of results are easier to read than large tables of data

7 Project Comments This course is heavily project based All projects will be constructed by groups I reserve the right to change group compositions No member from one group may exchange code (or group secrets) with a member from another group Innovation beyond algorithms presented in class is encouraged – however, all code must be written by group member and the source of existing algorithms must be cited in code listing and in write up. All project code must be written in Matlab.

8 Note Note: qualified students with disabilities needing appropriate academic adjustments should contact me as soon as possible to ensure your needs are met in a timely manner. Handouts are available in alternative accessible formats upon request.

9 Provisional Syllabus This is still under development but here are the main areas we are going to cover: 1)Using Unix 2)Coding in C (or Fortran for the determined) 3)Interfacing C and Fortran 4)Compiler optimization 5)Writing efficient code 6)Using math libraries (BLAS, LAPACK, ATLAS, INTEL’S MKL math kernel library)…) 7)Running a job on a parallel computer 8)Parallel programming 9)Using MPI (Message Passing Interface) 10)Using Upshot for parallel profiling 11)Visualization Project contents: 1)Machines can play cards too, analyzing a set up for implementation 2)Finite difference in parallel 3)Working in coding groups 4)Solving a large linear system in parallel 5)Depending on interest – implementing a PDE solver for acoustics

10 Computing Notes 1)Each student will be given an account on “blackbear” at the High Performance Computing and Education Center (HPCERC) formally known as AHPCC. 2)Jonathan Atencio maintains “blackbear”. His is: 3)Please direct questions about “blackbear” to Atencio, and cc me at the same time 4)I expect all students to be courteous and respectful in their communications with Atencio at all times. Any breaches of acceptable etiquette will be dealt with in an appropriate manner. I.e. be nice to your systems manager 5)Your user name is: cs471a* (accounts to be allocated on Weds)

11 Lecture 1 Q) What is a parallel computer? A) Something that performs multiple actions, simultaneously – or “in parallel” at least some of the time This is possibly the most comprehensive description of a parallel computer. What follows is a brief overview of one type of mode of operation of a parallel computer.

12 Class Exercise 1 1)Arrange your selves in groups of 4 2)Each group is now a small cluster of 4 cpus (persons) i.e. There should be 5 parallel computers 3) The following instructions should now be performed in each group: a)Find a single piece of paper b)Write your names on the piece of paper c)Memorize the names on the paper d)Introduce yourself to all the other cpus e)Congratulations you have just met your project group Now – we analyze what went on

13 Class Exercise 2 Repeat exercise 1 with only one parallel computer with 20 processors. Now – we analyze what went on 1)Form a 20 cpu parallel computer 2) Find a single piece of paper a)Write your names on the piece of paper b)Memorize the names on the paper c)Introduce yourself to all the other cpus d)Congratulations you have just met your class

14 Class Exercise 3 1)Return to your groups of 4 2)Obtain one pack of playing cards from the instructor 3)Choose a game from the following: 1)Poker 2)21 3)Go Fish 4)Hearts 5)Spades 4)Play a hand or two with NO BETTING !!!!!!! 5)Ok – now the hard part, analyze where the cards go!! 6)I.e. Is there a dealer involved?, do you talk to any of the other players, or just your neighbor. Does your neighbor change between hands?… 7)Each person must write up a (less than one page) analysis of the way the cards travel – and document if there is any other information passed? 8)Hand in write up on Wednesday 27 th August  9)Diagrams are encouraged – as long as they are explained in text.