|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
n |
Each process
|
|
|
executes at
nonzero
|
|
|
speed but no
|
|
|
assumption on
the
|
|
|
relative speed
of n
|
|
|
processes
|
|
|
n |
General
structure of a
|
|
process:
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
n |
many CPU may
be
|
|
|
present but
memory
|
|
|
hardware
prevents
|
|
|
simultaneous
access
|
|
|
to the same
memory
|
|
|
location
|
|
|
n |
No assumption
about
|
|
order of
interleaved
|
|
|
execution
|
|
|
n |
For solutions:
we
|
|
|
need to
specify entry
|
|
|
and exit
sections
|
|
|
|
|
|
|
|
|
|
|
|
repeat
|
|
entry section
|
|
critical section
|
|
exit section
|
|
remainder section
|
forever
|
|
|
|
|
|
|
|
|
|
|
|