|
|
|
|
|
|
|
|
|
|
|
|
|
| n | Normally,
access to a memory location excludes |
|||||||||||
| other access
to that same location |
||||||||||||
| n | Extension:
designers have proposed machines |
|||||||||||
| instructions
that perform 2 actions atomically |
||||||||||||
| (indivisible) on the same memory location (ex: |
||||||||||||
| reading and
testing) |
||||||||||||
| n | The execution
of such an instruction is mutually |
|||||||||||
| exclusive (even with multiple CPUs) |
||||||||||||
| n | They can be
used simply to provide mutual |
|||||||||||
| exclusion but
need more complex algorithms for |
||||||||||||
| satisfying the
3 requirements of the CS problem |
||||||||||||
