您的位置:首页 > 编程语言 > Java开发

Lock java synchronized sendlockCondition.await sendlockCondition.signal();

2018-02-07 00:00 711 查看
应付面试:面试管一般会问有过线程没有,你会在A的线程里面获取B线程的数据吗?

见图:(图1)



1.创建一个缓存池,用于线程管理

package test20140907.testthread3;

import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.Future;

public class ThreadPool {

private ThreadPool() {
}
private static ThreadPool instance;
public static ThreadPool getInstance() {
if (instance == null) {
instance = new ThreadPool();
}
return instance;
}

@SuppressWarnings("rawtypes")
static Future future =null;
static ExecutorService cachedService;

public void init() {
cachedService = Executors.newFixedThreadPool(1);
cachedService.execute(new RunableA());
}
class RunableA implements Runnable {

@Override
public void run() {
TaskFirst tf =new TaskFirst();
tf.getValue();
}

}

}


2.任务下发

package test20140907.testthread3;

import java.util.concurrent.TimeUnit;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;

public class TaskFirst {

static double d;

Lock sendlock = new ReentrantLock();
Condition sendlockCondition =sendlock.newCondition();

public void addValue(double doub){
sendlock.lock();
try {
sendlockCondition.await(5,TimeUnit.SECONDS);
} catch (InterruptedException e) {
e.printStackTrace();
}
System.out.println("getValue d: "+ d);
sendlock.unlock();
}

public void getValue(){
sendlock.lock();
try {
Thread.sleep(3000);
} catch (InterruptedException e) {
e.printStackTrace();
}
this.d= 5.5;
System.out.println("addValue d: "+ d);
sendlockCondition.signal();
sendlock.unlock();
}

}


3.测试 模拟一个执行任务的线程获取数据,该线程犹如网络延迟耗费3s 然后接收任务的线程等待5s 获取数据 完成一次同步的通讯

package test20140907.testthread3;

public class Test {

public static void main(String[] args) {
ThreadPool.getInstance().init();
TaskFirst tf =new TaskFirst();
tf.addValue(2);

}

}


捐助开发者

在兴趣的驱动下,写一个
免费
的东西,有欣喜,也还有汗水,希望你喜欢我的作品,同时也能支持一下。 当然,有钱捧个钱场(右上角的爱心标志,支持支付宝和PayPal捐助),没钱捧个人场,谢谢各位。







谢谢您的赞助,我会做的更好!
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息