Ghil-Young Hwang

dblp:04/5102 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1990
—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
Interconnection networks and networks-on-chip · 50% Parallel and multicore computing · 50%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip
graph embedding
0.011990
Embedding Rectangular Grids into Square Grids with Dilation Two · IEEE Trans. Computers 1990
Parallel and multicore computing › task allocation
processor array mapping
0.011990
Embedding Rectangular Grids into Square Grids with Dilation Two · IEEE Trans. Computers 1990
Graph algorithms and graph theory
graph embedding
0.011990
Embedding Rectangular Grids into Square Grids with Dilation Two · IEEE Trans. Computers 1990

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

multiple ripple propagation · 0.0dilation analysis · 0.0
YearPublicationVenuePosition
1990 Embedding Rectangular Grids into Square Grids with Dilation Two
abstract
A novel technique, the multiple ripple propagation technique, is presented for mapping and h*w grid into a w*h grid such that the dilation cost is 2, i.e. such that any two neighboring nodes in the first grid are mapped onto two nodes in the second grid that are separated by a distance of at most 2. The technique is then used as a basic tool for mapping any rectangular source grid into a square target grid with the dilation two property preserved. The ratio of the number of nodes in the source grid to the number of nodes in the target grid, called the expansion cost, is shown to be always less than 1.2. This is a significant improvement over the previously suggested techniques, where the expansion cost could be bounded by 1.2 only if the dilation cost was allowed to be as high as 18.>
Rami G. Melhem, Ghil-Young Hwang
IEEE Trans. Computers2