Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

High-concurrency service resource allocation method based on business priorities

A service resource and allocation method technology, which is applied in the field of high concurrent service resource allocation based on business priority, can solve problems such as insufficient consideration of business priority, and achieve a simple effect

Active Publication Date: 2017-05-31
XINGTANG TELECOMM TECH CO LTD
View PDF4 Cites 25 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0012] In view of the above analysis, the present invention aims to provide a high-concurrency service resource allocation method based on business priority, which fully considers business priority and allocates service resources according to priority to solve the problem of business priority in traditional load balancing technology. under-considered issues

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • High-concurrency service resource allocation method based on business priorities
  • High-concurrency service resource allocation method based on business priorities

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0079] In this embodiment, before allocating service resources, a scheduler is set; the scheduler may be any server in the server cluster, and may perform scheduling independently, or process service requests simultaneously. The scheduler is connected to all the servers in the server cluster; the scheduler stores the IDs of all the servers, which form the server ID queue of the server cluster. The scheduler is realized by a high-performance network server with multiple network cards. In order to improve fault tolerance, two servers are used to realize dual-machine hot backup (that is, one system is deployed on two servers at the same time, and if the host system fails, it will immediately switch to the backup machine to run).

[0080] This embodiment discloses a high-concurrency service resource allocation method based on business priority, such as figure 1 as shown,

[0081] Including the following steps:

[0082] Step S1, the scheduler receives the service request sent by...

Embodiment 2

[0108] For ease of understanding, a specific application example is given.

[0109] In the core communication system, there are three kinds of business that need to use the computing services provided by the computing server cluster, and their priorities are key control business, operation management business, and general query business from high to low.

[0110] Assume that the computing server cluster is composed of 10 single computing servers, and provides an access controller ServController as a unified access point, that is, the scheduler. ServController is responsible for receiving and forwarding the business requests of the client to the computing server cluster for processing. When the computing capacity of the computing server cluster is still free, for the computing resource requests of the three services, ServController calls 10 computing servers in a polling manner with the same priority. When the computing load of the selected computing server is full, the computi...

Embodiment 3

[0113] In the first and second embodiments above, the priority-based allocation of service resources is enabled only when the server cluster is fully loaded. In order to enable urgent and important services to obtain service resources faster, this embodiment provides a threshold-based priority Allocate instances of service resources.

[0114] This embodiment discloses a high-concurrency service resource allocation method based on business priority. The scheduler inquires about the service resource consumption of all servers at regular intervals to obtain the total resource consumption ratio of the server cluster. When the total resource consumption ratio reaches When the threshold set by the scheduler indicates that the service resources are not sufficient at this time, in order to allow urgent services to obtain resources first, stop the previous allocation method of evenly allocating resources regardless of priority, and forward the resources with higher priority first. serv...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to a high-concurrency service resource allocation method based on business priorities. The method comprises the steps of carrying out starting; receiving business requests of users by a dispatcher; generating processes for received business requests by the dispatcher; forwarding the received business requests in a polling mode; when servers receive the business requests, finishing the processes; when all servers pause access of the requests, storing the business requests of the user not received by the servers and inserting the business requests to corresponding queues; and setting time intervals t of retransmitting the business request queues according to the priorities, every other time t, retransmitting the business request queues in the polling mode until idle servers occur and all business request queues are received, and finishing the processes. According to the method, resources are allocated relatively uniformly, the realization is simple, and when the service resources are in shortage, the business with high priorities can obtain the service resources preferentially.

Description

technical field [0001] The invention relates to the technical field of service resource allocation, in particular to a high-concurrency service resource allocation method based on business priority. Background technique [0002] In recent years, with the continuous development of computer technology and communication technology, the number of Internet users has increased exponentially, and Internet applications have been rapidly popularized. The advancement of technology has stimulated the growth of user needs, and the business has become more complex, which requires the server to provide high concurrent access and the ability to reasonably allocate service resources. [0003] The traditional single server has limited processing capacity and cannot handle high concurrent business requests, and the cost of replacing a single ordinary server with a higher-performance server is too high, and causes a waste of idle server resources. Therefore, building multiple servers into a s...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): H04L12/851H04L29/08
CPCH04L47/24H04L47/2433H04L47/2483H04L67/1004H04L67/1001
Inventor 魏伟汪江萍沈泓
Owner XINGTANG TELECOMM TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com