Assignment

• Each process will be represented by its PCB.
• Each PCB has a uniform format similar to that in Fig. 4.2 (p.97) of your textbook.
• The collections of PCBs form linked lists for the various queues. You need to implement at least two queues for this part of the project (and probably more for the later part of the project): a ready queue and a waiting queue (or several waiting queues for different resources).
• The operations to be supported for each queue include:
  • adding a PCB to a given position in the queue,
  • removing a PCB with a given PID.
  • if the position or the PID is missing, the default actions are to add at the tail and remove at the head.
• The control program will call on different functions/methods to add/remove PCBs.
• You also need some utility functions/methods to show the contents of different queues.
• Some important design considerations should include:
  • program structure and modularity.
  • program clarity and comprehensibility (how easy to understand).
  • program maintainability (modification to work for Part II assignment).

What to turn in:

• The program code (written in your favorite language).
• Execution trace, showing different PCBs being added/removed, and the contents of the queues.
• Documentation on how to install (compile/link) your program on SoE/UNIX machines or on PC running Windows OS.
  Notice: When you finish with your project part 2, you will be required to schedule a 10 minutes demo on a PC or an Unix machine with your project grader Sudipti Mishra.
• All the above three parts, as well as overall code/design clarity/modularity/maintainability and documentation, will be considered in grading your project.

Due date:

• On-campus and TAGER/Green-network students: 3/4/03.
• Video students: 3/15/03.