java 多线程求和_Java多线程求和

package test;

import java.util.concurrent.*; import java.util.concurrent.locks.Lock; import java.util.concurrent.locks.ReentrantLock;

public class SumService {

private final Integer nthread;

private final ExecutorService executorService;

private final Lock lock;

private final CountDownLatch countDownLatch;

private Integer sum;

public SumService(){

this.sum = new Integer(0);

this.nthread = new Integer(100);

this.executorService = new ThreadPoolExecutor(10, nthread, 10L, TimeUnit.SECONDS, new ArrayBlockingQueue(nthread));

this.lock = new ReentrantLock();

this.countDownLatch = new CountDownLatch(nthread);

}

public Integer call() throws Exception{

for (int i = 0; i < nthread; i++) {

executorService.execute(()-> sum());

}

executorService.shutdown();

countDownLatch.await();

return sum;

}

private void sum(){

for (int i = 0; i < 10000; i++) {

lock.lock();

sum++;

lock.unlock();

}

countDownLatch.countDown();

}

public static void main(String[] args) throws Exception{

SumService sumService = new SumService();

Integer sum = sumService.call();

System.out.println(sum);

}

} `

来源:站长平台

标签:Java,求和,lock,sum,nthread,private,Integer,new,多线程

来源: https://www.cnblogs.com/1994july/p/12163944.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值