<s>
Dynamic	B-Algorithm
priority	I-Algorithm
scheduling	I-Algorithm
is	O
a	O
type	O
of	O
scheduling	O
algorithm	O
in	O
which	O
the	O
priorities	O
are	O
calculated	O
during	O
the	O
execution	O
of	O
the	O
system	O
.	O
</s>
<s>
The	O
goal	O
of	O
dynamic	B-Algorithm
priority	I-Algorithm
scheduling	I-Algorithm
is	O
to	O
adapt	O
to	O
dynamically	O
changing	O
progress	O
and	O
to	O
form	O
an	O
optimal	O
configuration	O
in	O
a	O
self-sustained	O
manner	O
.	O
</s>
<s>
Earliest	B-Operating_System
deadline	I-Operating_System
first	I-Operating_System
scheduling	I-Operating_System
and	O
Least	B-Operating_System
slack	I-Operating_System
time	I-Operating_System
scheduling	I-Operating_System
are	O
examples	O
of	O
Dynamic	B-Algorithm
priority	I-Algorithm
scheduling	I-Algorithm
algorithms	O
.	O
</s>
<s>
In	O
preemptible	O
scheduling	O
,	O
dynamic	B-Algorithm
priority	I-Algorithm
scheduling	I-Algorithm
such	O
as	O
earliest	O
deadline	O
first	O
(	O
EDF	O
)	O
provides	O
the	O
optimal	O
schedulable	O
utilization	O
of	O
1	O
in	O
contrast	O
to	O
less	O
than	O
0.69	O
with	O
fixed	O
priority	O
scheduling	O
such	O
as	O
rate-monotonic	O
(	O
RM	O
)	O
.	O
</s>
<s>
Unlike	O
fixed	O
priority	O
,	O
dynamic	B-Algorithm
priority	I-Algorithm
scheduling	I-Algorithm
could	O
dynamically	O
prioritize	O
task	O
deadlines	O
achieving	O
optimal	O
schedulable	O
utilization	O
in	O
the	O
preemptible	O
case	O
.	O
</s>
