dynamic load line
graphical plot showing
the instantaneous relationship between volt-
age across and current through a transistor
when driven by an input AC signal.
dynamic matching
See
variational
similarity
.
dynamic memory allocation
the run-
time assignment of small units of memory to
an active program. Used typically to support
growing structures such as lists.
dynamic path reconnect
used in IBM’s
high-end computer systems to allow a “sub-
channel” to change its channel path each time
it cycles through a disconnect/reconnect with
a given device. This enables it to be assigned
to another available path, rather than just wait
for the currently allocated path to become
free.
dynamic programming
introduced by
Bellman, one of the best known methods for
solving the optimal control problems. A re-
cursive method to compute the optimal con-
trol as a function of the state, dynamic pro-
gramming is used in multistage systems by
working backward from the final stage.
Dynamic programming is based on The
Optimality Principle. The Principle says that
optimal control strategy has the feature that
regardless of initial state and initial decision,
decision in the next step must form an opti-
mal control strategy with respect to the final
state of the previous decisions. This principle
allows us to find an optimal strategy in a nu-
merical way. The principle serves to limit the
number of potentially optimal control strate-
gies that must be investigated. It also implies
that optimal control strategies must be deter-
mined by working backward from the final
stage.
dynamic random access memory (DRAM)
a semiconductor memory using one capac-
itor and one access transistor per cell (bit).
The information is stored dynamically on a
small charge on the cell capacitance, and can
be read or written through the “access tran-
sistor” in the cell.
Since the charge will
slowly leak away (through semiconductor
junctions), the cells need to be “refreshed”
once every few milliseconds. This is typi-
cally done using on-chip circuitry. DRAMs
have very high storage density, but are slower
than SRAMs (static RAMs). See also
burst
refresh
,
distributed refresh
.
dynamic range
refers to the range of input
signal amplitudes over which an electronic
device will operate within a set of specified
parameters. Usually expressed in decibels.
In a communications receiver, the upper end
of the dynamic range is determined by the
largest tolerable input signal, while the lower
end is set by the receiver’s sensitivity. The
sensitivity is the minimum discernible signal
for a specific signal-to-noise ratio (SNR). See
also
signal-to-noise ratio
.
dynamic reconfiguration
changes of op-
tical paths from sources to detectors which
are instantly controllable. Paths of optical
signals are controlled and changed by an op-
tical crossbar switch that is usually a spatial
light modulator.
dynamic scattering
procedure to study
the change of state of atoms and molecules by
analyzing the frequency shift and fluctuations
of scattered light.
dynamic scheduling
(1) creating the ex-
ecution schedule of instructions at run-time
by the hardware, which provides a different
schedule than strict program order (i.e., a pro-
cessor issues instructions to functional units
out of program order). The processor can dy-
namically issue an instruction as soon as all
its operands are available and the required ex-
ecution unit is not busy. Thus, an instruction
is not delayed by a stalled previous instruc-
tion unless it needs the results of that previous
instruction.
(2) changing the software program sched-
ule dynamically depending on data or oper-
ating conditions.
c
2000 by CRC Press LLC