CN105573829B - A kind of method of high-throughput data in quick processing system - Google Patents

A kind of method of high-throughput data in quick processing system Download PDF

Info

Publication number
CN105573829B
CN105573829B CN201610072680.7A CN201610072680A CN105573829B CN 105573829 B CN105573829 B CN 105573829B CN 201610072680 A CN201610072680 A CN 201610072680A CN 105573829 B CN105573829 B CN 105573829B
Authority
CN
China
Prior art keywords
module
queue
request
service
user
Prior art date
Legal status (The legal status 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 status listed.)
Active
Application number
CN201610072680.7A
Other languages
Chinese (zh)
Other versions
CN105573829A (en
Inventor
沈文策
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
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 Individual filed Critical Individual
Priority to CN201610072680.7A priority Critical patent/CN105573829B/en
Publication of CN105573829A publication Critical patent/CN105573829A/en
Application granted granted Critical
Publication of CN105573829B publication Critical patent/CN105573829B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/466Transaction processing
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/48Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Medical Treatment And Welfare Office Work (AREA)

Abstract

The present invention provides a kind of method of high-throughput data in quick processing system, and the method need to provide queue module, scheduler module and service module;Method are as follows: the request of user's access is received by queue module, request is preserved in a manner of first in, first out, and the article that user needs is saved in a queue, the queue module is also responsible for providing a series of interfaces, the scheduler module is responsible for the dynamic dispatching of queue module to service module, service module is checked continually on, once service module processing capacity is available free, user access request is just called in service module from queue;And it is responsible for distributing to service module and requests;After the service module receives the request of distribution, the business processing service of calling system transfers the article in queue, and return to processing result.The present invention can quick high-throughput data in processing system, improve the experience of user, meanwhile, the pressure of high-throughput data is alleviated for system.

Description

A kind of method of high-throughput data in quick processing system
Technical field
The present invention relates to a kind of methods of high-throughput data in communication technique field more particularly to quick processing system.
Background technique
Existing electric business sells some articles or carries out the reservation of medical treatment or in order to attract customer, aggregation popularity, can incite somebody to action Virtual objects are first put into system, and then these virtual objects generally can all limit the quantity.Demand to user is more huge, use Family is poured in, and often virtual objects can be robbed sky within several seconds.And it for system may be more test.Such as: The booking of the end of the year, businessman's is of use volume, and reservation number etc. is seen a doctor by hospital.
It is the competition of a field speed degree for obtaining these virtual articles, that is, " quick-moving have, slow with one's hands nothing " that as the saying goes. Everybody emulatively after activity starts, at the first time gets virtual objects.Therefore the system in a flash that activity starts has greatly The flow of amount pours in, several times, even more than ten times of flow be not little to the impact of system.If system is not enough Counter-measure, it is likely that just crushed by instantaneous high flow capacity.
Secondly, precipitate high flow capacity, has all carried out a series of pressure to system modules, therefore system may be It is slack-off, and may affect one another, influence availability.Such as: database update virtual objects inventory need to record same a line It locks, as concurrent pressure is gradually increased, the performance of database update is gradually reduced.So as to cause offer inventory service The decline of application service performance, the possibility of the chain performance for influencing the service of placing an order, final feedback to consumer is exactly entire Site shopping performance of MRC process is poor, low-response.And the system for facing low-response, many demanders may be taken to be refreshed repeatedly, repeatedly It attempts, this undoubtedly increases the pressure to system again.
In addition, above-mentioned various pains often experienced to consumer's bring.Such as: websites response is slow, clicks panic buying Virtual objects button does not react.It is not at all easy to operate, it has been found that article has been robbed, and the sense of participation of consumer is compared Difference.
Summary of the invention
The technical problem to be solved in the present invention, be to provide it is a kind of can quick high-throughput data in processing system, improve The experience of user, meanwhile, the pressure of high-throughput data is alleviated for system.
The present invention is implemented as follows: in a kind of quick processing system high-throughput data method, the method needs to provide Queue module, scheduler module and service module;
The method are as follows: the request that user's access is received by queue module saves request in a manner of first in, first out Get off, and the article that user needs is saved in a queue, the queue module is also responsible for providing a series of interfaces, described Interface includes: that the interface of request, and clothes are pulled to scheduler module to the interface for the user query article condition for having entered queue The interface of business module write-back business processing status;
The scheduler module is responsible for the dynamic dispatching of queue module to service module, checks continually on service module, once clothes Resume module ability of being engaged in is available free, and user access request is just called in service module from queue;And it is responsible for service module point Hair request;The scheduler module not only transmits request, is also responsible for regulating system processing capacity;According to the practical place of service module Reason ability pulls the speed that the interface dynamic regulation of request pulls to system request by scheduler module;
After the service module receives the request of distribution, the object in queue is transferred in the business processing service of calling system Product, and processing result is returned to, and call the interface write-back service processing result of the service module write-back business processing status.
Further, the size of the queue is greater than according to the size that the quantity of article carries out self-defining or queue The quantity of article.
Further, the system comprises rob volume system of being of use, ticket-booking system or medical reservation system.
Further, the service module can service decoupling for the business processing of system, while for business behind system Processing capacity, dynamic adjust service module call business processing service below speed.
Further, the queue module is provided with to the interface for the user query user's solicited status for having entered queue, The interface of request, the interface of service module write-back business processing status, when user's request has entered queuing are pulled to scheduler module Illustrate user's request when module effectively, user can check from queue module to be had requested that the state of processing and be instantly available response certainly; When the complete user's request of background service resume module recalls interface change user's request of Queue module write-back business processing status State;Reach asynchronous process in this way.
The present invention has the advantage that the present invention working in coordination by queue module, scheduler module and service module, High-throughput data in the quick processing system of energy, improves the experience of user, meanwhile, the pressure of high-throughput data is alleviated for system Power.The present invention can push the development of system business, preferably support and push to business.
Detailed description of the invention
Fig. 1 is the method for the present invention flow diagram.
Fig. 2 is the frame principle of the method for the present invention.
Specific embodiment
System of the invention will consider following point:
1, current limliting: after virtual objects restocking, only small part user can get virtual objects, it is meant that in fact most of It is all invalid that the flow of user, which is passed to after background service,.If being able to guide this most flow, this most stream is not allowed Amount is passed to background service, in fact to the pressure of system with regard to very little.Therefore one of mentality of designing is exactly that only allowing successfully to get The flow (can have certain surplus) of virtual objects enters system.
2. peak clipping: although into system effective discharge total amount be not necessarily it is very big, but in a short period of time It pours in, therefore can have very high instantaneous flow peak value.The identical flow of total amount entered system at 1 second, and at 10 minutes Evenly into system, differ greatly to the impact of system.The flow of peak value tends to crush system.Therefore another A mentality of designing is how to even up the instantaneous high flow capacity for entering system, allow system within the scope of oneself processing capacity, All requests are disposed.
3. asynchronous process: traditional system is synchronization process for request, that is, is immediately treated after receiving request and knot Fruit returns to user;After system has the design of peak clipping, request is not to be handled at once, therefore requiring can be by synchronous clothes Business is transformed into asynchronous.
4. availability: the availability of system being placed on always important position when design, be likely to occur for system each Kind situation, all farthest guarantees to the greatest extent High Availabitity.
5. user experience: system design has to fully consider user experience.User after clicking virtual objects button, Regardless of whether virtual objects can be got, being contemplated to be timely to be fed back.Any failure occurs in system also will be as far as possible Guarantee that the damage of user experience minimizes.
On the basis of being understood thoroughly to above system business, the pain spot of scene and user for business, the present invention Provide a kind of method of high-throughput data in quick processing system, the method need to provide queue module, scheduler module and Service module;It please refers to shown in Fig. 1 and Fig. 2,
The method are as follows: the request that user's access is received by queue module saves request in a manner of first in, first out Get off, and the article that user needs is saved in a queue, the queue module is also responsible for providing a series of interfaces, described Interface includes: that the interface of request, and clothes are pulled to scheduler module to the interface for the user query article condition for having entered queue The interface of business module write-back business processing status;The size of the queue carries out self-defining or team according to the quantity of article The size of column is greater than the quantity of article.
The scheduler module is responsible for the dynamic dispatching of queue module to service module, checks continually on service module, once clothes Resume module ability of being engaged in is available free, and user access request is just called in service module from queue;And it is responsible for service module point Hair request;Here scheduler module plays the part of the role of an intermediary, and the scheduler module not only transmits request, is also responsible for adjusting system System processing capacity;According to the actual treatment ability of service module, the interface dynamic regulation of request is pulled to being by scheduler module System pulls the speed of request;The scheduler module acts on the gate of somewhat similar dam, and gate is turned on when downstream arid and is put more A little water just put down gate and put a little water less when downstream flood.It can reach in this way and even up the instantaneous high flow capacity for entering system, make The system of obtaining can be within the scope of oneself processing capacity.
After the service module receives the request of distribution, the object in queue is transferred in the business processing service of calling system Product, and processing result is returned to, and call the interface write-back service processing result of the service module write-back business processing status.Institute Stating service module can be the business processing service decoupling of system, while for the processing capacity of business behind system, dynamic tune Save the speed that service module calls business processing service below.
Wherein, the system comprises rob volume system of being of use, ticket-booking system or medical reservation system.
The queue module is provided with to the interface for the user query user's solicited status for having entered queue, gives scheduler module The interface of request is pulled, the interface of service module write-back business processing status illustrates when user's request has entered queue module Effectively, user can check from queue module to be had requested that the state of processing and is instantly available response user's request certainly;Work as background service The complete user's request of resume module recalls interface change user's solicited status of Queue module write-back business processing status;It reaches in this way To asynchronous process, and it can be carried out peak clipping.
Order sends processing with charge free when somewhat similar online shopping, and place an order success, commodity ex-warehouse, and dispatching is received.As long as each step The interface of poly- processing result write-back business processing status changes user's solicited status.It is not required to disposably handle and returns to use Family.
In short, the present invention working in coordination by queue module, scheduler module and service module, it can quick processing system Middle high-throughput data improves the experience of user, meanwhile, the pressure of high-throughput data is alleviated for system.The present invention can push The development of system business, preferably support and push to business.
The foregoing is merely presently preferred embodiments of the present invention, all equivalent changes done according to scope of the present invention patent with Modification, is all covered by the present invention.

Claims (4)

1. a kind of method of high-throughput data in quick processing system, it is characterised in that: the method need to provide queue module, adjust Spend module and service module;
The method are as follows: the request that user's access is received by queue module preserves request in a manner of first in, first out, And the article that user needs is saved in a queue, the queue module is also responsible for providing a series of interfaces, the interface It include: that the interface of request, and service mould are pulled to scheduler module to the interface for the user query article condition for having entered queue The interface of block write-back business processing status;
The scheduler module is responsible for the dynamic dispatching of queue module to service module, checks continually on service module, once service mould Block processing capacity is available free, and user access request is just called in service module from queue;And it is responsible for distributing to service module and asks It asks;The scheduler module not only transmits request, is also responsible for regulating system processing capacity;According to the actual treatment energy of service module Power pulls the speed that the interface dynamic regulation of request pulls to system request by scheduler module;
After the service module receives the request of distribution, the article in queue is transferred in the business processing service of calling system, and Processing result is returned, and calls the interface write-back service processing result of the service module write-back business processing status;
The queue module is provided with to the interface for the user query user's solicited status for having entered queue, is pulled to scheduler module The interface of request, the interface of service module write-back business processing status illustrate user when user's request has entered queue module Effectively, user can check from queue module to be had requested that the state of processing and is instantly available response certainly for request;When background service module Interface change user's solicited status that user's request recalls Queue module write-back business processing status is handled;Reach so different Step processing.
2. the method for high-throughput data in a kind of quick processing system according to claim 1, it is characterised in that: the team The size of column is greater than the quantity of article according to the size of the quantity of article progress self-defining or queue.
3. the method for high-throughput data in a kind of quick processing system according to claim 1, it is characterised in that: the system System includes volume system of being of use of robbing, ticket-booking system or medical reservation system.
4. the method for high-throughput data in a kind of quick processing system according to claim 1, it is characterised in that: the clothes Module of being engaged in can service decoupling for the business processing of system, while for the processing capacity of business behind system, dynamic adjusts clothes Module of being engaged in calls the speed of business processing service below.
CN201610072680.7A 2016-02-02 2016-02-02 A kind of method of high-throughput data in quick processing system Active CN105573829B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610072680.7A CN105573829B (en) 2016-02-02 2016-02-02 A kind of method of high-throughput data in quick processing system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610072680.7A CN105573829B (en) 2016-02-02 2016-02-02 A kind of method of high-throughput data in quick processing system

Publications (2)

Publication Number Publication Date
CN105573829A CN105573829A (en) 2016-05-11
CN105573829B true CN105573829B (en) 2019-03-12

Family

ID=55884000

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610072680.7A Active CN105573829B (en) 2016-02-02 2016-02-02 A kind of method of high-throughput data in quick processing system

Country Status (1)

Country Link
CN (1) CN105573829B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101174318A (en) * 2006-10-30 2008-05-07 索尼爱立信移动通讯有限公司 Queuing device, queuing system and queuing method
EP2223478A1 (en) * 2007-12-21 2010-09-01 Telecom Italia S.p.A. A scheduling method and system for communication
CN102467763A (en) * 2010-10-29 2012-05-23 爱立信电话股份有限公司 Queuing control system and method
CN103379040A (en) * 2012-04-24 2013-10-30 阿里巴巴集团控股有限公司 Device and method for controlling concurrency number in high concurrency system

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100466593C (en) * 2003-01-13 2009-03-04 华为技术有限公司 Method of implementing integrated queue scheduling for supporting multi service
US8756613B2 (en) * 2011-09-23 2014-06-17 International Business Machines Corporation Scalable, parallel processing of messages while enforcing custom sequencing criteria
CN102360309B (en) * 2011-09-29 2013-12-18 中国科学技术大学苏州研究院 Scheduling system and scheduling execution method of multi-core heterogeneous system on chip
KR20150017526A (en) * 2013-08-07 2015-02-17 삼성전자주식회사 Memory command schedular and method for memory command scheduling
US20150117319A1 (en) * 2013-10-25 2015-04-30 Qualcomm Incorporated Scheduling request without random access procedure
CN104079502B (en) * 2014-06-27 2017-05-10 国家计算机网络与信息安全管理中心 Multi-user multi-queue scheduling method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101174318A (en) * 2006-10-30 2008-05-07 索尼爱立信移动通讯有限公司 Queuing device, queuing system and queuing method
EP2223478A1 (en) * 2007-12-21 2010-09-01 Telecom Italia S.p.A. A scheduling method and system for communication
CN102467763A (en) * 2010-10-29 2012-05-23 爱立信电话股份有限公司 Queuing control system and method
CN103379040A (en) * 2012-04-24 2013-10-30 阿里巴巴集团控股有限公司 Device and method for controlling concurrency number in high concurrency system

Also Published As

Publication number Publication date
CN105573829A (en) 2016-05-11

Similar Documents

Publication Publication Date Title
CN105468690B (en) A kind of inventory data treating method and apparatus
Mei et al. A profit maximization scheme with guaranteed quality of service in cloud computing
CN104636957B (en) A kind of system and method for processing high concurrent request of data
CN103426072B (en) The order processing system of a kind of high concurrent competition stock and disposal route thereof
US9386086B2 (en) Dynamic scaling for multi-tiered distributed systems using payoff optimization of application classes
CN108090058A (en) A kind of high concurrent action interactions method
Schroeder et al. Achieving class-based QoS for transactional workloads
CN102325148B (en) WebService service calling method
CN102130938A (en) Resource supply method oriented to Web application host platform
CN105306277A (en) Message scheduling method and message scheduling device for message queues
CN109313642A (en) Bill information caching method, bill information querying method and terminal device
CN107800746B (en) Message pushing method and device
Alimi et al. Financial inclusion, ICT diffusion and poverty reduction: Evidence from Sub-Sahara African countries
CN105573829B (en) A kind of method of high-throughput data in quick processing system
CN111753065A (en) Request response method, system, computer system and readable storage medium
CN107194810A (en) Asset allocation system and method
Ghamkhari et al. Profit maximization and power management of green data centers supporting multiple SLAs
CN106874080A (en) Method for computing data and system based on distributed server cluster
US8924276B2 (en) Real-time trade forecaster
Wo et al. Overbooking-based resource allocation in virtualized data center
CN109375998B (en) Processing method in high-concurrency request environment
CN103793274B (en) Delta Time piece adjusting apparatus and method in a kind of CREDIT schedulers
CN109194759A (en) A kind of Network Access Method and system in front end degradation
CN104320481A (en) Virtual resource dynamic algorithm based on user experience
Cong et al. Profit-driven dynamic cloud pricing for multiserver systems considering user perceived value

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant