CN108874541A - Distributed arithmetic method, apparatus, computer equipment and storage medium - Google Patents
Distributed arithmetic method, apparatus, computer equipment and storage medium Download PDFInfo
- Publication number
- CN108874541A CN108874541A CN201810569361.6A CN201810569361A CN108874541A CN 108874541 A CN108874541 A CN 108874541A CN 201810569361 A CN201810569361 A CN 201810569361A CN 108874541 A CN108874541 A CN 108874541A
- Authority
- CN
- China
- Prior art keywords
- distributed
- memory grid
- grid
- operation result
- node
- 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.)
- Pending
Links
Classifications
-
- 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/5061—Partitioning or combining of resources
- G06F9/5072—Grid computing
-
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/54—Indexing scheme relating to G06F9/54
- G06F2209/548—Queue
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Multi Processors (AREA)
Abstract
This application discloses a kind of distributed arithmetic method, apparatus, computer equipment and storage mediums.This method includes：The deployment information for obtaining distributed memory grid, is correspondingly arranged Distributed Message Queue according to deployment information；The processor active task that message-oriented middleware is transmitted is obtained, the processor active task is executed in the correspondence operation node of distributed memory grid and obtains operation result；The corresponding arithmetic logic of operation result is obtained, operation result is stored into distributed memory grid corresponding to memory node.This method forms Distributed Message Queue using the partial cache address of distributed memory grid, the data stored in each Distributed Message Queue are sufficient for the operation demand of current grid, without obtaining from other Distributed Message Queues, the computational efficiency of distributed arithmetic is improved.
Description
Technical field
This application involves distributed arithmetic technical fields more particularly to a kind of distributed arithmetic method, apparatus, computer to set
Standby and storage medium.
Background technique
Using Ignite distributed memory grid, (Ignite memory data organization frame is a high-performance, collection at present
At changing and distributed memory calculates and affairs platform, handled for large-scale data set, than traditional based on disk or sudden strain of a muscle
The technology deposited has higher performance, while he is also to apply to provide high-performance, distributed memory between different data sources
The function of middle data organization and management) calculate when because calculate speed it is very fast, significantly larger than be written database speed
Degree, according to Kafka, (Kafka is that a kind of distributed post of high-throughput subscribes to message system, it can handle consumer's rule
Everything flow data in the website of mould) it is used as message queue, in the case where size of message is very big, treatment effeciency is relatively low,
It is unsatisfactory for the requirement of distributed computing.
Summary of the invention
This application provides a kind of distributed arithmetic method, apparatus, computer equipment and storage mediums, it is intended to solve existing
It is very big in size of message according to Kafka as message queue when in technology based on the progress operation of Ignite distributed memory grid
In the case where, the relatively low problem of distributed arithmetic treatment effeciency.
In a first aspect, this application provides a kind of distributed arithmetic methods comprising：
The deployment information for obtaining distributed memory grid, is correspondingly arranged Distributed Message Queue according to deployment information；
The processor active task that message-oriented middleware is transmitted is obtained, executes institute in the correspondence operation node of distributed memory grid
It states processor active task and obtains operation result；
The corresponding arithmetic logic of operation result is obtained, operation result is stored into distributed memory grid corresponding wait deposit
Store up node.
Second aspect, this application provides a kind of distributed arithmetic devices comprising：
Distributed Message Queue establishes unit, for obtaining the deployment information of distributed memory grid, according to deployment information
It is correspondingly arranged Distributed Message Queue；
Grid arithmetic element, the processor active task transmitted for obtaining message-oriented middleware, in pair of distributed memory grid
It meets the tendency of and executes the processor active task in operator node and obtain operation result；
Operation result storage unit stores operation result to distribution for obtaining the corresponding arithmetic logic of operation result
It is corresponding to memory node in formula memory grid.
The third aspect, the application provide a kind of computer equipment again, including memory, processor and are stored in described deposit
On reservoir and the computer program that can run on the processor, the processor realize this when executing the computer program
The described in any item distributed arithmetic methods provided are provided.
Fourth aspect, present invention also provides a kind of storage mediums, wherein the storage medium is stored with computer program,
The computer program includes program instruction, and described program instruction makes the processor execute the application when being executed by a processor
The described in any item distributed arithmetic methods provided.
The application provides a kind of distributed arithmetic method, apparatus, computer equipment and storage medium.This method passes through acquisition
The deployment information of distributed memory grid is correspondingly arranged Distributed Message Queue according to deployment information；Obtain message-oriented middleware institute
The processor active task of transmission executes the processor active task in the correspondence operation node of distributed memory grid and obtains operation result；
The corresponding arithmetic logic of operation result is obtained, operation result is stored into distributed memory grid corresponding to memory node.
This method forms Distributed Message Queue, each Distributed Message Queue using the partial cache address of distributed memory grid
Middle stored data are sufficient for the operation demand of current grid, without obtaining from other Distributed Message Queues, improve
The computational efficiency of distributed arithmetic.
Detailed description of the invention
Technical solution in ord to more clearly illustrate embodiments of the present application, below will be to needed in embodiment description
Attached drawing is briefly described, it should be apparent that, the accompanying drawings in the following description is some embodiments of the present application, general for this field
For logical technical staff, without creative efforts, it is also possible to obtain other drawings based on these drawings.
Fig. 1 is a kind of schematic flow diagram of distributed arithmetic method provided by the embodiments of the present application；
Fig. 2 is a kind of sub-process schematic diagram of distributed arithmetic method provided by the embodiments of the present application；
Fig. 3 is a kind of another schematic flow diagram of distributed arithmetic method provided by the embodiments of the present application；
Fig. 4 is a kind of another schematic flow diagram of distributed arithmetic method provided by the embodiments of the present application；
Fig. 5 is a kind of another schematic flow diagram of distributed arithmetic method provided by the embodiments of the present application；
Fig. 6 is a kind of schematic block diagram of distributed arithmetic device provided by the embodiments of the present application；
Fig. 7 is a kind of subelement schematic block diagram of distributed arithmetic device provided by the embodiments of the present application；
Fig. 8 is a kind of another schematic block diagram of distributed arithmetic device provided by the embodiments of the present application；
Fig. 9 is a kind of another schematic block diagram of distributed arithmetic device provided by the embodiments of the present application；
Figure 10 is a kind of another schematic block diagram of distributed arithmetic device provided by the embodiments of the present application；
Figure 11 is a kind of schematic block diagram of computer equipment provided by the embodiments of the present application.
Specific embodiment
Below in conjunction with the attached drawing in the embodiment of the present application, technical solutions in the embodiments of the present application carries out clear, complete
Site preparation description, it is clear that described embodiment is some embodiments of the present application, instead of all the embodiments.Based on this Shen
Please in embodiment, every other implementation obtained by those of ordinary skill in the art without making creative efforts
Example, shall fall in the protection scope of this application.
It should be appreciated that ought use in this specification and in the appended claims, term " includes " and "comprising" instruction
Described feature, entirety, step, operation, the presence of element and/or component, but one or more of the other feature, whole is not precluded
Body, step, operation, the presence or addition of element, component and/or its set.
It is also understood that mesh of the term used in this present specification merely for the sake of description specific embodiment
And be not intended to limit the application.As present specification and it is used in the attached claims, unless on
Other situations are hereafter clearly indicated, otherwise " one " of singular, "one" and "the" are intended to include plural form.
It will be further appreciated that the term "and/or" used in present specification and the appended claims is
Refer to any combination and all possible combinations of one or more of associated item listed, and including these combinations.
Referring to Fig. 1, Fig. 1 is a kind of schematic flow diagram of distributed arithmetic method provided by the embodiments of the present application.The party
Method is applied in server.As shown in Figure 1, the method comprising the steps of S101~S103.
S101, the deployment information for obtaining distributed memory grid, are correspondingly arranged Distributed Message Queue according to deployment information.
In the present embodiment, distributed memory grid, that is, ignite distributed memory grid, with storage processor active task (example
Such as the commission calculating task of business personnel) message-oriented middleware connection.And stand alone type can be used in ignite distributed memory grid
The deployment way of ignite cluster can also use the deployment way of embedded ignite cluster.
For example, constructing ignite distributed memory grid according to 32 machines, embedded Ignite cluster can be used
Deployment way.The existing application of every machine is internally embedded the relevant jar packet of ignite cluster, utilizes the hair of ignite
Existing mechanism, establishes cluster automatically.
More specifically, each is taken out memory space of the caching as Distributed Message Queue of certain space, more
The spatial cache of machine establishes cluster according to the discovery mechanism of ignite automatically, by multiple memory space clusters of more machines
It is combined into a Distributed Message Queue (distributed MQ can be abbreviated as, MQ is the abbreviation of Message Queue).The distribution
Message queue has multiple nodes, is stored with all data relevant to a certain processor active task on each node.
In one embodiment, as shown in Fig. 2, step S101 includes：
S1011, according to be added distributed memory grid networked terminals, obtain distributed memory grid deployment information；
S1012, the buffer address that each networked terminals are obtained according to deployment information；
S1013, cluster is established according to the buffer address of each networked terminals that distributed memory grid is added, is distributed
Formula message queue.
In the present embodiment, the deployment information of distributed memory grid indicates that how many platform networked terminals joined cluster,
And the buffer address of each networked terminals is also to record in deployment information.The connection of distributed memory grid is added when each
Network termination is provided which the buffer address of certain space, can be after networked terminals establish cluster, by the buffer address of networked terminals
Established cluster individually uses Kafka as message queue as Distributed Message Queue.In the very big feelings of data volume
Under condition, Distributed Message Queue is also able to satisfy calculation process requirement.
S102, the processor active task that message-oriented middleware is transmitted is obtained, in the correspondence operation node of distributed memory grid
It executes the processor active task and obtains operation result.
For example, be stored with multiple processor active tasks on message-oriented middleware, each processor active task in the message between distributed on part
Corresponding ignite distributed memory grid will after the completion of the corresponding node in the ignite distributed memory grid calculates
Operation result is stored to the corresponding node of ignite distributed memory grid.Namely it is big in the ignite distributed memory grid
Part of nodes is used as the operation node of commission calculating, and the cache node that small part node is used as (is used as distributed message
Queue, to be stored with all data relevant to a certain processor active task).Section is calculated by being both arranged on distributed memory grid
Point, is also provided with cache node, can be relevant data all juxtapositions on one node, and it is mobile that there will be no data in this way, also
Network and the consumption of IO are not had.
In one embodiment, as shown in figure 3, another embodiment as step S102 includes：
S102a, the processor active task that message-oriented middleware is transmitted is obtained, the arithmetic logic of processor active task is parsed, according to operation
The corresponding operation node of logic positions calculations task, and processor active task is transmitted to corresponding operation node, in distributed memory
The processor active task, which is executed, in the correspondence operation node of grid obtains operation result.
In the present embodiment, will be according to the corresponding operation node of arithmetic logic positions calculations task, and processor active task is passed
Corresponding operation node is transported to, is each processor active task to realize quick calculating, need to be distributed to being stored with all phases
The corresponding operation node of Distributed Message Queue for closing data, local distributed message team is directly extracted by the operation node
Data in column, rapid computations obtain operation result, realize the optimization distribution of processor active task.
S103, the corresponding arithmetic logic of operation result is obtained, operation result is stored into distributed memory grid corresponding
To memory node.
For example, constructing ignite distributed memory grid according to 32 machines, it is denoted as-No. 32 machines of No. 1 machine respectively,
Wherein No. 1 machine is used to handle the commission calculating task of the province A1 business personnel, and No. 2 machines are used to handle the servant of the province A2 business personnel
Golden calculating task ... ..., No. 32 machines are used to handle the commission calculating task of the province A32 business personnel.
When No. 1 machine has received the first stroke processor active task that message-oriented middleware is transmitted, need to be transported on No. 1 machine
It calculates, operation result may be applied and carry out in corresponding a certain node or multiple nodes in-No. 32 machines of No. 2 machines
Calculate in next step, so when need to obtain it according to the arithmetic logic of the operation result and wait for memory node.Namely each node
On all store the relevant all data of corresponding to node processor active task, accomplished the distributed deployment in advance of data, nothing
, by operation result from a certain node motion to another node, the effect of distributed treatment need to be improved in subsequent calculating process
Rate.
I.e. ignite grid directly does Distributed Message Queue using the caching of own, in this way can be relevant data
All on one node, it is mobile that there will be no data in this way, and also there will be no the consumption of network and IO for juxtaposition.
In one embodiment, as shown in figure 4, another embodiment as step S103 includes：
S103a, the corresponding arithmetic logic of operation result is obtained, according to arithmetic logic positions calculations task orientation operation result
To memory node, operation result is stored into distributed memory grid corresponding to memory node.
In the present embodiment, the corresponding arithmetic logic of operation result is obtained, according to arithmetic logic positions calculations task orientation
Operation result to memory node, namely realize and operation result transmitted and is deployed in advance next application node, rather than
Operation efficiency is effectively raised from the Node extraction data again in calculating process.
In one embodiment, as shown in figure 5, further including after step S103：
If the fortune that message-oriented middleware is transmitted S104, is not detected in distributed memory grid in preset detection cycle
Calculation task caches the deployment information of distributed memory grid, and dismisses to the cluster of Distributed Message Queue.
In the present embodiment, it is transmitted if message-oriented middleware is not detected (in 12 hours) in preset detection cycle
Processor active task, then it represents that will not be used, can recorde at this time point again in the cluster short time of the Distributed Message Queue
The deployment information of cloth memory grid sets up cluster in order to subsequent again, while solving to the cluster of Distributed Message Queue
It dissipates, effectively saves system resource.
As it can be seen that this method forms Distributed Message Queue using the partial cache address of distributed memory grid, it is each
The data stored in Distributed Message Queue are sufficient for the operation demand of current grid, are not necessarily to from other distributed message teams
It is obtained in column, improves the computational efficiency of distributed arithmetic.
The embodiment of the present application also provides a kind of distributed arithmetic device, and the distributed arithmetic device is for executing aforementioned distribution
Any embodiment of formula operation method.Specifically, referring to Fig. 6, Fig. 6 is a kind of distributed arithmetic provided by the embodiments of the present application
The schematic block diagram of device.Distributed arithmetic device 100 can be configured in server.
As shown in fig. 6, distributed arithmetic device 100 includes that Distributed Message Queue establishes unit 101, grid arithmetic element
102 and operation result storage unit 103.
Distributed Message Queue establishes unit 101, for obtaining the deployment information of distributed memory grid, is believed according to deployment
Breath is correspondingly arranged Distributed Message Queue.
In the present embodiment, distributed memory grid, that is, ignite distributed memory grid, with storage processor active task (example
Such as the commission calculating task of business personnel) message-oriented middleware connection.And stand alone type can be used in ignite distributed memory grid
The deployment way of ignite cluster can also use the deployment way of embedded ignite cluster.
For example, constructing ignite distributed memory grid according to 32 machines, embedded Ignite cluster can be used
Deployment way.The existing application of every machine is internally embedded the relevant jar packet of ignite cluster, utilizes the hair of ignite
Existing mechanism, establishes cluster automatically.
More specifically, each is taken out memory space of the caching as Distributed Message Queue of certain space, more
The spatial cache of machine establishes cluster according to the discovery mechanism of ignite automatically, by multiple memory space clusters of more machines
It is combined into a Distributed Message Queue (distributed MQ can be abbreviated as, MQ is the abbreviation of Message Queue).The distribution
Message queue has multiple nodes, is stored with all data relevant to a certain processor active task on each node.
In one embodiment, as shown in fig. 7, Distributed Message Queue establishes unit 101 includes：
Novel acquiring unit 1011 is disposed, for obtaining distributed according to the networked terminals that distributed memory grid is added
The deployment information of memory grid；
Buffer address acquiring unit 1012, for obtaining the buffer address of each networked terminals according to deployment information；
Cluster establishes unit 1013, for being built according to the buffer address of each networked terminals that distributed memory grid is added
Vertical cluster, obtains Distributed Message Queue.
In the present embodiment, the deployment information of distributed memory grid indicates that how many platform networked terminals joined cluster,
And the buffer address of each networked terminals is also to record in deployment information.The connection of distributed memory grid is added when each
Network termination is provided which the buffer address of certain space, can be after networked terminals establish cluster, by the buffer address of networked terminals
Established cluster individually uses Kafka as message queue as Distributed Message Queue.In the very big feelings of data volume
Under condition, Distributed Message Queue is also able to satisfy calculation process requirement.
Grid arithmetic element 102, the processor active task transmitted for obtaining message-oriented middleware, in distributed memory grid
The processor active task, which is executed, in corresponding operation node obtains operation result.
For example, be stored with multiple processor active tasks on message-oriented middleware, each processor active task in the message between distributed on part
Corresponding ignite distributed memory grid will after the completion of the corresponding node in the ignite distributed memory grid calculates
Operation result is stored to the corresponding node of ignite distributed memory grid.Namely it is big in the ignite distributed memory grid
Part of nodes is used as the operation node of commission calculating, and the cache node that small part node is used as (is used as distributed message
Queue, to be stored with all data relevant to a certain processor active task).Section is calculated by being both arranged on distributed memory grid
Point, is also provided with cache node, can be relevant data all juxtapositions on one node, and it is mobile that there will be no data in this way, also
Network and the consumption of IO are not had.
In one embodiment, as shown in figure 8, another embodiment as grid arithmetic element 102 includes：
First positioning unit 102a, the processor active task transmitted for obtaining message-oriented middleware, parses the fortune of processor active task
Logic is calculated, is transmitted to corresponding operation section according to the corresponding operation node of arithmetic logic positions calculations task, and by processor active task
Point executes the processor active task in the correspondence operation node of distributed memory grid and obtains operation result.
In the present embodiment, will be according to the corresponding operation node of arithmetic logic positions calculations task, and processor active task is passed
Corresponding operation node is transported to, is each processor active task to realize quick calculating, need to be distributed to being stored with all phases
The corresponding operation node of Distributed Message Queue for closing data, local distributed message team is directly extracted by the operation node
Data in column, rapid computations obtain operation result, realize the optimization distribution of processor active task.
Operation result storage unit 103, for obtaining the corresponding arithmetic logic of operation result, by operation result store to point
It is corresponding to memory node in cloth memory grid.
For example, constructing ignite distributed memory grid according to 32 machines, it is denoted as-No. 32 machines of No. 1 machine respectively,
Wherein No. 1 machine is used to handle the commission calculating task of the province A1 business personnel, and No. 2 machines are used to handle the servant of the province A2 business personnel
Golden calculating task ... ..., No. 32 machines are used to handle the commission calculating task of the province A32 business personnel.
When No. 1 machine has received the first stroke processor active task that message-oriented middleware is transmitted, need to be transported on No. 1 machine
It calculates, operation result may be applied and carry out in corresponding a certain node or multiple nodes in-No. 32 machines of No. 2 machines
Calculate in next step, so when need to obtain it according to the arithmetic logic of the operation result and wait for memory node.Namely each node
On all store the relevant all data of corresponding to node processor active task, accomplished the distributed deployment in advance of data, nothing
, by operation result from a certain node motion to another node, the effect of distributed treatment need to be improved in subsequent calculating process
Rate.
I.e. ignite grid directly does Distributed Message Queue using the caching of own, in this way can be relevant data
All on one node, it is mobile that there will be no data in this way, and also there will be no the consumption of network and IO for juxtaposition.
In one embodiment, as shown in figure 9, another embodiment as operation result storage unit 103 includes：
Second positioning unit 103a, for obtaining the corresponding arithmetic logic of operation result, according to arithmetic logic positions calculations
Task orientation operation result to memory node, operation result is stored into distributed memory grid corresponding wait store section
Point.
In the present embodiment, the corresponding arithmetic logic of operation result is obtained, according to arithmetic logic positions calculations task orientation
Operation result to memory node, namely realize and operation result transmitted and is deployed in advance next application node, rather than
Operation efficiency is effectively raised from the Node extraction data again in calculating process.
In one embodiment, as shown in Figure 10, distributed arithmetic device 100 further includes：
Cluster dismisses unit 104, if for message to be not detected in distributed memory grid in preset detection cycle
The processor active task that middleware is transmitted caches the deployment information of distributed memory grid, and to Distributed Message Queue
Cluster dismissed.
In the present embodiment, it is transmitted if message-oriented middleware is not detected (in 12 hours) in preset detection cycle
Processor active task, then it represents that will not be used, can recorde at this time point again in the cluster short time of the Distributed Message Queue
The deployment information of cloth memory grid sets up cluster in order to subsequent again, while solving to the cluster of Distributed Message Queue
It dissipates, effectively saves system resource.
As it can be seen that the device forms Distributed Message Queue using the partial cache address of distributed memory grid, it is each
The data stored in Distributed Message Queue are sufficient for the operation demand of current grid, are not necessarily to from other distributed message teams
It is obtained in column, improves the computational efficiency of distributed arithmetic.
Above-mentioned distributed arithmetic device can be implemented as a kind of form of computer program, which can be such as
It is run in computer equipment shown in Figure 11.
Figure 11 is please referred to, Figure 11 is a kind of schematic block diagram of computer equipment provided by the embodiments of the present application.The calculating
500 equipment of machine equipment can be server.
Refering to fig. 11, which includes processor 502, memory and the net connected by system bus 501
Network interface 505, wherein memory may include non-volatile memory medium 503 and built-in storage 504.
The non-volatile memory medium 503 can storage program area 5031 and computer program 5032.The computer program
5032 include program instruction, which is performed, and processor 502 may make to execute a kind of distributed arithmetic method.
The processor 502 supports the operation of entire computer equipment 500 for providing calculating and control ability.
The built-in storage 504 provides environment for the operation of the computer program 5032 in non-volatile memory medium 503, should
When computer program 5032 is executed by processor 502, processor 502 may make to execute a kind of distributed arithmetic method.
The network interface 505 such as sends the task dispatching of distribution for carrying out network communication.Those skilled in the art can manage
It solves, structure shown in Figure 11, only the block diagram of part-structure relevant to application scheme, is not constituted to the application side
The restriction for the computer equipment 500 that case is applied thereon, specific computer equipment 500 may include more than as shown in the figure
Or less component, perhaps combine certain components or with different component layouts.
Wherein, the processor 502 is for running computer program 5032 stored in memory, to realize following function
Energy：The deployment information for obtaining distributed memory grid, is correspondingly arranged Distributed Message Queue according to deployment information；It obtains in message
Between the processor active task that is transmitted of part, execute the processor active task in the correspondence operation node of distributed memory grid and obtain operation
As a result；The corresponding arithmetic logic of operation result is obtained, operation result is stored into distributed memory grid corresponding wait store
Node.
In one embodiment, processor 502 also performs the following operations：It is whole according to the networking that distributed memory grid is added
End obtains the deployment information of distributed memory grid；The buffer address of each networked terminals is obtained according to deployment information；According to every
The buffer address of the networked terminals of one addition distributed memory grid establishes cluster, obtains Distributed Message Queue.
In one embodiment, processor 502 also performs the following operations：The arithmetic logic for parsing processor active task, according to operation
The corresponding operation node of logic positions calculations task, and processor active task is transmitted to corresponding operation node.
In one embodiment, processor 502 also performs the following operations：According to arithmetic logic positions calculations task orientation operation
As a result to memory node.
In one embodiment, processor 502 also performs the following operations：If the distributed memory net in preset detection cycle
The processor active task that message-oriented middleware is transmitted is not detected in lattice, the deployment information of distributed memory grid is cached, and
The cluster of Distributed Message Queue is dismissed.
It will be understood by those skilled in the art that the embodiment of computer equipment shown in Figure 11 is not constituted to computer
The restriction of equipment specific composition, in other embodiments, computer equipment may include components more more or fewer than diagram, or
Person combines certain components or different component layouts.For example, in some embodiments, computer equipment can only include depositing
Reservoir and processor, in such embodiments, the structure and function of memory and processor are consistent with embodiment illustrated in fig. 11,
Details are not described herein.
It should be appreciated that in the embodiment of the present application, processor 502 can be central processing unit (Central
Processing Unit, CPU), which can also be other general processors, digital signal processor (Digital
Signal Processor, DSP), specific integrated circuit (Application Specific Integrated Circuit,
ASIC), ready-made programmable gate array (Field-Programmable GateArray, FPGA) or other programmable logic devices
Part, discrete gate or transistor logic, discrete hardware components etc..Wherein, general processor can be microprocessor or
The processor is also possible to any conventional processor etc..
A kind of storage medium is provided in another embodiment of the application.The storage medium can be computer-readable storage
Medium.The storage medium is stored with computer program, and wherein computer program includes program instruction.The program instruction is by processor
It is realized when execution：The deployment information for obtaining distributed memory grid, is correspondingly arranged Distributed Message Queue according to deployment information；It obtains
The processor active task that message-oriented middleware is transmitted is taken, executes the processor active task in the correspondence operation node of distributed memory grid
Obtain operation result；The corresponding arithmetic logic of operation result is obtained, operation result is stored into distributed memory grid corresponding
To memory node.
In one embodiment, realization when which is executed by processor：According to the connection that distributed memory grid is added
Network termination obtains the deployment information of distributed memory grid；The buffer address of each networked terminals is obtained according to deployment information；Root
Cluster is established according to the buffer address of each networked terminals that distributed memory grid is added, obtains Distributed Message Queue.
In one embodiment, realization when which is executed by processor：The arithmetic logic for parsing processor active task, according to
The corresponding operation node of arithmetic logic positions calculations task, and processor active task is transmitted to corresponding operation node.
In one embodiment, realization when which is executed by processor：It is fixed according to arithmetic logic positions calculations task
Bit arithmetic result to memory node.
In one embodiment, realization when which is executed by processor：If distributed in preset detection cycle
The processor active task that message-oriented middleware is transmitted is not detected in memory grid, the deployment information of distributed memory grid is delayed
It deposits, and the cluster of Distributed Message Queue is dismissed.
The storage medium can be the internal storage unit of aforementioned device, such as the hard disk or memory of equipment.It is described to deposit
Storage media is also possible to the plug-in type hard disk being equipped on the External memory equipment of the equipment, such as the equipment, intelligent storage
Block (Smart Media Card, SMC), secure digital (Secure Digital, SD) card, flash card (Flash Card) etc..
Further, the storage medium can also both including the equipment internal storage unit and also including External memory equipment.
It is apparent to those skilled in the art that for convenience of description and succinctly, foregoing description is set
The specific work process of standby, device and unit, can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.
Those of ordinary skill in the art may be aware that unit described in conjunction with the examples disclosed in the embodiments of the present disclosure and algorithm
Step can be realized with electronic hardware, computer software, or a combination of the two, in order to clearly demonstrate hardware and software
Interchangeability generally describes each exemplary composition and step according to function in the above description.These functions are studied carefully
Unexpectedly the specific application and design constraint depending on technical solution are implemented in hardware or software.Professional technician
Each specific application can be used different methods to achieve the described function, but this realization is it is not considered that exceed
The scope of the present invention.
In several embodiments provided herein, it should be understood that disclosed unit and method, it can be with
It realizes by another way.For example, the apparatus embodiments described above are merely exemplary, for example, the unit
It divides, only a kind of logical function partition, there may be another division manner in actual implementation, can also will have identical function
The unit set of energy can be combined or can be integrated into another system at a unit, such as multiple units or components, or
Some features can be ignored or not executed.In addition, shown or discussed mutual coupling or direct-coupling or communication link
Connect can be through some interfaces, the indirect coupling or communication connection of device or unit, be also possible to electricity, it is mechanical or other
Form connection.
The unit as illustrated by the separation member may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, it can and it is in one place, or may be distributed over multiple
In network unit.Some or all of unit therein can be selected to realize the embodiment of the present invention according to the actual needs
Purpose.
It, can also be in addition, the functional units in various embodiments of the present invention may be integrated into one processing unit
It is that each unit physically exists alone, is also possible to two or more units and is integrated in one unit.It is above-mentioned integrated
Unit both can take the form of hardware realization, can also realize in the form of software functional units.
If the integrated unit is realized in the form of SFU software functional unit and sells or use as independent product
When, it can store in one storage medium.Based on this understanding, technical solution of the present invention is substantially in other words to existing
The all or part of part or the technical solution that technology contributes can be embodied in the form of software products, should
Computer software product is stored in a storage medium, including some instructions are used so that a computer equipment (can be
Personal computer, server or network equipment etc.) execute all or part of step of each embodiment the method for the present invention
Suddenly.And storage medium above-mentioned includes：USB flash disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), magnetic disk or
The various media that can store program code such as person's CD.
The above description is merely a specific embodiment, but scope of protection of the present invention is not limited thereto, any
Those familiar with the art in the technical scope disclosed by the present invention, can readily occur in various equivalent modifications or replace
It changes, these modifications or substitutions should be covered by the protection scope of the present invention.Therefore, protection scope of the present invention should be with right
It is required that protection scope subject to.
Claims (10)
1. a kind of distributed arithmetic method, which is characterized in that including：
The deployment information for obtaining distributed memory grid, is correspondingly arranged Distributed Message Queue according to deployment information；
The processor active task that message-oriented middleware is transmitted is obtained, executes the fortune in the correspondence operation node of distributed memory grid
Calculation task obtains operation result；
The corresponding arithmetic logic of operation result is obtained, operation result is stored into distributed memory grid corresponding wait store section
Point.
2. distributed arithmetic method according to claim 1, which is characterized in that the portion for obtaining distributed memory grid
Information is affixed one's name to, Distributed Message Queue is correspondingly arranged according to deployment information, including：
According to the networked terminals that distributed memory grid is added, the deployment information of distributed memory grid is obtained；
The buffer address of each networked terminals is obtained according to deployment information；
Cluster is established according to the buffer address of each networked terminals that distributed memory grid is added, obtains distributed message team
Column.
3. distributed arithmetic method according to claim 1, which is characterized in that described to obtain what message-oriented middleware was transmitted
After processor active task, further include：
The arithmetic logic for parsing processor active task is appointed according to the corresponding operation node of arithmetic logic positions calculations task, and by operation
Business is transmitted to corresponding operation node.
4. distributed arithmetic method according to claim 1, which is characterized in that the corresponding operation of the acquisition operation result
After logic, including：
According to arithmetic logic positions calculations task orientation operation result to memory node.
5. distributed arithmetic method according to claim 2, which is characterized in that the corresponding operation of the acquisition operation result
Logic, by operation result store into distributed memory grid it is corresponding to memory node after, further include；
It, will if the processor active task that message-oriented middleware is transmitted is not detected in distributed memory grid in preset detection cycle
The deployment information of distributed memory grid is cached, and is dismissed to the cluster of Distributed Message Queue.
6. a kind of distributed arithmetic device, which is characterized in that including：
Distributed Message Queue establishes unit, corresponding according to deployment information for obtaining the deployment information of distributed memory grid
Distributed Message Queue is set；
Grid arithmetic element, the processor active task that is transmitted for obtaining message-oriented middleware, in distributed memory grid to meeting the tendency of
The processor active task is executed in operator node obtains operation result；
Operation result storage unit stores operation result to distribution for obtaining the corresponding arithmetic logic of operation result
It deposits corresponding to memory node in grid.
7. distributed arithmetic device according to claim 6, which is characterized in that the Distributed Message Queue is established single
Member, including：
Novel acquiring unit is disposed, for obtaining distributed memory grid according to the networked terminals that distributed memory grid is added
Deployment information；
Buffer address acquiring unit, for obtaining the buffer address of each networked terminals according to deployment information；
Cluster establishes unit, for establishing cluster according to the buffer address of each networked terminals that distributed memory grid is added,
Obtain Distributed Message Queue.
8. distributed arithmetic device according to claim 7, which is characterized in that further include：
Cluster dismisses unit, if for message-oriented middleware institute to be not detected in distributed memory grid in preset detection cycle
The processor active task of transmission caches the deployment information of distributed memory grid, and to the cluster of Distributed Message Queue into
Row is dismissed.
9. a kind of computer equipment, including memory, processor and it is stored on the memory and can be on the processor
The computer program of operation, which is characterized in that the processor is realized when executing the computer program as in claim 1-5
Described in any item distributed arithmetic methods.
10. a kind of storage medium, which is characterized in that the storage medium is stored with computer program, the computer program packet
Program instruction is included, described program instruction executes the processor such as any one of claim 1-5 institute
The distributed arithmetic method stated.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810569361.6A CN108874541A (en) | 2018-06-05 | 2018-06-05 | Distributed arithmetic method, apparatus, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810569361.6A CN108874541A (en) | 2018-06-05 | 2018-06-05 | Distributed arithmetic method, apparatus, computer equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108874541A true CN108874541A (en) | 2018-11-23 |
Family
ID=64336784
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810569361.6A Pending CN108874541A (en) | 2018-06-05 | 2018-06-05 | Distributed arithmetic method, apparatus, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108874541A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110851282A (en) * | 2019-11-14 | 2020-02-28 | 北京东方通科技股份有限公司 | Distributed data calculation method and system based on memory grid |
| CN110941791A (en) * | 2019-11-19 | 2020-03-31 | 中国建设银行股份有限公司 | Configurable algorithm implementation method and device |
| CN111782404A (en) * | 2020-07-21 | 2020-10-16 | 深圳市金蝶天燕云计算股份有限公司 | Data processing method and related equipment |
| CN112367386A (en) * | 2020-10-30 | 2021-02-12 | 中国平安人寿保险股份有限公司 | Ignite-based automatic operation and maintenance method, apparatus and computer equipment |
| CN112882801A (en) * | 2021-01-28 | 2021-06-01 | 广州衣科明夷信息技术有限公司 | MQ-based distributed transaction implementation method |
| CN113703947A (en) * | 2021-09-01 | 2021-11-26 | 上海漫酷网络技术有限公司 | Distributed task processing system, method, computer equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170017516A1 (en) * | 2014-05-12 | 2017-01-19 | Hitachi, Ltd. | Information-processing device, processing method thereof, and input/output device |
| CN107707662A (en) * | 2017-10-16 | 2018-02-16 | 大唐网络有限公司 | A kind of distributed caching method based on node, device and storage medium |
| CN108009029A (en) * | 2017-11-30 | 2018-05-08 | 中电福富信息科技有限公司 | Method and system based on the data cached decoupling persistence of Ignite grids |
| CN108038007A (en) * | 2017-11-30 | 2018-05-15 | 中电福富信息科技有限公司 | A kind of orderly processing method of message based on Ignite and system |
-
2018
- 2018-06-05 CN CN201810569361.6A patent/CN108874541A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170017516A1 (en) * | 2014-05-12 | 2017-01-19 | Hitachi, Ltd. | Information-processing device, processing method thereof, and input/output device |
| CN107707662A (en) * | 2017-10-16 | 2018-02-16 | 大唐网络有限公司 | A kind of distributed caching method based on node, device and storage medium |
| CN108009029A (en) * | 2017-11-30 | 2018-05-08 | 中电福富信息科技有限公司 | Method and system based on the data cached decoupling persistence of Ignite grids |
| CN108038007A (en) * | 2017-11-30 | 2018-05-15 | 中电福富信息科技有限公司 | A kind of orderly processing method of message based on Ignite and system |
Non-Patent Citations (1)
| Title |
|---|
| 马万明: "Apache Ignite内存计算平台-功能部分(一)", 《一一架构》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110851282A (en) * | 2019-11-14 | 2020-02-28 | 北京东方通科技股份有限公司 | Distributed data calculation method and system based on memory grid |
| CN110941791A (en) * | 2019-11-19 | 2020-03-31 | 中国建设银行股份有限公司 | Configurable algorithm implementation method and device |
| CN111782404A (en) * | 2020-07-21 | 2020-10-16 | 深圳市金蝶天燕云计算股份有限公司 | Data processing method and related equipment |
| CN112367386A (en) * | 2020-10-30 | 2021-02-12 | 中国平安人寿保险股份有限公司 | Ignite-based automatic operation and maintenance method, apparatus and computer equipment |
| CN112367386B (en) * | 2020-10-30 | 2023-05-30 | 中国平安人寿保险股份有限公司 | Ignite-based automatic operation and maintenance method and device and computer equipment |
| CN112882801A (en) * | 2021-01-28 | 2021-06-01 | 广州衣科明夷信息技术有限公司 | MQ-based distributed transaction implementation method |
| CN113703947A (en) * | 2021-09-01 | 2021-11-26 | 上海漫酷网络技术有限公司 | Distributed task processing system, method, computer equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108874541A (en) | Distributed arithmetic method, apparatus, computer equipment and storage medium | |
| Li et al. | Accelerating distributed reinforcement learning with in-switch computing | |
| CN106850829B (en) | A kind of micro services design method based on non-blocking communication | |
| CN104040535B (en) | Custom browser-side spreadsheet functions | |
| CN107526645B (en) | A kind of communication optimization method and system | |
| CN106888218A (en) | Message treatment method, device, client and service end | |
| CN108418874A (en) | Guiding method, device, computer equipment and storage medium are returned across wide area network data | |
| CN103403699A (en) | Estimating load shed data in streaming database applications | |
| CN107748696A (en) | The method and terminal device of a kind of task scheduling | |
| WO2014206289A1 (en) | Method and apparatus for outputting log information | |
| CN105472291B (en) | The digital hard disc video recorder and its implementation of multiprocessor cluster | |
| KR20150084892A (en) | Dynamic graph performance monitoring | |
| CN109254854A (en) | Asynchronous invoking method, computer installation and storage medium | |
| CN109471626A (en) | Page logic structure, page generation method, page data processing method and device | |
| CN110147249A (en) | A kind of calculation method and device of network model | |
| Wang et al. | A discrete-time on–off source queueing system with negative customers | |
| CN108874738A (en) | Distributed parallel operation method, device, computer equipment and storage medium | |
| Devi et al. | Parallel processing of IoT health care applications | |
| CN109933595A (en) | A kind of internet of things equipment information sharing system, device and terminal device | |
| Chen et al. | Performance evaluation of three Network-on-Chip (NoC) architectures | |
| CN109684256A (en) | Server and data transmission method | |
| CN104270453B (en) | Data communications method and server between a kind of multistage server | |
| CN109254780A (en) | A kind of method, apparatus and controlled terminal of batch refresh server node firmware | |
| US20120174059A1 (en) | Energy consumption visualization for software design | |
| CN108595149A (en) | Restructural multiply-add operation device |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181123 |
|
| RJ01 | Rejection of invention patent application after publication |