Coursehero >> Arizona >> Arizona >> C SC 522

Course Hero has millions of student submitted documents similar to the one below including study guides, homework solutions, papers, exam answer keys and textbook solutions.

522 CSc Homework 3 Due Tuesday, October 31, 2006 This assignment is again worth 50 points, divided as indicated. You may discuss the meanings of questions with classmates, but the answers and programs that you turn in must be yours alone. Please explain your answers, and please comment your programs so that your logic is clear. 1. [20 points] Water Molecule Problem. Given are two kinds of processes, Hydrogen and Oxygen. There are N oxygen processes and 2*N hydrogen processes. Assume that each process has a unique identity. The goal is for the Hydrogen and Oxygen processes to bond together to form water molecules. They do this by using a MakeWater process. This server process repeatedly waits for two Hydrogens and one Oxygen to arrive, in any order, and then tells each the identities of the others. (a) Develop a solution using channels and asynchronous message passing, as de ned in class and the text (Section 7.1). Give all details for the MakeWater process, and show how the other processes interact with MakeWater. Develop a solution using the CSP primitives and programming notation as de ned in the CSP paper. Again give the entire Makewater process and show how the other processes interact with it. Develop a solution using RPC and monitors using Java-like pseudo-code. Again give details for MakeWater and show how the other processes interact with MakeWater. Develop a solution using the rendezvous primitives of either Ada, SR, or MPD as de ned in Sections 8.3, 8.6, or 8.7. (I recommend using the notation described in Section 8.3.) Again show MakeWater and the interface to it. Finally, develop a solution using the Linda primitives as de ned either in the paper or in Section 7.7 of the text. In this case, you should NOT write a MakeWater process. Instead, you should have the Hydrogen and Oxygen processes interact with each other using tuple space. Step back and assess your solutions. Which one was easiest to write? Which one was hardest to write? Which one do you like the best? Explain your reasoning in each case. (b) (c) (d) (e) (f) 2. [15 points] Rock/Scissors/Paper Game. Write a distributed program to simulate a threeperson rock/scissors/paper game, as described below. Write your program in C using the MPI library; you may use the send/receive and/or the collective communication Execute primitives. your program on either Lectura or Voltron. Turn in (1) a commented listing of the program, (2) output from a representative set of runs, and (3) a brief explanation of your results. In this familiar game, each player randomly chooses one of rock, scissors, or paper. The players then compare their choices to see who "won." Rock smashes scissors, scissors cut paper, and paper covers rock. Award a player 2 points if it beats both the others; award two players 1 point each if they both beat the third; otherwise award no points. Use one process for each player, and have the players play several games. The players must interact directly with each other using message passing. Do not use an additional coordinator process, and do not share any variables except for constants and the command-line argument. The command-line argument should be numGames, the number of games to play. At the end print the total points won by each player. 5. [15 points] Distributed Dining Philosophers. Develop a distributed program that simulates a solution to the Dining Philosophers problem. Use 5 philosopher processes, and have them interact with one server process, which manages the forks on the table. Write your program in C using the MPI library, or in Java using either the sockets or RMI library. Hand in (1) a commented listing of your program, and (2) output from a representative set of runs. Your program should have a command-line argument numRounds that speci es the number of "eat then think" rounds that each philosopher executes. Simulate thinking and eating by having a philosopher delay for a random amount of time. Your program should print a trace of interesting events as they happen so that you get a clear idea how the program executed. (See the CS simulation program handed out in class for ideas on how to program the delays and trace.) Electronic Turnin. In addition to handing in printed listings as speci ed above, use the turnin program on Lectura to turn in copies of your programs. For problem 2, the assignment name is hw3.prob2. The le name is game.c. For problem 3, the assignment name is hw3.prob3. If you use C/MPI, the le name is dp.c. If you use Java, select your own le names but be sure to include a README le that explains how to compile and run your program.

Find millions of documents here - Study Guides, Homework Solutions, Papers, Exam Answer Keys and more. Course Hero has millions of course related materials that will enable you to learn better, faster and get an A in all your courses.
Below is a small sample set of documents: