我们都知道,map是线程不安全的,那么我们如何才能实现一个线程安全的map呢?
这里介绍4种实现方式:
1、使用synchronized来进行约束:
synchronized(obj){
value = map.get(key);
}
2、使用JDK1.5版本所提供的lock机制,java.util.concurrent.locks.Lock:
lock.lock();
value = map.get(key);
lock.unlock();
3、使用JDK提供的读写锁java.util.concurrent.locks.ReadWriteLock:
rwlock.readLock().lock();
value= map.get(key);
rwlock.readLock().unlock();
这样两个读操作可以同时进行,理论上效率比lock要高;
4、使用JDK1.5提供的java.util.concurrent.ConcurrentHashMap,该类将Map的存储空间分为若干块,每块拥有自己的锁,减少了多个线程争夺同一个锁的情况:
value=map.get(key);其中,同步机制已经在get方法中实现。
以下是代码体现:
public class MapTest {
public static final int THREAD_COUNT = 1;
public static final int MAP_SIZE = 1000;
public static final int EXECUTION_MILLES = 1000;
public static final int[] KEYS = new int[100];
public static void main(String[] args) throws Exception {
// 初始化
Random rand = new Random();
for (int i = 0; i < KEYS.length; ++i)
KEYS[i] = rand.nextInt();
// 创建线程
long start = System.currentTimeMillis();
Thread[] threads = new Thread[THREAD_COUNT];
for (int i = 0; i < THREAD_COUNT; ++i) {
threads[i] = new SynchronizedThread();
// threads[i] = new LockThread();
threads[i].start();
}
// 等待其它线程执行若干时间
Thread.sleep(EXECUTION_MILLES);
// 统计 get 操作的次数
long sum = 0;
for (int i = 0; i < THREAD_COUNT; ++i) {
sum += threads[i].getClass().getDeclaredField("count")
.getLong(threads[i]);
}
long millisCost = System.currentTimeMillis() - start;
System.out.println(sum + "(" + (millisCost) + "ms)");
System.exit(0);
}
public static void fillMap(Map<Integer, Integer> map) {
Random rand = new Random();
for (int i = 0; i < MAP_SIZE; ++i) {
map.put(rand.nextInt(), rand.nextInt());
}
}
}
class SynchronizedThread extends Thread {
private static Map<Integer, Integer> map = new HashMap<Integer, Integer>();
public long count = 0;
static {
MapTest.fillMap(map);
}
public void run() {
for (;;) {
int index = (int) (count % MapTest.KEYS.length);
synchronized (SynchronizedThread.class) {
map.get(MapTest.KEYS[index]);
}
++count;
}
}
}
class LockThread extends Thread {
private static Map<Integer, Integer> map = new HashMap<Integer, Integer>();
private static Lock lock = new ReentrantLock();
public long count = 0;
static {
MapTest.fillMap(map);
}
public void run() {
for (;;) {
int index = (int) (count % MapTest.KEYS.length);
lock.lock();
map.get(MapTest.KEYS[index]);
lock.unlock();
++count;
}
}
}
文章来自于转载,请多多指教。