An exposition on the applications of Locality Aware Scheduling algorithms
Waqar Hussain, Muhammad Adeel Ashraf, Faria Ferooz, Ahmad Hassan Butt, Yaser Daanial Khan · 2019
The present study analyses the various applications of the Locality aware scheduling algorithms, focusing the effectiveness and efficiency of these algorithms. Locality-Aware Scheduling algorithms (LAS) is observed having various applications in the field of computer science. It has been observed that the locality is a universal behavior in all the computational fields and it is observed that these tend to refer repeatedly among various subsets of the resources within various time intervals. It is observed that the execution of each computation basically generates a reference to the objects within the memory such as the memory pages, memory sectors, database records and the web pages. Through the analysis of various locality aware scheduling algorithms, it is observed that the locality aware scheduling works more effectively as compared to the other scheduling algorithms. Among these various systems, it has been observed that the locality aware scheduling is the most effective and efficient technique for the scheduling of the processes. The concept of locality aware scheduling is to make the data parallel applications run more efficiently with less data loss or data inconsistency. Analyzing the effectiveness of LAS it is clearly identifiable that the LAS is achieving this purpose with high effectiveness as compared to the other scheduling algorithms. For future considerations, LAS can be point of interest for the researchers due to its effective results.