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

Hsueh-Yi Chung

dblp:28/8032 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none

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

Systems, architecture and hardware · 2 · 1 first-authorArtificial intelligence and machine learning · 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
Storage systems · 28% Parallel and multicore computing · 28% Cloud and datacenter computing · 28%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cloud storage
0.212013
Load Rebalancing for Distributed File Systems in Clouds · IEEE Trans. Parallel Distributed Syst. 2013
Storage systems › file systems
distributed file system
0.212013
Load Rebalancing for Distributed File Systems in Clouds · IEEE Trans. Parallel Distributed Syst. 2013
Parallel and multicore computing
load balancing
0.212013
Load Rebalancing for Distributed File Systems in Clouds · IEEE Trans. Parallel Distributed Syst. 2013
Distributed systems › distributed algorithms › decentralized computation
decentralized algorithms
0.012013
Load Rebalancing for Distributed File Systems in Clouds · IEEE Trans. Parallel Distributed Syst. 2013
Distributed systems
fault tolerance
0.012013
Load Rebalancing for Distributed File Systems in Clouds · IEEE Trans. Parallel Distributed Syst. 2013

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

simulation · 0.2distributed algorithm · 0.2
YearPublicationVenuePosition
2013 Load Rebalancing for Distributed File Systems in Clouds
abstract
Distributed file systems are key building blocks for cloud computing applications based on the MapReduce programming paradigm. In such file systems, nodes simultaneously serve computing and storage functions; a file is partitioned into a number of chunks allocated in distinct nodes so that MapReduce tasks can be performed in parallel over the nodes. However, in a cloud computing environment, failure is the norm, and nodes may be upgraded, replaced, and added in the system. Files can also be dynamically created, deleted, and appended. This results in load imbalance in a distributed file system; that is, the file chunks are not distributed as uniformly as possible among the nodes. Emerging distributed file systems in production systems strongly depend on a central node for chunk reallocation. This dependence is clearly inadequate in a large-scale, failure-prone environment because the central load balancer is put under considerable workload that is linearly scaled with the system size, and may thus become the performance bottleneck and the single point of failure. In this paper, a fully distributed load rebalancing algorithm is presented to cope with the load imbalance problem. Our algorithm is compared against a centralized approach in a production system and a competing distributed solution presented in the literature. The simulation results indicate that our proposal is comparable with the existing centralized approach and considerably outperforms the prior distributed algorithm in terms of load imbalance factor, movement cost, and algorithmic overhead. The performance of our proposal implemented in the Hadoop distributed file system is further investigated in a cluster environment.
Hung-Chang Hsiao, Hsueh-Yi Chung, Haiying Shen, Yu-Chang Chao
IEEE Trans. Parallel Distributed Syst.2
2012 The Load Rebalancing Problem in Distributed File Systems
abstract
Distributed file systems (DFS) are key building blocks for cloud computing applications based on the MapReduce programming paradigm. In such file systems, nodes simultaneously serve computing and storage functions, a file is partitioned into a number of chunks allocated in distinct nodes so that MapReduce tasks can be performed in parallel over the nodes. However, in a cloud computing environment, failure is the norm, and nodes may be upgraded, replaced, and added in the system. Files can also be dynamically created, deleted, and appended. This results in load imbalance, that is, the file chunks are not distributed as uniformly as possible in the nodes. Although distributed load balancing algorithms exist in the literature to deal with the load imbalance problem, emerging DFSs in production systems strongly depend on a central node for chunk reallocation. This dependence is clearly inadequate in a large-scale, failure-prone environment because the central load balancer is put under considerable workload that is linearly scaled with the system size, and may thus become the performance bottleneck and the single point of failure. In this paper, we illustrate and define the load rebalancing problem in cloud DFSs. We advocate file systems in clouds shall incorporate decentralized load rebalancing algorithms to eliminate the performance bottleneck and the single point of failure. Simulation results for a potential distributed load balancing algorithm are illustrated. The performance of our proposal implemented in the Hadoop distributed file system is also demonstrated.
Hsueh-Yi Chung, Hung-Chang Hsiao, Yu-Chang Chao
CLUSTER1
2010 An MRF-based kernel method for nonlinear feature extraction
Pi-Fuei Hsieh, Po-Wen Chou, Hsueh-Yi Chung
Image Vis. Comput.3