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

Gyuyoung Kwauk

dblp:290/9129 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021

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
Electronic design automation · 44% Cloud and datacenter computing · 44% Interconnection networks and networks-on-chip · 13%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › resource management › shared resource management
deadlock avoidance
0.512021
BoomGate: Deadlock Avoidance in Non-Minimal Routing for High-Radix Networks · HPCA 2021
Electronic design automation › physical design
routing
0.512021
BoomGate: Deadlock Avoidance in Non-Minimal Routing for High-Radix Networks · HPCA 2021
Interconnection networks and networks-on-chip
virtual channels
0.112021
BoomGate: Deadlock Avoidance in Non-Minimal Routing for High-Radix Networks · HPCA 2021

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

load balancing · 0.5flow control · 0.5
YearPublicationVenuePosition
2021 BoomGate: Deadlock Avoidance in Non-Minimal Routing for High-Radix Networks
abstract
Avoiding routing deadlock is an important component of an interconnection network. For large-scale systems with high-radix topologies that leverage non-minimal adaptive routing, virtual channels (VCs) are commonly used to prevent routing deadlock. However, VCs in large-scale networks can be costly because of deep buffers and restrict VC usage. In this work, we propose BoomGATE for deadlock avoidance in large-scale networks. In particular, BoomGATE consists of two components - Restricted Intermediate-node Non-minimal Routing (RINR) algorithm and opportunistic flow control (OFC) which both exploit the low-diameter characteristics of high-radix networks while maximizing path diversity within the topology. We identify how routing deadlock in fully-connected topologies are caused by non-minimal routes and propose to restrict the non-minimal routing to ensure deadlock freedom without additional virtual channels. We also propose an algorithm that ensures path diversity is load-balanced across all nodes in the system. However, since path diversity is restricted with the RINR algorithm, complement RINR algorithm with opportunistic flow control (OFC) where “illegal routes” are allowed if and only if sufficient buffer can be guaranteed to ensure cyclical dependency does not occur. We propose both a static and dynamic OFC implementation. We evaluate the performance of BoomGATE and demonstrate there is minimal performance loss compared to global adaptive routing, while reducing the amount of buffers required by 50%.
Gyuyoung Kwauk, Seungkwan Kang, Hans Kasan, Hyojun Son, John Kim 0001
HPCA1