Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jui-Yuan Ku

dblp:98/6907 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1999
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 39% Distributed systems · 30% Performance modeling and evaluation · 30%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems › communication optimization
communication-computation overlap
0.011999
Communication Studies of Single-Threaded and Multithreaded Distributed-Memory Multiprocessors · HPCA 1999
Performance modeling and evaluation
communication modeling
0.011999
Communication Studies of Single-Threaded and Multithreaded Distributed-Memory Multiprocessors · HPCA 1999
Parallel and multicore computing › parallel programming models
message passing
0.011999
Communication Studies of Single-Threaded and Multithreaded Distributed-Memory Multiprocessors · HPCA 1999
Parallel and multicore computing › multiprocessor system
distributed-memory multiprocessor
0.011999
Communication Studies of Single-Threaded and Multithreaded Distributed-Memory Multiprocessors · HPCA 1999

Methods — techniques the papers use, named apart from their topics

logp model · 0.0fast fourier transform · 0.0bitonic sort · 0.0LogGP model · 0.0
YearPublicationVenuePosition
1999 Communication Studies of Single-Threaded and Multithreaded Distributed-Memory Multiprocessors
abstract
This report explicates the communication overlapping capabilities of three distributed-memory machines, SGI/Cray T3E, IBM SP-2 with wide nodes, and the ETL EM-X. Bitonic sorting and Fast Fourier Transform are selected for experiments. Various message sizes are used to determine when, where, how much and why the overlapping takes place. Experimental results with up to 64 processors indicated that the communication performance of EM-X is insensitive to various message sizes while SP-2 is the most sensitive. T3E stayed in between. The EM-X gave the highest communication overlapping capability while T3E did the lowest. The experimental results are compared with the analytical results based on LogP and LogGP communication models.
Andrew Sohn, Yunheung Paek, Jui-Yuan Ku, Yuetsu Kodama, Yoshinori Yamaguchi
HPCA3