架构之路--多线程下的设计模式 Master worker并行计算模式

这里面有两个重要角色：Master 、 Worker

Master 负责接收和分配任务 ； Worker 负责处理从master分配过来的子任务。

如图：多个客户端发送请求，master处理器接收请求并分组处理，分发给多个worker线程去执行。

下面通过一个小例子看一下：

目录结构如下：

Master类：

import java.util.HashMap;
import java.util.Map;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.ConcurrentLinkedQueue;
/**
 * Master 控制器（接收和分配任务）
 * @author Administrator
 *
 */
public class Master {

//承装任务的集合
private ConcurrentLinkedQueue<Task> workQueue = new ConcurrentLinkedQueue<>();  
//承装所有worker对象
private HashMap<String, Thread> workers = new HashMap<String,Thread>();
//承转并发处理任务的结果集
private ConcurrentHashMap<String, Object> resultMap = new ConcurrentHashMap<String,Object>();

public Master(Worker worker, int workerCount){
//每一个worker对象都需要ConcurrentLinkedQueue<Task>的引用
worker.setWorkerQueue(this.workQueue);
//每一个worker对象都需要ConcurrentHashMap<String, Object>的引用
worker.setResultMap(this.resultMap);
for (int i = 0; i < workerCount; i++) {
workers.put("子节点" + Integer.toString(i), new Thread(worker));
System.out.println("子节点" + i + "启动");
}
}
//提交方法
public void submit(Task task){
this.workQueue.add(task);
}

//执行方法，启动worker，让所有worker工作
public void execute(){
for (Map.Entry<String, Thread> me : workers.entrySet() ) {
me.getValue().start();
}
}

//判断线程是否执行完毕
public boolean isComplete(){
for (Map.Entry<String, Thread> me:workers.entrySet()) {
if(me.getValue().getState() != Thread.State.TERMINATED){
return false;
}
}
return true;
}
//返回结果集合
public int getResult(){
int ret = 0;
for (Map.Entry<String, Object> me : resultMap.entrySet()) {
ret +=(Integer)me.getValue();
}
return ret;
}
}

Worker类

import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.ConcurrentLinkedQueue;


public class Worker implements Runnable{


private ConcurrentLinkedQueue<Task> workQueue;
private ConcurrentHashMap<String, Object> resultMap;

@Override
public void run() {
while(true){
Task input = this.workQueue.poll();
if(input == null){
break;
}
Object output = handle(input);
this.resultMap.put(Integer.toString(input.getId()), output);
}
}

private Object handle(Task input){
Object output = null;
try {
Thread.sleep(500);
output = input.getPrice();
} catch (Exception e) {
e.printStackTrace();
}
return output;
}


public void setWorkerQueue(ConcurrentLinkedQueue<Task> workQueue) {
this.workQueue = workQueue;
}

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


}

Task任务类
 
public class Task {
private int id;
private String name;
private int price;
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getPrice() {
return price;
}
public void setPrice(int price) {
this.price = price;
}
}

测试类


import java.util.Random;


public class Test {


public static void main(String[] args) {

Master master = new Master(new Worker(), 10);

Random r = new Random();
for (int i = 0; i <= 100; i++) {
Task task = new Task();
task.setId(i);
task.setName("任务"+i);
task.setPrice(r.nextInt(1000));
//System.out.println("任务队列" + task.getId() + "生成");
master.submit(task);
}
master.execute();

long start = System.currentTimeMillis();

while(true){
if(master.isComplete()){
long end = System.currentTimeMillis() - start;
int ret = master.getResult();
System.out.println("最终结果：" +ret +", 执行耗时："+end);
break;
}
}
}
}

运行结果：