Article Fingerprint
ReserarchID
CSTKI1DG
Choose where you want to hide AI Takeaway. Your site-wide choice will be remembered in this browser.
In this new era with the advancement in the technological world the data storage, analysis becomes a major problem. Although the availability of different data storage component like electronic storage such as hard drive or virtual storage such as cloud still the problems remains. The major issue is processing the data because usually the data is in several format and size. Usually processing such huge amount of data with several formats can be time consuming. Using of application such as Hadoop can be beneficial but using of scheduling algorithm can be the best way to for data set analysis to make the process time efficient and analysis the requirement of different scheduling algorithm for the specific data set. In this paper we analysis different data set to explain the most effective scheduling algorithm for that specific data set and then store and execute data set after processing.
Tanmay Paul. 2017. "Study of Effective Scheduling Algorithm for Application of Big Data". Global Journal of Computer Science and Technology GJCST-C Volume 17 (GJCST Volume 17 Issue C1).
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 141
Country: India
Subject: Global Journal of Computer Science and Technology
Authors: Tanmay Paul (PhD/Dr. count: 0)
View Count (all-time): 482
Total Views (Real + Logic): 2749
Total Downloads (simulated): 188
Publish Date: 2017 01, Sun
Monthly Totals (Real + Logic):
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.