WO2019001256A1 - Procédé et appareil de traitement de données à haute concordance et support d'informations lisible par ordinateur - Google Patents

Procédé et appareil de traitement de données à haute concordance et support d'informations lisible par ordinateur Download PDF

Info

Publication number
WO2019001256A1
WO2019001256A1 PCT/CN2018/090692 CN2018090692W WO2019001256A1 WO 2019001256 A1 WO2019001256 A1 WO 2019001256A1 CN 2018090692 W CN2018090692 W CN 2018090692W WO 2019001256 A1 WO2019001256 A1 WO 2019001256A1
Authority
WO
WIPO (PCT)
Prior art keywords
message
data processing
message queue
high concurrent
concurrent data
Prior art date
Application number
PCT/CN2018/090692
Other languages
English (en)
Chinese (zh)
Inventor
刘四根
Original Assignee
平安科技（深圳）有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 平安科技（深圳）有限公司 filed Critical 平安科技（深圳）有限公司
Publication of WO2019001256A1 publication Critical patent/WO2019001256A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/0601—Electronic shopping [e-shopping]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/0601—Electronic shopping [e-shopping]
    • G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
    • G06Q30/0635—Processing of requisition or of purchase orders
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/56—Queue scheduling implementing delay-aware scheduling
    • H04L47/562—Attaching a time tag to queues
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources

