|
Page
|
Location
|
Action
|
Old Text
|
New Text
|
|
2
|
7th line from bottom
|
Delete
|
advance the exact nature of all
|
advance the nature of all
|
|
3
|
4th para, 8th line
|
Replace
|
inverison
|
inversion
|
|
3
|
4th para, 2nd line, before priority inversion
|
Add
|
complexity: priority inversion.
|
complexity: controlling priority inversion.
|
|
3
|
4th para, 1st line
|
Replace
|
Logic often needs to share serializable resources.
|
Logic often requires serial access to resources.
|
|
6
|
2nd para, last sentence
|
Replace
|
So called
|
So-called
|
|
6
|
4th para, 6th line
|
Replace
|
times
|
time
|
|
6
|
4th para, 6th line
|
Replace
|
, later
|
later,
|
|
6
|
3rd para
|
Replace
|
The feasibility algorithms assume that the rate-monotonic priority
assignment algorithm has been used to assign priorities. The RTSJ does
not require that implementations check that such a priority assignment
is correct. If, of course, the assignment is incorrect the feasibility
analysis will be meaningless (note however, that this is no different than
the vast majority of real-time operating systems and kernels in use today).
|
For the base scheduler the feasibility methods may always return
an indication that the system is feasible. This is allowed because the
application controls the assignment of priority and the RTSJ does not check
assignment. The RTSJ expects that the base scheduler may be subclassed
in particular implementations (e.g., an RMA or EDF scheduler) and for those
implementations the feasibility methods may correctly indicate the actual
feasibility of the system under the given scheduler. Note that for the
base scheduler the RTSJ is no different than most real-time operating systems
in current use.
|
|
7
|
1st para, 9th line
|
Replace
|
changes to
|
constraints on
|
|
7
|
item 1
|
Replace
|
Scoped memory provides a mechanism for dealing with a class of
objects that have a lifetime defined by syntactic scope (cf, the lifetime
of objects on the heap).
|
Scoped memory provides a mechanism, more general than stack allocated
objects, for managing objects that have a lifetime defined by scope (cf,
the lifetime of objects on the heap).
|
|
7
|
Item 3
|
Delete
|
advance the exact nature of all, i.e., the objects are immortal
|
advance the exact nature of all.
|
