当前位置:网站首页>Countdownlatch blocking wait for multithreading concurrency
Countdownlatch blocking wait for multithreading concurrency
2022-07-01 17:25:00 【It takes time for fish to find water】
1. brief introduction
CountDownLatch in count down It means to count down ,latch It's the latch 、 The meaning of locking . The whole meaning can be understood as the countdown bolt .CountDownLatch The same is true of , In the structure CountDownLatch You need to pass in an integer n( must >0), In this integer “ Reciprocal ” To 0 Before , The main thread needs to wait at the door , And this “ Reciprocal ” The process is driven by each execution thread , Each thread performs a task “ Reciprocal ” once . In conclusion ,CountDownLatch Wait for other threads to finish their tasks , If necessary, the execution results of each task can be summarized , Then the main thread continues to execute .
CountDownLatch There are two main ways :countDown() and await().countDown() Method is used to decrement the counter by one , It's generally a thread call to perform a task ,await() Method makes the thread calling the method wait , It is generally called by the main thread . What needs to be noted here is ,countDown() Method does not specify that a thread can only be called once , When the same thread is called multiple times countDown() When the method is used , Each time, the counter will be decremented by one ; in addition ,await() Method does not specify that only one thread can execute the method , If multiple threads execute at the same time await() Method , Then these threads will be in the waiting state , And share the same lock in shared mode .
2. Method API
Method :
| Method | explain |
|---|---|
| await() | Make the current thread enter the synchronization queue to wait , until latch The value of is reduced to 0 Or the current thread is interrupted , The current thread will be awakened . |
| await(long timeout, TimeUnit unit) | wait for timeout After time ,count The value of is not yet 0, No more waiting , Then we will continue |
| countDown() | send latch The value of the reduction 1, If it's down to 0, Will wake up all waiting in this latch On the thread . |
| getCount() | get latch The numerical . |
3. Use
3.1 await()
Example :
CountDownLatch count = new CountDownLatch(3);
new Thread(()->{
// Deal with business 1
try {
TimeUnit.SECONDS.sleep(2); } catch (InterruptedException e) {
e.printStackTrace(); } finally {
count.countDown();// Ensure that each task is performed in descending order
}
}, "t1").start();
new Thread(()->{
// Deal with business 2
try {
TimeUnit.SECONDS.sleep(3); } catch (InterruptedException e) {
e.printStackTrace(); } finally {
count.countDown();// Ensure that each task is performed in descending order
}
}, "t2").start();
new Thread(()->{
// Deal with business 3
try {
TimeUnit.SECONDS.sleep(3); } catch (InterruptedException e) {
e.printStackTrace(); } finally {
count.countDown(); // Ensure that each task is performed in descending order
}
}, "t3").start();
long startTime = System.currentTimeMillis();
count.await(); // Waiting for the task to execute
long endTime = System.currentTimeMillis();
System.out.println(" Task execution completed , Time consuming :" + (endTime - startTime) + " millisecond ");
result :

3.2 boolean await(long timeout, TimeUnit unit)
boolean await(long timeout, TimeUnit unit) Example :
CountDownLatch count = new CountDownLatch(3);
new Thread(()->{
// Deal with business 1
try {
TimeUnit.SECONDS.sleep(1);
System.out.println("task1 over");} catch (InterruptedException e) {
e.printStackTrace(); } finally {
count.countDown();// Ensure that each task is performed in descending order
}
}, "t1").start();
new Thread(()->{
// Deal with business 2
try {
TimeUnit.SECONDS.sleep(2);
System.out.println("task2 over");} catch (InterruptedException e) {
e.printStackTrace(); } finally {
count.countDown();// Ensure that each task is performed in descending order
}
}, "t2").start();
new Thread(()->{
// Deal with business 3
try {
TimeUnit.SECONDS.sleep(3);
System.out.println("task3 over");} catch (InterruptedException e) {
e.printStackTrace(); } finally {
count.countDown(); // Ensure that each task is performed in descending order
}
}, "t3").start();
long startTime = System.currentTimeMillis();
boolean await = count.await(2, TimeUnit.SECONDS);// Specify waiting time , If there are currently tasks that have not been completed, return false
System.out.println(" Whether all tasks have been completed :" + (await ? " yes " : " no "));
System.out.println(" The counter value is :" + count.getCount());
long endTime = System.currentTimeMillis();
System.out.println(" Task execution completed , Time consuming :" + (endTime - startTime) + " millisecond ");
analysis :
Start three threads to execute the task , Mission 1、 Mission 2、 Mission 3 The time-consuming sequence is 1s、2s、3s
Counter await wait for 2s, If 2s The post counter value is not 0( That is, there are three tasks that have not been completed ), So return false. It can be used in some time-consuming tasks , For example, call the third-party interface 、 The business line is relatively long , When the specified time is exceeded, it will be treated as a failure , Avoid that the service is always waiting for blocking .
result :

