|
|
Adaptation of johnson sequencing algorithm for job scheduling to minimise the average waiting time in cloud computing environment
|
|
|
|
|
نویسنده
|
pal s. ,pattnaik p.k.
|
منبع
|
journal of engineering science and technology - 2016 - دوره : 11 - شماره : 9 - صفحه:1282 -1295
|
چکیده
|
Cloud computing is an emerging paradigm of internet-centric business computing where cloud service providers (csps) are providing services to the customer according to their needs. the key perception behind cloud computing is on-demand sharing of resources available in the resource pool provided by csp,which implies new emerging business model. the resources are provisioned when jobs arrive. the job scheduling and minimization of waiting time are the challenging issue in cloud computing. when a large number of jobs are requested,they have to wait for getting allocated to the servers which in turn may increase the queue length and also waiting time. this paper includes system design for implementation which is concerned with johnson scheduling algorithm that provides the optimal sequence. with that sequence,service times can be obtained. the waiting time and queue length can be reduced using queuing model with multi-server and finite capacity which improves the job scheduling model. © school of engineering,taylor’s university.
|
کلیدواژه
|
Cloud broker; Cloud computing; Job scheduling; Queuing model
|
آدرس
|
school of computer engineering,kiit university,campus 15, India, school of computer engineering,kiit university,campus 15, India
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|