PC COURSE OUTLINE

Parallel Computing - Course Plan

1. Introduction

What is Parallel Computing, Motivation why Parallel Computing? Link with other technologies.

Module 1 – Instruction Level Parallelism (ILP)

2. MPIS/DLX Architecture

Overview of Processor Architecture , Instruction Set Architecture , Instruction encoding

3. ILP – Instruction Level Parallelism

Overview of MIPS/DLX Pipelining, Structural Hazards, Control Hazards, Data Hazards

4. Pipeline Code Scheduling

Techniques to avoid and remove Pipeline Hazards – Static Code Rescheduling and Loop unrolling

5. Dynamic Code Rescheduling Techniques (Score Boarding, Tomasolo)

6. Code Scheduling on Multi-issue processors

Superscalar and VLIW architecture & code scheduling, comparison with Array and Vector Processors

Module 2 - PRAM ( Parallel Random Access Machines)

7. PRAM Algorithms

Overview of Parallel Random Access Machine, PRAM Models, EREW PRAM Algorithms

8. Analysis of ERCW-PRAM, Algorithms

9. Analysis of CRCW-PRAM Algorithms

10. Analysis of CREW-PRAM Algorithms

Module 3 – Cluster Computing

11. Cluster Computing

Cluster Computing, GRID Computing, Overview of Available tools, Overview of Message Passing Systems & Applications.

12. MPI Cluster – Programming

Overview of Message Passing Interface,

Installation and Configuration of MPI Cluster

13. MPI Programming Examples,

Analysis of MPI Algorithms

14. Implementing PRAM algorithms through MPI

15. Review

Review of the course

Books:

“Fundamentals of Parallel Processing”, Harry F,Gita , Prentice Hall 2003

“Interlocution to Parallel Computing” W.P. Peterson, P.Abenz , Oxford University Press - 2004

“Parallel Scientific Computing in C++ and MPI”, G.E. Karniadakis, Cambridge University Press- 2003

“Distributed and Parallel Computing”, Hesham ElRewini, Manning Greenwich 1998

“Computer Architecture – A Qantitative Approach”, Patterson,Hennessy, Morgan Kaufmann - 2006=

STATS Exam Paper Pattern

Exam Paper Pattern

[CSKU2008-2011a] Course Outline - 601

 

Course Covered BSCS – 601 Reference: William Stallings (2009), Operating Systems: Internals and Design Principles, 6/E, Pearson Education Chapter 3 ·         All material covered in lecture slides and class Chapter 4 ·         All articles from the book excluding 4.3 and 4.5 ·         All material covered in class and lecture slides ·         All related implementations discussed in class or given as assignments Chapter 5 ·         All articles from the book excluding 5.6 ·         All material covered in class and lecture slides ·         All related implementations discussed in class or given as assignments ·         The Dining Philosophers Problem as discussed in the class. {Theoretical description only, no implementation}. You can can reference from 6.6. Chapter 7 ·         All articles from the book excluding 7.5 ·         All material covered in class and lecture slides Chapter 12 ·         Cover 12.1-12.4 for objectives only ....  Chapter 16 ·         Cover 16.1 ·         All material covered in class and lecture slides   Reference:  Tom Barnaby (2002), Distributed .NET Programming in C#, Apress Chapter 2 ·         Serialization ·         All material covered in class Chapter 3 ·         Remoting, Application Domains, Context, Marshalling ·         All material covered in class ·         All related implementations discussed in class or given as assignments Chapter 4 ·         Implementing Well Known Objects, Building remote hosts using Windows Services ·         All material covered in class ·         All related implementations discussed in class or given as assignments   Please send input through respective CRs if I have missed anything out.  Whatever I have mentioned above WILL BE included in the exam, so don`t bother about arguing about them.  No direct emails, calls or sms please. I haven't made the paper as yet so I can't provide any exact distribution but a general outlay will be 30-40% objectives, 20-30% theory and 30-40% implementations. For CRs : please email me a document containing all the topics that I referred as IMPORTANT for the exam. Please make sure you email these within before 2359hrs on Friday 20 May 2011.  Wasalam, Zain Abbas

__._,_.___

Reply to sender | Reply to group | Reply via web post | Start a New Topic

Messages in this topic (1)

Recent Activity:

• New Members 2

Visit Your Group

Switch to: Text-Only, Daily Digest • Unsubscribe • Terms of Use

.

__,_._,___

--
 <\b>    (- \> \> !

PC NEWS

PC LAB n PROJECT SUBMISSION ON 18th june:)

TIME TABLE OF 7ths semster

toci 9th jun and ACG on 26th may

STATS ASSIGNMENT 2011 (for repeters and improvers also)

BSCS Section A and B

Assignment III is here

Due Date 15.04.2011 for both Sec A and Sec B

Assignment II is here

Due Date Section A 19-04-2010

Section B 19-04-2010

Assignment 1

Due Date Section A 03-03-2010

Section B 02-03-2010

1. Define Statistics and discuss application of statistics in various fields of life.

2. Explain difference between Population and Sample by giving example

3. Describe nominal, ordinal interval and ratio data type by giving examples of each

4. Attempt Exercises (chapter 1 )2-5, 9 and 10 of supplementary exercise given on page 11 of reference notes
5. Attempt (Chapter 2) supplementary Exercises 39, 41, 48, 46 given on page 51 of reference notes

[csku2008b] Fw: Final Lab - Inform All

 

BSCS- 601

 

Lab Tasks

 

Multi Threading

isBackground property

Thread Priority

Other implementation aspects discussed in the class

Synchronization

Lock

Interlocked class

Sempahore

Binary semaphore

Counting semaphore

Monitor

.NET Remoting

Application Domain

Context

Serialization

Marshalling

Well Known Singleton

Windows service

All assignments given during the lectures

 

Please make sure you all these tasks in the lab file on Saturday, May 7 2011 (Final Lab). Timings will be communicated to the respective CR's. No class this week

Zain Abbas

__,_._,___