java 想成中的Master-Worker模式

Master-Worker模式是常用的并行模式，他的核心思想是，系统由两类进程写作工作：
Master进程和Worker进程。Master进程负责接收和分配任务，Worker进程负责处理子任务。当各个Worker进程将子任务处理完成后，将结果返回给Master进程，由Master进程进行汇总和归纳，从而得到系统的最终处理结果。

Master类

public class Master {

    // 任务队列
    protected Queue<Object> workQueue = new ConcurrentLinkedQueue<Object>();
    // worker进程队列
    protected Map<String, Thread> threadMap = new HashMap<String, Thread>();
    // 子任务处理结果集
    protected Map<String, Object> resultMap = new ConcurrentHashMap<String, Object>();

    // 判断是否所有的子任务都结束了
    public boolean isComplete() {
        for (Map.Entry<String, Thread> entry : threadMap.entrySet()) {
            if (entry.getValue().getState() != Thread.State.TERMINATED) {
                return false;
            }
        }
        return true;
    }

    // Master的构造函数，需要一个Worker的进程逻辑和Worker的进程数量
    public Master(Worker worker, int countWorker) {
        worker.setWorkQueue(workQueue);
        worker.setResultMap(resultMap);
        for (int i = 0; i < countWorker; i++) {
            threadMap.put(Integer.toString(i), new Thread(worker, Integer.toString(i)));
        }
    }

    // 提交任务
    public void submit(Object job) {
        workQueue.add(job);
    }

    // 返回任务结果集
    public Map<String, Object> getResultMap() {
        return resultMap;
    }

    // 开始运行所有的worker进程，进行处理
    public void execute() {
        for (Map.Entry<String, Thread> entry : threadMap.entrySet()) {
            entry.getValue().start();
        }
    }


}

Worker类

public class Worker implements Runnable {

    //任务队列，由于取得任务
    protected Queue<Object> workQueue;
    //子任务处理结果集
    protected Map<String, Object> resultMap;



    public void setWorkQueue(Queue<Object> workQueue) {
        this.workQueue = workQueue;
    }



    public void setResultMap(Map<String, Object> resultMap) {
        this.resultMap = resultMap;
    }

    //子任务的处理逻辑，在子类中实现具体的逻辑
    public Object handle(Object input){
        return input;
    }

    /**
     * 
     * @see java.lang.Runnable#run()
     */
    @Override
    public void run() {

        while(true){
            Object input=workQueue.poll();
            if(input==null){
                break;
            }else{
                Object re=handle(input);
                //将处理的结果写入结果集中
                resultMap.put(Integer.toString(input.hashCode()), re);
            }
        }
    }

}

Worker具体实现类

public class PlusWorker extends Worker {

    public Object handle(Object obj){
        Integer i=(Integer) obj;
        return i*i*i;
    }
}

处理一个求0-n的立方和问题

public class TestMasterWorker {

    /**
     * @param args
     */
    public static void main(String[] args) {

        long begin=System.currentTimeMillis();
        masterTest();
        System.out.println((System.currentTimeMillis()-begin)/1000);
    }

    public static void masterTest() {

        // 创建Master
        Master master = new Master(new PlusWorker(), 5);
        for (int i = 0; i < 100000; i++) {
            master.submit(i);
        }

        master.execute();

        int re = 0;
        Map<String, Object> resultMap = master.getResultMap();
        while (resultMap.size() > 0 || !master.isComplete()) {
            Set<String> keys = resultMap.keySet();
            String key = null;
            for (String k : keys) {
                key = k;
                break;
            }

            Integer i = null;
            if (key != null) {
                i = (Integer) resultMap.get(key);
            }

            if (i != null) {
                re += i;
            }

            if (key != null) {
                resultMap.remove(key);// 移除已经被计算过的项
            }

        }
        System.out.println("master" + re);
    }

    public static void testPlus() {
        int re = 0;
        for (int i = 0; i < 100000; i++) {
            re += i * i * i;
        }
        System.out.println("testPlus:" + re);
    }