Ryan Nathanael Soenjoto Widodo Widodo

Mr. Ryan Nathanael Soenjoto Widodo Widodo

University of Tsukuba
orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2017 in Future Generation Computer Systems
Verified
Journal Article
Closed access
RWRyan Nathanael Soenjoto Widodo Widodo
Ryan Nathanael Soenjoto Widodo Widodo
HLHyotaek Lim
Hyotaek Lim
MAMohammed Atiquzzaman
Mohammed Atiquzzaman

1 May 2017 in Future Generation Computer Systems
Verified
Journal Article
Closed access
RWRyan Nathanael Soenjoto Widodo Widodo
Ryan Nathanael Soenjoto Widodo Widodo
HLHyotaek Lim
Hyotaek Lim
MAMohammed Atiquzzaman
Mohammed Atiquzzaman

24 August 2020
Verified
Conference Paper
Open access
RNRyan Nathanael
Ryan Nathanael
RWRyan Nathanael Soenjoto Widodo Widodo
Ryan Nathanael Soenjoto Widodo Widodo
HAHirotake Abe
Hirotake Abe
KKKazuhiko Kato
Kazuhiko Kato
The selection of data reduction schemes, which is crucial for reduced data footprints on a distributed file system (DFS) and transferring big data, is usually limited to the schemes supported by the underlying platforms. If the source code of the platform is available, it might be possible to add user-favorite reduction schemes, but it requires an expensive implementation cost or is virtually impossible. In this paper, we propose a system design that links a DFS to reduction schemes and enables them transparently to data processing applications. To verify the feasibility of this approach, we implemented a framework within Hadoop DFS (HDFS) named Hadoop Data Reduction Framework (HDRF). The features of HDRF is threefold. First, the application programmers can easily incorporate their favorite reduction schemes with reasonably restrained implementation costs. Second, the selection is transparent to data processing applications. Lastly, experimental results show that HDRF can halve the vanilla HDFS transfer time by using a more optimized application without compromising the compression ratio. When running the same application, HDRF has minimal runtime and storage overheads compared to vanilla HDFS.

13 November 2021 in IEEE Access
Verified
Journal Article
Open access
RWRyan Nathanael Soenjoto Widodo Widodo
Ryan Nathanael Soenjoto Widodo Widodo
HAHirotake Abe
Hirotake Abe
KKKazuhiko Kato
Kazuhiko Kato
Big-data processing systems such as Hadoop, which usually utilize distributed file systems (DFSs), require data reduction schemes to maximize storage space efficiency. These schemes have different tradeoffs, and there are no all-purpose schemes applicable to all data. Users must select a suitable scheme in accordance with their data. To accommodate this requirement, application software or file system (FS) have a fixed selection of these schemes. However, these provided schemes are insufficient for all data types, and when novel schemes emerge, extending the selection can be problematic. If the source code of the application or FS is available, the source code could potentially be extended with extensive labor, but could be virtually impossible without the code maintainers’ assistance. If the source code is unavailable, there is no way to tackle the problem. This paper proposes an unexplored solution through a modular DFS design that eases data reduction scheme usage through existing programming techniques. The advantages of this presented approach are threefold. First, adding new schemes is easy and they are transparent to the application code requiring no extensions to it. Second, the modular structure requires minimal modification to the existing DFSs and performance overhead. Third, users can compile schemes separately from the DFS without the FS or DFS source code. To demonstrate the design’s effectiveness, we implemented it by minimally extending the Hadoop DFS (HDFS) and named it the Hadoop Data Reduction Framework (HDRF). We designed HDRF to work with minimal overhead and tested it extensively. Experimental results indicate that it has negligible overhead over existing approaches. In a number of cases, it can offer up to 48.96% higher throughput while achieving the best result in storage reduction within our tested setups because of the incorporated data reduction schemes.

20 January 2017
Verified
Conference Paper
Open access
RWRyan Nathanael Soenjoto Widodo Widodo
Ryan Nathanael Soenjoto Widodo Widodo
HLHyotaek Lim
Hyotaek Lim
Cloud storages are used to expand the storage on mobile devices. It can be accessed through an internet connection. On mobile devices, network data can be expensive in terms of tariff and power consumption. Deduplication can be used to reduce the amount of data to be transferred. This paper proposes a fast deduplication system for mobile devices named rapid deduplication for mobile cloud storage (RDM). RDM is based on smart deduplication for mobile cloud storage (SDM) and rapid asymmetric extremum (RAM). RDM used RAM as the chunking algorithm instead of Rabin which is used in SDM. Our experimental results show RDM is at least 39.5% to 44.7% faster at the cost of 4.2% to 9.1% higher size after deduplication.