Skip to main content

3 Result(s)

within Chapter Remove this filter Chansu Yu Remove this filter English Remove this filter Algorithm Analysis and Problem Complexity Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Tree-Based Multicast Meshes with Variable Density of Redundant Paths on Mobile Ad Hoc Networks

    This paper proposes an adaptive multicast scheme for mobile ad hoc networks, called tree-based mesh with k-hop redundant paths (TBM k ), in which path re...

    Sangman Moh, Sang Jun Lee, Chansu Yu in Wireless Algorithms, Systems, and Applications (2006)

  2. No Access

    Chapter and Conference Paper

    A Fast Tree-Based Barrier Synchronization on Switch-Based Irregular Networks

    In this paper, we propose a Barrier Tree for Irregular Networks (BTIN) and a barrier synchronization scheme using BTIN for switch-based cluster systems. The synchronization latency of the proposed BTIN scheme is ...

    Sangman Moh, Chansu Yu, Hee Yong Youn… in High Performance Computing — HiPC 2000 (2000)

  3. No Access

    Chapter and Conference Paper

    Isomorphic Allocation in k-Ary n-Cube Systems

    Due to its topological generality and flexibility, the k-ary n-cube architecture is actively researched exploring network design tradeoffs as well as characterizing the topology. Processor allocation problem, whi...

    Moonsoo Kang, Chansu Yu in High Performance Computing – HiPC’99 (1999)