1 Course Information Parallel Computing Spring 2010.

Slides:



Advertisements
Similar presentations
CSc 2310 Principles of Programming (Java)
Advertisements

CSCE 145: Algorithmic Design I Introduction Muhammad Nazmus Sakib.
1-1 CMPT 225 Data Structures and Programming Instructor: Aaron Hunter Section: E300 Campus: Harbour Centre Semester: Spring 2007.
CS 46101–600/CS Design and Analysis of Algorithms Dr. Angela Guercio Spring 2010.
1 Course Information Parallel Computing Fall 2008.
CS/CMPE 524 – High- Performance Computing Outline.
Welcome to MAT 170. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Wednesday and Friday 10:40 am – 11:30 am and by appointment.
Welcome to MAT 210. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Tuesday and Thursday 12 noon - 1 pm Wednesday 8:30 am –
Welcome to MAT 170. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Tuesday and Thursday 8 am – 8:30 am Tuesday and Thursday.
CS 524 – High- Performance Computing Outline. CS High-Performance Computing (Wi 2003/2004) - Asim LUMS2 Description (1) Introduction to.
COMP171 Data Structures and Algorithm Huamin Qu Lecture 1 (Sept. 1, 2005)
COMP171 Data Structures and Algorithm Qiang Yang Lecture 1 ( Fall 2006)
Welcome to MAT 170. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Tuesday and Thursday 12 noon - 1 pm Wednesday 8:30 am –
Slide 1 Instructor: Dr. Hong Jiang Teaching Assistant: Mr. Sheng Zhang Department of Computer Science & Engineering University of Nebraska-Lincoln Classroom:
1 CPT S 223: Advanced Data Structures (section 01) Fall 2010 School of EECS Washington State University, Pullman MWF 10:10-11 Sloan 5.
Dr. Iyad Jafar Embedded Systems CPE 333. Instructor Information Dr. Iyad F. Jafar Office : Room 002 Computer Engineering Office Hours Sunday & Tuesday.
CSCI 1301 Principles of Computer Science I
Computer Network Fundamentals CNT4007C
CS223 Algorithms D-Term 2013 Instructor: Mohamed Eltabakh WPI, CS Introduction Slide 1.
Cpt S 471/571: Computational Genomics Spring 2015, 3 cr. Where: Sloan 9 When: M WF 11:10-12:00 Instructor weekly office hour for Spring 2015: Tuesdays.
Math 125 Statistics. About me  Nedjla Ougouag, PhD  Office: Room 702H  Ph: (312)   Homepage:
Welcome to CS 3331, Advanced Object-Oriented Programming Fall 2009 Dept. of Computer Science University of Texas at El Paso.
COMP Introduction to Programming Yi Hong May 13, 2015.
Computer Networks CEN 5501C Spring, 2008 Ye Xia (Pronounced as “Yeh Siah”)
ITCS 4/5145 Cluster Computing, UNC-Charlotte, B. Wilkinson, 2006outline.1 ITCS 4145/5145 Parallel Programming (Cluster Computing) Fall 2006 Barry Wilkinson.
Course Introduction Software Engineering
COMPE 226 Data Structures 2015 Fall Murat KARAKAYA Department of Computer Engineering.
CST 229 Introduction to Grammars Dr. Sherry Yang Room 213 (503)
1 Course Information Operating System Fall Instructor Information Office: 1N-214 Tel:(718) Webpage:
40551 Logic Synthesis Optimization Dr. Yaser M. Agami Khalifa Fall 2004 Lecture # 1.
CNS 4450 Syllabus. Context Language is a tool of thought. We rarely think without words. In solving problems by computer, we eventually get to the point.
CS 140 Computer Programming (I) Second semester (3 credits) Imam Mohammad bin Saud Islamic University College of Computer Science and Information.
Welcome CSCI 1100/1202 Intro to Computer Science Winter 2002.
Data Structures (Second Part) Lecture 1 Bong-Soo Sohn Assistant Professor School of Computer Science and Engineering Chung-Ang University.
Data Warehousing/Mining 1 Data Warehousing/Mining Comp 150DW Course Overview Instructor: Dan Hebert.
1 CSCI 3120: Operating Systems Summer 2003 Instructor: Kirstie Hawkey Office hours (outside Room 311): Mon: 2:30-3:30, Fri: 10:30-11:30.
Object Oriented Programming (OOP) Design Lecture 1 : Course Overview Bong-Soo Sohn Assistant Professor School of Computer Science and Engineering Chung-Ang.
June 19, Liang-Jun Zhang MTWRF 9:45-11:15 am Sitterson Hall 011 Comp 110 Introduction to Programming.
CS Welcome to CS 5383, Topics in Software Assurance, Toward Zero-defect Programming Spring 2007.
IST 210: Organization of Data
ICS202 Data Structures King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science Department.
Computing Systems: Organization and Design EE460/CS360/T425.
CPE 432 Computer Design Dr. Walid Abu-Sufah 1CPE 432 Computer Design.
Course Overview 1 FCM 710 Architecture of Secure Operating Systems Prof. Shamik Sengupta Office 4210 N
CS 52500, Parallel Computing Spring 2011 Alex Pothen Lectures: Tues, Thurs, 3:00—4:15 PM, BRNG 2275 Office Hours: Wed 3:00—4:00 PM; Thurs 4:30—5:30 PM;
CSE3330/5330 DATABASE SYSTEMS AND FILE STRUCTURES (DB I) CSE3330/5330 DB I, Summer2012 Department of Computer Science and Engineering, University of Texas.
Computer Networks CNT5106C
MAT 279 Data Communication and the Internet Prof. Shamik Sengupta Office 4210 N Fall 2010.
IST 210: ORGANIZATION OF DATA Introduction IST210 1.
Administrative Preliminaries Computer Architecture.
Course Information CSE 2031 Fall Instructor U.T. Nguyen Office: CSE Home page:
CMPT 238 Data Structures Instructor: Tina Tian. General Information Office: RLC 203A Office Hour: Tue and Fri 12:30 - 2:00PM.
– Ecology and Evolution Spring 2004 M,W,F 11 – 11:50 CEH 218.
Course Overview 1 MAT 279 Data Communication and the Internet Prof. Shamik Sengupta Office 4210 N
Operating Systems (CS 340 D) Dr. Abeer Mahmoud Princess Nora University Faculty of Computer & Information Systems Computer science Department.
Computer Network Fundamentals CNT4007C
Computer Engineering Department Islamic University of Gaza
CSCE 121, Sec 200 Fall 2012 Prof. Jennifer L. Welch.
Computer Networks CNT5106C
CPE741: Distributed Systems Course Introduction
CMPT 238 Data Structures Instructor: Tina Tian.
Artificial Intelligence (CS 461D)
Artificial Intelligence (CS 370D)
Cpt S 471/571: Computational Genomics
CSE1311 Introductory Programming for Engineers & Scientists
COT 4600 Operating Systems Spring 2011
Computer Engineering Department Islamic University of Gaza
CMPT 238 Data Structures Instructor: Tina Tian.
Presentation transcript:

