to dine had a ticket value of 7, then the next one to be allowed to dir elease of one or two forks, is the one with a ticket value of 8. ilosopher is supposed to go through the following sequence of actions: think () getTicket () getForks () eat () celeaseForks () : should be implemented in a monitor : replace with a random delay in [0, 1]sec : should be implemented in a monitor : should be implemented in a monitor : replace with a random delay in [0, 1]sec

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
A variation of the classic Dining Philosophers problem is the one where the philosophers get a "ticket", i.e. a
number that identifies their priority. The philosophers are supposed to eat based on this priority, e.g. if the
last one to dine had a ticket value of 7, then the next one to be allowed to dine, regardless if he has to wait
for the release of one or two forks, is the one with a ticket value of 8.
Each philosopher is supposed to go through the following sequence of actions:
think ()
getTicket ()
getForks ()
eat ()
releaseForks () : should be implemented in a monitor
: replace with a random delay in [0, 1]sec
: should be implemented in a monitor
: should be implemented in a monitor
: replace with a random delay in [0, 1]sec
You program should be able to work for a variable number of philosophers that are specified in the
command-line. E.g.
$ ./deli 10
should run the program for 10 philosophers.
Your output should be similar to the following:
Philosopher 1 got ticket 0
Philosopher 0 got ticket 1
Philosopher1 got forks
Philosopher 1 ate
Philosopher 2 got ticket 2
Philosopher 4 got ticket 3
Philosopher 1 released the forks
Philosopher 0 got forks
Philosopher 2 got forks
Philosopher 2 ate
Philosopher 0 ate
Philosopher 3 got ticket 4
..
Transcribed Image Text:A variation of the classic Dining Philosophers problem is the one where the philosophers get a "ticket", i.e. a number that identifies their priority. The philosophers are supposed to eat based on this priority, e.g. if the last one to dine had a ticket value of 7, then the next one to be allowed to dine, regardless if he has to wait for the release of one or two forks, is the one with a ticket value of 8. Each philosopher is supposed to go through the following sequence of actions: think () getTicket () getForks () eat () releaseForks () : should be implemented in a monitor : replace with a random delay in [0, 1]sec : should be implemented in a monitor : should be implemented in a monitor : replace with a random delay in [0, 1]sec You program should be able to work for a variable number of philosophers that are specified in the command-line. E.g. $ ./deli 10 should run the program for 10 philosophers. Your output should be similar to the following: Philosopher 1 got ticket 0 Philosopher 0 got ticket 1 Philosopher1 got forks Philosopher 1 ate Philosopher 2 got ticket 2 Philosopher 4 got ticket 3 Philosopher 1 released the forks Philosopher 0 got forks Philosopher 2 got forks Philosopher 2 ate Philosopher 0 ate Philosopher 3 got ticket 4 ..
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY