2009 ◽  
Vol 29 (5) ◽  
pp. 1204-1207
Author(s):  
Hong-xia ZHANG ◽  
Ju-feng DAI

Author(s):  
Muhammad Aliyu ◽  
Murali M. ◽  
Abdulsalam Y. Gital ◽  
Souley Boukari ◽  
Rumana Kabir ◽  
...  

As cloud resource demand grows, supply chain management (SCM), which is the core function of cloud computing, faces serious challenges. Quite a number of techniques have been proposed by many researchers for such a challenge. As such, numerous proposed strategies are still under reckoning and modification so as to enhance its potential. An optimized dynamic scheme that combined several algorithms' characteristics was proposed to map out such a challenge. The hybridized proposed scheme involved the meta-heuristic swarm mechanism of ant colony optimization (ACO) and deterministic spanning tree (SPT) algorithm as it obtained faster convergence chain, ensured resource utilization in least time and cost. Extensive experiments conducted in cloudsim simulator provided an efficient result in terms of minimized makespan time and throughput as compared to SPT, round robin (RR), and pre-emptive fair scheduling algorithm (PFSA) as it significantly improves performance.


2013 ◽  
Vol 347-350 ◽  
pp. 2203-2207 ◽  
Author(s):  
Yong He ◽  
Lei Gao ◽  
Gui Kai Liu ◽  
Yu Zhen Liu

This paper puts forward a new dynamic round-robin (DYRR) packet scheduling algorithm with high efficiency and good fairness. DYRR algorithm introduces dynamic round-robin concept, that is, the allowance given to each of the flows in a given round is not fixed, but is related with the number of bytes sent of this and other flows of the last round scheduling. The time complexity of the DYRR algorithm is O(1). Results from performance simulation analysis shows that DYRR algorithm can effectively smooth output burst, realize fair scheduling, and have a good time delay characteristic.


Sign in / Sign up

Export Citation Format

Share Document