Abstract—Cloud Computing refers to the concept of outsourcing the services, computational requirements and data storage to a centralized facility called “Cloud”. Cloud consists of an assemblage of virtualized resources, which include both computational and storage services that can be provisioned on demand, depending on the users’ necessities. Gang Scheduling is one of the most efficient algorithms for scheduling parallel jobs and is already functional in the extents of parallel and distributed systems. This paper associates the enactment of gang job scheduling algorithm in B2C electronic commerce architecture to calculate the total response time of the B2C EC architecture in public cloud, using combination of different queuing models. Results reveal the performance of job scheduling algorithm using each of the queuing models and suggestions are accomplished consequently.
Index Terms—M/G/1, G/M/1, M/M/2, M/M/m G/G/1, cloud computing, response time, gang scheduling algorithm.
Riktesh Srivastava is with Skyline University College Information Systems, UAE (e-mail: riktesh.srivastava@ gmail.com/ rsrivastava@skylineuniversity.com).
Cite: Riktesh Srivastava, "Evaluation of Response Time Using Gang Scheduling Algorithm for B2C Electronic Commerce Architecture Implemented in Cloud Computing Environment by Queuing Models," International Journal of Future Computer and Communication vol. 2, no. 2 pp. 71-75, 2013.
Copyright © 2008-2024. International Journal of Future Computer and Communication. All rights reserved.
E-mail: ijfcc@ejournal.net