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

Do Hyung Kim 0003

dblp:262/6744 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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 · 54% Parallel and multicore computing · 46%

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

TopicWeightPapersLastEvidence papers
Embedded and real-time systems › real-time scheduling › multiprocessor scheduling
global EDF scheduling
0.412019
Conditionally Optimal Task Parallelization for Global EDF on Multi-core Systems · RTSS 2019
Parallel and multicore computing
parallel programming models
0.412019
Conditionally Optimal Task Parallelization for Global EDF on Multi-core Systems · RTSS 2019
Embedded and real-time systems
real-time scheduling
0.412019
Conditionally Optimal Task Parallelization for Global EDF on Multi-core Systems · RTSS 2019
Parallel and multicore computing › parallelization strategies
task parallelization
0.412019
Conditionally Optimal Task Parallelization for Global EDF on Multi-core Systems · RTSS 2019
Embedded and real-time systems › real-time scheduling
schedulability analysis
0.112019
Conditionally Optimal Task Parallelization for Global EDF on Multi-core Systems · RTSS 2019

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

one-way search · 0.4interference-based analysis · 0.4
YearPublicationVenuePosition
2022 Towards Defensive Autonomous Driving: Collecting and Probing Driving Demonstrations of Mixed Qualities
abstract
Designing or learning an autonomous driving policy is undoubtedly a challenging task as the policy has to maintain its safety in all corner cases. In order to secure safety in autonomous driving, the ability to detect hazardous situations, which can be seen as an out-of-distribution (OOD) detection problem, becomes crucial. However, conventional datasets often only contain expert driving demonstrations, although some non-expert or uncommon driving behavior data are needed to implement a safety guaranteed autonomous driving platform. To this end, we present a dataset called the R3 Driving Dataset, composed of driving data with different qualities. The dataset categorizes abnormal driving behaviors into eight categories and 369 different detailed situations. The situations include dangerous lane changes and near-collision situations. To further enlighten how these abnormal driving behaviors can be detected, we utilize different uncertainty estimation and anomaly detection methods for the proposed dataset. From the results of the proposed experiment, it can be inferred that by using both uncertainty estimation and anomaly detection, most of the abnormal cases in the proposed dataset can be discriminated. https://rllab-snu.github.io/projects/R3-Driving-Dataset/doc.html
Alex Jeongwoo Oh, Gunmin Lee, Jeongeun Park 0002, Wooseok Oh, Jaeseok Heo, Hojun Chung, Do Hyung Kim 0003, Chang-Gun Lee, Songhwai Oh
IROS7
2019 Conditionally Optimal Task Parallelization for Global EDF on Multi-core Systems
abstract
Targeting global EDF scheduling, this paper proposes a conditionally optimal algorithm for parallelizing tasks with parallelization freedom. For this, we extend the interference-based sufficient schedulability analysis and derive monotonic increasing properties of both tolerance and interference for the schedulability. Leveraging those properties, we propose a one-way search based conditionally optimal algorithm with polynomial time complexity. Our extensive experiments through both simulation and actual implementation show that our proposed approach can significantly improve the schedulability up to 60 percent.
Youngeun Cho, Do Hyung Kim 0003, Daechul Park, Seung Su Lee, Chang-Gun Lee
RTSS2