| Summary: | 碩士 === 國立成功大學 === 資訊工程學系 === 86 === Parallel processing technique has become important because it
supports high-performance computation. So, massively parallel
processing computers connected by a variety of interconnection
networks are increasingly demanded for high-performance
computation-based applications. Multicast, an important
communication mechanism, is frequently used in many applications
of parallel computing. The star graph interconnection network,
when compared with the hypercube network, which has superior
features including low degree and small diameter, has been
recognized to be an attractive alternative to the popular
hypercube network. In this thesis, we first derive a node
labeling formula based on a hamiltonian path and then propose
four efficient multicast routing schemes in wormhole-routed star
networks with multidestination capability. All of the four
proposed schemes are path-based and deadlock-free. The first
scheme, dual-path routing, includes two independent paths
(toward high label nodes and low label nodes). To this approach,
the next traversed node is the one with nearest label to that of
the next unvisited target node of all its neighboring nodes. The
second one, shortcut-node-based dual-path routing, is similar to
dual-path scheme except that the routing tries to find a
shortcut node to route the message as soon as possible to reduce
the length of transmission path. The third one, multipath
routing, is a multiple dual-path routing strategy that includes
source-to-relay and relay-to-destination phases. The last
scheme, proximity grouping routing, is also a multiple dual-path
routing strategy except that in the partitioning step of source
and destination nodes the relation of spatial locality of nodes
is also taken into account to reduce the length of transmission
paths. The proximity grouping routing includes source-to-leader
and leader-to-destination phases. Finally, the experimental
results are given to show that the performance based on unicast-
based and traditional hamiltonian-path routing schemes can be
improved significantly by our four proposed routing schemes.
|
|---|
