Asn 1 - makeargv and Message Logs - Due Thursday Week 2

• Part a - makeargv. Due Tuesday week 2, paper handin only
  1. Analyze your makeargv code from fall quarter according to the Robbins checklist for functions given on USP pp30-31. Type up the checklist and for each item, explain briefly whether or not your code follows the rule and why. If you don't have your own makeargv function, then analyze Neal's or Sherri's. You don't have to fix your makeargv function, just analyze it.
  2. Get your makeargv function working with a test program like USP program 2.1 p34. If you're not happy with your makeargv, use Neal's or Sherri's.
  3. Get the USP program 2.1 working with the USP program 2.2 makeargv function.
  4. Write a short description of how your makeargv function works. Your description should be modeled on the brief description of the USP makeargv program given on p35.
  5. Be prepared to discuss your makeargv description and analysis in class.
  6. Hand in your makeargv description and analysis on paper in class. Do not hand in your makeargv code.
• Part b - Message Logging Exercise 2.13 USP p55. Due Thursday week 2
  1. Get the listlib USP programs 2.6, 2.7 (pp 43-45) working with a small test program that you write to exercise the library functions.
  2. Study the USP program 2.8, 2.9 code and get it working.
  3. Code the Message Logging Exercise of USP section 2.13.
  4. Analyze your code according to the Robbins function-writing checklist.
  5. Submit a tar file of your message logging program directory with your code including test programs, your test evidence, your README lab writeup. Follow the Lab Handin Guidelines for your handin. Please include the substring asn1 in your handin tarfile name.

Asn 3 - Process Fans - Due Thursday Week 4

You're probably better off working through the code sequences in the USP textbook rather than trying to fix your code. On the other hand, it is always instructive to begin with your code and fix it by incorporating all the good coding from the textbook examples. I'll leave it up to you how to proceed, but remember, promise to achive good clean code in the end.

You must submit your work as a directory with a makefile. Include instructions on how to make and test the various versions of your program.

1. Do the Ring Exploration in Section 7.3 p234. Try to get through step 9.
2. Do the Simple Communication in Section 7.4 p236.
3. Do the Mutual Exclusion with Tokens in Section 7.5 p237. Try to get this far in your programming because this is the first real concurrency application for the token ring architecture.

Please reference the work you do by textbook section and by the numbers in the exercises so I can more easily follow what you're doing.

Final Exam - Testing Report and Demo

Your final exam testing report must include the following for each of the 5 testing programs you choose to report on.

• An annotated testing script that supplies any reader with confidence that the program works properly for all possible cases in which the program is expected to work. You should cover all the logic of your program.
• A buglist and description of all cases in which the program is not expected to work.
• A description of what the program does with enough information for the reader to comprehend the tests and annotations in the testing script. You may want to submit a documented test program to help the reader understanding the annotated testing script.

Notes

• You should conscientiously use the buglist to specify those situations in which the behavior of your program is "undefined", meaning an improper use of the program.
• You should cover all the logic of your program, but you will find that it is not feasible to trigger some the logic in your program, such as the error conditions. You should note those cases in the buglist and description.
• It also may not be feasible to have tests cover all the "bad input" cases of your program. You'll have to use good judgement about the thoroughness of your testing and the careful notation of those things you could not test.
• You are encouraged to discuss and share test scenarios with your classmates to improve your testing.

Minimum Requirement for Credit

Required for credit

• Asn1 - Message logging,
• Asn2 - Process Chains
• Asn3 - Process Fans
• Asn5 - Token Ring
• Plus one of
  • Asn4 - Shell with redirection, pipes, and foreground signal handling
  • Asn6 - Parallel File Copy
  • Asn7 - Parallel Virtual Machine
  • Asn8 - Multiple Barriers
• Final Exam