1 Course Information Parallel Computing Spring 2010

2 Instructor Information Office: 1N-202 Tel:(718) Webpage: Course webpage: /csc770Spring10.html

3 Schedule Course Monday, 8:20pm-10:00pm Room: 2N104 Regularly scheduled conference hour 1 hour supplemental independent study Office hour: Monday 2:00pm - 3:30pm Wednesday 2:00pm - 3:30pm or by special appointment

4 Textbook Required: An Introduction to Parallel Computing: Design and Analysis of Algorithms, Second Edition by A. Grama, V. Kumar et al. Pearson Addison Wesley. ISBN: Reference: Using MPI - 2nd Edition: Portable Parallel Programming with the Message Passing Interface (Scientic and Engineering Computation) by William Gropp, Ewing Lusk, Anthony Skjellum. MIT Press; 2nd edition (November 26, 1999), ISBN: Parallel Programming with MPI by Peter S. Pacheco. Morgan Kaufmann; 1st edition (October 1, 1996), ISBN-10: ISBN-13:

5 Course Content Introduction to Parallel Computing Parallel Programming Platforms Principles of Parallel Algorithm Design Analytical Modeling of Parallel Programs Decomposition Techniques for Parallel Algorithms Programming Using the Message-Passing Paradigm PRAM algorithms Architecture Independent Algorithms Design and Time Analysis Matrix Algorithms Sorting Graph Algorithms Search Algorithms Parallel algorithms for scientific computing Note: The order and the content is subject to change.

6 Homework There are FOUR homework assignments. Homeworks will focus on: review some important concepts and formulas covered in the class. extend or modify the algorithms to solve the variants of the problems covered in the class. design new algorithms for new problems using the techniques covered in the class. Homework assignments will be assigned during class and also posted on the course Web-page: Homeworks MUST be turned in before the beginning of the class on the due date.

7 Programming Assignments Three programming Assignments Use CSI’s Linux Cluster Website for basic information of CSI’s cluster: Click the link of Research Linux cluster Accounts to be created Tasks: Designing and implementing parallel algorithms, compiling and running your programs in the environment of cluster, evaluating a solution, and submitting your program and report. Goals: Students can solve the problems using the techniques introduced in the class. Students can implement their parallel programs using MPI programming language on CSI’s Linux cluster – Typhon. Students will learn more about doing research in general.

8 Programming Assignments (cont.) The solution to each programming assignment may include the source code and a report showing the result. The source code MUST be turned in by to before midnight the date they are due. The report MUST be submitted either per or be handed in a hard-copy at the beginning of the class on the due date. Handwritten or typed report will be accepted. Solutions must be readable(especially handwriting!!!), clear, concise and complete.

9 Grade The exams may test on material covered in class and on material covered in the reading assignments. Your grade will be based approximately, as follows. These percentages are tentative and subject to change. 20% - Homeworks 30% - Programming Assignments 25% - Midterm Exam 25% - Final Class participation is essential to succeed in this course.

10 Policy Homework assignments and programming assignments are due at the start of class on their due date. If you think you won't be present in class on that Monday, turn the homework in earlier at instructor's office or by . Each homework or each programming assignment will receive a maximum of 100 points for full credit. Homework or programming assignment submitted up to 1 week late will receive a maximum of 80 points Homework or programming assignment submitted up to 2 weeks late will receive a maximum of 60 points. NO Homework or programming assignment will be accepted later than two weeks after due date. Check the marks in a homework, programming assignment or an exam and report errors promptly. Make sure you report such problems to the instructor within four weeks from receipt but no later than May 17, The work you turn in MUST BE your own personal work, composed and written by you. DO NOT OBTAIN YOUR SOLUTION THROUGH THE INTERNET. Collaboration of any kind is NOT allowed in the in-class exams (midterms, and final). DO NOT USE pencils to write down your solutions for the homework, programming assignments or exams