50 lines
1.3 KiB
Plaintext
50 lines
1.3 KiB
Plaintext
|
Title: philosopher
|
||
|
|
|
||
|
|
Description:
|
||
|
|
|
||
|
|
An implementation of a solution to the Dining Philosophers problem
|
||
|
|
(a classic multi-thread synchronization problem). This particular
|
||
|
|
implementation demonstrates the usage of nanokernel semaphores and
|
||
|
|
timers from multiple (6) fibers.
|
||
|
|
|
||
|
|
The philosopher always tries to get the lowest fork first (f1 then f2).
|
||
|
|
When done, he will give back the forks in the reverse order (f2 then f1).
|
||
|
|
If he gets two forks, he is EATING. Otherwise, he is THINKING.
|
||
|
|
|
||
|
|
Each Philosopher will randomly alternate between the EATING and THINKING state.
|
||
|
|
|
||
|
|
--------------------------------------------------------------------------------
|
||
|
|
|
||
|
|
Building and Running Project:
|
||
|
|
|
||
|
|
This nanokernel project outputs to the console. It can be built and executed
|
||
|
|
on QEMU as follows:
|
||
|
|
|
||
|
|
make pristine
|
||
|
|
make nanokernel.qemu
|
||
|
|
|
||
|
|
--------------------------------------------------------------------------------
|
||
|
|
|
||
|
|
Sample Output:
|
||
|
|
|
||
|
|
Philosopher 0 EATING
|
||
|
|
Philosopher 1 THINKING
|
||
|
|
Philosopher 2 THINKING
|
||
|
|
Philosopher 3 EATING
|
||
|
|
Philosopher 4 THINKING
|
||
|
|
Philosopher 5 THINKING
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
Demo Description
|
||
|
|
----------------
|
||
|
|
An implementation of a solution to the Dining Philosophers problem
|
||
|
|
(a classic multi-thread synchronization problem). This particular
|
||
|
|
implementation demonstrates the usage of multiple (6) fibers
|
||
|
|
of differing priorities and the nanokernel semaphores and timers.
|