Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Course Syllabus Comp 735 Distributed and Concurrent Algorithms
 

Summary: Course Syllabus
Comp 735 Distributed and Concurrent Algorithms
Spring 2011
Meeting Place: FB 007
Meeting Time: 2:00 3:15, TuTh
Course Web Page: http://www.cs.unc.edu/anderson/teach/comp735
Powerpoint Transparencies: In the public folder comp735 on my office PC, ANDERSON1
Instructor: Prof. Jim Anderson
Telephone: 962-1757
Office: FB 112
E-mail: anderson@cs.unc.edu
Office Hours: 3:15 4:00, TuTh.
Goals of the course: To present fundamental algorithms and impossibility results from the concurrent
programming literature, and to cover techniques for formally specifying and verifying concurrent systems.
Both message-passing and shared-memory models of concurrency will be considered. At the end of the
course, students will have a general knowledge of the concurrent programming literature, and will be
able to develop new concurrent algorithms and verify their correctness. Perhaps the most important skill
to be developed is the ability to intuitively "see" how or why a concurrent program works (a skill most
students probably take for granted when it comes to sequential programs). In other words, this class will
teach you how to "think" concurrently.

  

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill

 

Collections: Computer Technologies and Information Sciences