Analysis of SSD Utilization by Graph Processing Systems
Journal: Journal of Independent Studies and Research - Computing (Vol.13, No. 1)Publication Date: 2015-06-01
Authors : Haider Qutbuddin Saif-ur-Rahman;
Page : 27-34
Keywords : ;
Abstract
Graph Processing Systems are highly productive when it comes to graph data. While using data parallel approach, it could not exploit common characteristics of a graph computation workload. To address all these challenges, distributed graph processing frameworks were introduced which inherited both the properties of graph parallel systems and data parallel system. Usually, the standard operators which were being used by data parallel systems were filter, join, reduce and etc. while graph parallel system introduced operators such as sub-graph, mrTriplets and etc. In comparison with graph framework operators, the standard relational operators were too slow. Traditionally, all the frameworks and their benchmarks were executed over hard disk drive but modern storage technology has evolved which lead us to use Solid State Drives. Solid state drives are known for their lightning speed as it manages to retrieve and populate data using pulse. This paper presents an analysis of SSD by utilizing graph processing systems. It also discuss the pros and cons faced by the Graph Processing Frameworks and by using TRIM support how the issue of wear leveling can be resolved.
Other Latest Articles
- Graph Visualization Tools: A Comparative Analysis
- Probabilistic Vs. Soft Computing for Classifying Credit Card Transactions. A Case Study of Pakistani's Credit Card Data
- Extracting patterns from Global Terrorist Dataset (GTD) Using Co-Clustering approach
- Міжнародний досвід як методологічна основа досягнення гендерного паритету в Україні
- Comparative Analysis of Collaborative Filtering on GraphLab, MLlib and Mahout
Last modified: 2018-07-17 01:04:28