• Journal of Internet Computing and Services
• /
• v.6 no.6
• /
• pp.117-125
• /
• 2005

The dominator tree presents the dominance frontier from directed graph to the tree. we present the effective algorithm for constructing the dominator tree from arbitrary directed graph. The reducible flow graph was reduced to dominator tree after dominator calculation. And the irreducible flow graph was constructed to dominator-join graph using join-edge information of information table. For reducing the dominator tree from dominator-join graph, we implement the effective sequency reducible algorithm and delay reducible algorithm. As a result of implementation, we can see that the delay reducible algorithm takes less execution time than the sequency reducible algorithm. Therefore, we can reduce the flow graph to dominator tree effectively.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2536-2542
• /
• 2000

The dominator tree presents the dominance frontier from directed graph to the tree. we present the effective algorithm for constructing the dominator tree from arbitrarY directed graph. The reducible flow graph was reduced to dominator tree after dominator calculation. And the irreducible flow graph was constructed to dominator-join graph using join-edge information of information table. For reducing the dominator tree from dominator-join graph, we present the effective sequency reducible algorithm and delay reducible algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8A
• /
• pp.937-941
• /
• 2004

In this paper, we propose a efficient multicast routing algorithm in the wire/wireless integrated environment. Through simulations and comparing to another multicast algorithm, we reach a conclusion is that the routing algorithm can simply and dynamically adjusts the construction of multicast tree with little delay and the most reducible bandwidth resources.

• The Journal of the Korea Contents Association
• /
• v.4 no.1
• /
• pp.100-104
• /
• 2004

In this paper, we propose multicast routing algorithm to guarantee QoS in mobile computing environment. Through simulations and comparing to another multicast algorithm, we reach a conclusion is that DQDMR can simply and dynamically adjusts the construction of multicast tree with little delay and the most reducible bandwidth resources.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.308-312
• /
• 2003

In this paper, we propose the M-QDMR algorithm for improvement QoS in the wire/wireless integrated environment. Through simulations and comparing to another multicast algorithm, we reach a conclusion is that M-QDMR can simply and dynamically adjusts the construction of multicast tree with little delay and the most reducible bandwidth resources.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.5
• /
• pp.525-532
• /
• 2004

In this paper, we proposed a multicast routing algorithm for QoS improvement in the wire/wireless integrated environment. We analyzed requests and characteristics of QoS, and then proposed a new algorithm that can improve QoS by adding node mobility to wire environment. This new algorithm constructs a dynamic multicast tree that can prevent a loss of packet and save the bandwidth. As a result of simulations comparing to another multicast algorithms, we showed that this new algorithm can simply and dynamically adjusts the construction of multicast tree with little delay and the most reducible bandwidth resources.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.171-180
• /
• 2002

The effective and accurate data flow problem analysis uses the dominator tree and DJ graphs. The data flow problem solving is to safely reduce the flow graph to the dominator tree. The flow graph replaces a parse tree and used to accurately reduce either reducible or irreducible flow graph to the dominator tree. In this paper, in order to utilize Tarian's path compress algorithm, the Top node finding algorithm is suggested and the existing delay reduction algorithm is improved using Path compression. The delayed reduction a1gorithm using path compression actually compresses the pathway of the dominator tree by hoisting the node while reducing to delay the DJ graph. Realty, the suggested algorithm had hoisted nodes in 22% and had compressed path in 20%. The compressed dominator tree makes it possible to analyze the effective data flow analysis and brings the improved effect for the complexity of code optimization process with the node hoisting effect of code optimization process.