Author image not provided
 Youngwon Lim

Authors:
Add personal information
 
Bibliometrics: publication history
Average citations per article12.67
Citation Count38
Publication count3
Publication years1995-1997
Available for download0
Average downloads per article0.00
Downloads (cumulative)0
Downloads (12 Months)0
Downloads (6 Weeks)0
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author




BOOKMARK & SHARE


3 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 3 of 3
Sort by:

1
August 1997 ICPP '97: Proceedings of the international Conference on Parallel Processing
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 14

We present a uniform framework for a classical problem, redistribution of a multi-dimensional array. Using a generalized circulant matrix formalism, we derive eficient direct, indirect a,nd hybrid contention-free communication schedules. Our indirect schedule reduces the number of communication steps significantly compared with the previous approaches. Our approach exploits the regularity ...

2
October 1996 SPDP '96: Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 23

We present new algorithmic techniques for a classical research problem, runtime redistribution of an array from one block-cyclic layout to another. Our methodology for reducing communication overheads is based on a generalized circulant matrix formalism. Using this formalism, we derive direct, indirect, and hybrid communication schedules for the cyclic redistribution ...
Keywords: Block-cyclic redistribution, HPF, MPI, Circulant matrices.

3
September 1995 CAMP '95: Proceedings of the Computer Architectures for Machine Perception
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1

We propose architecture independent parallel algorithms for solving perceptual grouping tasks on distributed memory machines. Given an n/spl times/n image, using P processors, we show that these tasks can be performed in O(n/sup 2//P) computation time and 20/spl radic/(P)T/sub d/+8(logP)T/sub d/+(40n//spl radic/(P)+20P)/spl tau//sub d/ communication time, where T/sub d/ is ...
Keywords: MPI message passing standard, communication startup time, perceptual grouping, transmission rate, 16 node Cray T3D, CM-5, feature extraction, message passing, parallel algorithms, architecture independent parallel algorithms, communication time, distributed memory systems, communication complexity, computation time, computational complexity, distributed memory machines, edge detection, high performance computing platforms, line segment extraction, processing nodes



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us