Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/14740| Title: | Performance Evaluation of Simulated Annealing-Based Task Scheduling Algorithms |
| Authors: | Mishra, Abhishek |
| Keywords: | Computer Science Simulated Annealing (SA) Cluster Pair Priority Scheduling (CPPS) Dominant Sequence Clustering (DSC) |
| Issue Date: | Sep-2020 |
| Publisher: | Springer |
| Abstract: | The performance of simulated annealing (SA)-based task scheduling algorithms is evaluated. First, various parameters of SA are varied, and it is seen how it affects the schedule length (SL). The parameters that are varied are initial temperature, number of iterations, initial clustering, and cooling schedule. Then, one SA-based task scheduling algorithm is selected and compared with other task scheduling algorithms. The algorithms selected for comparison are cluster pair priority scheduling (CPPS), dominant sequence clustering (DSC), edge zeroing (EZ), and linear clustering (LC). Random task graphs are used for comparison |
| URI: | https://link.springer.com/chapter/10.1007/978-981-15-4936-6_15 http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/14740 |
| Appears in Collections: | Department of Computer Science and Information Systems |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.