The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
다단계 분할 정복 (MDC)은 계층적으로 구성된 하나 이상의 분할 단계로 구성된 일반화된 분할 정복 기술입니다. 본 논문에서는 MDC의 패러다임을 조사하고 이것이 병렬 알고리즘을 설계하는 데 효율적인 기술임을 보여줍니다. MDC를 연구하는 데는 다음과 같은 병렬 알고리즘이 사용됩니다. 디스크의 볼록 선체 찾기, 선분의 위쪽 봉투 찾기, 볼록 다각형의 가장 먼 이웃 찾기 및 완전히 단조로운 행렬의 모든 행 최대값 찾기. 세 번째와 네 번째 알고리즘이 새롭게 제시된다. 우리의 논의는 EREW PRAM을 기반으로 하지만 여기서 논의된 방법은 모든 병렬 계산 모델에 적용될 수 있습니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Wei CHEN, Koichi WADA, "Designing Efficient Parallel Algorithms with Multi-Level Divide-and-Conquer" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 5, pp. 1201-1208, May 2001, doi: .
Abstract: Multi-level divide-and-conquer (MDC) is a generalized divide-and-conquer technique, which consists of more than one division step organized hierarchically. In this paper, we investigate the paradigm of the MDC and show that it is an efficient technique for designing parallel algorithms. The following parallel algorithms are used for studying the MDC: finding the convex hull of discs, finding the upper envelope of line segments, finding the farthest neighbors of a convex polygon and finding all the row maxima of a totally monotone matrix. The third and the fourth algorithms are newly presented. Our discussion is based on the EREW PRAM, but the methods discussed here can be applied to any parallel computation models.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_5_1201/_p
부
@ARTICLE{e84-a_5_1201,
author={Wei CHEN, Koichi WADA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Designing Efficient Parallel Algorithms with Multi-Level Divide-and-Conquer},
year={2001},
volume={E84-A},
number={5},
pages={1201-1208},
abstract={Multi-level divide-and-conquer (MDC) is a generalized divide-and-conquer technique, which consists of more than one division step organized hierarchically. In this paper, we investigate the paradigm of the MDC and show that it is an efficient technique for designing parallel algorithms. The following parallel algorithms are used for studying the MDC: finding the convex hull of discs, finding the upper envelope of line segments, finding the farthest neighbors of a convex polygon and finding all the row maxima of a totally monotone matrix. The third and the fourth algorithms are newly presented. Our discussion is based on the EREW PRAM, but the methods discussed here can be applied to any parallel computation models.},
keywords={},
doi={},
ISSN={},
month={May},}
부
TY - JOUR
TI - Designing Efficient Parallel Algorithms with Multi-Level Divide-and-Conquer
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1201
EP - 1208
AU - Wei CHEN
AU - Koichi WADA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2001
AB - Multi-level divide-and-conquer (MDC) is a generalized divide-and-conquer technique, which consists of more than one division step organized hierarchically. In this paper, we investigate the paradigm of the MDC and show that it is an efficient technique for designing parallel algorithms. The following parallel algorithms are used for studying the MDC: finding the convex hull of discs, finding the upper envelope of line segments, finding the farthest neighbors of a convex polygon and finding all the row maxima of a totally monotone matrix. The third and the fourth algorithms are newly presented. Our discussion is based on the EREW PRAM, but the methods discussed here can be applied to any parallel computation models.
ER -