SAS: Speculative Locality Aware Scheduling for I/O Intensive Analysis in Clouds

The execution of data intensive analysis workflows in a multi-cloud environment, such as World Large hadron collider Computing Grid (WLCG) at CERN, requires a large amount of input data, which is stored in multiple storage elements. The turnaround time taken by an individual analysis workflow is mostly affected by the data reading time. Minimizing the data reading time can improve the overall efficiency of data analysis process. To overcome this problem, we have used Speculative Scheduling to optimize the multi-cloud analysis workflows by intelligently streaming data before a task arrives for execution. We propose an Event Server (ES) which is an in-memory process responsible for proactively providing input data to the workflow processes. It prefetches the data from the storage elements to the memory of the worker node, which executes the workflow. Using locality aware scheduling and prefetching algorithms, it performs Speculative Scheduling on the basis of the evaluation of historic execution logs. ES learns about the incoming jobs ahead of time and makes use of the intelligent data streaming to supply data to these jobs, thus reducing the overall scheduling and data access latencies and leading to significant improvements in the overall turnaround time. We have evaluated the proposed system using a large analysis workflow from High Energy Physics (HEP) by emulating the WLCG infrastructure in a controlled environment. The results have shown that by using speculative and locality aware scheduling techniques, significant improvements (i.e. over 30%) can be achieved in the execution of data intensive workflows in a multi-cloud environment.

[1]  Richard McClatchey,et al.  Job Monitoring in an Interactive Grid Analysis Environment , 2004 .

[2]  Ashiq Anjum,et al.  Grid Enabled Analysis : Architecture, prototype and status , 2005 .

[3]  Dharmendra S. Modha,et al.  SARC: Sequential Prefetching in Adaptive Replacement Cache , 2005, USENIX Annual Technical Conference, General Track.

[4]  Ashiq Anjum,et al.  The Clarens Web service framework for distributed scientific analysis in grid projects , 2005, 2005 International Conference on Parallel Processing Workshops (ICPPW'05).

[5]  Richard McClatchey,et al.  Bulk Scheduling With the DIANA Scheduler , 2006, IEEE Transactions on Nuclear Science.

[6]  Luis Angel D. Bathen,et al.  AMP: Adaptive Multi-stream Prefetching in a Shared Cache , 2007, FAST.

[7]  Song Jiang,et al.  STEP: Sequentiality and Thrashing Detection Based Prefetching to Improve Performance of Networked Storage Servers , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[8]  Matei Zaharia,et al.  Job Scheduling for Multi-User MapReduce Clusters , 2009 .

[9]  Zhe Zhang,et al.  Memory resource allocation for file system prefetching: from a supply chain management perspective , 2009, EuroSys '09.

[10]  Johan Montagnat,et al.  Modeling the latency on production grids with respect to the execution context , 2009, Parallel Comput..

[11]  Xiao Liu,et al.  A Compromised-Time-Cost Scheduling Algorithm in SwinDeW-C for Instance-Intensive Cost-Constrained Workflows on a Cloud Computing Platform , 2010, Int. J. High Perform. Comput. Appl..

[12]  Scott Shenker,et al.  Delay scheduling: a simple technique for achieving locality and fairness in cluster scheduling , 2010, EuroSys '10.

[13]  P. Bhat Multivariate Analysis Methods in Particle Physics , 2011 .

[14]  Richard McClatchey,et al.  CMS Workflow Execution Using Intelligent Job Scheduling and Data Access Strategies , 2011, IEEE Transactions on Nuclear Science.

[15]  Kang G. Shin,et al.  FAST: Quick Application Launch on Solid-State Drives , 2011, FAST.

[16]  H. Howie Huang,et al.  Flashy prefetching for high-performance flash drives , 2012, 012 IEEE 28th Symposium on Mass Storage Systems and Technologies (MSST).

[17]  Jisha S. Manjaly,et al.  A Relative Study on Task Schedulers in Hadoop MapReduce , 2013 .

[18]  Liang Chen,et al.  Efficient task scheduling for Many Task Computing with resource attribute selection , 2014, China Communications.

[19]  Wei Wang,et al.  FLAP: Flash-aware Prefetching for Improving SSD-based Disk Cache , 2014, J. Networks.

[20]  Markus Zimmermann The ALICE analysis train system , 2015, ArXiv.

[21]  P. Buncic,et al.  Technical Design Report for the Upgrade of the Online-Offline Computing System , 2015 .

[22]  Hiral M. Patel A Comparative Analysis of MapReduce Scheduling Algorithms for Hadoop , 2015 .

[23]  Frank Singhoff,et al.  Lynx: a learning linux prefetching mechanism for SSD performance model , 2016, 2016 5th Non-Volatile Memory Systems and Applications Symposium (NVMSA).

[24]  Hidenori Nakazato,et al.  Clustering-Based Task Scheduling in a Large Number of Heterogeneous Processors , 2016, IEEE Transactions on Parallel and Distributed Systems.

[25]  Yuki Hayashi,et al.  Victream: Computing Framework for Out-of-Core Processing on Multiple GPUs , 2017, BDCAT.

[26]  A. Mauro,et al.  Particle identification methods other than RICH , 2020 .