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

Insung Park

dblp:92/3165 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2000
—ORCID · none

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

Systems, architecture and hardware · 3 · 2 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
Parallel and multicore computing · 77% Performance modeling and evaluation · 23%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
parallel programming environment
0.012000
Towards an Integrated, Web-executable Parallel Programming Tool Environment · SC 2000
Performance modeling and evaluation
performance tuning
0.012000
Towards an Integrated, Web-executable Parallel Programming Tool Environment · SC 2000

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

web browser execution · 0.0java applets · 0.0
YearPublicationVenuePosition
2000 Towards an Integrated, Web-executable Parallel Programming Tool Environment
abstract
We present a new parallel programming tool environment that is (1) accessible and executable "anytime, anywhere," through standard Web browsers and (2) integrated in that it provides tools that adhere to a common underlying methodology for parallel programming and performance tuning. The environment is based on a new network computing infrastructure, developed at Purdue University. We evaluate our environment qualitatively by comparing our tool access method with conventional schemes of software download and installation. We also quantitatively evaluate the efficiency of interactive tool access in our environment. We do this by measuring the response times of various functions of the URSA MINOR tool and compare them with those of a Java Applet-based "anytime, anywhere" tool access method. We found that our environment offers significant advantages in terms of tool accessibility, integration, and efficiency.
Insung Park, Nirav H. Kapadia, Renato J. O. Figueiredo, Rudolf Eigenmann, José A. B. Fortes
SC1
1998 Compiler-Based Tools for Analyzing Parallel Programs
Seon Wook Kim, Insung Park, Michael Voss, Rudolf Eigenmann
Parallel Comput.3
1995 A New Method for Partial Scan Design Based on Propagation and Justification Requirements of Faults
abstract
Scan design can be viewed as scanning flip-flops, so that faults, otherwise aborted, are detected by meeting propagation and justification requirements. In this paper, we propose a new method which identifies justification and propagation requirements of aborted faults through combinational test generation and selects flip-flops to meet the requirements. Two procedures, optimal and heuristic, were considered in the process. We implemented the heuristic procedure in a program called BELLONA. BELLONA selects flip-flops progressively to lead to high fault efficiency. Our experimental results show that BELLONA achieves 100% fault efficiency for all circuits experimented with, on average, 19% of flip-flops selected.
Insung Park, Dong Sam Ha, Gyoochan Sim
ITC1