zephyr

History

Peter Mitsis d63a4f7bf7 nano_timers: Simplify nano_xxx_timer_test() API family Simplifies the nanokernel timer API so that the timeout parameter must be specified when invoking nano_isr_timer_test(), nano_fiber_timer_test(), nano_task_timer_test() and nano_timer_test(). This obsoletes the following APIs: nano_fiber_timer_wait() nano_task_timer_wait() nano_timer_wait() Note that even the though the new API requires that the timeout parameter be specified, there are currentl only two acceptable values: TICKS_NONE and TICKS_UNLIMITED Theoretically, the current implementation would allow one to supply a finite positive value for the timeout and the system would wait up to that many ticks for the timer to expire. However, it is thought that that unnecessarily complicates the nanokernel timer model and so it is left as an unsupported option. Should that change, then that feature could be enabled by updating the documentation. Change-Id: I8835c5342ab5025d6f70fdfbed54a50add7568d7 Signed-off-by: Peter Mitsis <peter.mitsis@windriver.com>		2016-02-05 20:25:15 -05:00
..
src	nano_timers: Simplify nano_xxx_timer_test() API family	2016-02-05 20:25:15 -05:00
Makefile	Use BOARD instead of PLATFORM_CONFIG	2016-02-05 20:25:11 -05:00
README.txt	Update Title in sample project README.txt files	2016-02-05 20:15:21 -05:00
prj.mdef	Rename VPF files to use MDEF file extension	2016-02-05 20:14:15 -05:00
prj_arm.conf	samples: remove explicit enabling of SW_ISR_TABLE/DYNAMIC	2016-02-05 20:13:45 -05:00
prj_x86.conf	First commit	2015-04-10 16:44:37 -07:00
testcase.ini	initial commit for next-gen sanity checks	2016-02-05 20:14:42 -05:00

README.txt

Title: Dining Philosophers

Description:

An implementation of a solution to the Dining Philosophers problem
(a classic multi-thread synchronization problem).  This particular
implementation demonstrates the usage of microkernel task groups,
Mutex APIs and timer drivers from multiple (6) tasks.

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
states.

--------------------------------------------------------------------------------

Building and Running Project:

This microkernel project outputs to the console.  It can be built and executed
on QEMU as follows:

    make qemu

--------------------------------------------------------------------------------

Troubleshooting:

Problems caused by out-dated project information can be addressed by
issuing one of the following commands then rebuilding the project:

    make clean          # discard results of previous builds
                        # but keep existing configuration info
or
    make pristine       # discard results of previous builds
                        # and restore pre-defined configuration info

--------------------------------------------------------------------------------

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) tasks
of differing priorities and the nanokernel semaphores and timers.