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

Byeong-Cheol Choi

dblp:199/2463 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

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

Systems, architecture and hardware · 1Computer networks · 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
Embedded and real-time systems · 40% Parallel and multicore computing · 40% Electronic design automation · 20%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › task scheduling
DAG scheduling
0.412020
Scheduling Parallel Real-Time Tasks on the Minimum Number of Processors · IEEE Trans. Parallel Distributed Syst. 2020
Embedded and real-time systems › real-time scheduling
parallel real-time tasks
0.412020
Scheduling Parallel Real-Time Tasks on the Minimum Number of Processors · IEEE Trans. Parallel Distributed Syst. 2020
Parallel and multicore computing
processor allocation
0.412020
Scheduling Parallel Real-Time Tasks on the Minimum Number of Processors · IEEE Trans. Parallel Distributed Syst. 2020
Embedded and real-time systems
real-time scheduling
0.412020
Scheduling Parallel Real-Time Tasks on the Minimum Number of Processors · IEEE Trans. Parallel Distributed Syst. 2020
Electronic design automation › high-level synthesis
scheduling
0.412020
Scheduling Parallel Real-Time Tasks on the Minimum Number of Processors · IEEE Trans. Parallel Distributed Syst. 2020
Graph algorithms and graph theory › graph algorithms
network flow
0.112020
Scheduling Parallel Real-Time Tasks on the Minimum Number of Processors · IEEE Trans. Parallel Distributed Syst. 2020

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

polynomial algorithm · 0.9flow networks · 0.4flow network · 0.4
YearPublicationVenuePosition
2020 Scheduling Parallel Real-Time Tasks on the Minimum Number of Processors
abstract
Recently, several parallel frameworks have emerged to utilize the increasing computational capacity of multiprocessors. Parallel tasks are distinguished from traditional sequential tasks in that the subtasks contained in a single parallel task can simultaneously execute on multiple processors. In this study, we consider the scheduling problem of minimizing the number of processors on which the parallel real-time tasks feasibly run. In particular, we focus on scheduling sporadic parallel real-time tasks, in which precedence constraints between subtasks of each parallel task are expressed using a directed acyclic graph (DAG). To address the problem, we formulate an optimization problem that aims to minimize the maximum processing capacity for executing the given tasks. We then suggest a polynomial solution consisting of three steps: (1) transform each parallel real-time task into a series of multithreaded segments, while respecting the precedence constraints of the DAG; (2) selectively extend the segment lengths; and (3) interpret the problem as a flow network to balance the flows on the terminal edges. We also provide the schedulability bound of the proposed solution: it has acapacity augmentation boundof 2. Our experimental results show that the proposed approach yields higher performance than one developed in a recent study.
Hyeonjoong Cho, Chulgoo Kim, Joohyung Sun, Arvind Easwaran, Juderk Park, Byeong-Cheol Choi
IEEE Trans. Parallel Distributed Syst.6
2000 IP forwarding engine with VC merging in ATM-based MPLS system
abstract
In this paper, we describe the necessity of VC merging in an edge label switched router (LSR) for scalability, one of the important merits in multi-protocol label switching (MPLS). We introduce the design of a high-speed IP forwarding engine with virtual connection (VC) merging. This forwarding engine largely consists of a segmentation and reassembly (SAR) processing part, a CAM-based IP look-up processing part, a VC-merging part, and a physical line interface part. It provides some desirable characteristics that are described in this paper. We also compare the edge MPLS systems with centralized and distributed forwarding engine architectures, and the good points of the MPLS system with the latter architectures when supporting VC merging.
Sun Kang, Byeong-Cheol Choi, Chang-Sik Choi, Youn-Kwae Jeong, Yoo-Kyoung Lee
ICCCN2