Matchmaking System Design – Answering Frequently Asked Questions

简介: With the transformation of the financial services market, the demand for core technology for conducting financial transactions has grown.

Matchmaking_Image_2
With the transformation of the financial services market, the demand for core technology for conducting financial transactions has grown. The financial transaction model has changed from traditional manual bidding to matchmaking orders through an electronic transaction system. This article is a follow up article to the initial article which detailed the matchmaking technology architectural design, and aims to answer frequently asked questions on the topic.

FAQs

Q: On a hot standby mechanism. How can one ensure strong consistency of status on multiple machine memories?
A: All hot standby machines are stateless. The system deploys a group of matchmaking engines into a mutual standby matchmaking engine cluster. Additionally, there is only one matchmaking engine in service at any given time. When one of the operating matchmaking engines breaks down and cannot continue to work, the matchmaking engine cluster will quickly detect such faults and select a standby matchmaking engine to take over the task of the faulty matchmaking engine. Multi-machine hot standby technology behaves like a standby technology to resolve the temporary fault of the server.
Q: If one adds a new matchmaking engine, how can we judge that the synchronization of all matchmaking data into the new engine has occurred?
A: Ideally, the engine writes the raid document system into the commission sheet so that one can retrieve the data in case of a new matchmaking engine.
Q: According to your description, is it true that a cluster shall at least be fitted with three matchmaking engines to judge if the matchmaking engine breaks down?
A: The matchmaking progress shall be monitored by risk control process.
Q: Which one do the memory state machine replicate, the results or the data?
A: The data. It means to replicate the data with a certain status.
Q: If there are only two matchmaking engines and we discover that the results are inconsistent with a buying order. How can we judge which is the faulty engine?
A: Only one machine conducts matchmaking. It writes back to the database, produces a quotation and distributes to each terminal only after the completion of matchmaking. After that the user can check if the system has executed their commission sheet.

目录
相关文章
|
机器学习/深度学习 编解码 人工智能
Reading Notes: Human-Computer Interaction System: A Survey of Talking-Head Generation
由于人工智能的快速发展,虚拟人被广泛应用于各种行业,包括个人辅助、智能客户服务和在线教育。拟人化的数字人可以快速与人接触,并在人机交互中增强用户体验。因此,我们设计了人机交互系统框架,包括语音识别、文本到语音、对话系统和虚拟人生成。接下来,我们通过虚拟人深度生成框架对Talking-Head Generation视频生成模型进行了分类。同时,我们系统地回顾了过去五年来在有声头部视频生成方面的技术进步和趋势,强调了关键工作并总结了数据集。 对于有关于Talking-Head Generation的方法,这是一篇比较好的综述,我想着整理一下里面比较重要的部分,大概了解近几年对虚拟人工作的一些发展和
|
8月前
|
存储 自然语言处理 数据可视化
【提示学习】AUTOPROMPT: Eliciting Knowledge from Language Models with Automatically Generated Prompts
Prompt任务需要构建合适的Pattern,但是编写合适的Pattern需要手动工作和人为猜测,有很大的不确定性。为了解决这个问题,提出AUTOPROMPT模型,基于梯度下降搜索来创建Pattern。
|
XML 数据格式
Some more technical details about SAP note
I use this note 2184333 which I am responsible for as an example:
Some more technical details about SAP note
|
SQL 编译器 API
Efficiently Compiling Efficient Query Plans for Modern Hardware 论文解读
这应该是SQL查询编译的一篇经典文章了,作者是著名的Thomas Neumann,主要讲解了TUM的HyPer数据库中对于CodeGen的应用。 在morsel-driven那篇paper 中,介绍了HyPer的整个执行框架,会以task为单位处理一个morsel的数据,而执行的处理逻辑(一个pipeline job)就被编译为一个函数。这篇paper则具体讲如何实现动态编译。
390 0
Efficiently Compiling Efficient Query Plans for Modern Hardware 论文解读
|
CDN
Building an Industry Information Website
Object Storage Server (OSS) is a massive, secure, low-cost and highly reliable distributed storage service offered by Alibaba Cloud.
1539 0
Building an Industry Information Website
lecture 3.2 problem set 3
"Radioactive decay" is the process by which an unstable atom loses energy and emits ionizing particles - what is commonly refered to as radiation.
1099 0
lecture 2.2 problem set 1 and 2
1 COUNTING VOWELS   (10/10 分数) Assume s is a string of lower case characters.
1022 0
|
人工智能 自然语言处理 搜索推荐