Swarm Based System for Management of Containerized Microservices in a Cloud Consisting of Heterogeneous Servers

Author(s):  
Waldemar Karwowski ◽  
Marian Rusek ◽  
Grzegorz Dwornicki ◽  
Arkadiusz Orłowski
2020 ◽  
Vol 11 (1) ◽  
pp. 149
Author(s):  
Wu-Chun Chung ◽  
Tsung-Lin Wu ◽  
Yi-Hsuan Lee ◽  
Kuo-Chan Huang ◽  
Hung-Chang Hsiao ◽  
...  

Resource allocation is vital for improving system performance in big data processing. The resource demand for various applications can be heterogeneous in cloud computing. Therefore, a resource gap occurs while some resource capacities are exhausted and other resource capacities on the same server are still available. This phenomenon is more apparent when the computing resources are more heterogeneous. Previous resource-allocation algorithms paid limited attention to this situation. When such an algorithm is applied to a server with heterogeneous resources, resource allocation may result in considerable resource wastage for the available but unused resources. To reduce resource wastage, a resource-allocation algorithm, called the minimizing resource gap (MRG) algorithm, for heterogeneous resources is proposed in this study. In MRG, the gap between resource usages for each server in cloud computing and the resource demands among various applications are considered. When an application is launched, MRG calculates resource usage and allocates resources to the server with the minimized usage gap to reduce the amount of available but unused resources. To demonstrate MRG performance, the MRG algorithm was implemented in Apache Spark. CPU- and memory-intensive applications were applied as benchmarks with different resource demands. Experimental results proved the superiority of the proposed MRG approach for improving the system utilization to reduce the overall completion time by up to 24.7% for heterogeneous servers in cloud computing.


2017 ◽  
Vol 49 (2) ◽  
pp. 603-628 ◽  
Author(s):  
Ramtin Pedarsani ◽  
Jean Walrand ◽  
Yuan Zhong

Abstract Modern processing networks often consist of heterogeneous servers with widely varying capabilities, and process job flows with complex structure and requirements. A major challenge in designing efficient scheduling policies in these networks is the lack of reliable estimates of system parameters, and an attractive approach for addressing this challenge is to design robust policies, i.e. policies that do not use system parameters such as arrival and/or service rates for making scheduling decisions. In this paper we propose a general framework for the design of robust policies. The main technical novelty is the use of a stochastic gradient projection method that reacts to queue-length changes in order to find a balanced allocation of service resources to incoming tasks. We illustrate our approach on two broad classes of processing systems, namely the flexible fork-join networks and the flexible queueing networks, and prove the rate stability of our proposed policies for these networks under nonrestrictive assumptions.


2018 ◽  
Vol 6 (1) ◽  
pp. 69-84
Author(s):  
Jia Xu ◽  
Liwei Liu ◽  
Taozeng Zhu

AbstractWe consider anM/M/2 queueing system with two-heterogeneous servers and multiple vacations. Customers arrive according to a Poisson process. However, customers become impatient when the system is on vacation. We obtain explicit expressions for the time dependent probabilities, mean and variance of the system size at timetby employing probability generating functions, continued fractions and properties of the modified Bessel functions. Finally, two special cases are provided.


Sign in / Sign up

Export Citation Format

Share Document