logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

Implement this as an Actors-based system using Java with Akka particularly recall that in the solution discussed in class, the file servers share channel open.

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Solve the following two problems.  Read the submission instructions carefully.

Problem 1 (50 Points):  Recall the message-passing based implementation of a file server.  Implement this as an Actors-based system using Java with Akka.  Particularly, recall that in the solution discussed in class, the file servers share channel open.  Because your Actors implementation will not use channels separate from actors, your solution will have to be different.

Problem 1 clarification

  1. You should use real files.
  2. Assume that each file server is handling a different file (i.e., they don't have to worry about multiple processes accessing the same file.
  3. You should test with 5-10 clients and 3-4 servers

Problem 2 (50 Points): Develop a Java program to simulate the Dining Philosophers problem defined as follows. 

Five philosophers sit around a circular table.  Each philosopher spends his life alternately thinking and eating.  In the center of the table is a large platter of spaghetti.  Because the spaghetti is long and tangled -- and the philosophers are not mechanically adept -- a philosopher must use two forks to eat a helping.  Unfortunately, the philosophers can afford only five forks among them.  One fork is placed between each pair of philosophers, and the agree that each will use only the forks to the immediate left and right of them.  The problem is to write a program to simulate the behavior of the philosophers.  The program must avoid the unfortunate (and eventually fatal) situation in which all philosophers are hungry but none is able to acquire both forks -- for example, each holds one fork and refuses to give it up.

Your program should have 5 philosopher threads and a class that implements a monitor to synchronize the philosophers.  The monitor should have two methods: getforks(id) and relforks(id), where id is an integer between 1 and 5.  Have the philosophers eat and sleep for random amounts of time.  Add print statements to your program to generate a trace of the activity of the program.  Write a brief report summarizing what you observe.

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

762 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

905 Answers

Hire Me
expert
Husnain SaeedComputer science

611 Answers

Hire Me
expert
Atharva PatilComputer science

730 Answers

Hire Me
June
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
4
5
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30