A dynamic priority scheduling algorithm on service request scheduling in cloud computing

Author(s):  
Zhongyuan Lee ◽  
Ying Wang ◽  
Wen Zhou
2020 ◽  
Vol 2 (1) ◽  
pp. 29-35
Author(s):  
Rizki Setyawati ◽  
Adam Bachtiar Maulachela

Queue is a condition where the number of service recipients is higher than the number ofservice providers. This condition can cause a buildup of service recipients, and eventually,bottlenecks will occur. It faced by all service organizations that focus on service to customers.No exception is a car wash business whose business processes focus on providing fast andquality car wash services. But unfortunately, many car wash businesses get complaints fromcustomers, especially related to the queue buildup and unclear queue information received bycustomers. Therefore this study aims to produce a mobile-based car wash queue application,which includes a dynamic priority scheduling algorithm that functions as a queue manager.To carry out these objectives, a research methodology that is sequential and iterative used,namely, the software development methodology using the Rapid Application Development(RAD) model. This model consists of four phases: planning needs, prototype development,system development, and finally, testing. The Application test is finished with two approaches,namely testing of application code, specifically the application of dynamic priority schedulingalgorithm and testing of the overall functional system. From the test results, it knows that thecar wash queue application managed to sort customer orders based on the specified priorityrules based on the distance and time of the law. While the results of testing the systemfunctionality show that the application successfully manages a variety of errors, both causedby system failures and due to human error.


Author(s):  
Sarita Simaiya ◽  
Vinay Gautam ◽  
Umesh Kumar Lilhore ◽  
Atul Garg ◽  
Pinaki Ghosh ◽  
...  

2017 ◽  
Vol 29 (18) ◽  
pp. e4167 ◽  
Author(s):  
Rongbin Xu ◽  
Yeguo Wang ◽  
Wei Huang ◽  
Dong Yuan ◽  
Ying Xie ◽  
...  

2014 ◽  
Vol 538 ◽  
pp. 512-515
Author(s):  
Feng Song Li ◽  
Yuan Sheng Lou

For the issues of quality of service (QoS) in the cloud computing raised by users, this paper proposes a strategy for QoS classification and builds tasks' priority function modeling and through priority scheduling tasks, assigning tasks to the reasonable resources, and finally to complete the task efficiently, improve the utilization of resources.


2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Ye-In Seol ◽  
Young-Kuk Kim

Power-aware scheduling reduces CPU energy consumption in hard real-time systems through dynamic voltage scaling (DVS). In this paper, we deal with pinwheel task model which is known as static and predictable task model and could be applied to various embedded or ubiquitous systems. In pinwheel task model, each task’s priority is static and its execution sequence could be predetermined. There have been many static approaches to power-aware scheduling in pinwheel task model. But, in this paper, we will show that the dynamic priority scheduling results in power-aware scheduling could be applied to pinwheel task model. This method is more effective than adopting the previous static priority scheduling methods in saving energy consumption and, for the system being still static, it is more tractable and applicable to small sized embedded or ubiquitous computing. Also, we introduce a novel power-aware scheduling algorithm which exploits all slacks under preemptive earliest-deadline first scheduling which is optimal in uniprocessor system. The dynamic priority method presented in this paper could be applied directly to static systems of pinwheel task model. The simulation results show that the proposed algorithm with the algorithmic complexity ofO(n) reduces the energy consumption by 10–80% over the existing algorithms.


Sign in / Sign up

Export Citation Format

Share Document