当前位置:网站首页>Synchronous vs asynchronous
Synchronous vs asynchronous
2022-07-03 10:13:00 【DadongDer】
There are two basic ways of message communication :
1、 Synchronization mode
Two communication application services must be synchronized , Both services must be running normally . Both sender and receiver must be running at all times , And be ready to communicate with each other at any time .
The sender first sends a request to the receiver , Call it sending messages , The sender will then block its current process , No communication and interaction with other applications , Wait for the response of the receiving program , After receiving the return message from the receiving program, the sending message will continue to run downward , Proceed to the next step of business processing .
2、 Asynchronous way
There is no need to wait online at the same time between two communication applications , Each party only needs to deal with its own business , For example, the sender does not need to log in to the receiver's response after sending the message , You can then deal with other tasks . That is to say, the sender and the receiver are independent of each other , The sender only cares about the sender , The receiver can only receive , There is no need to wait for the other party's response .
Java in JMS It is a typical asynchronous message processing mechanism ,JMS There are two types of messages : Point to point 、 Release / subscribe .
边栏推荐
- 20220604数学:x的平方根
- CV learning notes - scale invariant feature transformation (SIFT)
- Cases of OpenCV image enhancement
- LeetCode - 460 LFU 缓存(设计 - 哈希表+双向链表 哈希表+平衡二叉树(TreeSet))*
- Opencv gray histogram, histogram specification
- 1. Finite Markov Decision Process
- 20220608 other: evaluation of inverse Polish expression
- Leetcode-106:根据中后序遍历序列构造二叉树
- 20220606 Mathematics: fraction to decimal
- Opencv interview guide
猜你喜欢

Leetcode-112:路径总和

Leetcode 300 longest ascending subsequence

LeetCode - 1172 餐盘栈 (设计 - List + 小顶堆 + 栈))

Discrete-event system

Deep Reinforcement learning with PyTorch

LeetCode - 673. Number of longest increasing subsequences

Opencv+dlib to change the face of Mona Lisa

LeetCode - 895 最大频率栈(设计- 哈希表+优先队列 哈希表 + 栈) *

4.1 Temporal Differential of one step

Vgg16 migration learning source code
随机推荐
20220603数学:Pow(x,n)
20220601数学:阶乘后的零
Leetcode-513:找树的左下角值
Opencv image rotation
is_ power_ of_ 2 judge whether it is a multiple of 2
QT setting suspension button
Tensorflow built-in evaluation
CV learning notes - scale invariant feature transformation (SIFT)
4G module designed by charging pile obtains signal strength and quality
Wireshark use
CV learning notes alexnet
4G module at command communication package interface designed by charging pile
Leetcode-513: find the lower left corner value of the tree
01 business structure of imitation station B project
4G module board level control interface designed by charging pile
Swing transformer details-1
20220606 Mathematics: fraction to decimal
Leetcode-100:相同的树
The underlying principle of vector
Modelcheckpoint auto save model