CSC 213:  Operation Systems and Parallel Algorithms

Laboratory Exercises

Computer Science 213 includes weekly laboratory exercises, as described below:
Laboratory
Exercise
Title and Description Status
Lab. 1 Review of C Programming: Due: Friday, September 3, 2004
  • C control structures, procedures, parameters
  • Partition, selection, medians
  • Lab. 2 A Simple Shell: Part A due Friday, September 10
    Part B due Monday, September 13
  • C functions to parse strings
  • Use of fork, exec
  • Lab. 3 Device Management: Due Friday: September 17
  • Interrupt processing
  • Buffering
  • Algorithms for accessing disk data
  • Lab. 4 Signals and Timers: Due Tuesday, September 28
  • Defining and registering signal handlers
  • Sending signals
  • Using count-down timers
  • Lab. 5 Writing and Comparing Scheduling Algorithms: Part A due Friday, October 1
    Part B due Monday, October 4
  • First Come First Served Scheduling
  • Shortest Job Next Scheduling
  • Round Robin Scheduling
  • Priority Queue Scheduling
  • Lab. 6 Shared Memory and Semaphores: Due Monday, October 11
  • Shared Memory: mmap
  • Semaphores: semget, semctl, semop
  • Lab. 7 Using Pipes in C Programs: Part A, B due Friday, October 15
    Part C due Tuesday, October 26
  • Local and Global Variables
  • Use of Pipes: pipe, popen
  • Lab. 8 An Expanded Unix-Style Shell: Due Friday, October 29
  • Input Redirection
  • Use of Pipes in the Command Line
  • Output Redirection
  • Lab. 9 Deadlock and Levels of Memory: Part A due Friday, November 5
    Part B due Tuesday, November 8
  • Deadlock
  • Memory Management
  • Virtual Memory
  • File Management
  • Lab. 10 Parallel Searching: Friday, November 19
  • Division of tasks among processors
  • Organization of processes within a tree
  • Lab. 11 Parallel Algorithms 1: Due: Tuesday, November 30
  • Prefix Sums
  • Parallel Sorting
  • Lab. 12 Some Classic Problems Involving Parallelism: Algorithm in Pseudocode (or code) Due Tuesday, December 7
    Full Program Due: Friday, December 10
  • Simulation Exercise
  • Sleeping Barbers Problem
  • Roller Coaster with One Car and with Several Cars
  • Baboons Crossing a Canyon

  • This document is available on the World Wide Web as

    http://www.math.grin.edu/~walker/courses/213.fa04/lab-index.shtml
    

    created August 20, 1998
    last revised December 6, 2004
    Valid HTML 4.01! Valid CSS!
    For more information, please contact Henry M. Walker at (walker@cs.grinnell.edu)