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

Hae-woo Park

dblp:72/1226 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2015
—ORCID · none

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

Systems, architecture and hardware · 4 · 1 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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
Distributed systems · 59% Hardware reliability and fault tolerance · 23% Processor architecture and microarchitecture · 18%

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

TopicWeightPapersLastEvidence papers
Distributed systems › fault tolerance › checkpointing
checkpoint selection
0.212015
Optimal Checkpoint Selection with Dual-Modular Redundancy Hardening · IEEE Trans. Computers 2015
Processor architecture and microarchitecture
chip multiprocessor
0.212015
Optimal Checkpoint Selection with Dual-Modular Redundancy Hardening · IEEE Trans. Computers 2015
Distributed systems › fault tolerance › fault-tolerant real-time systems
fault-tolerant scheduling
0.212015
Optimal Checkpoint Selection with Dual-Modular Redundancy Hardening · IEEE Trans. Computers 2015
Distributed systems › fault tolerance › checkpointing
optimal checkpoint placement
0.212015
Optimal Checkpoint Selection with Dual-Modular Redundancy Hardening · IEEE Trans. Computers 2015
Hardware reliability and fault tolerance
transient fault tolerance
0.212015
Optimal Checkpoint Selection with Dual-Modular Redundancy Hardening · IEEE Trans. Computers 2015
Hardware reliability and fault tolerance › redundancy
dual modular redundancy
0.112015
Optimal Checkpoint Selection with Dual-Modular Redundancy Hardening · IEEE Trans. Computers 2015
Distributed systems › replication
task replication
0.112015
Optimal Checkpoint Selection with Dual-Modular Redundancy Hardening · IEEE Trans. Computers 2015

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

task graph scheduling · 0.2latency-constrained optimization · 0.2
YearPublicationVenuePosition
2015 Optimal Checkpoint Selection with Dual-Modular Redundancy Hardening
abstract
With the continuous scaling of semiconductor technology, failure rate is increasing significantly so that reliability becomes an important issue in multiprocessor system-on-chip (MPSoC) design. We propose an optimal checkpoint selection with task duplication hardening to tolerate transient faults. A target application is specified in a task graph, and the schedule/checkpoint placements are determined at design time. The proposed optimal algorithm minimizes the checkpoint overhead with a latency constraint. Experimental results show that the proposed algorithm effectively reduces the minimum end-to-end latency to perform a fault-tolerant schedule. In addition, the proposed algorithm dramatically decreases the checkpointing overhead on uniprocessor and multiprocessor systems compared with a greedy approach and an equidistant algorithm.
Shin-Haeng Kang, Hae-woo Park, Sungchan Kim, Hyunok Oh, Soonhoi Ha
IEEE Trans. Computers2
2011 Library Support in an Actor-Based Parallel Programming Platform
abstract
Actor model-based design is actively researched for parallel embedded SW design since the model exposes the potential parallelism explicitly in an architecture-neutral form. In most actor-oriented models, actors are self-contained and data channels are the only sharable object between actors, and they compose a system in a flat layer. In contrast, it is common to use shared library functions and construct vertically layered software for efficiency and modularity. To fill this gap between modeling and implementation, we propose a special actor, library task, with new types of ports: library master port and library slave port. It is a sharable and mappable object that defines a set of function interfaces inside. N:1 master-slave connection allows sharing a library task and the master-slave connection can specify vertically layered software and client-server applications naturally. To support the library task in our embedded software design environment, we develop an automatic mapping algorithm as well as an automatic code generator. The design environment with the library task is applied for two target platforms: IBM CELL Broad band Engine and an ARM-based multicore simulator. Preliminary experiments show that the special actor, or library task, extends the expression power of the previous actor model with efficiently generated codes.
Hae-woo Park, Hanwoong Jung, Hyunok Oh, Soonhoi Ha
IEEE Trans. Ind. Informatics1
2007 Performance evaluation and optimization of dual-port SDRAM architecture for mobile embedded systems
abstract
Recently dual-port SDRAM (DPSDRAM) architecture tailored for dual-processor based mobile embedded systems has been announced where a single memory chip plays the role of the local memories and the shared memory for both processors. In order to keep memory consistency from simultaneous accesses of both ports, every access to the shared memory should be protected by a synchronization mechanism, which can result in substantial access latency. We propose two optimization techniques by exploiting the communication patterns of target application: lock-priority scheme and static-copy scheme. Further, by dividing the shared bank into multiple blocks, we enable simultaneous accesses to different blocks and achieve considerable performance gain. Experiments on a virtual prototyping system show a promising result that we achieve about 20-50% performance gain compared to the base DPSDRAM architecture.
Hoeseok Yang, Sungchan Kim, Hae-woo Park, Soonhoi Ha
CASES3
2007 A novel technique to use scratch-pad memory for stack management
Hae-woo Park, Soonhoi Ha
DATE2
2006 Dynamic code overlay of SDF-modeled programs on low-end embedded systems
abstract
In this paper we propose a dynamic code overlay technique of synchronous data-flow (SDF)-modeled program for low-end embedded systems which lack MMU-support. With this technique, the system can utilize expensive SRAM memory more efficiently by using flash memory as code storage. SRAM is divided into several regions called overlay slots. A data-flow block or a cluster of data-flow blocks is loaded into the corresponding overlay slot on demand at run-time. Which blocks are clustered together and which overlay slots are allocated to the clusters are statically decided by the clustering and placement algorithm. We also propose an automatic code generation framework that generates the C-program code, dynamic loader and linker script files from the given SDF-modeled blocks and schematic, so we can run or simulate the program immediately without any additional coding effort. Experiments report that we can reduce the SRAM size significantly with a reasonable amount of time overhead for several real applications
Hae-woo Park, Kyoungjoo Oh, Myoung-min Sim, Soonhoi Ha
DATE1