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

Jung Wan Cho

dblp:72/2774 · DBLP profile ↗
← Back
26ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none

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

Systems, architecture and hardware · 10Databases, data management, data science and information retrieval · 4Graphics, computer vision, multimedia, augmented reality and games · 4Artificial intelligence and machine learning · 3Computer networks · 3Theory of computation · 3Software engineering, systems software and programming languages · 2

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 networks
2 papers
Physical-layer communications · 58% Routing and switching · 19% Internet architecture and protocols · 14%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Interconnection networks and networks-on-chip · 72% Performance modeling and evaluation · 20% Electronic design automation · 8%
Databases, data mining, and information retrieval
1 paper
Data models and query languages · 100%
Theoretical computer science
1 paper
Distributed computing theory · 100%

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

TopicWeightPapersLastEvidence papers
Data models and query languages
datalog
0.012004
Generalization of ZYT-linearizability for bilinear datalog programs · Inf. Comput. 2004
Distributed computing theory › shared memory consistency
linearizability
0.012004
Generalization of ZYT-linearizability for bilinear datalog programs · Inf. Comput. 2004
Physical-layer communications › multiple access
CDMA systems
0.012001
A design of macro-micro CDMA cellular overlays in the existing big urban areas · IEEE J. Sel. Areas Commun. 2001
Physical-layer communications
code-division multiple access
0.012001
A design of macro-micro CDMA cellular overlays in the existing big urban areas · IEEE J. Sel. Areas Commun. 2001
Interconnection networks and networks-on-chip › switching network
multistage interconnection network
0.021996
Novel algorithms for multicast communication in self-routing MIN-based ATM switches · ICNP 1996
Performance analysis of an ATM switch with multiple paths · ICNP 1995
Internet architecture and protocols › ATM networks
ATM switching
0.011996
Novel algorithms for multicast communication in self-routing MIN-based ATM switches · ICNP 1996
Routing and switching › switching systems
self-routing switch
0.011996
Novel algorithms for multicast communication in self-routing MIN-based ATM switches · ICNP 1996
Interconnection networks and networks-on-chip › routing algorithms
multicast routing
0.011996
Novel algorithms for multicast communication in self-routing MIN-based ATM switches · ICNP 1996
Performance modeling and evaluation › network performance analysis
switch performance analysis
0.011995
Performance analysis of an ATM switch with multiple paths · ICNP 1995
Routing and switching
deadlock-free routing
0.011996
Novel algorithms for multicast communication in self-routing MIN-based ATM switches · ICNP 1996
Interconnection networks and networks-on-chip
interconnection networks
0.011995
Performance analysis of an ATM switch with multiple paths · ICNP 1995
Electronic design automation › hardware test
fault detection and location
0.011983
Fault Diagnosis of Bit-Slice Processor · ISCA 1983
Electronic design automation › hardware verification and test
fault diagnosis
0.011983
Fault Diagnosis of Bit-Slice Processor · ISCA 1983

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

