HEURISTICS BASED MULTI QUEUE JOB SCHEDULING FOR CLOUD COMPUTING ENVIRONMENT
| Autor: | V. Rajeshram, C. P. Shabariram |
|---|---|
| Rok vydání: | 2015 |
| Předmět: | |
| Zdroj: | International Journal of Research in Engineering and Technology. :163-166 |
| ISSN: | 2319-1163 2321-7308 |
| DOI: | 10.15623/ijret.2015.0405032 |
| Popis: | With the influx of large number of users, delivering the services to them and to meet their quality requirements is still challenging. Cloud computing is built upon the advancements of virtualization technology and distributed computing. Cloud computing itself is a grid computing with additional property of elasticity and scalability. Since cloud usually contains a heterogeneous pool of resources, scheduling plays a vital role in cloud computing. Scheduling in cloud computing denotes the execution of current jobs in a given constraint. QoS is inevitably needed to deal with scheduling in cloud computing environment. Efficient scheduling mechanism should meet the QoS parameters and should enhance resource utilization. Traditional scheduling algorithms such as FCFS, SJF, EASY, round robin and backfilling possesses fragmentation problem. The proposed heuristics based multi queue job scheduling method overcomes the problem of fragmentation by providing an on-demand strategy for scheduling. On-demand service provided by introducing priority. Priority is a comprehensive concept, computed based on QoS parameters. The proposed system, by considering the priority concept reduces the problem of fragmentation and also overcomes "starving to death" problem in scheduling. The proposed method thus can efficiently executes the user requirements and can manifest better performance. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|