Resource Optimization by Scheduling
| dc.contributor.author | Udvanshi, Pankaj | |
| dc.contributor.supervisor | Kakkar, Ajay | |
| dc.date.accessioned | 2013-09-16T11:51:52Z | |
| dc.date.available | 2013-09-16T11:51:52Z | |
| dc.date.issued | 2013-09-16T11:51:52Z | |
| dc.description | MT, ECED | en |
| dc.description.abstract | Scheduling refers to a set of policies and mechanisms supported by operating system that controls the order in which the work to be done is completed. Scheduling is the best method to improve the performance of the network by re-arranging the system parameters. The aim of scheduling is to keep the CPU busy as much as possible by executing a (user) process until it must wait for an event, and then switch to another process. Various scheduling algorithm which are suitable only in linear system have been studied. Shortest distance between source and destination in a network has also been calculated. Results have been observed using “TORA”. Two nodes failure condition have also been considered: a) Single node failure and b) Multiple nodes. Finally, observing from the simulation results has been drawn. | en |
| dc.description.sponsorship | Thapar University, Patiala | en |
| dc.format.extent | 1034575 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/10266/2453 | |
| dc.language.iso | en | en |
| dc.subject | Scheduling Algorithms, Shortest Path, Efficiency | en |
| dc.title | Resource Optimization by Scheduling | en |
| dc.type | Thesis | en |