S. Usman, Sikandar Khan, S. M. Ali, Chaudhary Arshad Mehmood, Rahat Nasim, M. Jawad, Saqib Salahuddin, Ahsan Khawja, M. A. Ihsan
{"title":"Optimization of resource allocation using Monte Carlo","authors":"S. Usman, Sikandar Khan, S. M. Ali, Chaudhary Arshad Mehmood, Rahat Nasim, M. Jawad, Saqib Salahuddin, Ahsan Khawja, M. A. Ihsan","doi":"10.1109/EIT.2014.6871807","DOIUrl":null,"url":null,"abstract":"In this paper, we study the problem of optimizing the error generated in the allocation of processing elements to tasks, based on real-time scheduling. The makespan of the tasks to be scheduled is the same, in the computational grid. Tasks to be assigned to processing elements are randomly generated and are mapped to processors. Scheduling is done, considering real-time environment and mapping is achieved via biased and unbiased mapping of tasks to processors. The heuristics are used with the simulated computational grid and the results are compared extensively against each other.","PeriodicalId":92209,"journal":{"name":"IEEE International Conference on Electro Information Technology : [proceedings]. IEEE International Conference on Electro Information Technology","volume":"90 1","pages":"454-458"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on Electro Information Technology : [proceedings]. IEEE International Conference on Electro Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EIT.2014.6871807","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we study the problem of optimizing the error generated in the allocation of processing elements to tasks, based on real-time scheduling. The makespan of the tasks to be scheduled is the same, in the computational grid. Tasks to be assigned to processing elements are randomly generated and are mapped to processors. Scheduling is done, considering real-time environment and mapping is achieved via biased and unbiased mapping of tasks to processors. The heuristics are used with the simulated computational grid and the results are compared extensively against each other.