Course Syllabus
CIS 527 Distributed
Systems
Instructor_____Dr. Zhicheng
Wang__________________________________________________
|
Office Hours |
Tuesday/Thursday: 11:00 am-12:00 pm, 2:00-4:00 pm Monday/Wednesday/Friday:
Appointment available
|
|
Office
Location |
SRC 1017 |
|
Office
Telephone |
(404) 8806934 |
|
Email |
zwang@cau.edu |
Course Information (must be
same as listed in Catalog)
|
Course Number/Sect |
Course Title |
Credit Hours |
Semester |
Time |
Level (U/G) |
|
|
CCIS 527 |
01 |
Distributed
Systems |
3 |
Fall 2005 |
T/TH 4:30-5:45 pm |
G |
|
Brief
Description |
Distributed computing systems will be of interesting importance due to
a continue demand for greater computation speed from a computer system than
currently available one. . Two parallel programming tools, parallel virtual
machine (PVI) and massage-passing interface (MPI, become popular that will be
detailed in class. |
|||||
|
Prerequisites if applicable |
|
|||||
|
Course Description: Distributed
computing systems will be of interesting importance due to a continue demand for
greater computation speed from a computer system than currently available
one. Distributed computing systems provide aggregate power for solving
large-scale real world problems in parallel. A parallel computer could be a
specially designed computer system containing multiple processor or several
independent computers interacted in some way.
With the advent of really powerful and inexpensive workstations and
PCs, workstation clusters have assumed an even more important concept. Two
parallel programming tools, parallel virtual machine (PVI) and
massage-passing interface (MPI, become popular. Numerical algorithms, image
processing and searching are typical applications of parallel computation |
|
Course Objectives: 1.
The students will learn an introduction to
the parallel programming techniques-concepts and mechanism. 2.
The student will have a working knowledge
of MPI and PVM pseudo-codes to describe algorithms. |
|
Learning Outcomes: 1. The student will have an introduction to the parallel programming techniques. 2. The student will have a working knowledge of MPI and PVM pseudo-codes to describe algorithms. 3. The student will have been provided with thorough coverage of share memory programming. 4.
The student will have skills to program
and execute parallel program on network stations.. 5.
The student will practice teamwork |
|
|
|
Teaching/Learning Methods: (lectures,
videos, outside speakers, etc.)
|
|
Grading and other policies and expectations: The Final Grade will be based
on an accumulation of all grades received during the Semester, which will consist
of In-Classes exam (4), home work(4), Midterm Exam, Final Exam and Classroom
Participation. There will be NO makeup. Any exception based on extraordinary circumstances may suffer a degradation of points awarded. Legibility is important on all
tests. English (Spelling, sentence construction, etc.) will be grade, where
appropriate. |
|
Required Parallel Programming: Techniques and applications Using Network Workstations and Parallel
Computers |
|
Supplemental Metlab, MSI
and PVM manuals |
Course Outline and Schedule:
|
Week |
Comment |
|
|
T, Th |
|
Books/materials |
|
1 |
Syllabus |
|
|
2 |
Introduction, Overview |
Chapter1 |
|
3-4 |
Massage-passing Interface |
Chapter2 |
|
5 |
Embarrassingly parallel computations |
Chapter3 |
|
5-6 |
Partitioning and divide-and conquer strategies |
Chapter 4 |
|
7 |
Pipelined computations |
Chapter 5 |
|
8 |
Synchronous computations |
Chapter 6 |
|
9-10 |
Programming with shared memory |
Chapter 8 |
|
11-12 |
Sorting algorithm |
Chapter 9 |
|
13 |
Numerical Algorithm |
Chapter 10 |
|
14 |
Image processing |
Chapter 11 |