4. CountDownLatch and Thread.join() Differences in methods
1、
CountDownLatchOne or more threads are allowed to wait for other threads to complete the operation , It looks a bit likejoin()Method , But it provides more thanjoin()More flexible API.2、
CountDownLatchCan be manually controlled in the n Called in a thread n TimecountDown()Method to make the counter minus one , It can also be called in a threadn TimePerform minus one operation . andjoin()The implementation principle of is to keep checking join Is the thread alive , IfjoinThread survival makes the current thread wait forever . So the two are relatively differentCountDownLatchIt is more flexible to use .
5. CountDownLatch Deficiency
CountDownLatch yes Disposable Of , Calculator values can only be initialized once in a constructor , After that, there is no mechanism to set the value again , When CountDownLatch After use , It can't be used again .
6. Expand
If you use multithreaded asynchronous tasks Future, adopt CompletableFuture.allOf The same effect can be achieved , Block waiting for task execution results , Reference article Multithreading Future,CompletableFuture
边栏推荐
- 【Try to Hack】vulnhub DC4
- Research and investment strategy report of hydroxypropyl beta cyclodextrin industry in China (2022 Edition)
- ACL 2022 | 分解的元学习小样本命名实体识别
- Judge whether the binary tree is a binary search tree
- Research Report on development prediction and investment direction of nylon filament sewing thread in China (2022 Edition)
- Yyds dry inventory MySQL RC transaction isolation level implementation
- In depth evaluation and development trend prediction report of China's ice cream market (2022 Edition)
- DNS
- Girls who want to do software testing look here
- [mathematical modeling] [matlab] implementation of two-dimensional rectangular packing code
猜你喜欢

SystemVerilog structure (II)

C language input / output stream and file operation
![Integer array merge [JS]](/img/0d/70535e0eb1c299bda25159b58c70d7.png)
Integer array merge [JS]

Redis 分布式鎖

DNS

【splishsplash】关于如何在GUI和json上接收/显示用户参数、MVC模式和GenParam
![[Verilog quick start of Niuke network question brushing series] ~ priority encoder circuit ①](/img/24/23f6534e2c74724f9512c5b18661b6.png)
[Verilog quick start of Niuke network question brushing series] ~ priority encoder circuit ①

(28) Shape matching based on contour features

How to use etcd to realize distributed /etc directory

Petrv2: a unified framework for 3D perception of multi camera images
随机推荐
LeetCode中等题之TinyURL 的加密与解密
Integer array merge [JS]
【C语言补充】判断明天是哪一天(明天的日期)
Determine whether the linked list is a palindrome linked list
Redis distributed lock
[C language supplement] judge which day tomorrow is (tomorrow's date)
DNS
中国一次性卫生用品生产设备行业深度调研报告(2022版)
China biodegradable plastics market forecast and investment strategy report (2022 Edition)
中国乙腈市场预测与战略咨询研究报告(2022版)
(27) Open operation, close operation, morphological gradient, top hat, black hat
In aks, use secret in CSI driver mount key vault
中国酶制剂市场预测与投资战略研究报告(2022版)
深度优先遍历和广度优先遍历[通俗易懂]
(十六)ADC转换实验
两数之和c语言实现[通俗易懂]
阿里云李飞飞:中国云数据库在很多主流技术创新上已经领先国外
Redis 分布式鎖
GameFramework食用指南
英特尔开源深度学习工具库 OpenVINO,将加大与本土软硬件方合作,持续开放