zoukankan      html  css  js  c++  java
  • php版权重轮询调度算法

    2013-09-25

    <?php
          class WeightedRoundRobin
          {
          	private static $_weightArray = array();	
          	
          	private static $_i = -1;//代表上一次选择的服务器
          	private static $_gcd;//表示集合S中所有服务器权值的最大公约数
          	private static $_cw = 0;//当前调度的权值
          	private static $_max;
          	private static $_n;//agent个数
          	
          	public function __construct(array $weightArray)
          	{
          		self::$_weightArray = $weightArray;
          		self::$_gcd = self::getGcd(self::$_weightArray);
          		self::$_max = self::getMaxWeight(self::$_weightArray);
          		self::$_n = count($weightArray);
          	}
          	
          	private static function getGcd(array $weightArray)
          	{
          		$temp = array_shift($weightArray);
          		$min = $temp['weight'];
          		$status = false;
          		foreach ($weightArray as $val) {
          			$min = min($val['weight'],$min);
          		}
          		
          		if($min == 1){
          			return 1;
          		}else{

          			for ($i = $min; $i>1; $i--) {
          				 
          				foreach ($weightArray as $val) {
          					if (is_int($val['weight']/$i)) {
          						$status = true;
          					}else{
          						$status = false;
          						break;
          					}
          				}
          				if ($status) {
          					return $i;
          				}else {
          					return 1;
          				}
          				 
          			}
          		}
    
          	}
          	
          	private static  function getMaxWeight(array $weightArray)
          	{
          		if(empty($weightArray)){
          			return false;
          		}
          		$temp = array_shift($weightArray);
          		$max = $temp['weight'];
          		foreach ($weightArray as $val) {
          			$max = max($val['weight'],$max);         					
          		}      		
          		return $max;
          	}
          	
          	public function getWeight()
          	{
          		
          		while (true){
    
          			self::$_i = ((int)self::$_i+1) % (int)self::$_n;
          			
          			if (self::$_i == 0) {
          				
          				self::$_cw = (int)self::$_cw - (int)self::$_gcd;
          				if (self::$_cw <= 0) {
          					self::$_cw = (int)self::$_max;
          					
          					if (self::$_cw == 0) {
          						return null;
          					}
          				}
          			}
          			
          			if ((int)(self::$_weightArray[self::$_i]['weight']) >= self::$_cw) {
          				return self::$_weightArray[self::$_i];
          			}
          		}
          	}
    
          }
    ?>
    

      客户端代码:在thinkphp中实现

    <?php
    class IndexAction extends Action {
        public function index(){
            
            import("COM.WeightedRoundRobin");
            
            $arr = array(
                    array('id' => 'A', 'weight' => 3),
                    array('id' => 'B', 'weight' => 3),
                    array('id' => 'C', 'weight' => 6),
                    array('id' => 'D', 'weight' => 4),
                    array('id' => 'E', 'weight' => 1),
                    
            );
            $weight = new WeightedRoundRobin($arr);
            
            $a=0;
            $b=0;
            $c=0;
            $d=0;
            $e=0;
            for ($j = 0; $j < 100; $j++) {
                $weightInfo = $weight->getWeight();
                echo $weightInfo['id'].'----------------------weight:'.$weightInfo['weight'].'<br/>';
                if($weightInfo['id'] == 'A'){
                    $a++;
                }
                if($weightInfo['id'] == 'B'){
                    $b++;
                }
                if($weightInfo['id'] == 'C'){
                    $c++;
                }
                if($weightInfo['id'] == 'D'){
                    $d++;
                }
                if($weightInfo['id'] == 'E'){
                    $e++;
                }
            }
            echo 'A:'.$a.'<br/>';
            echo 'B:'.$b.'<br/>';
            echo 'C:'.$c.'<br/>';
            echo 'D:'.$d.'<br/>';
            echo 'E:'.$e.'<br/>';
            exit;
            $this->display();
        }
    }

    测试结果:

  • 相关阅读:
    Chunky Monkey(算法)
    Confirm the Ending(算法)
    Return Largest Numbers in Arrays(算法)
    防止SQL注入总结
    mybatis中的#和$的区别 以及 防止sql注入
    拆分字符串为树形结构
    虚拟机类加载机制
    linux加载字体
    项目上线暴露出的问题
    浅析正则表达式-应用篇
  • 原文地址:https://www.cnblogs.com/lovely/p/3338985.html
Copyright © 2011-2022 走看看