arrow
Return

A Study on Garbage Collection Algorithms for Big Data Environments

delete2018-01-10
delete16
PRE
AI
R
Rodrigo Bruno *
P
Paulo Ferreira
DOI:10.1145/3156818delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The need to process and store massive amounts of data-Big Data-is a reality. In areas such as scientific experiments, social networks management, credit card fraud detection, targeted advertisement, and financial analysis, massive amounts of information are generated and processed daily to extract valuable, summarized information. Due to its fast development cycle (i.e., less expensive to develop), mainly because of automatic memory management, and rich community resources, managed object-oriented programming languages (e.g., Java) are the first choice to develop Big Data platforms (e.g., Cassandra, Spark) on which such Big Data applications are executed. However, automatic memory management comes at a cost. This cost is introduced by the garbage collector, which is responsible for collecting objects that are no longer being used. Although current (classic) garbage collection algorithms may be applicable to small-scale applications, these algorithms are not appropriate for large-scale Big Data environments, as they do not scale in terms of throughput and pause times. In this work, current Big Data platforms and their memory profiles are studied to understand why classic algorithms (which are still the most commonly used) are not appropriate, and also to analyze recently proposed and relevant memory management algorithms, targeted to Big Data environments. The scalability of recent memory management algorithms is characterized in terms of throughput (improves the throughput of the application) and pause time (reduces the latency of the application) when compared to classic algorithms. The study is concluded by presenting a taxonomy of the described works and some open problems, with regard to Big Data memory management, that could be addressed in future works.
Keywords:
Garbage collection
Big Data
processing platforms
storage platform
Java
memory managed runtime
scalability
Big Data environment
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

ACM Computing Surveys cover
ACM Computing Surveys
IF:
28
Papers:
2.5K
Citations:
3.5W

Organization

U
universidade de lisboa
Scholars:
3.4W
Papers: 3.1W
Citations: 29
Cited Papers

Cited Papers

pH Dependence of the Four Individual Transitions in the Catalytic S-Cycle during Photosynthetic Oxygen Evolution
err2002-04-11
err0
PREAI
errGábor Bernát; Fatemeh Morvaridi; Yashar Feyziyev; Stenbjörn Styring
errShare
errSave
SARS-CoV-2 ORF9b Antagonizes Type I and III Interferons by Targeting Multiple Components of RIG-I/MDA-5-MAVS, TLR3-TRIF, and cGAS-STING Signaling Pathways
err
IF0
err2020-08-17
err0
errOAAI
errLulu Han; Meng-Wei Zhuang; Yi Zheng; Jing Zhang; Mei-Ling Nan; Pei-Hui Wang; Chengjiang Gao
errShare
errSave
Broadband Rectenna Arrays for Randomly Polarized Incident Waves
err2000-10-01
err0
PREAI
errJoseph A. Hagerty; Nestor D. Lopez; Branko Popovic; Zoya Popovic
errShare
errSave
Plant-mediated effects linking herbivory and pollination
err2007-01-04
err0
PREAI
errJudith L. Bronstein; Travis E. Huxman; Goggy Davidowitz
errShare
errSave
Developing and Evaluating Intermodal E-Sharing Services–A Multi-method Approach
err2014-01-01
err0
errOAAI
errJörn-Ole Schröder; Christine Weiß; Martin Kagerbauer; Nicolas Reiß; Christian Reuter; Rimbert Schürmann; Steven Pfisterer
errShare
errSave
Incidence of Dementia in Relation to Genetic Variants at PITX2, ZFHX3, and ApoE ε4 in Atrial Fibrillation Patients
err2014-12-12
err0
errOAAI
errJEFFREY ROLLO; STACEY KNIGHT; HEIDI T. MAY; JEFFREY L. ANDERSON; JOSEPH B. MUHLESTEIN; T. JARED BUNCH; JOHN CARLQUIST
errShare
errSave
researcher View more