1 / 14

MA471 Introduction To Scientific Computing

MA471 Introduction To Scientific Computing. Fall 2003 Prof. Tim Warburton timwar@math.unm.edu. 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 --

goro
Download Presentation

MA471 Introduction To Scientific Computing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. MA471Introduction To Scientific Computing Fall 2003 Prof. Tim Warburton timwar@math.unm.edu

  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: http://www.useme.org/MA471.html • I will post this material as promptly aspossible 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 betyped (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: • Using Unix • Coding in C (or Fortran for the determined) • Interfacing C and Fortran • Compiler optimization • Writing efficient code • Using math libraries (BLAS, LAPACK, ATLAS, INTEL’S MKL math kernel library)…) • Running a job on a parallel computer • Parallel programming • Using MPI (Message Passing Interface) • Using Upshot for parallel profiling • Visualization • Project contents: • Machines can play cards too , analyzing a set up for implementation • Finite difference in parallel • Working in coding groups • Solving a large linear system in parallel • Depending on interest – implementing a PDE solver for acoustics

  10. Computing Notes • Each student will be given an account on “blackbear” at the High PerformanceComputing and Education Center (HPCERC) formally known as AHPCC. • Jonathan Atencio maintains “blackbear”. His email is:jatencio@ahpcc.unm.edu • Please direct questions about “blackbear” to Atencio, and cc me at the same time • I expect all students to be courteous and respectful in their communicationswith Atencio at all times. Any breaches of acceptable etiquette will be dealtwith in an appropriate manner. I.e. be nice to your systems manager  • 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 ofoperation of a parallel computer.

  12. Class Exercise 1 • Arrange your selves in groups of 4 • 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: • Find a single piece of paper • Write your names on the piece of paper • Memorize the names on the paper • Introduce yourself to all the other cpus • 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. • Form a 20 cpu parallel computer • 2) Find a single piece of paper • Write your names on the piece of paper • Memorize the names on the paper  • Introduce yourself to all the other cpus • Congratulations you have just met your class  Now – we analyze what went on

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

More Related