当前位置:网站首页>Condition and AQS principle
Condition and AQS principle
2022-07-06 01:10:00 【@Overstep】
Condition brief introduction
Any one of them java Objects are all inherited from Object class , Communication between online programs is often applied to Object Several methods of , such as wait(),wait(long timeout),wait(long timeout, int nanos) And notify(),notifyAll() Several ways to implement wait / A notification mechanism , alike , stay java Lock Under the system, there will still be the same way to achieve waiting / A notification mechanism . On the whole Object Of wait and notify/notify It is to cooperate with the object monitor to complete the inter thread waiting / A notification mechanism , and Condition And Lock Cooperate with the completion waiting notification mechanism , The former is java At the bottom level , The latter is at the language level , It has higher controllability and expansibility . The two are different in use , There are still many differences in functional features :
- Condition Can support no response interrupt , But by using Object The way doesn't support ;
- Condition Can support multiple waiting queues (new Multiple Condition object ), and Object Only one... Can be supported ;
- Condition It can support the setting of timeout time , and Object I won't support it
Condition analysis :
(1)Condition The essence of waiting for notification is waiting queue and The interactive process of synchronizing queues , Follow object Of wait()/notify() The mechanism is the same ;Condition Based on synchronous lock state Realized , and objec Is based on monitor Pattern implementation .
(2) One lock(AQS) There can be multiple Condition, That is, multiple waiting queues , There is only one synchronization queue .
(3)Condition.await() Method execution , Will synchronize the... In the queue head Lock released , Encapsulate threads into new node Add to the waiting queue ;Condition.signal() Method execution , The first node in the waiting queue will be moved to the synchronization queue , Until the lock state It's only when you get it that you wake up .
AQS Principle Overview
It's a framework for building locks and synchronizers , Use AQS A large number of synchronizers can be constructed simply and efficiently
AQS The core idea is , If the requested shared resource is free , Set the thread of the current request resource to a valid worker thread , And set the shared resources to the locked state . If the requested shared resource is occupied , Then we need a set of mechanism for thread blocking waiting and lock allocation when it is awakened , This mechanism AQS Yes, it is CLH The implementation of queue lock , Join the queue with the thread temporarily unable to acquire the lock .
CLH(Craig,Landin,andHagersten) A queue is a virtual two-way queue ( Virtual two-way queue means there is no queue instance , There is only an association between nodes ).AQS It is to encapsulate each thread requesting shared resources into a CLH A node in a lock queue (Node) To achieve lock allocation .
AQS Define two ways to share resources
1)Exclusive( Monopoly )
Only one thread can execute , Such as ReentrantLock. It can be divided into fair lock and unfair lock ,ReentrantLock Two locks are supported at the same time , Let's say ReentrantLock Introduce the definition of these two kinds of locks :
- Fair lock : In the order in which threads are queued in the queue , First come, first get the lock
- Not fair lock : When a thread wants to acquire a lock , Pass it twice first CAS Operate to grab the lock , If you don't get , The current thread then joins the queue waiting for wakeup .
2)Share( share )
边栏推荐
- Beginner redis
- Obstacle detection
- Three methods of script about login and cookies
- MIT博士论文 | 使用神经符号学习的鲁棒可靠智能系统
- Questions about database: (5) query the barcode, location and reader number of each book in the inventory table
- Interview must brush algorithm top101 backtracking article top34
- Finding the nearest common ancestor of binary search tree by recursion
- Dede collection plug-in free collection release push plug-in
- 可恢复保险丝特性测试
- MIT doctoral thesis | robust and reliable intelligent system using neural symbol learning
猜你喜欢
Cf:d. insert a progression [about the insert in the array + the nature of absolute value + greedy top-down]
[groovy] compile time meta programming (compile time method interception | method interception in myasttransformation visit method)
Cve-2017-11882 reappearance
Installation and use of esxi
[pat (basic level) practice] - [simple mathematics] 1062 simplest fraction
[groovy] JSON serialization (jsonbuilder builder | generates JSON string with root node name | generates JSON string without root node name)
Who knows how to modify the data type accuracy of the columns in the database table of Damon
[groovy] XML serialization (use markupbuilder to generate XML data | create sub tags under tag closures | use markupbuilderhelper to add XML comments)
测试/开发程序员的成长路线,全局思考问题的问题......
Some features of ECMAScript
随机推荐
记一个 @nestjs/typeorm^8.1.4 版本不能获取.env选项问题
Opinions on softmax function
Finding the nearest common ancestor of binary tree by recursion
有谁知道 达梦数据库表的列的数据类型 精度怎么修改呀
JMeter BeanShell的基本用法 一下语法只能在beanshell中使用
[groovy] JSON serialization (jsonbuilder builder | generates JSON string with root node name | generates JSON string without root node name)
Interview must brush algorithm top101 backtracking article top34
孤勇者
看抖音直播Beyond演唱会有感
For a deadline, the IT fellow graduated from Tsinghua suddenly died on the toilet
Blue Bridge Cup embedded stm32g431 - the real topic and code of the eighth provincial competition
MIT博士论文 | 使用神经符号学习的鲁棒可靠智能系统
Mlsys 2020 | fedprox: Federation optimization of heterogeneous networks
Hundreds of lines of code to implement a JSON parser
[Arduino syntax - structure]
Cf:c. the third problem
KDD 2022 | 脑电AI助力癫痫疾病诊断
Four dimensional matrix, flip (including mirror image), rotation, world coordinates and local coordinates
Intensive learning weekly, issue 52: depth cuprl, distspectrl & double deep q-network
Pbootcms plug-in automatically collects fake original free plug-ins