玩转并发-单线程执行设计模式

概述

Single Thread Execution模式是指同一时刻只能有一个线程去访问共享资源，就像独木桥一次通过一个人一样。简单来说，Single Thread Execution就是采用排他式操作保证同一时刻只能有一个线程访问共享资源。

---

有一个门始终只能一个人通过

先写个线程不安全的栗子：

package com.Reyco.MyThread;

public class Gate {
	private int count=0;
	private String name="Nobody";
	private String address="Nowhere";
	
	//门通过
	public void pass(String name,String address) {
		this.name=name;
		this.address=address;
		count++;
		verify();
	}
	
	//校验
	private void verify() {
		if(this.name.charAt(0)!=this.address.charAt(0)) {
			System.out.println("================");
			System.out.println("broken"+toString());
		}
	}
	
	@Override
	public String toString() {
		return "NO."+count+":"+name+address;
	}
}


public class Person	extends Thread{
	private final String name;
	private final String address;
	private final Gate gate;
	
	public Person(String name, String address, Gate gate) {
		this.name = name;
		this.address = address;
		this.gate = gate;
	}
	
	@Override
	public void run() {
		System.out.println(name+"Begin!");
		while(true) {
			this.gate.pass(name, address);
		}
	}
}

测试类：

public static void main(String[] args) {
		Gate gate = new Gate();
		Person person1 = new Person("Beyco","Beijing",gate);
		Person person2 = new Person("Gbenl","Guangzhou",gate);
		Person person3 = new Person("Seyco","Shenzhen",gate);
		
		person1.start();
		person2.start();
		person3.start();
	}

打印结果：

brokenNO.1112588:BeycoBeijing
================
brokenNO.1113089:BeycoShenzhen
================
brokenNO.1113562:BeycoShenzhen

我们发现id顺序发生错误，且name和address不匹配；即使name和address首字母相同，仍然发生broke。其实这两个现象很好解释，比如A线程传入参数Beyco和Beijing，当向pass方法传入Beyco时，A线程被B线程打断，B线程传入Shenzhen，此时verify自然就broke；另一种情况是，继前面一种情况之后，此时参数已经是Beyco和Shenzhen，在准备toString时，B线程又将address传入实参Beijing，所以就出现了首字母相同还是broke的情况。
解决方法很简单：将pass方法和toString方法同步即可

public synchronized String toString() {
		return "NO."+count+":"+name+address;
	}
/**
	 * 临界值
	 * @param name
	 * @param address
	 */
	public synchronized void pass(String name,String address) {
		//线程竞争
		this.name=name;
		this.address=address;
		count++;
		verify();
	}