Demo Data from EDBT 2026 / reviewers in the wild / expert
Chiu-Yu Ku
dblp:99/3470
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2001
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2
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 |
Interconnection networks and networks-on-chip · 50% Parallel and multicore computing · 25% Distributed systems · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems
communication optimization |
0.0 | 1 | 2001 | Optimal Processor Mapping for Linear-Complement Communication on Hypercubes · IEEE Trans. Parallel Distributed Syst. 2001 |
Interconnection networks and networks-on-chip
hypercube network |
0.0 | 1 | 2001 | Optimal Processor Mapping for Linear-Complement Communication on Hypercubes · IEEE Trans. Parallel Distributed Syst. 2001 |
Parallel and multicore computing › processor allocation
processor mapping |
0.0 | 1 | 2001 | Optimal Processor Mapping for Linear-Complement Communication on Hypercubes · IEEE Trans. Parallel Distributed Syst. 2001 |
Interconnection networks and networks-on-chip › routing algorithms
wormhole routing |
0.0 | 1 | 2001 | Optimal Processor Mapping for Linear-Complement Communication on Hypercubes · IEEE Trans. Parallel Distributed Syst. 2001 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.0dynamic programming · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2001 | Optimal Processor Mapping for Linear-Complement Communication on HypercubesabstractIn this paper, we address the problem of minimizing channel contention of linear-complement communication on wormhole-routed hypercubes. Our research reveals that, for traditional routing algorithms, the degree of channel contention of a linear-complement communication can be quite large. To solve this problem, we propose an alternative approach, which applies processor reordering mapping at compile time. In this compiler approach, processors are logically reordered according to the given communication(s) so that the new communication(s) can be efficiently realized on the hypercube network. It is proved that, for any linear-complement communication, there exists a reordering mapping such that the new communication has minimum channel contention. An O(n/sup 3/) algorithm is proposed to find such a mapping for an n-dimensional hypercube. An algorithm based on dynamic programming is also proposed to find an optimal reordering mapping for a set of linear-complement communications. Several computer simulations have been conducted and the results clearly show the advantage of the proposed approach. Yomin Hou, Chien-Min Wang, Chiu-Yu Ku, Lih-Hsing Hsu |
IEEE Trans. Parallel Distributed Syst. | 3 |
| 1995 | A Near-Optimal Broadcasting Algorithm in All-Port Wormhole-Routed HypercubesabstractArticle Free Access Share on A near-optimal broadcasting algorithm in all-port wormhole-routed hypercubes Authors: Chien-Min Wang Institute of Information Science, Academia Sinica, Nankang, Taipei, Taiwan Institute of Information Science, Academia Sinica, Nankang, Taipei, TaiwanView Profile , Chiu-Yu Ku Institute of Information Science, Academia Sinica, Nankang, Taipei, Taiwan Institute of Information Science, Academia Sinica, Nankang, Taipei, TaiwanView Profile Authors Info & Claims ICS '95: Proceedings of the 9th international conference on SupercomputingJuly 1995 Pages 147–153https://doi.org/10.1145/224538.224554Published:03 July 1995Publication History 6citation99DownloadsMetricsTotal Citations6Total Downloads99Last 12 Months11Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF Chien-Min Wang, Chiu-Yu Ku |
International Conference on Supercomputing | 2 |