当前位置:网站首页>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 .
边栏推荐
- Anaconda安装包 报错packagesNotFoundError: The following packages are not available from current channels:
- 2312、卖木头块 | 面试官与狂徒张三的那些事(leetcode,附思维导图 + 全部解法)
- 20220605数学:两数相除
- LeetCode 面试题 17.20. 连续中值(大顶堆+小顶堆)
- 20220531 Mathematics: Happy numbers
- 03 fastjason solves circular references
- CV learning notes - Stereo Vision (point cloud model, spin image, 3D reconstruction)
- Dynamic layout management
- Vscode markdown export PDF error
- 20220604数学:x的平方根
猜你喜欢

Retinaface: single stage dense face localization in the wild

LeetCode - 933 最近的请求次数

Octave instructions

LeetCode - 673. Number of longest increasing subsequences

openCV+dlib實現給蒙娜麗莎換臉

Matplotlib drawing

Opencv notes 17 template matching

openCV+dlib实现给蒙娜丽莎换脸

CV learning notes - Stereo Vision (point cloud model, spin image, 3D reconstruction)

Opencv feature extraction - hog
随机推荐
About windows and layout
[combinatorics] combinatorial existence theorem (three combinatorial existence theorems | finite poset decomposition theorem | Ramsey theorem | existence theorem of different representative systems |
Flutter 退出当前操作二次确认怎么做才更优雅?
The data read by pandas is saved to the MySQL database
4G module IMEI of charging pile design
Implementation of "quick start electronic" window dragging
CV learning notes - feature extraction
Connect Alibaba cloud servers in the form of key pairs
When the reference is assigned to auto
Discrete-event system
20220605数学:两数相除
yocto 技術分享第四期:自定義增加軟件包支持
Leetcode - 5 longest palindrome substring
20220606数学:分数到小数
Retinaface: single stage dense face localization in the wild
Leetcode-404: sum of left leaves
Development of intelligent charging pile (I): overview of the overall design of the system
Qcombox style settings
LeetCode - 706 设计哈希映射(设计) *
使用密钥对的形式连接阿里云服务器