recursive recycling scheme · 0.0event-driven simulation · 0.0simulation · 0.0queueing analysis · 0.0restricted multiple slice fault assumption · 0.0high functional fault model · 0.0
YearPublicationVenuePosition
2006 Home-based Cooperative Cache for parallel I/O applications
In-Chul Hwang, Seung Ryoul Maeng, Jung Wan Cho
Future Gener. Comput. Syst.3
2004 Secure Group Communication with Low Communication Complexity
Heeyoul Kim, Hyunsoo Yoon, Jung Wan Cho
PDCAT4
2004 Generalization of ZYT-linearizability for bilinear datalog programs
Ji-Hoon Kang, Ki-Hyung Hong, Kyu-Young Whang, Jung Wan Cho
Inf. Comput.4
2001 A design of macro-micro CDMA cellular overlays in the existing big urban areas
abstract
We focus on delivering radio engineers a practical design of macro-micro code division multiple access (CDMA) cellular overlays. First, we review our algorithmic approach to jointly deploy macrocells and microcells over today's big urban areas having spatially nonuniform traffic distributions. Next, we identify several further issues related to the optimal design of macro-micro cellular overlays and enhance the cell-deploying algorithm to reflect these issues. The numerical results by extensive event-driven simulations show that the resulting macro-micro cellular overlays successfully cope with the existing conditions of today's big urban areas, such as spatial and temporal traffic distributions and user mobility characteristics. Finally, we discuss the practical guidelines for designing macro-micro cellular overlays in the existing big urban areas.
Byungchan Ahn, Hyunsoo Yoon, Jung Wan Cho
IEEE J. Sel. Areas Commun.3
1998 Fault-Tolerant Multicasting in Multistage Interconnection Networks
abstract
We study fault-tolerant multicasting in multistage interconnection networks (MINs) for constructing large-scale multicomputers. In addition to point-to-point routing among processor nodes, efficient multicasting is critical to the performance of multicomputers. This paper presents a new approach to provide fault-tolerant multicasting, which employs the restricted header encoding schemes. The proposed approach is based on a recursive scheme in order to send a multicast packet to the desired destinations detouring faulty element(s). In the proposed fault-tolerant multicasting, a multicast packet is routed to its own destinations in only two passes through the MIN having a number of faulty elements by exploiting its nonblocking property.
Jinsoo Kim 0005, Jaehyung Park, Jung Wan Cho, Hyunsoo Yoon
ICPP3
1997 Methodology for ensuring high reliability of VLSI systems
Byung-gi Kim, Hoon Chang, Jung Wan Cho
J. Syst. Archit.3
1997 Image Parallel Ray Tracing Using Static Load Balancing and Data Prefetching
Hyeon-Ju Yoon, Seong Bae Eun, Jung Wan Cho
Parallel Comput.3
1996 Novel algorithms for multicast communication in self-routing MIN-based ATM switches
abstract
We discuss the multicast communication in the self-routing multistage interconnection network (MIN) for constructing the internal architecture of asynchronous transfer mode (ATM) switches. Many applications of ATM switches require multicast communications in addition to conventional point-to-point communications. This paper presents a novel approach to supporting multicast communication, on the basis of the recursive scheme that recycles a multicast packet one or more times through the network to reach at desired destinations. We also propose cost-effective multicast algorithms providing deadlock-freedom in MIN-based ATM switches. The proposed algorithms require a small and fixed number of recycling passes and a reasonable number of links used. The proposed algorithms can be easily applicable to buffered MIN-based ATM switches.
Jaehyung Park, Hyunsoo Yoon, Jung Wan Cho
ICNP3
1996 Drop-and-reroute: A new flow control policy for adaptive wormhole routing
Ji-Yun Kim, Hyunsoo Yoon, Seung Ryoul Maeng, Jung Wan Cho
J. Syst. Archit.4
1996 A prediction-based adaptive location policy for distributed load balancing
Gil-Haeng Lee, Heung-Kyu Lee, Jung Wan Cho
J. Syst. Archit.3
1995 Performance analysis of an ATM switch with multiple paths
abstract
An ATM switch based on multistage interconnection networks with multiple paths can support higher bandwidth than that of buffered networks with single path by passing multiple packets to the same destination simultaneously. These multiple packets are buffered in the output buffer of the destination. The performance of output buffer in the switch with multiple paths is closely dependent on the output traffic distribution, which is the packet arrival rate at each output link destined to a given output port. As the nonuniformity of the output traffic distribution becomes higher, the performance of the output buffer as like delay and packet loss probability gets better. In this paper, we propose a new self-routing switch architecture with multiple paths called Fly network and analyze the performance of the switching network and the output buffer focusing on the output traffic distribution. It is shown that the Fly network supports best throughput and latency of the output buffer by producing a high degree of the nonuniform output traffic distribution.
Byungho Kim, Boseob Kwon, Jinchun Kim, Hyunsoo Yoon, Jung Wan Cho
ICNP5
1995 Drop-and-Reroute: A New flow Control Policy for Adaptive Wormhole Routing
Ji-Yun Kim, Hyunsoo Yoon, Seung Ryoul Maeng, Jung Wan Cho
ICPP (1)4
1994 MAKRS: a knowledge and belief representation system for multiple agents
Young Hoon Kim, Seung Ryoul Maeng, Jung Wan Cho
Knowl. Based Syst.3
1993 Directory-based cache coherence scheme using number-balanced binary tree
Dae-Wha Seo, Jung Wan Cho
Microprocess. Microprogramming2
1993 Concurrency and inheritance in actor-based object-oriented languages
Kiyeol Ryu, Seung Ryoul Maeng, Jung Wan Cho
J. Syst. Softw.3
1992 A New Subsumption Method in the Connection Graph Proof Procedure
Byeong Man Kim, Jung Wan Cho
Theor. Comput. Sci.2
1991 Application of fully recurrent neural networks for speech recognition
abstract
The authors describe an extended backpropagation algorithm for fully connected recurrent neural networks applied to speech recognition. The extended delta rule is approximated by excluding some of the past activities of the dynamic neurons to reduce computational complexity without performance degradation. In speaker-dependent recognition of a confusable syllable set, the fully recurrent neural network with the approximated backpropagation algorithm showed better performance than the multilayer perceptron and the self-recurrent network with comparable time complexity. In addition, it is found that most self-recurrent connections become excitatory and most mutual recurrent connections become inhibitory.>
Sung Jun Lee, Ki Chul Kim, Hyunsoo Yoon, Jung Wan Cho
ICASSP4
1991 Performance evaluation of catalog management schemes in distributed database systems
Eui Kyeong Hong, Jung Wan Cho
Inf. Syst.2
1990 Extended elman's recurrent neural network for syllable recognition
Yong Duk Cho, Ki Chul Kim, Hyunsoo Yoon, Seung Ryoul Maeng, Jung Wan Cho
ICSLP5
1990 Enhanced parametric representation using binarized spectrum
Ki Chul Kim, Hyunsoo Yoon, Jung Wan Cho
ICSLP3
1989 Phonetic recognition using peak weighted binary spectrum
abstract
Invariant acoustic-phonetic features conveyed simultaneously by the stable and the transient portion of the speech signal are investigated quantitatively using a relational cue. To represent the relational cue effectively, a peak-weighted binary spectrum is proposed. Prevocalic nasal recognition results show speaker independence and improved performance in comparison with dynamic time-warping methods.>
Ki Chui Kim, Hwang Soo Lee, Jung Wan Cho
ICASSP3
1987 History Sensitive String for Multiple Alphabets
Tae-Choong Chung, Jung Wan Cho
Inf. Process. Lett.2
1986 A Parallel Execution Model of Logic Program Based on Dependency Relationship Graph
Seungbeom Kim, Seung Ryoul Maeng, Jung Wan Cho
ICPP3
1986 An improved protocol validation technique for a class of communication models
Si-Yeong Hwang, Jung Wan Cho
Inf. Sci.2
1985 KPSP: A Knowledge Programming System based on Prolog
Sangki Han, Jung Wan Cho
ER2
1983 Fault Diagnosis of Bit-Slice Processor
abstract
This paper proposes a microdiagnostic procedure for efficient fault diagnosis of bit-slice processors that are formed by an array of identical bit-slice processors. A test generation procedure for testing the entire array simultaneously instead of testing single slice, one after another, is presented, which is based on the high functional fault model and restricted multiple slice fault assumption within an array. Fault detection and fault location procedures using the generated test sequence are also presented.
Young Gil Park, Jung Wan Cho
ISCA2