{"title":"Standard deviation of probability of processor availability based task scheduling algorithm","authors":"Vijayalakshmi A. Lepakshi, C. Prashanth","doi":"10.1109/ITACT.2015.7492659","DOIUrl":null,"url":null,"abstract":"Cloud [2] is an interconnection of clusters of different heterogeneous processors that provides different services such as SaaS, PaaS, IaaS etc., to different users. User's jobs are diverse and have different requirements. Jobs can be represented as Directed Acyclic Graphs and scheduling these jobs is a known NP-Complete problem. There are many heuristics developed earlier for job scheduling, that work differently in different environments with different requirements. A new heuristic SDPA, using Standard Deviation of probability of resource availability is developed for scheduling tasks which reduces makespan. It works in two stages. During first stage jobs are arranged based on the upward ranks and during the second stage jobs are allotted to the processor based on the standard deviation of probability of processor availability. Performance metrics such as Speedup, SLR and makespan are used to compare the performance of the new heuristic with existing one.","PeriodicalId":336783,"journal":{"name":"2015 International Conference on Trends in Automation, Communications and Computing Technology (I-TACT-15)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Trends in Automation, Communications and Computing Technology (I-TACT-15)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITACT.2015.7492659","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Cloud [2] is an interconnection of clusters of different heterogeneous processors that provides different services such as SaaS, PaaS, IaaS etc., to different users. User's jobs are diverse and have different requirements. Jobs can be represented as Directed Acyclic Graphs and scheduling these jobs is a known NP-Complete problem. There are many heuristics developed earlier for job scheduling, that work differently in different environments with different requirements. A new heuristic SDPA, using Standard Deviation of probability of resource availability is developed for scheduling tasks which reduces makespan. It works in two stages. During first stage jobs are arranged based on the upward ranks and during the second stage jobs are allotted to the processor based on the standard deviation of probability of processor availability. Performance metrics such as Speedup, SLR and makespan are used to compare the performance of the new heuristic with existing one.