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
Demo Data from SIGIR 2026 / reviewers in the wild / expert

EunJoung Byun

dblp:38/5875 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
0since 2021 · last 2010
—ORCID · none

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

Systems, architecture and hardware · 3 · 1 first-authorSecurity and privacy · 1 · 1 first-authorApplied, 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
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems › distributed mobile computing
mobile agents		 0.112010
A Reliable Communication Protocol for Multiregion Mobile Agent Environments · IEEE Trans. Parallel Distributed Syst. 2010
Distributed systems
fault tolerance		 0.012010
A Reliable Communication Protocol for Multiregion Mobile Agent Environments · IEEE Trans. Parallel Distributed Syst. 2010
Distributed systems › fault tolerance
reliable communication		 0.012010
A Reliable Communication Protocol for Multiregion Mobile Agent Environments · IEEE Trans. Parallel Distributed Syst. 2010
YearPublicationVenuePosition
2010 A Reliable Communication Protocol for Multiregion Mobile Agent Environments
abstract
A mobile agent system is regarded as an attractive technology when developing distributed applications. However, mobility makes it more difficult to trace agents. It is also more complex for agents to communicate with each other in a reliable manner. Therefore, a reliable communication protocol is necessary to control and monitor mobile agents and deliver messages between them. In this paper, a new reliable communication protocol (RCP) is proposed for a multiregion mobile agent computing environment. RCP is implemented on the ODDUGI mobile agent system. Analysis and evaluation show that RCP fulfills the following design goals: reliability, asynchrony, timeliness, location dependency, scalability, and communication cost.
SungJin Choi, MaengSoon Baik, HongSoo Kim, EunJoung Byun, Hyunseung Choo
 IEEE Trans. Parallel Distributed Syst.4
2009 ODDUGI: Ubiquitous Mobile Agent System
SungJin Choi, Hyunseung Choo, MaengSoon Baik, HongSoo Kim, EunJoung Byun
 ICCSA (2)5
2007 Characterizing and Classifying Desktop Grid
abstract
Desktop Grid has recently received the strong attraction for executing high throughput applications as CPU, storage and network capacities improve and become cheaper. Desktop Grid is different from Grid in many respects, but there is no general survey or taxonomy for desktop Grid. Therefore, we propose a new comprehensive taxonomy and survey of desktop Grid in order to characterize and categorize desktop Grid.
SungJin Choi, HongSoo Kim, EunJoung Byun, MaengSoon Baik, SungSuk Kim, Chan Yeol Park, Chong-Sun Hwang
 CCGRID3
2007 MJSA: Markov job scheduler based on availability in desktop grid computing environment
EunJoung Byun, SungJin Choi, MaengSoon Baik, Joon-Min Gil, Chan Yeol Park, Chong-Sun Hwang
 Future Gener. Comput. Syst.1
2006 Advanced Stochastic Host State Modeling to Reliable Computation in Global Computing Environment
EunJoung Byun, HongSoo Kim, SungJin Choi, MaengSoon Baik, SooJin Goo, Joon-Min Gil, Hark-Soo Park, Chong-Sun Hwang
 EUC1
2006 MTRMS: mutual-trust-based reputation management system in community-based peer-to-peer environment
abstract
No abstract available.
EunJoung Byun, SeokIn Kim, HongSoo Kim, SungJin Choi, Chong-Sun Hwang
 PST1
2005 Scheduling Scheme based on Dedication Rate in Volunteer Computing Environment
abstract
A volunteer node can join and leave a volunteer computing system freely. However, existing volunteer computing systems suffer from interruptions of job execution, delays of execution time, and increases of total execution time, since they do not consider dynamic scheduling properties (i.e. volatilities), such as leave, join, and suspension. Therefore, dynamic execution properties of volunteer node should be considered in scheduling schemes, in order to design a stable and reliable volunteer computing system. This paper proposes a new scheduling scheme based on the dedication rate (DR), which reflects the dynamic properties of a volunteer. The scheduling scheme improves the completeness and reliability of execution, while also decreasing delay and total execution time. In addition, an implementation of the proposed scheduling scheme on top of Korea@Home is described, as well as performance evaluation
EunJoung Byun, SungJin Choi, MaengSoon Baik, Chong-Sun Hwang
 ISPDC1