CN113162990B - Message sending method, device, equipment and storage medium - Google Patents
Message sending method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN113162990B CN113162990B CN202110341751.XA CN202110341751A CN113162990B CN 113162990 B CN113162990 B CN 113162990B CN 202110341751 A CN202110341751 A CN 202110341751A CN 113162990 B CN113162990 B CN 113162990B
- Authority
- CN
- China
- Prior art keywords
- module
- message
- modules
- channel
- ith
- 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
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/51—Discovery or management thereof, e.g. service location protocol [SLP] or web services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
- H04L67/61—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources taking into account QoS or priority requirements
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/5021—Priority
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Computer And Data Communications (AREA)
Abstract
The application discloses a message sending method, a message sending device, message sending equipment and a storage medium, and belongs to the technical field of computers. The method comprises the following steps: allocating storage resources to each module according to the service priority of all the modules in the n modules needing network communication in the network node, wherein the service priority of each module is in positive correlation with the storage resources allocated to each module; for each of the n modules, creating a message channel with a storage resource allocated to the module as the message channel of the module to obtain n message channels; storing the message generated by the ith module in the n modules to the message channel of the ith module; and sending the message stored in one message channel of the n message channels. In the method and the device, the storage resources which can be used by different modules when the messages are sent are planned according to the service priority, so that the network communication of the modules with higher service priority is preferentially ensured, and the overall availability of the system is further ensured.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a message sending method, apparatus, device, and storage medium.
Background
There are often multiple modules in a network node that each need to communicate over a network. For example, modules such as a consensus module, a block data synchronization module, and a file upload and download module in a block chain node of a block chain system all need to perform network communication. The modules share system resources, and each module needs to monopolize the system resources when performing network communication, so that the problem of resource competition exists among different modules.
In the related art, in order to solve the problem of resource contention among different modules, when a plurality of modules call a data transmission interface on the same network connection, each module needs to lock and monopolize the data transmission interface when transmitting a message. Meanwhile, each module independently preempts the lock, and which module preempts the lock has the right to send the message. However, this preemptive manner of sending messages may result in some modules failing to preempt the lock for a long time, which may affect the availability of the system as a whole.
Disclosure of Invention
The application provides a message sending method, a message sending device, message sending equipment and a storage medium, which can improve the usability of the whole system.
In a first aspect, a message sending method is provided, where the method includes:
allocating storage resources to each of n modules needing network communication in a network node according to service priorities of all the modules, wherein the service priority of each module is in positive correlation with the storage resources allocated to each module, and n is an integer greater than or equal to 2;
for each of the n modules, creating a message channel with storage resources allocated to the one module as the message channel of the one module to obtain n message channels;
storing a message generated by an ith module of the n modules to a message channel of the ith module, wherein i is an integer greater than or equal to 1 and less than or equal to n;
and sending the message stored in one message channel of the n message channels.
In the application, storage resources are allocated to each module according to the service priority of n modules needing network communication in a network node, then a message channel with the allocated storage resources is created for each module, and the generated message is stored and sent through the message channel of each module. Therefore, for different modules, the storage resources which can be used when the messages are sent are planned according to the service priority, so that the network communication of the module with higher service priority can be preferentially ensured, and the availability of the whole system can be further ensured. In addition, because the messages of different modules are isolated through different message channels, the mutual interference of the modules caused by the difference of processing capacity can be reduced to a certain extent, and the parallel processing capacity of the messages is improved. Meanwhile, because each module is provided with a message channel for storing messages according to the service priority, the burst traffic can be handled, and the message receiving and sending rate can be smoothed.
Optionally, the sending the message stored in one of the n message channels includes:
selecting one message channel from the n message channels according to the service priority of all the n modules;
and sending the message stored in the selected one message channel.
In this application, when sending messages stored in n message channels, the messages can be sent with reference to the service priorities of n modules. Therefore, the higher the service priority of the module is, the more likely the message stored in the message channel of the module is to be sent out, and the availability of the whole system can be further improved.
Optionally, the selecting one message channel from the n message channels according to the service priorities of all the n modules includes:
dividing the designated interval according to the weights of all the modules in the n modules to obtain n subintervals corresponding to the n modules one to one, wherein the weights are used for indicating the service priority;
generating a random number within the designated interval;
and selecting a message channel of a module corresponding to a subinterval in which the random number is positioned.
Optionally, the storing resource includes a storage space size and a maximum storage amount, the message channel includes a write channel and a read channel, and the storing the message generated by the ith module of the n modules to the message channel of the ith module includes:
if the byte number of the message generated by the ith module is smaller than the capacity of the free storage space of the write channel of the ith module and the number of the messages stored by the write channel of the ith module is smaller than the maximum storage number of the write channel of the ith module, storing the message generated by the ith module to the write channel of the ith module;
the sending the message stored in one of the n message channels includes:
and sending the message stored by the writing channel in one of the n message channels.
In the application, when the write channel of the ith module currently has enough remaining storage resources to store the message generated by the ith module, the message is stored to the write channel of the ith module, so that the crash caused by overhigh system load can be effectively avoided.
Optionally, the method further comprises:
receiving a message addressed to said ith module;
if the byte number of the message sent to the ith module is smaller than the capacity of the free storage space of the read channel of the ith module, and the number of the messages stored in the read channel of the ith module is smaller than the maximum storage number of the read channel of the ith module, storing the message sent to the ith module to the read channel of the ith module, wherein the messages stored in the read channel of the ith module are provided for the ith module to read.
In the application, when the read channel of the ith module currently has enough remaining storage resources to store the message sent to the ith module, the message is stored to the read channel of the ith module, so that the crash caused by overhigh system load can be effectively avoided.
Optionally, the allocating, according to service priorities of all modules in n modules that need to perform network communication in a network node, storage resources for each module in the n modules includes:
accumulating the weights of all the modules in the n modules to obtain a total weight, wherein the weight is used for indicating the service priority;
dividing the total storage resource by the total weight to obtain a target storage resource;
and multiplying the weight of each module in the n modules by the target storage resource to obtain the storage resource distributed to each module.
Optionally, the network node is a block link point in a block chain system.
In a second aspect, a message sending apparatus is provided, the apparatus comprising:
the network node comprises an allocation module, a storage module and a processing module, wherein the allocation module is used for allocating storage resources to each module in n modules needing network communication according to service priorities of all the modules in the n modules, the service priority of each module is in positive correlation with the storage resources allocated to each module, and n is an integer greater than or equal to 2;
a creating module configured to create, for each of the n modules, a message channel with a storage resource allocated to the one module as a message channel of the one module, so as to obtain n message channels;
a storage module, configured to store a message generated by an ith module of the n modules to a message channel of the ith module, where i is an integer greater than or equal to 1 and less than or equal to n;
and the sending module is used for sending the message stored in one message channel of the n message channels.
Optionally, the sending module is configured to:
selecting one message channel from the n message channels according to the service priority of all the n modules;
and sending the message stored in the selected one message channel.
Optionally, the sending module is configured to:
dividing the designated interval according to the weights of all the modules in the n modules to obtain n subintervals which are in one-to-one correspondence with the n modules, wherein the weights are used for indicating the service priority;
generating a random number within the designated interval;
and selecting a message channel of a module corresponding to a subinterval in which the random number is positioned.
Optionally, the storage resource includes a storage space size and a maximum storage amount, the message channel includes a write channel and a read channel, and the storage module is configured to:
if the byte number of the message generated by the ith module is smaller than the capacity of the free storage space of the write channel of the ith module and the number of the messages stored in the write channel of the ith module is smaller than the maximum storage number of the write channel of the ith module, storing the message generated by the ith module into the write channel of the ith module;
the sending module is used for:
and sending the message stored by the writing channel in one of the n message channels.
Optionally, the apparatus further comprises:
a receiving module for receiving a message addressed to the ith module;
the storage module is further configured to store the message sent to the ith module to the read channel of the ith module if the byte number of the message sent to the ith module is smaller than the capacity of an idle storage space of the read channel of the ith module, and the number of messages stored in the read channel of the ith module is smaller than the maximum storage number of the read channel of the ith module, where the message stored in the read channel of the ith module is provided for the ith module to read.
Optionally, the allocation module is configured to:
accumulating the weights of all the modules in the n modules to obtain a total weight, wherein the weight is used for indicating the service priority;
dividing the total storage resource by the total weight to obtain a target storage resource;
and multiplying the weight of each module in the n modules by the target storage resource to obtain the storage resource distributed to each module.
Optionally, the network node is a block link point in a block chain system.
In a third aspect, a computer device is provided, the computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, the computer program, when executed by the processor, implementing the above-mentioned message sending method.
In a fourth aspect, a computer-readable storage medium is provided, which stores a computer program that, when executed by a processor, implements the above-described message sending method.
In a fifth aspect, a computer program product containing instructions is provided, which when run on a computer, causes the computer to perform the steps of the above-described message sending method.
It is to be understood that, for the beneficial effects of the second aspect, the third aspect, the fourth aspect and the fifth aspect, reference may be made to the description of the first aspect, and details are not described herein again.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic diagram of a message sending system according to an embodiment of the present application.
Fig. 2 is a flowchart of a message sending method according to an embodiment of the present application.
Fig. 3 is a schematic diagram of a messaging process according to an embodiment of the present application.
Fig. 4 is a schematic structural diagram of a message sending apparatus according to an embodiment of the present application.
Fig. 5 is a schematic structural diagram of a computer device according to an embodiment of the present application.
Detailed Description
To make the objects, technical solutions and advantages of the present application more clear, embodiments of the present application will be described in further detail below with reference to the accompanying drawings.
It should be understood that reference to "a plurality" in this application means two or more. In the description of this application, "/" indicates an inclusive meaning, for example, A/B may indicate either A or B; "and/or" herein is only an association relationship describing an associated object, and means that there may be three relationships, for example, a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, for the convenience of clearly describing the technical solutions of the present application, the terms "first", "second", and the like are used to distinguish the same items or similar items having substantially the same functions and actions. Those skilled in the art will appreciate that the terms "first," "second," etc. do not denote any order or quantity, nor do the terms "first," "second," etc. denote any order or importance.
Before explaining the embodiments of the present application in detail, an application scenario of the embodiments of the present application will be described.
There are often multiple modules in a network node that each need to communicate over the network. In this case, there is a resource contention problem between different modules in this network node. For example, for any blockchain node in the blockchain system, modules in the blockchain node, such as a consensus module, a blockchain data synchronization module, a file uploading and downloading module, need to perform network communication, including but not limited to network communication with a client or network communication with other blockchain nodes. These modules share system resources, and in order to ensure the integrity of network communication, each module needs to monopolize the system resources when performing network communication, so different modules compete for the system resources.
Modules in a network node can be distinguished into critical modules and non-critical modules. The key module can determine the system service quality and is a module with higher service priority. The non-critical module has little influence on the service quality of the system and is a module with lower service priority. Therefore, in order to ensure high availability of the system, it is necessary to preferentially ensure network communication of the key module, and ensure that the message of the key module can be preferentially processed, that is, it is necessary to ensure that the key module can preferentially occupy system resources, and to prevent non-key modules from preempting all system resources.
Therefore, an embodiment of the present application provides a message sending method, which may allocate storage resources to each module according to service priorities of multiple modules in a network node, create a message channel with the allocated storage resources for each module, and store and send a generated message through the message channel of each module. Therefore, for different modules, the storage resources which can be used when the messages are sent are planned according to the service priority, so that the network communication of the module with higher service priority can be preferentially ensured, and the overall availability of the system can be further ensured.
The following describes a system architecture according to an embodiment of the present application.
Fig. 1 is a schematic diagram of a message sending system according to an embodiment of the present application. The messaging system may be implemented by a network node, i.e., the messaging system may be deployed in a network node. Referring to fig. 1, the message transmission system may include: n modules 101, n message channels 102, and a message distributor 103, where n is an integer greater than or equal to 2.
Each of the n modules 101 has a message channel 102. For each module 101 of the n modules 101, the message channel 102 of this module 101 is provided with memory resources assigned to this module 101 according to the service priority of this module 101. The message channel 102 of the module 101 may store messages generated by the module 101 and required to be sent to clients or other network nodes, or may store messages sent by clients or other network nodes to the module 101. Specifically, the message channel 102 of the module 101 may include a write channel and a read channel, the write channel of the module 101 is used for storing the message generated by the module 101 and required to be sent to the client or other network node, and the read channel of the module 101 is used for storing the message sent by the client or other network node to the module 101.
The message distributor 103 is used to create and manage n message channels 102. In particular, the message distributor 103 may allocate memory resources for the respective modules 101 according to the service priority of the n modules 101, and then for each module 101 of the n modules 101, may create a message channel 102 for this module 101 with the memory resources allocated to this module 101. Thereafter, the message distributor 103 may store the message generated by the module 101 to the message channel of the module 101, specifically, to the write channel of the module 101, and then may send the message stored in the write channel of the module 101 to the client or other network nodes. Meanwhile, the message distributor 103 may store the message addressed to the module 101 to a message channel of the module 101, specifically, to a read channel of the module 101, and then may transmit the message stored by the read channel of the module 101 to the module 101 for the module 101 to read.
In some embodiments, the message distributor 103 may invoke a ChanMgr method, writeMsg method, send method, receive method, etc. method to implement its functionality. The ChanMgr method is used to create n message channels 102, the writeMsg method is used to store messages to corresponding message channels, the send method is used to send messages in the message channels to the network, and the receive method is used to receive messages in the network.
Next, a message sending method provided in an embodiment of the present application will be explained in detail.
Fig. 2 is a flowchart of a message sending method according to an embodiment of the present application. The method may be applied to a network node, in particular to a message distributor in the network node, which may be the message distributor 103 described in the embodiment of fig. 1 above. Referring to fig. 2, the method includes the following steps.
Step 201: and the network node allocates storage resources for each module in the n modules according to the service priority of all the modules in the n modules, wherein n is an integer greater than or equal to 2.
The n modules are at least two modules which need to perform network communication in the network node, and the n modules compete for resources during network communication. For example, the network node may be a blockchain node in a blockchain system (including but not limited to a federation chain system), in which case, the n modules may be a consensus module, a blockchain data synchronization module, a file upload and download module, and other modules in the blockchain node that need to perform network communication.
For each of the n modules, the module has a message identification for identifying messages generated by the module and for identifying messages that need to be sent to the module. That is, the message generated by this module will carry the message identifier, and the message addressed to this module will also carry the message identifier. For example, the message identifier may be a message code or a message type.
For each of the n modules, the service priority of the module is used to indicate the degree of influence of the module on the system service quality, i.e. represents the importance degree of the module, which is represented by the priority of the module in resource competition. That is to say, the higher the service priority of the module is, the greater the influence degree of the module on the system service quality is, the more important the module is, the higher the priority of the module in resource competition is, the more priority is required to ensure the network communication of the module. Conversely, the lower the service priority of the module, the smaller the influence degree of the module on the system service quality, and the less important the module is, the lower the priority of the module in resource competition is, the less the module needs to preferentially ensure the network communication of the module. The service priority of this module may be indicated with a weight. The weight of this module may be set in advance, such as may be set manually by a technician. The weight of this module is positively correlated with the service priority of this module. That is, the greater the weight of this module, the higher the service priority of this module is indicated. Conversely, the smaller the weight of the module, the lower the service priority of the module is indicated.
The storage resource is a resource that each module needs to use when performing network communication. The storage resource may include a storage space size and may further include a maximum storage amount. The size of the storage space refers to the capacity of the storage space, i.e. the number of bytes of data that can be accommodated by the storage space, and the size of the storage space may include the size of a memory and the size of a cache. The maximum storage amount refers to the number of messages that the storage space can store at maximum. The service priority of each module is positively correlated with the memory resources allocated to each module. That is, the higher the service priority of a module, the more memory resources are allocated to that module. The lower the service priority of a module, the less memory resources are allocated to this module. That is, for different modules, the storage resources that can be used when performing network communication are planned according to the service priority. Therefore, under the conditions of high system load and limited network bandwidth, the messages of each module can be ensured to be received and transmitted in time according to the service priority of each module, so that the normal network communication of each module is ensured, and the whole system can be used.
Specifically, the operation of step 201 may be: the network node accumulates the weights of all the modules in the n modules to obtain a total weight; dividing the total storage resource by the total weight to obtain a target storage resource; for each of the n modules, the weight of the module is multiplied by the target storage resource to obtain the storage resource allocated to the module.
The total storage resource is all storage resources in the network node for implementing the network communication of the n modules. For example, the total storage resource may include a capacity of all storage spaces in the network node for implementing network communication of the n modules (which may be referred to as a total storage space size), and further may include a maximum number of messages that can be stored in the storage spaces (which may be referred to as a maximum total storage amount).
The target storage resource obtained by dividing the total storage resource by the total weight is a storage resource to be allocated for the unit weight. Therefore, the weight of a module is multiplied by the target storage resource to obtain the storage resource allocated to the module. Therefore, the storage resources of each module are distributed according to the weight of each module, and the storage resources of each module are distributed according to the service priority of each module.
For example, the total storage resource includes a total storage space size, and the network node may divide the total storage space size by the total weight to obtain a target storage space size, and then multiply the weight of one module by the target storage space size to obtain a storage space size allocated to the module. For another example, the total storage resource further includes a maximum total storage amount, and the network node may divide the maximum total storage amount by the total weight to obtain a target storage amount, and multiply the weight of one module by the target storage amount to obtain the maximum storage amount allocated to the module.
In some embodiments, for each of the n modules, the module may be registered with the message distributor prior to network communication, the registered content including a weight and a message identification for the module. When the message distributor is initialized, the weights of all the registered n modules can be scanned, then the total storage resources are divided by the total weight of the n modules to obtain target storage resources required to be allocated by the unit weight, and then the required storage resources are allocated to the modules according to the weights of the modules and the target storage resources. It should be noted that if the registered weight of a module is too small, the message distributor may appropriately adjust the registered weight of the module, for example, the registered weight of the module may be adjusted to a minimum default weight, so as to ensure that the module can perform network communication normally.
Step 202: for each of the n modules, the network node creates a message channel with the memory resource allocated to this module as the message channel for this module, resulting in n message channels.
The message channel of a module is used for storing messages generated by the module and for storing messages that need to be sent to the module. The message channel of the module may include a write channel for storing messages generated by the module and a read channel for storing messages addressed to the module.
The message channel of this module having a memory resource allocated to this module means that the message channel of this module can use this memory resource. Assuming that the storage resource includes a storage space size and a maximum storage amount, the capacity of the storage space available for the message channel of the module is the storage space size, and the maximum number of messages that can be stored by the message channel of the module is the maximum storage amount.
For a write channel and a read channel in a message channel of the module, the storage resources that can be used by the write channel and the read channel may be equal, that is, the storage resources that can be used by the write channel and the read channel of the module are both half of the storage resources allocated to the module; alternatively, the memory resources available for the two modules may be different, for example, the memory resource available for the write channel of the module is two thirds of the memory resource allocated to the module, and the memory resource available for the read channel of the module is one third of the memory resource allocated to the module. The embodiment of the present application does not limit the proportion of the storage resources that can be used by the write channel and the read channel of the module in the storage resources allocated to the module, as long as it is ensured that both the write channel and the read channel of the module can use a part of the storage resources allocated to the module, and the sum of the storage resources that can be used by the write channel and the read channel of the module is the storage resource allocated to the module.
The n modules use the n message channels for network communication. On one hand, messages of different modules are isolated through different message channels, and when one module breaks down during message receiving and sending, other modules are not affected, so that mutual interference of the modules due to difference of processing capacity is reduced to a certain extent, and the parallel processing capacity of the messages is improved. On the other hand, since each module is provided with a message channel for storing messages according to the service priority, the receiving and sending rate of the messages can be smoothed in response to the burst traffic.
Step 203: the network node stores the message generated by the ith module in the n modules to the message channel of the ith module, wherein i is an integer greater than or equal to 1 and less than or equal to n.
The network node may store the message generated by the ith module to the write channel of the ith module. Optionally, after receiving a message generated by a certain module, the network node may determine which module generates the message according to a message identifier carried in the message, and then store the message to a message channel of the module that generates the message.
In some embodiments, the network node may also perform some checking operations before storing the message generated by the ith module in the write channel of the ith module. Specifically, the network node may determine whether the byte number of the message generated by the ith module is smaller than the capacity of the free storage space of the write channel of the ith module, and determine whether the number of messages already stored in the write channel of the ith module is smaller than the maximum storage number of the write channel of the ith module; if the byte number of the message generated by the ith module is smaller than the capacity of the free storage space of the write channel of the ith module and the number of the messages stored in the write channel of the ith module is smaller than the maximum storage number of the write channel of the ith module, storing the message generated by the ith module into the write channel of the ith module; and if the byte number of the message generated by the ith module is larger than or equal to the capacity of the free storage space of the write channel of the ith module and/or the number of the messages stored by the write channel of the ith module is equal to the maximum storage number of the write channel of the ith module, discarding the message generated by the ith module and returning abnormal reminding information to the ith module.
And under the condition that the byte number of the message generated by the ith module is less than the capacity of the free storage space of the write channel of the ith module, and the number of the messages stored in the write channel of the ith module is less than the maximum storage number of the write channel of the ith module, the write channel of the ith module currently has enough residual storage resources to store the message, so that the message can be stored in the write channel of the ith module.
And when the byte number of the message generated by the ith module is greater than or equal to the capacity of the free storage space of the write channel of the ith module, and/or the number of the messages already stored by the write channel of the ith module is equal to the maximum storage number of the write channel of the ith module, the write channel of the ith module currently has insufficient remaining storage resources to store the message, that is, the current remaining storage resources of the write channel of the ith module are insufficient, the message backlog has occurred, and the message cannot be stored any more.
It is noted that for a module, if the rate at which the module generates messages is greater than the rate at which the network node sends messages generated by the module into the network, then a backlog of messages occurs in the write channel of the module. In this case, in order to avoid the system from crashing due to too high load, the network node needs to discard the message subsequently generated by this module and return an exception notification message to this module.
Step 204: the network node sends a message stored by one of the n message channels.
In general, a network connection can only send one message at a time, and thus the network node needs to select a message stored in one message channel from the n message channels to send. The network node may send a message stored by a write channel in one of the n message channels, and may send the message to a client or other network nodes as needed.
Specifically, the network node may select one message channel from the n message channels according to the service priorities of all the n modules, and then send a message stored in the selected message channel, that is, send a message stored in a write channel in the selected message channel.
In the embodiment of the application, when the messages stored in the n message channels are sent, the messages are sent by referring to the service priority of the n modules. Therefore, the higher the service priority of the module is, the more likely the message stored in the message channel of the module is to be sent out, and the availability of the whole system can be further improved.
Wherein, the operation of the network node selecting one message channel from the n message channels according to the service priority of all the modules in the n modules may be: the network node divides the designated interval according to the weights of all the modules in the n modules to obtain n subintervals which are in one-to-one correspondence with the n modules; generating a random number within a designated interval; and selecting the message channel of the module corresponding to the subinterval in which the random number is positioned.
For each module in the n modules, the proportion of the sub-interval corresponding to the module in the specified interval is the proportion of the weight of the module in the total weight of the n modules. In this case, the higher the weight of a certain module is, the higher the proportion of the sub-interval corresponding to the module in the specified interval is, the higher the probability that the random number in the specified interval falls in the sub-interval corresponding to the module is, and thus the probability of selecting the message channel of the module is higher. Thus, the higher the weight of the module, i.e. the module with higher service priority, the higher the probability that the message channel is selected, the higher the probability that the message stored in the message channel is sent out.
Of course, the network node may also select one message channel from the n message channels in other manners according to the service priorities of all the modules in the n modules, as long as it is ensured that the selection of the message channel is performed with reference to the service priorities of the n modules.
Further, the network node may store the message generated by the ith module in the message channel of the ith module and send the message, and the network node may also receive the message sent to the ith module and store the message sent to the ith module in the message channel of the ith module, specifically, in the read channel of the ith module, where the message stored in the read channel of the ith module may be read by the ith module.
Optionally, after receiving a message sent by a client or another network node, the network node may determine, according to a message identifier carried in the message, to which module the message is sent, and then may store the message to a message channel of the module to which the message needs to be sent.
Each of the n modules may consume messages from a respective read channel. For example, when the ith module needs to consume the message, whether the message is stored in the read channel of the ith module can be checked in a polling mode; if the read channel of the ith module has a message, reading the message; if no message exists in the read channel of the ith module, continuing polling until the read channel of the ith module receives the message from the network and then reads the message.
In some embodiments, the network node may also perform some checking operations before storing the message addressed to the ith module in the read channel of the ith module. Specifically, the network node may determine whether the number of bytes of the message sent to the i-th module is smaller than the capacity of the free storage space of the read channel of the i-th module, and determine whether the number of messages stored in the read channel of the i-th module is smaller than the maximum storage number of the read channel of the i-th module; if the byte number of the message sent to the ith module is smaller than the capacity of the free storage space of the read channel of the ith module and the number of the messages stored in the read channel of the ith module is smaller than the maximum storage number of the read channel of the ith module, storing the message sent to the ith module to the read channel of the ith module; if the byte number of the message sent to the ith module is larger than or equal to the capacity of the free storage space of the read channel of the ith module, and/or the number of the messages stored in the read channel of the ith module is equal to the maximum storage number of the read channel of the ith module, the message sent to the ith module is discarded.
When the byte number of the message sent to the ith module is smaller than the capacity of the free storage space of the read channel of the ith module and the number of the messages already stored by the read channel of the ith module is smaller than the maximum storage number of the read channel of the ith module, the read channel of the ith module currently has enough remaining storage resources to store the message, so that the message can be stored in the read channel of the ith module.
And when the byte number of the message sent to the ith module is greater than or equal to the capacity of the free storage space of the read channel of the ith module, and/or the number of the messages already stored in the read channel of the ith module is equal to the maximum storage number of the read channel of the ith module, the read channel of the ith module currently has insufficient remaining storage resources to store the message, that is, the current remaining storage resources of the read channel of the ith module are insufficient, the message backlog has occurred, and the message cannot be stored any more, if the message is stored continuously under such a condition, the system may be abnormal, so the message needs to be discarded at this time.
It is noted that for a module, if the rate at which the network node receives messages addressed to the module is greater than the rate at which the module consumes messages, a backlog of messages occurs in the read channel of the module, in which case, in order to avoid a system crash due to excessive load, the network node needs to discard subsequent messages received from the network.
For ease of understanding, the above message sending and receiving process is illustrated below in conjunction with fig. 3.
Referring to fig. 3, the network node 1 includes three modules, namely, an a1 module, a B1 module, and a C1 module, that need network communication, and the network node 1 allocates storage resources to the modules according to service priorities of the three modules, and then creates a message channel with the allocated storage resources for each module, where the message channel includes a write channel. The network node 2 includes three modules, i.e., an a2 module, a B2 module, and a C2 module, which need to perform network communication, and the network node 2 allocates storage resources to the modules according to service priorities of the three modules, and then creates a message channel with the allocated storage resources for each module, where the message channel includes a read channel.
For the network node 1, the message generated by the a1 module is stored in the write channel of the a1 module, the message generated by the B1 module is stored in the write channel of the B1 module, and the message generated by the C1 module is stored in the write channel of the C1 module. In the process of storing messages to the write channels of the A1 module, the B1 module and the C1 module, if the write channel of a certain module has message backlog, the message generated by the module is discarded, and exception reminding information is returned to the module. Then, one write channel is selected from the write channels of the three modules according to the service priorities of the a1 module, the B1 module, and the C1 module, and the message in the selected one write channel is sent to the network through the sending interface.
For the network node 2, the network node 2 receives a message from the network through the receiving interface, stores the message, which needs to be sent to the a2 module, in the received message into the read channel of the a2 module, stores the message, which needs to be sent to the B2 module, in the received message into the read channel of the B2 module, and stores the message, which needs to be sent to the C2 module, in the received message into the read channel of the C2 module. In the process of storing messages in the read channels of the A2 module, the B2 module and the C2 module, if the read channel of a certain module has message backlog, the messages which are required to be sent to the module in the received messages are discarded. Thereafter, the A2 module reads messages from the read channel of the A2 module, the B2 module reads messages from the read channel of the B2 module, and the C2 module reads messages from the read channel of the C2 module.
In the embodiment of the application, storage resources are allocated to each module according to the service priority of n modules needing network communication in a network node, then a message channel with the allocated storage resources is created for each module, and the generated message is stored and sent through the message channel of each module. Therefore, for different modules, the storage resources which can be used when the messages are sent are planned according to the service priority, so that the network communication of the modules with higher service priority can be preferentially ensured, and the overall availability of the system can be further ensured. In addition, because the messages of different modules are isolated through different message channels, the mutual interference of the modules caused by the difference of processing capacity can be reduced to a certain extent, and the parallel processing capacity of the messages is improved. Meanwhile, because each module is provided with a message channel for storing messages according to the service priority, the burst traffic can be handled, and the message receiving and sending rate can be smoothed.
In addition, in the embodiment of the present application, when sending a message stored in n message channels, the message may be sent with reference to the service priority of n modules. Therefore, the higher the service priority of the module is, the more likely the message stored in the message channel of the module is to be sent out, and the availability of the whole system can be further improved.
Fig. 4 is a schematic structural diagram of a message sending apparatus provided in an embodiment of the present application, where the apparatus may be implemented by software, hardware, or a combination of the two as part or all of a network node. Referring to fig. 4, the apparatus includes: an allocation module 401, a creation module 402, a storage module 403, and a sending module 404.
The allocation module 401 is configured to allocate, according to service priorities of all modules in n modules that need to perform network communication in a network node, a storage resource to each module in the n modules, where the service priority of each module is in a positive correlation with the storage resource allocated to each module, and n is an integer greater than or equal to 2;
a creating module 402, configured to create, for each of the n modules, a message channel with a storage resource allocated to the one module as a message channel of the one module, so as to obtain n message channels;
a storage module 403, configured to store a message generated by an ith module of the n modules into a message channel of the ith module, where i is an integer greater than or equal to 1 and less than or equal to n;
a sending module 404, configured to send a message stored in one of the n message channels.
Optionally, the sending module 404 is configured to:
selecting one message channel from the n message channels according to the service priority of all the modules in the n modules;
and sending the message stored in the selected one message channel.
Optionally, the sending module 404 is configured to:
dividing the designated interval according to the weights of all the modules in the n modules to obtain n subintervals which are in one-to-one correspondence with the n modules, wherein the weights are used for indicating the service priority;
generating a random number in a designated interval;
and selecting a message channel of a module corresponding to a subinterval in which the random number is positioned.
Optionally, the storage resource includes a storage space size and a maximum storage amount, the message channel includes a write channel and a read channel, and the storage module 403 is configured to:
if the byte number of the message generated by the ith module is smaller than the capacity of the free storage space of the write channel of the ith module and the number of the messages stored in the write channel of the ith module is smaller than the maximum storage number of the write channel of the ith module, storing the message generated by the ith module into the write channel of the ith module;
the sending module 404 is configured to:
and sending the message stored by the writing channel in one of the n message channels.
Optionally, the apparatus further comprises:
a receiving module for receiving a message sent to the ith module;
the storage module 403 is further configured to store the message sent to the ith module in the read channel of the ith module if the byte count of the message sent to the ith module is smaller than the capacity of the free storage space of the read channel of the ith module, and the number of messages already stored in the read channel of the ith module is smaller than the maximum storage number of the read channel of the ith module, where the message stored in the read channel of the ith module is provided for the ith module to read.
Optionally, the assignment module 401 is configured to:
accumulating the weights of all the modules in the n modules to obtain a total weight, wherein the weight is used for indicating the service priority;
dividing the total storage resource by the total weight to obtain a target storage resource;
and multiplying the weight of each module in the n modules by the target storage resource to obtain the storage resource distributed to each module.
Optionally, the network node is a block chain node in a block chain system.
In the embodiment of the application, storage resources are allocated to each module according to the service priority of n modules needing network communication in a network node, then a message channel with the allocated storage resources is created for each module, and the generated message is stored and sent through the message channel of each module. Therefore, for different modules, the storage resources which can be used when the messages are sent are planned according to the service priority, so that the network communication of the modules with higher service priority can be preferentially ensured, and the overall availability of the system can be further ensured. In addition, because the messages of different modules are isolated through different message channels, the mutual interference of the modules caused by the difference of processing capacity can be reduced to a certain extent, and the parallel processing capacity of the messages is improved. Meanwhile, because each module is provided with a message channel for storing messages according to the service priority, the burst traffic can be handled, and the message receiving and sending rate can be smoothed.
In addition, in the embodiment of the present application, when sending a message stored in n message channels, the message may be sent with reference to the service priority of n modules. Therefore, the higher the service priority of the module is, the more likely the message stored in the message channel of the module is to be sent out, and the availability of the whole system can be further improved.
It should be noted that: in the message sending apparatus provided in the foregoing embodiment, only the division of the functional modules is described as an example when sending a message, and in practical applications, the function distribution may be completed by different functional modules as needed, that is, the internal structure of the apparatus is divided into different functional modules to complete all or part of the functions described above.
Each functional unit and module in the above embodiments may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit, and the integrated unit may be implemented in a form of hardware, or in a form of software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used to limit the protection scope of the embodiments of the present application.
The message sending apparatus provided in the above embodiment and the message sending method embodiment belong to the same concept, and for specific working processes and technical effects brought by the units and modules in the above embodiments, reference may be made to the method embodiment section, which is not described herein again.
Fig. 5 is a schematic structural diagram of a computer device according to an embodiment of the present application, where the computer device may be a network node according to the foregoing embodiment. As shown in fig. 5, the computer device 5 includes: a processor 50, a memory 51 and a computer program 52 stored in the memory 51 and operable on the processor 50, the steps in the message sending method in the above embodiments being implemented when the processor 50 executes the computer program 52.
The computer device 5 may be a general purpose computer device or a special purpose computer device. In a specific implementation, the computer device 5 may be a desktop computer, a laptop computer, a network server, a palmtop computer, a mobile phone, a tablet computer, a wireless terminal device, a communication device, or an embedded device, and the embodiment of the present application does not limit the type of the computer device 5. Those skilled in the art will appreciate that fig. 5 is merely an example of the computer device 5 and does not constitute a limitation of the computer device 5, and may include more or less components than those shown, or combine some of the components, or different components, such as input output devices, network access devices, etc.
The Processor 50 may be a Central Processing Unit (CPU), and the Processor 50 may also be other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components, etc. A general purpose processor may be a microprocessor or any conventional processor.
The memory 51 may in some embodiments be an internal storage unit of the computer device 5, such as a hard disk or a memory of the computer device 5. The memory 51 may also be an external storage device of the computer device 5 in other embodiments, such as a plug-in hard disk provided on the computer device 5, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and so on. Further, the memory 51 may also include both an internal storage unit and an external storage device of the computer device 5. The memory 51 is used for storing an operating system, an application program, a BootLoader (BootLoader), data, and other programs, such as program codes of a computer program. The memory 51 may also be used to temporarily store data that has been output or is to be output.
An embodiment of the present application further provides a computer device, where the computer device includes: at least one processor, a memory, and a computer program stored in the memory and executable on the at least one processor, the processor implementing the steps of any of the various method embodiments described above when executing the computer program.
Embodiments of the present application further provide a computer-readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the steps in the foregoing method embodiments may be implemented.
The embodiments of the present application provide a computer program product, which when run on a computer causes the computer to perform the steps of the above-described method embodiments.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, all or part of the processes in the above method embodiments may be implemented by a computer program, which may be stored in a computer readable storage medium and used by a processor to implement the steps of the above method embodiments. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer readable medium may include at least: any entity or apparatus capable of carrying computer program code to a photographing apparatus/terminal device, a recording medium, computer Memory, ROM (Read-Only Memory), RAM (Random Access Memory), CD-ROM (Compact Disc Read-Only Memory), magnetic tape, floppy disk, optical data storage device, etc. The computer-readable storage medium referred to herein may be a non-volatile storage medium, in other words, a non-transitory storage medium.
It should be understood that all or part of the steps for implementing the above embodiments may be implemented by software, hardware, firmware or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. The computer instructions may be stored in the computer-readable storage medium described above.
In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to the related descriptions of other embodiments for parts that are not described or illustrated in a certain embodiment.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus/computer device and method may be implemented in other ways. For example, the above-described apparatus/computer device embodiments are merely illustrative, and for example, a module or a unit may be divided into only one logical function, and may be implemented in other ways, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not implemented. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
Units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
The above-mentioned embodiments are only used for illustrating the technical solutions of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present application and are intended to be included within the scope of the present application.
Claims (9)
1. A method for sending a message, the method comprising:
allocating storage resources to each of n modules needing network communication in a network node according to service priorities of all the modules, wherein the service priority of each module is in positive correlation with the storage resources allocated to each module, and n is an integer greater than or equal to 2;
for each of the n modules, creating a message channel with storage resources allocated to the one module as the message channel of the one module to obtain n message channels;
storing a message generated by an ith module of the n modules to a message channel of the ith module, wherein i is an integer greater than or equal to 1 and less than or equal to n;
selecting one message channel from the n message channels according to the service priority of all the n modules;
and sending the message stored in the selected one message channel.
2. The method of claim 1, wherein said selecting one of said n message channels based on service priorities of all of said n modules comprises:
dividing the designated interval according to the weights of all the modules in the n modules to obtain n subintervals corresponding to the n modules one to one, wherein the weights are used for indicating the service priority;
generating a random number within the designated interval;
and selecting a message channel of a module corresponding to a subinterval in which the random number is positioned.
3. The method of claim 1 or 2, wherein the storage resources include a storage space size and a maximum storage amount, the message channel includes a write channel, and the storing the message generated by an ith module of the n modules to the message channel of the ith module includes:
if the byte number of the message generated by the ith module is smaller than the capacity of the free storage space of the write channel of the ith module and the number of the messages stored in the write channel of the ith module is smaller than the maximum storage number of the write channel of the ith module, storing the message generated by the ith module into the write channel of the ith module;
the sending the message stored in the selected one of the message channels includes:
and sending the message stored by the writing channel in the selected one message channel.
4. The method of claim 1 or 2, wherein the storage resources include a storage space size and a maximum storage amount, the message channel includes a read channel, the method further comprising:
receiving a message addressed to said ith module;
if the byte number of the message sent to the ith module is smaller than the capacity of the free storage space of the read channel of the ith module, and the number of the messages stored in the read channel of the ith module is smaller than the maximum storage number of the read channel of the ith module, storing the message sent to the ith module to the read channel of the ith module, wherein the messages stored in the read channel of the ith module are provided for the ith module to read.
5. The method according to claim 1 or 2, wherein said allocating storage resources for each of n modules in the network node, according to service priorities of all of the n modules that need to perform network communication, comprises:
accumulating the weights of all the modules in the n modules to obtain a total weight, wherein the weight is used for indicating the service priority;
dividing the total storage resource by the total weight to obtain a target storage resource;
and multiplying the weight of each module in the n modules by the target storage resource to obtain the storage resource distributed to each module.
6. The method of claim 1 or 2, wherein the network node is a blockchain node in a blockchain system.
7. A message transmission apparatus, characterized in that the apparatus comprises:
the network node comprises an allocation module, a storage module and a processing module, wherein the allocation module is used for allocating storage resources to each module in n modules needing network communication according to service priorities of all the modules in the n modules, the service priority of each module is in positive correlation with the storage resources allocated to each module, and n is an integer greater than or equal to 2;
a creating module configured to create, for each of the n modules, a message channel with a storage resource allocated to the one module as a message channel of the one module, so as to obtain n message channels;
a storage module, configured to store a message generated by an ith module of the n modules to a message channel of the ith module, where i is an integer greater than or equal to 1 and less than or equal to n;
and the sending module is used for selecting one message channel from the n message channels according to the service priority of all the modules in the n modules and sending the message stored in the selected message channel.
8. A computer device, characterized in that the computer device comprises a memory, a processor and a computer program stored in the memory and executable on the processor, which computer program, when executed by the processor, implements the method according to any of claims 1 to 6.
9. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program which, when executed by a processor, implements the method of any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110341751.XA CN113162990B (en) | 2021-03-30 | 2021-03-30 | Message sending method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110341751.XA CN113162990B (en) | 2021-03-30 | 2021-03-30 | Message sending method, device, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113162990A CN113162990A (en) | 2021-07-23 |
| CN113162990B true CN113162990B (en) | 2022-08-16 |
Family
ID=76885481
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110341751.XA Active CN113162990B (en) | 2021-03-30 | 2021-03-30 | Message sending method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113162990B (en) |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6018515A (en) * | 1997-08-19 | 2000-01-25 | Ericsson Messaging Systems Inc. | Message buffering for prioritized message transmission and congestion management |
| US20030135609A1 (en) * | 2002-01-16 | 2003-07-17 | Sun Microsystems, Inc. | Method, system, and program for determining a modification of a system resource configuration |
| US7143413B2 (en) * | 2002-05-15 | 2006-11-28 | Hewlett-Packard Development Company, L.P. | Method and system for allocating system resources among applications using weights |
| CN101741884B (en) * | 2008-11-25 | 2012-07-04 | 华为技术有限公司 | Distributed storage method and device |
| CN102915254B (en) * | 2011-08-02 | 2018-04-06 | 中兴通讯股份有限公司 | task management method and device |
| CN109857595A (en) * | 2019-02-28 | 2019-06-07 | 新华三信息安全技术有限公司 | A kind of back up memory space distribution method and device |
| CN110554922A (en) * | 2019-09-05 | 2019-12-10 | 北京安云世纪科技有限公司 | System resource allocation method and device |
| CN111404838A (en) * | 2020-03-17 | 2020-07-10 | 上海云励科技有限公司 | Message processing method, device and equipment |
| CN111563124B (en) * | 2020-05-08 | 2023-06-23 | 中国工商银行股份有限公司 | Operation processing method, device and system based on block chain |
-
2021
- 2021-03-30 CN CN202110341751.XA patent/CN113162990B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN113162990A (en) | 2021-07-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5815678A (en) | Method and apparatus for implementing an application programming interface for a communications bus | |
| US6590865B1 (en) | Transmission system, bandwidth management apparatus, and bandwidth management method | |
| CN107819797B (en) | Access request processing method and device | |
| CN109167819B (en) | Data synchronization system, method, device and storage medium | |
| CN113138802B (en) | Command distribution device, method, chip, computer device and storage medium | |
| US20180069927A1 (en) | Server Access Processing System | |
| CN111163130A (en) | Network service system and data transmission method thereof | |
| CN110800328A (en) | Buffer status reporting method, terminal and computer storage medium | |
| CN112214313A (en) | Memory allocation method and related equipment | |
| CN111221638A (en) | Scheduling processing method, device, equipment and medium for concurrent tasks | |
| CN111538572A (en) | Task processing method, device, scheduling server and medium | |
| CN115002046A (en) | Message processing method, NUMA node, electronic device and storage medium | |
| CN116414534A (en) | Task scheduling method, device, integrated circuit, network equipment and storage medium | |
| CN113162990B (en) | Message sending method, device, equipment and storage medium | |
| CN109995667A (en) | The method and sending device of transmitting message | |
| CN108830724B (en) | Resource data packet processing method and terminal equipment | |
| KR20030012048A (en) | Error processing method for pdcp | |
| CN115220993A (en) | Process monitoring method, device, vehicle and storage medium | |
| CN115794396A (en) | Resource allocation method, system and electronic equipment | |
| CN115344405A (en) | Data processing method, network interface card, electronic equipment and storage medium | |
| JP2007221522A (en) | Polling device, terminal device, polling method and program | |
| CN115878309A (en) | Resource allocation method, device, processing core, equipment and computer readable medium | |
| CN111030944A (en) | Message sending method and equipment | |
| CN111092817A (en) | Data transmission method and device | |
| US7324508B2 (en) | Crossbar switching circuit and operating method thereof |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |