Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Design and Experiment of a Communication-Aware Parallel Quicksort with Weighted Partition of Processors

    In most parallel algorithms, inter-processor communication cost is much more than computing cost within a processor. So, it is very important to reduce the amount of inter-processor communication. This paper pres...

    Sangman Moh, Chansu Yu, Dongsoo Han in Computational Science and Its Applications… (2004)

  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)