Information Technology Reference
In-Depth Information
p->ts
[
ts
,
te
]. The processing algorithms of the resource binary tree involves one
recursive operation and its time complexity is
O (logn) * O (m)
.
In summary, the processing performance of data structures is affected by many fac-
tors. The processing algorithm of the resource binary tree is poor. It is difficult to
determinewhich is better between the resource cluetree and the timeslot array because
it depends on the parameters of reservation requests.
∈
Experiment.
The results support our analysis well. The processing performance of three data struc-
tures is measured as shown in Figure 8.
Figure 8 shows that the performance of the resource clue tree is slightly better than
the timeslot array and much better than the resource binary tree. It is mainly because
there are a large number of redundant nodes in the resource binary tree and the
processing operation involves a lot of recursions which seriously affect the processing
speed.
Two kinds of tree structures are less affected by reservation requests whereas the
timeslot array is directly affected by the parameter
td
. Figure 9 indicates the
processing performance of the timeslot array when the parameter
λ
is 0.01, 0.1 and 1.
As
λ
increases,
td
increasingly concentrates to smaller values and the processing per-
formance of the timeslot array improves significantly. At this point, its performance is
far better than the resource clue tree. However, it is more sensitive to fluctuations
of
td
, so it has more vigorous fluctuations under different conditions of reservation
requests.
Fig. 8.
The performance of processing algorithm
Fig. 9.
The performance of the timeslot
array under different conditions of reserva-
tion requests
7
Conclusion
In this paper, two new data structures—the resource clue tree and the resource binary
tree—are proposed to solve the problem of low performance of non-slotted tree struc-
tures. The algorithms for establishment and performance improvement of the two data
structures are introduced in detail. The description performance, processing perfor-
mance and store performance of several data structures are analyzed and compared
