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

Il-Hyung Cho

dblp:74/556 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · none

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

Software engineering, systems software and programming languages · 3 · 1 first-authorComputer 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
Parallel and multicore computing · 67% Distributed systems · 33%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems
graph matching
0.011991
A Close Look at Task Assignment in Distributed Systems · INFOCOM 1991
Parallel and multicore computing › task allocation
static task assignment
0.011991
A Close Look at Task Assignment in Distributed Systems · INFOCOM 1991
Parallel and multicore computing
task allocation
0.011991
A Close Look at Task Assignment in Distributed Systems · INFOCOM 1991
Graph algorithms and graph theory
graph algorithms
0.011991
A Close Look at Task Assignment in Distributed Systems · INFOCOM 1991
Graph algorithms and graph theory
graph homomorphism
0.011991
A Close Look at Task Assignment in Distributed Systems · INFOCOM 1991

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

heuristic search · 0.0a* search · 0.0
YearPublicationVenuePosition
2005 Component Specification for Enterprise Software Development on Web Services Environment
abstract
The idea of developing software systems by putting software modules together has been a goal for many software researchers and practitioners for a long time. This goal is within sight due to the increased adoption of component-based software engineering, the development of component standards, and their wide acceptance by industry. Component-based development is an approach to developing a software system by assembling and composing already built software components. It promises reusable and plug-and-playable software system development environments. The component concept is not new and has been perceived in several different ways by software researchers in academics and practitioners in industry. The different perspectives from diverse researchers and practitioners have led to a plethora of definitions of component and different component specification and implementation models. In this paper, we briefly review several of these different views and definitions on software components. We then present the Interoperable Component Specification Model (ICSM) for the Web services environment.
Il-Hyung Cho, John D. McGregor
SERA1
2003 Measuring and Communicating Component Reliability
John D. McGregor, Judith A. Stafford, Il-Hyung Cho
SERA3
1999 Collecting Metrics for CORBA-Based Distributed Systems
John D. McGregor, Il-Hyung Cho, Brian A. Malloy, E. Lowry Curry, Chanika Hobatr
Empir. Softw. Eng.2
1991 A Close Look at Task Assignment in Distributed Systems
abstract
C. C. Shen and W. H. Tsai (IEEE Trans. Comput., vol.C-34, no.3, p.197-203 1985) proposed a graph matching algorithm for solving the static task assignment problem. It combines two important ideas: (1) graph homomorphism and (2) application of the A* algorithm. Task-dependent information is used as a heuristic to reduce the search effort in finding an optimal path to the goal node. An examination is made of Shen and Tsai's strategy and their complexity measure. The authors propose some simple alternatives to their algorithm that are effective in reducing the number of nodes generated (and expanded) without sacrificing the optimality criteria.>
Sub Ramakrishnan, Il-Hyung Cho, Larry A. Dunning
INFOCOM2