|
|
Bimonthly Since 1986 |
ISSN 1004-9037
|
|
|
|
|
Publication Details |
Edited by: Editorial Board of Journal of Data Acquisition and Processing
P.O. Box 2704, Beijing 100190, P.R. China
Sponsored by: Institute of Computing Technology, CAS & China Computer Federation
Undertaken by: Institute of Computing Technology, CAS
Published by: SCIENCE PRESS, BEIJING, CHINA
Distributed by:
China: All Local Post Offices
|
|
|
|
|
|
|
|
|
|
Abstract
Cloud computing is a new distributed computing technology that allows for a pay-per-use model based on user demand and requirements. A cloud is a collection of virtual machines that includes both computational and storage capabilities. Cloud computing's primary goal is to provide efficient access to remote and geographically distributed resources. The cloud is evolving at a rapid pace and faces numerous challenges, one of which is scheduling. Scheduling is a set of policies that control the order in which work is performed by a computer system. A good scheduler adapts their scheduling strategy to the changing environment and task type. In this paper, we presented a Generalized Priority algorithm for efficient task execution and compared it to FCFS and Round Robin Scheduling.The algorithm should be tested in the cloud Sim toolkit, and the results show that it outperforms other traditional scheduling algorithms.
Keyword
Virtual Machine, Scheduling, CloudComputing
PDF Download (click here)
|
|
|
|
|