Definitions

  • the present application relates to data processing technologies, and in particular, to a high concurrent data processing method, apparatus, and computer readable storage medium.
  • the present application provides a high concurrent data processing method, apparatus, and computer readable storage medium, the main purpose of which is to reduce the concurrent pressure of the server, thereby ensuring the availability and throughput of the application system.
  • the present application provides a high concurrent data processing method, which is applied to a data processing apparatus, and the method includes:
  • Receiving step receiving an access request sent by the client
  • Queue management step storing the received access request as a message to the message queue
  • the first processing step calling a preset number of threads to process the message in the message queue, reading the relevant data from the database, and feeding back the processing result to the client.
  • the present application also provides a high concurrent data processing method, which is applied to a data processing apparatus, and the method includes:
  • Receiving step receiving an access request sent by the client
  • Queue management step storing the received access request in a message manner to the message queue
  • Request merge step merge the same message in the message queue with the same access request to form multiple message groups
  • the second processing step calling a preset number of threads to process the plurality of message groups, reading related data from the database, and feeding back the processing result to the client.
  • the present application provides a high concurrent data processing apparatus, the apparatus comprising a memory, a processor, and a high concurrent data processing system stored on the memory and operable on the processor, the high concurrent data processing system
  • the method includes: a receiving module, a queue management module, and a first processing module.
  • Receiving step receiving an access request sent by the client
  • Queue management step storing the received access request as a message to the message queue
  • the first processing step calling a preset number of threads to process the message in the message queue, reading the relevant data from the database, and feeding back the processing result to the client.
  • the present application also provides a high concurrent data processing apparatus, the apparatus comprising a memory, a processor, and a high concurrent data processing system stored on the memory and operable on the processor, the high concurrent data processing system comprising : a receiving module, a queue management module, a request combining module, and a second processing module.
  • Receiving step receiving an access request sent by the client
  • Queue management step storing the received access request in a message manner to the message queue
  • Request merge step merge the same message in the message queue with the same access request to form multiple message groups
  • the second processing step calling a preset number of threads to process the plurality of message groups, reading related data from the database, and feeding back the processing result to the client.
  • the present application also provides a computer readable storage medium storing a high concurrent data processing system, the high concurrent data processing system being executable by at least one processor to implement the following steps:
  • Receiving step receiving an access request sent by the client
  • Queue management step storing the received access request as a message to the message queue
  • the first processing step invoking a preset number of threads to process the message in the message queue, reading the relevant data from the database, and feeding back the processing result to the client.
  • the application further provides a computer readable storage medium storing a high concurrent data processing system, the high concurrent data processing system being executable by at least one processor to implement the following steps:
  • Receiving step receiving an access request sent by the client
  • Queue management step storing the received access request in a message manner to the message queue
  • Request merge step merge the same message in the message queue with the same access request to form multiple message groups
  • the second processing step calling a preset number of threads to process the plurality of message groups, reading related data from the database, and feeding back the processing result to the client.
  • the high concurrent data processing method, apparatus and computer readable storage medium use an asynchronous queue to manage client data access requests, merge the same data access requests, and call a preset number.
  • the thread processes the message in the message queue, so that when the server receives a large amount of data access requests at the same time, the concurrent pressure of the server can be effectively reduced, the time for the end user to participate in the interface interaction is saved, and the computing resources of the server are fully utilized. Reduce the interaction between users under high load to ensure the availability and throughput of the application system.
  • FIG. 1 is a schematic diagram of a preferred embodiment of a high concurrent data processing apparatus of the present application.
  • FIG. 2 is a block diagram of a preferred embodiment of a high concurrent data processing system of the present application.
  • FIG. 3 is a block diagram of another preferred embodiment of the high concurrent data processing system of the present application.
  • FIG. 4 is a flow chart of a preferred embodiment of a high concurrent data processing method of the present application.
  • FIG. 5 is a flowchart of another preferred embodiment of a high concurrent data processing method of the present application.
  • FIG. 1 it is an exemplary diagram of a preferred embodiment of the high concurrent data processing apparatus 1 of the present application.
  • the high concurrent data processing apparatus 1 includes a memory 11, a processor 12, a communication bus 13, and a high concurrent data processing system 10 stored on the memory 11 and operable on the processor 12, the apparatus 1
  • the network 2 is connected to one or more clients 3 and is communicatively coupled to the database 4 via a communication bus 13.
  • the network 2 can be a network of a local area network, a wide area network, a metropolitan area network, etc., and can be a wired network or a wireless network.
  • the client 3 can be a desktop computer, a notebook, a tablet, a mobile phone, or other terminal device that can communicate with the device 1 via the network 2.
  • the processor 12 can be a Central Processing Unit (CPU), microprocessor or other data processing chip for running the high concurrent data processing system 10 stored in the memory 11, such as executing high concurrent data processing programs and the like.
  • CPU Central Processing Unit
  • microprocessor or other data processing chip for running the high concurrent data processing system 10 stored in the memory 11, such as executing high concurrent data processing programs and the like.
  • the memory 11 stores the program code of the high concurrent data processing system 10, the data of the client that issues the data request, such as customer identity information, account information, and data request information.
  • the memory 11 connected to the high concurrent data processing device 1 may be an internal storage unit of the terminal, such as a hard disk or a memory of the terminal, or may be a memory device independent of the aforementioned processor 12 connected through a network.
  • the memory 11 may include at least one type of storage medium including a flash memory, a hard disk, a multimedia card, a card type memory (eg, SD or DX memory, etc.), a random access memory (RAM), a static random access memory. (SRAM), read only memory (ROM), electrically erasable programmable read only memory (EEPROM), programmable read only memory (PROM), magnetic memory, magnetic disk, optical disk, and the like.
  • the processor 12 reads and executes the program code of the high concurrent data processing system 10 from the memory 11 to provide the following functions of the high concurrent data processing system 10.
  • Figure 1 shows only the high concurrent data processing device 1 with components 11-13 and a high concurrent data processing system, but it should be understood that not all illustrated components may be implemented, alternative implementations may be more or less s component.
  • FIG. 2 is a block diagram of a preferred embodiment of the high concurrent data processing system 10 of the present application.
  • the high concurrent data processing system 10 includes a receiving module 110, a queue management module 120, and a first processing module 130.
  • the receiving module 110 is configured to receive an access request sent by the client 3. For example, when a customer participates in an online online rushing activity of a merchant through the client 3, the receiving module 110 receives n snapping requests issued by the client.
  • the queue management module 120 is configured to store the received access request in a message manner to the message queue. For example, the queue management module 120 stores the n snap requests in chronological order and stores them in a message queue.
  • the first processing module 130 calls a preset number of threads to process the message in the message queue, reads the related data from the database 4, and feeds back the processing result to the client 3. For example, the first processing module 130 invokes a preset number of threads, processes the previous snap request in the message queue, reads the information of the snapped product from the database 4, and feeds the processing result back to the client. 3.
  • FIG. 3 is a block diagram of another preferred embodiment of the high concurrent data processing system 10 of the present application.
  • the high concurrent data processing system 10 includes:
  • the receiving module 110 is configured to receive an access request sent by the client 3. For example, when the customer participates in the online panning activity of a merchant through the client 3, the receiving module 110 receives n snap requests issued by the client.
  • the queue management module 120 is configured to store the received access request in a message manner to the message queue. For example, the queue management module 120 stores the n snap requests in chronological order and stores them in a message queue.
  • the request merge module 140 is configured to merge the same message in the message queue to form a plurality of message groups. For example, among the n snapping requests, there are 20 snapping requests to snap up product A, there are 10 snapping products B, and other snapping requests without the same request each constitute a message group, then the request combining module 140 snaps up the 20 pieces. The snap request of product A is merged into message group C, and the snap requests of the 10 snapped products B are merged into message group D. If the time of the first snap request in the message group C is earlier than the first snap request in any other message group, the message of the message group C will be processed in preference to the messages of other message groups.
  • the second processing module 150 is configured to invoke a preset number of threads to process the plurality of message groups, read related data from the database 4, and feed back the processing result to the client 3. For example, if the message group C is arranged at the head end of the message queue, the second processing module 150 calls a preset number of threads, extracts the information of the message group C for processing, and reads the snapped A from the database 4. The information of the product, and the processing result is fed back to all the clients 3 that issued the snap request.
  • FIG. 4 it is a flowchart of a preferred embodiment of the high concurrent data processing method of the present application.
  • the high concurrent data processing method includes the following steps:
  • Step S111 Receive a data access request sent by the client 3. For example, when a customer purchases a ticket through an application on the client 3 during the Spring Festival, the G6034 (Shenzhen-Yueyang) is taken as an example. When the ticketing time of the train is reached, the receiving module 110 instantaneously receives n ticket grab requests. When the client 3 makes a request, the client 3 interface displays "in queue".
  • Step S112 Store the received access request in a message manner to the message queue.
  • the queue management module 120 stores the n ticket rush requests in a chronological order in the form of a message to the message queue, wherein the information of each rushed train ticket represents a message in the message queue.
  • Step S113 Calling a preset number of threads to process the message in the message queue, reading the related data from the database 4, and feeding back the processing result to the client 3.
  • the first processing module 130 invokes a preset number of threads, processes the previous ticket rush request in the message queue, reads the remaining ticket information from the database 4, and feeds the processing result back to the client 3 .
  • FIG. 5 it is a flow chart of another preferred embodiment of the high concurrent data processing method of the present application.
  • the high concurrent data processing method includes the following steps:
  • Step S111 Receive a data access request sent by the client 3. For example, when a customer purchases a ticket on an APP through the client 3 during the Spring Festival, the G6034 (Shenzhen-Yueyang) is taken as an example. When the ticketing time of the train is reached, the receiving module 110 instantaneously receives n ticket grab requests. When the client 3 makes a request, the client 3 interface displays "in queue”.
  • Step S112 Store the received access request in a message manner to the message queue.
  • the queue management module 120 stores the n snap requests in chronological order and stores them in a message queue.
  • the queue management module 120 stores the n ticket rush requests in a chronological order in the form of a message to the message queue, wherein the information of each rushed train ticket represents a message in the message queue.
  • Step S114 Combine the messages with the same access request in the message queue to form a plurality of message groups. For example, among the n ticket rushing requests, 20 robbed requests to snap up the second-class seat of Shenzhen to Yueyang, and 10 rushed to buy the first-class seat of Shenzhen to Zhuzhou. Then, the request merging module 140 snapped the 20 pieces to Shenzhen.
  • the snap request to the second-class seat of Yueyang is merged into message group E, and the snap-up requests of 10 snapped products B are merged into message group F, and the other non-identical grab requests respectively form a message group, if the message group E is the first
  • the initiation time of the ticket rushing request is earlier than the initiation time of the first rush ticket request in any other message group, and the message in the message group E will be processed in preference to the messages of other message groups.
  • Step S115 Calling a preset number of threads to process the plurality of message groups, reading related data from the database 4, and feeding back the processing result to the client 3. For example, if the message group E is arranged at the head end of the message queue, the second processing module 150 calls a preset number of threads, extracts the information of the message group E for processing, and reads the remaining ticket information from the database 4. The processing result is fed back to all clients 3 that issued the snap request.
  • the application also includes a computer readable storage medium storing a high concurrent data processing system 10.
  • the high concurrent data processing system 10 is executed by at least one processor 12 to implement the following steps:
  • Step S111 Receive an access request sent by the client 3. For example, when a customer participates in an online online rushing activity of a merchant through the client 3, the receiving module 110 receives n snapping requests issued by the client.
  • Step S112 Store the received access request in a message manner to the message queue.
  • the queue management module 120 stores the n snap requests in chronological order and stores them in a message queue.
  • Step S113 Calling a preset number of threads to process the message, reading related data from the database 4, and feeding back the processing result to the client 3.
  • the first processing module 140 extracts and analyzes the key information of the first ticket rush request in the message queue, reads the remaining ticket information from the database 4, and feeds back the processing result to the client 3.
  • the high concurrent data processing system 10 is executed by at least one processor 12 to implement the following steps:
  • Step S111 Receive an access request sent by the client 3. For example, when a customer participates in an online online rushing activity of a merchant through the client 3, the receiving module 110 receives n snapping requests issued by the client.
  • Step S112 Store the received access request in a message manner to the message queue.
  • the queue management module 120 stores the n snap requests in chronological order and stores them in a message queue.
  • Step S114 Combine the messages with the same access request in the message queue to form a plurality of message groups. For example, among the n snapping requests, there are 20 snapping requests to snap up the product A, and 10 snapping the product B. Then, the merging module 140 merges the snapping requests of the 20 snapped products A into the message group C, the 10 The snap-up request for snapping up product B is merged into message group D. If the time of the first snap request in the message group C is earlier than the first snap request in the message group D, the message in the message group C will be processed in preference to the message of the message group D.
  • Step S115 Calling a preset number of threads to process the plurality of message groups, reading related data from the database 4, and feeding back the processing result to the client 3. For example, if the message group C is arranged at the head end of the message queue, the second processing module 150 extracts the key information of the message group C for processing, and reads the information of the snapped A product from the database 4, and feedback. To all clients 3 that issued the snap request.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Finance (AREA)
  • Accounting & Taxation (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Development Economics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Strategic Management (AREA)
  • Computer Hardware Design (AREA)
  • Computer Security & Cryptography (AREA)
  • General Engineering & Computer Science (AREA)
  • Computing Systems (AREA)
  • Computer And Data Communications (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

La présente invention concerne un procédé de traitement de données à haute concordance, qui est appliqué à un appareil de traitement de données. Le procédé de traitement de données à haute concordance comprend les étapes suivantes consistant à : recevoir une demande d'accès envoyée par un client ; stocker la demande d'accès reçue dans une file d'attente de messages en tant que message ; et traiter des messages dans la file d'attente de messages en invoquant une quantité prédéfinie de fils, lire des données associées à partir d'une base de données, et renvoyer le résultat de traitement au client. Lorsqu'un serveur reçoit une grande quantité de demandes d'accès aux données en même temps, la pression simultanée du serveur peut être efficacement réduite, et la disponibilité et le débit d'un système d'application sont assurés. La présente invention concerne également un appareil de traitement de support de stockage lisible par ordinateur.
PCT/CN2018/090692 2017-06-25 2018-06-11 Procédé et appareil de traitement de données à haute concordance et support d'informations lisible par ordinateur WO2019001256A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710490374.X 2017-06-25
CN201710490374.XA CN107872398A (zh) 2017-06-25 2017-06-25 高并发数据处理方法、装置及计算机可读存储介质

Publications (1)

Publication Number Publication Date
WO2019001256A1 true WO2019001256A1 (fr) 2019-01-03

Family

ID=61762164

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/090692 WO2019001256A1 (fr) 2017-06-25 2018-06-11 Procédé et appareil de traitement de données à haute concordance et support d'informations lisible par ordinateur

Country Status (2)

Country Link
CN (1) CN107872398A (fr)
WO (1) WO2019001256A1 (fr)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110069217A (zh) * 2019-04-10 2019-07-30 新华三信息安全技术有限公司 一种数据存储方法及装置
CN110740103A (zh) * 2019-09-02 2020-01-31 深圳壹账通智能科技有限公司 业务请求处理方法、装置、计算机设备和存储介质
CN110888704A (zh) * 2019-11-08 2020-03-17 北京浪潮数据技术有限公司 一种高并发接口处理方法、装置、设备及存储介质
CN111831458A (zh) * 2020-06-11 2020-10-27 武汉烽火技术服务有限公司 一种高并发高解耦数据处理方法及数据中台系统
CN111984433A (zh) * 2020-07-31 2020-11-24 五八有限公司 业务数据处理方法、展示方法、装置、电子设备及介质
CN113259229A (zh) * 2020-02-13 2021-08-13 阿里巴巴集团控股有限公司 数据处理方法、装置及网关设备
CN113703947A (zh) * 2021-09-01 2021-11-26 上海漫酷网络技术有限公司 一种分布式任务处理系统、方法、计算机设备和存储介质
CN114006946A (zh) * 2021-10-29 2022-02-01 中国平安人寿保险股份有限公司 同质资源请求的处理方法、装置、设备及存储介质
CN115348220A (zh) * 2022-08-25 2022-11-15 中国银行股份有限公司 访问请求传输方法及装置
CN115629890A (zh) * 2022-10-27 2023-01-20 圣名科技(广州)有限责任公司 传感器数据采集方法及装置、电子设备

Families Citing this family (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107872398A (zh) * 2017-06-25 2018-04-03 平安科技（深圳）有限公司 高并发数据处理方法、装置及计算机可读存储介质
CN110505257A (zh) * 2018-05-17 2019-11-26 北京国双科技有限公司 请求消息处理方法及装置
CN109102402A (zh) * 2018-07-26 2018-12-28 阿里巴巴集团控股有限公司 一种交易风险的监控方法、装置和系统
CN109510864B (zh) * 2018-09-29 2022-07-19 网宿科技股份有限公司 一种缓存请求的转发方法、传输方法及相关装置
CN109617974B (zh) * 2018-12-21 2021-12-28 珠海金山办公软件有限公司 一种请求处理方法、装置及服务器
CN110134531A (zh) * 2019-05-06 2019-08-16 广州华多网络科技有限公司 虚拟资产流转数据的处理方法、装置和计算机设备
CN112019689A (zh) * 2019-05-29 2020-12-01 北京奇虎科技有限公司 来电秀业务处理系统及方法
CN110460534B (zh) * 2019-07-26 2024-05-14 腾讯云计算（北京）有限责任公司 一种请求消息上报方法、装置、设备及存储介质
CN112688982B (zh) * 2019-10-18 2024-04-16 北京京东振世信息技术有限公司 一种用户请求处理方法和装置
CN111124702B (zh) * 2019-11-22 2023-03-21 腾讯科技（深圳）有限公司 性能数据采集方法、装置和计算机可读存储介质
CN112104731B (zh) * 2020-09-11 2022-05-20 北京奇艺世纪科技有限公司 请求处理方法、装置、电子设备和存储介质
CN112422404B (zh) * 2020-10-19 2022-08-19 上海哔哩哔哩科技有限公司 消息处理方法及系统
CN113691611B (zh) * 2021-08-23 2022-11-22 湖南大学 一种区块链的分布式高并发事务处理方法及系统、设备、存储介质
CN113722078A (zh) * 2021-11-02 2021-11-30 西安热工研究院有限公司 一种基于线程池高并发数据库访问方法、系统及设备
CN114221885A (zh) * 2021-12-07 2022-03-22 深圳市链融科技股份有限公司 消息异步处理方法、装置、计算机设备及存储介质
CN116595099A (zh) * 2023-05-22 2023-08-15 北京言子初科技有限公司 高并发数据异步处理方法及装置

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0849921A2 (fr) * 1996-12-20 1998-06-24 International Business Machines Corporation Appareil et procédé pour l'envoi d'appels de procédé client dans un système d'ordinateur serveur
US20070168764A1 (en) * 2005-12-14 2007-07-19 Business Objects Apparatus and method for persistent report serving
CN101452555A (zh) * 2008-12-31 2009-06-10 中国建设银行股份有限公司 查询个人信用信息的方法、系统及个人信用查询系统
CN102394867A (zh) * 2011-10-10 2012-03-28 深圳市金槌拍卖行有限公司 网络并发通讯请求转串行队列技术
CN103197968A (zh) * 2013-03-18 2013-07-10 焦点科技股份有限公司 一种融合同步异步特点的线程池处理方法及系统
CN103218455A (zh) * 2013-05-07 2013-07-24 中国人民解放军国防科学技术大学 Key-Value数据库用户请求的高速并发处理方法
US20150212794A1 (en) * 2011-09-22 2015-07-30 Oracle International Corporation System and method for supporting a lazy sorting priority queue in a computing environment
CN105183549A (zh) * 2015-08-27 2015-12-23 携程计算机技术（上海）有限公司 基于任务分配的自动出票系统
CN107341050A (zh) * 2016-04-28 2017-11-10 北京京东尚科信息技术有限公司 基于动态线程池的服务处理方法和装置
CN107679931A (zh) * 2017-08-17 2018-02-09 平安科技（深圳）有限公司 订单异步处理的方法、装置、存储介质及终端
CN107872398A (zh) * 2017-06-25 2018-04-03 平安科技（深圳）有限公司 高并发数据处理方法、装置及计算机可读存储介质

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0849921A2 (fr) * 1996-12-20 1998-06-24 International Business Machines Corporation Appareil et procédé pour l'envoi d'appels de procédé client dans un système d'ordinateur serveur
US20070168764A1 (en) * 2005-12-14 2007-07-19 Business Objects Apparatus and method for persistent report serving
CN101452555A (zh) * 2008-12-31 2009-06-10 中国建设银行股份有限公司 查询个人信用信息的方法、系统及个人信用查询系统
US20150212794A1 (en) * 2011-09-22 2015-07-30 Oracle International Corporation System and method for supporting a lazy sorting priority queue in a computing environment
CN102394867A (zh) * 2011-10-10 2012-03-28 深圳市金槌拍卖行有限公司 网络并发通讯请求转串行队列技术
CN103197968A (zh) * 2013-03-18 2013-07-10 焦点科技股份有限公司 一种融合同步异步特点的线程池处理方法及系统
CN103218455A (zh) * 2013-05-07 2013-07-24 中国人民解放军国防科学技术大学 Key-Value数据库用户请求的高速并发处理方法
CN105183549A (zh) * 2015-08-27 2015-12-23 携程计算机技术（上海）有限公司 基于任务分配的自动出票系统
CN107341050A (zh) * 2016-04-28 2017-11-10 北京京东尚科信息技术有限公司 基于动态线程池的服务处理方法和装置
CN107872398A (zh) * 2017-06-25 2018-04-03 平安科技（深圳）有限公司 高并发数据处理方法、装置及计算机可读存储介质
CN107679931A (zh) * 2017-08-17 2018-02-09 平安科技（深圳）有限公司 订单异步处理的方法、装置、存储介质及终端

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110069217A (zh) * 2019-04-10 2019-07-30 新华三信息安全技术有限公司 一种数据存储方法及装置
CN110740103A (zh) * 2019-09-02 2020-01-31 深圳壹账通智能科技有限公司 业务请求处理方法、装置、计算机设备和存储介质
CN110888704A (zh) * 2019-11-08 2020-03-17 北京浪潮数据技术有限公司 一种高并发接口处理方法、装置、设备及存储介质
CN113259229A (zh) * 2020-02-13 2021-08-13 阿里巴巴集团控股有限公司 数据处理方法、装置及网关设备
CN111831458A (zh) * 2020-06-11 2020-10-27 武汉烽火技术服务有限公司 一种高并发高解耦数据处理方法及数据中台系统
CN111831458B (zh) * 2020-06-11 2024-04-26 武汉烽火技术服务有限公司 一种高并发高解耦数据处理方法及数据中台系统
CN111984433A (zh) * 2020-07-31 2020-11-24 五八有限公司 业务数据处理方法、展示方法、装置、电子设备及介质
CN113703947A (zh) * 2021-09-01 2021-11-26 上海漫酷网络技术有限公司 一种分布式任务处理系统、方法、计算机设备和存储介质
CN114006946A (zh) * 2021-10-29 2022-02-01 中国平安人寿保险股份有限公司 同质资源请求的处理方法、装置、设备及存储介质
CN114006946B (zh) * 2021-10-29 2023-08-29 中国平安人寿保险股份有限公司 同质资源请求的处理方法、装置、设备及存储介质
CN115348220A (zh) * 2022-08-25 2022-11-15 中国银行股份有限公司 访问请求传输方法及装置
CN115629890A (zh) * 2022-10-27 2023-01-20 圣名科技(广州)有限责任公司 传感器数据采集方法及装置、电子设备

Also Published As

Publication number Publication date
CN107872398A (zh) 2018-04-03

Similar Documents

Publication Publication Date Title
WO2019001256A1 (fr) Procédé et appareil de traitement de données à haute concordance et support d'informations lisible par ordinateur
CN109344183B (zh) 数据交互方法、装置、计算机设备和存储介质
WO2019205371A1 (fr) Serveur, procédé d'attribution de message, et support de stockage
US11296941B2 (en) Standby instances for auto-scaling groups
US7680848B2 (en) Reliable and scalable multi-tenant asynchronous processing
WO2019080415A1 (fr) Procédé et système d'assignation d'appel entrant de client, dispositif informatique et support de stockage
CN111045806A (zh) 延迟消息队列实现方法以及系统
CN107911406B (zh) 基于网络的任务流转方法、设备及存储介质
CN110795479A (zh) 基于数据的分布式etl调度的方法和装置
CN110716800B (zh) 任务调度方法及装置、存储介质及电子设备
US10657537B2 (en) Systems and methods for asynchronous processing of events within networks
CN110851248A (zh) 异步任务数据处理方法、装置及计算机可读存储介质
WO2019080416A1 (fr) Procédé et système d'affectation d'appel entrant de client, dispositif informatique et support d'informations
CN110738436A (zh) 一种确定可用库存的方法和装置
CN107239325B (zh) 单证数据处理方法和装置
CN111461776A (zh) 资源发放的方法、装置、设备及存储介质
CN112991064B (zh) 业务处理方法、装置、计算机设备和存储介质
US20150296010A1 (en) Asynchronous Download for Application Offline Support
CN113095936A (zh) 委托订单处理方法、装置、计算机设备和存储介质
US20170139808A1 (en) Method and dispatcher node for server processing management
US9292364B1 (en) Packaging application data and logic for offline support
CN107678839B (zh) 基于优先级的客户跟进方法、系统及可读存储介质
WO2019169696A1 (fr) Procédé de flux inverse de données de client de plateforme, appareil électronique, dispositif et support de stockage
WO2019000995A1 (fr) Système et procédé pour des communications en mode données entre des systèmes associés
CN113761420A (zh) 一种页面展示方法、装置、业务服务器及存储介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18825528

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 23/06/2020)

122 Ep: pct application non-entry in european phase

Ref document number: 18825528

Country of ref document: EP

Kind code of ref document: A1