CN102271167B - A kind of proxy server (Agent) method for parallel processing and structure being applicable to distributed communication middleware - Google Patents
A kind of proxy server (Agent) method for parallel processing and structure being applicable to distributed communication middleware Download PDFInfo
- Publication number
- CN102271167B CN102271167B CN201110266719.6A CN201110266719A CN102271167B CN 102271167 B CN102271167 B CN 102271167B CN 201110266719 A CN201110266719 A CN 201110266719A CN 102271167 B CN102271167 B CN 102271167B
- Authority
- CN
- China
- Prior art keywords
- agent
- lib
- resources bank
- parallel processing
- libs
- 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.)
- Expired - Fee Related
Links
Landscapes
- Computer And Data Communications (AREA)
- Multi Processors (AREA)
Abstract
The present invention relates to communication middleware field, the invention discloses a kind of method for parallel processing being applicable to distributed communication middleware, relation will be combined between Agent collection and resources bank, be mapped in geometric graph opinion, Modling model, finds out the maximum weight matching of former figure, namely sets up Agent parallel process model in systems in which, make each agency to greatest extent while executing the task, do not conflict ground calling system resources bank.The invention also discloses a kind of Agent structure being applicable to the parallel processing of distributed communication middleware, make Agent not conflict to greatest extent use system resource storehouse.
Description
Technical field
The present invention relates to communication middleware field, particularly relate to a kind of the Agent method for parallel processing and the structure that are applicable to distributed communication middleware.
Background technology
Middleware is the systems soft ware independently with corresponding level between application software to system-based software, its effect is the environment that the application software for being in oneself upper strata provides operation and develops, and helps the application software of user flexibility, efficiently exploitation and integrated complex.Present middleware is divided into message-oriented middleware, transaction middleware, object middleware etc., representative products has the WebSphere of IBM, the WebLogic of BEA, open source software Jboss, the TongLINK/Q etc. of domestic Ting Tech, these middlewares mostly are versatility, generally not for special specific area.And the exploitation of distributed network communication system of the prior art, many employings are based on the middleware of J2EE framework, as WebSphere, Jboss etc., these middleware platforms non-expert are for network communicating system, having mass communication function, communication protocol and needs carry out in the network communicating system development of a large amount of parallel processing, and above-mentioned universal middleware seems that efficiency is not high.
Modern software system is network mostly, there is distributed feature, traditional distributed computing technology is mostly based on C/S model, by mode telecommunications such as remote procedure call (RPC) or Message Transmission (Message passing), comparatively be applicable to stable network environment and occasion, network applications evolve quick and various now can not be adapted to far away.Agent(Agent) technology is a kind of new distributed computing model, and it is from solving this problem to a great extent.Agent is a software entity with features such as autonomy, collaborative work ability and target drives, code can be carried and state is independently run from the node motion of network to another node, find suitable computational resource and information resources, complete specific task.Agent pattern has independence, reactivity, initiative, interactivity and ambulant feature, effectively can reduce the offered load in Distributed Calculation, improve communication efficiency, support calculated off-line, support asynchronous autonomous mutual, dynamic adaptable network environment, becomes most popular distributed computing mode now.Middleware is between operating system and application layer, and multiple Agent does distributed deployment in the entire system, completes communication, transaction, safety, the functions such as load balancing.
In network communicating system, there is various communication protocol and mechanism, network communicating system can process a large amount of communication events in running simultaneously, comprise between intercell communication, inter-thread communication, interprocess communication, CPU and communicating, the a limited number of Agent of normal service requirement of system can process communication event as much as possible simultaneously, reach maximized parallel processing effect, general Agent structure seems degraded performance in this case.
Summary of the invention
The object of the invention is the technical problem for above-mentioned Agent method for parallel processing degraded performance of the prior art, a kind of the Agent method for parallel processing and the structure that are applicable to distributed communication middleware are provided.
Object of the present invention is realized by following technical proposals:
Be applicable to a method for parallel processing for distributed communication middleware, will combine relation between Agent collection and resources bank, be mapped in geometric graph opinion, Modling model, finds out the maximum weight matching of former figure.
Preferably, the above-mentioned method finding out the maximum weight matching of former figure is specially
Step 1 creates proxy server collection Agents and needs the resources bank collection Libs of access, and its concrete steps are:
Proxy server collection Agents={ag1, ag2 ... agN}, represents the set of Agent; Need access resources bank collection Libs=Lib1, Lib2 ..., LibN}, represents the set of resources bank; <Agents, Libs> representative agency with resources bank between combine relation;
If the top mark of vertex set Agents is Agent [i], the top mark of vertex set Libs is lib [j], initialization is carried out to top mark, even the value of Agent [i] is the most authority on all limits associated with summit Agent, lib [j]=0, limit power between Agent and Lib of summit is W [i, j];
For arbitrary limit (i, j), Agent [i]+Lib [j] >=W [i, j];
Step 2 asks Agent [i], and the Perfect matching of the subgraph M that lib [j] is formed, its concrete steps are
(1) subgraph M is put for empty;
(2) find out an augmenting path P, obtain larger coupling M ' by xor operation and replace M;
(3) (2) operation is repeated until can not find augmenting path;
Step 3 judges the Perfect matching by whether finding subgraph M after step 2, if found, then terminates to run; Otherwise the top mark on Agent [i] summit existed is reduced d, the top mark on Lib [j] summit increases d, turn back to step 2, wherein d=Min{Agent [i]+Lib [j]-w [i, j] | Agent [i] is in alternating tree, and Lib [j] is not in alternating tree }.
The invention also discloses a kind of Agent parallel processing structure being applicable to distributed communication middleware, comprise Agent performance element, event message queue, synchronous performance element, persistence performance element, the performance element that cooperates, carry the performance element of thread, carry the performance element list of thread; Described Agent performance element and event message queue form Agent pool of execution units;
Described Agent performance element is for completing the major function of agency: process the request from system layer; The request of repeater system layer is to the managed object of application layer; Forward application layer managed object to request response to system layer administrative unit; The parsing of demarcation and filtering function in software;
Described event message queue, plays the effect of message queue in Agent pool of execution units;
Described synchronous performance element is responsible for processing the locking to application layer object;
Described cooperation performance element passes to Agent performance element the request from application layer, and in Agent, performs each act on behalf of load balance function between performance element;
The described sub agent carrying the chartered Agent of performance element representative of thread, and be responsible for the communication between process agency and sub agent;
The described performance element list carrying thread comprises the information of the performance element of all band threads;
Described Agent pool of execution units, be used for dynamic creation and delete performance element.
Preferably, above-mentioned performance element can dynamically produce and delete, various performance element performs different functions respectively, and different performance elements can perform simultaneously, described performance element is event driven, each performance element has oneself thread and finite state machine status, in a program class, each performance element can and other performance element share code.
Agent based on distributed communication middleware produces and an initial method, specifically comprises following steps:
Create the data structure of Agent self, after then starting Agent root thread, create and coordinate performance element and synchronous performance element, then coordinate performance element and create pool of execution units and corresponding performance element;
Coordinate performance element and send specific event signal to one of them performance element, after receiving this particular event signal, this performance element is by communication point interconnection network management object;
Whole Agent initial work completes, and can process the request from system and perform.
Beneficial effect of the present invention: the Agent method for parallel processing of distributed communication middleware provided by the invention and structure make the network hardware (i.e. the network equipment) parallel processing capability greatly strengthen.Complete the maximum weight matching of this figure, that is, set up Agent parallel process model in systems in which, make each Agent to greatest extent while executing the task, do not conflict ground calling system resources bank.
Accompanying drawing explanation
Fig. 1 is the Agent cut-away view of distributed communications platform composer.
Fig. 2 is generation and the initialization flowchart of Agent.
Fig. 3 is the structural representation of Agent parallel processing in network service.
Fig. 4 is the application of DCPC communications platform composer in network communicating system.
Embodiment
Below in conjunction with specific embodiments and the drawings, the present invention is further illustrated.
In the communication system of reality, multiple Agent needs to process multiple task simultaneously, Agent wants treatment system task to need to call limited system resource storehouse, and therefore multiple Agent does not use system resource storehouse to be the key realizing parallel processing with how conflicting to greatest extent.
Bipartite graph in graph theory is defined as: establish G=(V, E) be a non-directed graph, if summit V may be partitioned into two mutually disjoint subset (A, B), and the every bar limit (i in figure, j) two summit i and j associated by belong to these two different vertex sets (i in A, j in B) respectively, then title figure G is a bipartite graph.
A given bipartite graph G, in a subgraph M of G, any two limits that the limit of M is concentrated do not depend on same summit, then claim M to be a coupling.
Select the maximum subset of such limit number to be called the maximum weight matching problem of figure, generally, be exactly that most probable finds two limits manyly, they do not depend on same summit.
If in a coupling, certain limit is associated in each summit in figure and figure, then this coupling is claimed to be Perfect matching.
If P be in figure G one be communicated with two paths of not mating summit, and the limit belonging to M and the limit (namely having mated and limit to be matched) that do not belong to M alternately occur on P, then title P is an augmenting path relative to M.
Obtain the maximum weight matching of figure, following two variable need be used:
Theorem 1: set the top mark of summit Xi in bipartite graph G as A [i], the top mark of summit Yj is B [j], the limit power between Xi and the Yj of summit is W [i, j].If in the subgraph M of figure G, all limits all meet the subgraph of equal value that A [i]+B [j]==W [i, j], M is called as G.
Theorem 2: if the subgraph (being called equal subgraph) be made up of limits (i, j) meeting A [i]+B [j]=w [i, j] all in bipartite graph has Perfect matching, so this Perfect matching is exactly the maximum weight matching of bipartite graph.
<Agents, Libs> correspond to two vertex sets in bipartite graph, if can find the maximum weight matching of figure, are exactly use system resource storehouse with making Agent not conflict to greatest extent.
In the present invention, a kind of method for parallel processing being applicable to distributed communication middleware is will combine relation between Agent collection and resources bank, be mapped in geometric graph opinion, Modling model, find out the maximum weight matching of former figure, namely set up in systems in which and act on behalf of parallel process model, make each Agent to greatest extent while executing the task, do not conflict ground calling system resources bank.It specifically comprises the following steps
Step 1 creates Agent collection Agents and needs the resources bank collection Libs of access, and its concrete steps are:
Agent collection Agents={ag1, ag2 ... agN}, represents the set of Agent; Need access resources bank collection Libs=Lib1, Lib2 ..., LibN}, represents the set of resources bank; <Agents, Libs> representative agency with resources bank between combine relation;
If the top mark of vertex set Agents is Agent [i], the top mark of vertex set Libs is lib [j], initialization is carried out to top mark, even the value of Agent [i] is the most authority on all limits associated with summit Agent, lib [j]=0, limit power between Agent and Lib of summit is W [i, j];
For arbitrary limit (i, j), Agent [i]+Lib [j] >=W [i, j];
Step 2 asks Agent [i], the Perfect matching of the subgraph M that lib [j] is formed, and concrete steps are as follows:
(1) subgraph M is put for empty;
(2) find out an augmenting path P, obtain larger coupling M ' by xor operation and replace M;
(3) (2) operation is repeated until can not find augmenting path;
Step 3 judges the Perfect matching by whether finding subgraph M after step 2, if found, then terminates to run; Otherwise the top mark that the top mark on Agent [i] summit existed reduces d, Lib [j] summit is increased d, turns back to step 2; Wherein d=Min{Agent [i]+Lib [j]-w [i, j] | Agent [i] is in alternating tree, and Lib [j] is not in alternating tree }.
The Perfect matching of subgraph of equal value, the namely maximum weight matching of former figure, completes this maximum weight matching, that is, set up Agent parallel process model in systems in which, make each Agent to greatest extent while executing the task, do not conflict ground calling system resources bank.
Accomplish the event that parallel processing is efficiently a large amount of and request, except establishing Agent parallel process model as stated above, Agent itself also needs to have the internal structure adapting to parallel processing.Its main points are: each Agent comprises multiple performance element (EU), performance element is exactly the processing unit that can intercom mutually, can operationally dynamically be set up and be deleted, there is the control thread of oneself or share thread with other processing units.Each performance element has been responsible for the required function of the Some features of Agent in network activity, such as: the mutual communication function between agency; Load-balancing function; Persistence function in database access; The synchronous protection function etc. of distributed objects, described method has efficiently, high reliability, feature applied widely, supports parallel processing framework and multi-process.Solve for complex communication and parallel processing efficiency shortcoming on the low side under existing architecture, the event enabling platform parallel processing efficiently a large amount of and request, support the network communicating system software development based on parallel framework better.
A kind of distributed communications platform composer (Distributed Communication as shown in Figure 1
Constructor is called for short DCPC) Agent cut-away view, dotted line is the internal structure of a communication Agent with upper part, it is made up of multiple performance element entity (EU), this performance element (Executing Unit, be called for short EU) utilize distributed object technology in Agent internal build, can dynamically be set up when running software and delete, they be coordinated mutually, jointly complete the function of Agent.
The invention also discloses a kind of be applicable to distributed communication middleware act on behalf of parallel processing structure, comprise act on behalf of performance element (Agent EU), event message queue Event Message Queue (being called for short EMQ), synchronous EU, persistence EU, the EU that cooperates, the performance element Proxy Sub-Agent(that carries thread be called for short PSA), carry the performance element list Proxy Sub-Agent List (being called for short PSAL) of thread; Described Agent EU(is called for short AE) and event message queue Event Message Queue (being called for short EMQ) form Agent pool of execution units Agent EU Pool (abbreviation AEP).The described performance element Agent EU that acts on behalf of is for completing the major function acting on behalf of Agent: process the request from system layer; The request of repeater system layer is to the managed object of application layer; Forward application layer managed object to request response to system layer administrative unit; The parsing of demarcation and filtering function in software.Described event message queue (EMQ), plays the effect of message queue in Agent pool of execution units, and namely when all AE are busy with processing various request, come if any new request, these requests will be placed into EMQ, wait for idle AE to process.Described synchronous EU is responsible for processing the locking to application layer object, and when the multiple request of this subject undergoes, this locking ensures that object can be accessed in order by these requests, thus ensures its fail safe of accessing.Described persistence EU performs the function of the persistence relevant to lock unit, thus makes lock unit be absorbed in object synchronization work, and the persistence work with concrete consumes resources departs from comes.Described cooperation EU passes to Agent EU the request from application layer, and the load balance function performed in Agent between each Agent EU, namely once the request receiving application layer, which AE this unit determines by as the case may be to process these requests.The described performance element Proxy Sub-Agent(carrying thread is called for short PSA) sub agent (Sub-Agent) of the chartered Agent of representative, and the communication be responsible between process Agent and sub agent (Sub-Agent), it is as gateway, resolve the details in communication, such as protocol stack etc.Communication protocol between PSA and Sub-Agent is general management information (CMIP) agreement.Described Proxy Sub-Agent List (PSAL) is the list of PSA, comprises the information of all PSA.Described Agent EU Pool (AEP) is Agent pool of execution units, be used for dynamic creation and delete performance element, comprise the configuration information of performance element.
In Agent structure of the present invention, performance element (EU) is the most basic functional unit, it can dynamically produce and delete, and there is following characteristics: 1. various EU performs different functions respectively, and different EU can perform simultaneously, can this system in parallel processing capacity greatly be improved.2.EU is event driven.3. each EU has thread and finite state machine (FSM) state of oneself.4., in a program " class " (class), each EU can share code with other EU.
All performance elements (EU) are all created by Agent, and after EU produces, only have when Agent self withers away (namely Agent root process terminates), performance element (EU) just can disappear.
Fig. 2 is the generation and initialize flow that Agent is complete.Can see from the graph: the invention also discloses a kind of agency based on distributed communication middleware and produce and initial method; first system creates the data structure of Agent self; then after starting Agent root thread; create and coordinate EU and synchronous EU, then coordinate EU and create pool of execution units (AEP) and corresponding performance element (EU); Next step is coordinated EU and sends specific event signal to one of them performance element (EU), and after receiving this particular event, this performance element (EU) is by communication point SAP interconnection network management object (MO); Finally, whole Agent initial work completes, and can process the request from system and perform.
The angle of parallel processing from network service illustrates how Agent realizes parallel processing below.Suppose in network, have three network equipment network elements 1, network element 2, network element 3, for each network element, DCPC composer disposes a series of Agent (affairs agent, safe agent, communication Agent) it is responsible for, the Agent that wherein communicates completes the transmission from request in net element communication, and receive, the communication that is established to of communication completes whole process.
The structural representation of Agent parallel processing in network service as shown in Figure 3, first Agent produces the various performance elements (EU) of oneself according to flow process described in Fig. 2, when network element 1 receives the communication request of network element 2 and network element 3 simultaneously, the cooperation EU (Coordinating EU) be responsible in the Agent of network element 1 ranks the event message queue (EMQ) that Agent is put in these two requests; Then the EU that cooperates selects two idle Agent EU (AE) to process these two requests in Agent, completes communicating to network element 2 and network element 3 respectively.Because these two communication processs carry out simultaneously, so just achieve the parallel processing of communication with two Agent EU (AE), it is synchronously the key issue in parallel process, as above in illustration 3, Agent EU (AE) in network element 1 wants executive communication function, need system resource storehouse relevant to communication in calling system (containing various communications protocols, usually object approach calls for user in a distributed manner), if two communication processs carried out all will call such resources bank and will clash simultaneously, the function of synchronous EU is to ensure that the safety of system call is carried out: when there to be two requests from different AE for system resource storehouse simultaneously, these two requests are put into event message queue Event Message Queue (being called for short EMQ) by Agent EU, then system resource storehouse is given one of them request, when processing this request, synchronous EU makes system resource storehouse be in the lock state, refuse other request.Only have when first request has been processed, synchronous EU unlocks system resource storehouse, and second request in event message queue (EMQ) is just fed to resources bank.
DCPC is a kind of distributed middleware, and it is closely related with the development and application of network communicating system, and Fig. 4 is the application of DCPC communications platform composer in network communicating system.The use of DCPC makes the network hardware (i.e. the network equipment) parallel processing capability greatly strengthen, and the implementation method of DCPC communications platform component device comprises following steps:
Dispose DCPC communications platform composer: between operating system layer and application layer, settle middleware server, DCPC composer is deployed in middleware server.
DCPC provides CommAPI to the network equipment: DCPC is integrated with various communications protocols stack, comprise communication (ICC) and intersystem communications (ISC) between intercell communication (IWC), inter-thread communication (ITC), interprocess communication (IPC), CPU, DCPC constructs API on the basis of these communication protocols, and API is supplied to application layer.In network communicating system, DCPC provides asynchronous (clog-free) and synchronous (obstruction) in fully-integrated mode, SCCP connection-oriented and connectionless communication API.Make that user can be suitable in conjunction with various API to set up cost-effective communication modes.Identical communications infrastructure API is all provided at the top layer of each protocol stack (comprising TCP/IP, OSI etc.).
Dispose Agent in the network equipment, improve its parallel processing capability: first, build best Agent parallel process model according to maximum matching algorithm, make each Agent to greatest extent and the ground calling system resources bank that do not conflict.Secondly, for each Network element object (switch of network application layer in Fig. 3 in network, the network equipments such as router), DCPC disposes a series of Agent, create various performance element (EU) according to the flow process of Fig. 2 in Agent inside, complete and relevant the communicating of Network element object, network management, database access persistence, the functions such as security affairs.
Developer makes full use of two features of DCPC (based on the Agent parallel process model that maximum matching algorithm builds in the exploitation of communication system; Special Agent structure), substantially increase the ability of network communication equipment parallel processing communication event.
More than above are only preferred embodiment of the present invention, not in order to limit the present invention, all any amendments done within the spirit and principles in the present invention, equivalent replacement and improvement etc., all should be included within protection scope of the present invention.
Claims (1)
1. be applicable to a method for parallel processing for distributed communication middleware, will combine relation between proxy server collection Agents and resources bank collection Libs, be mapped in geometric graph opinion, Modling model, finds out the maximum weight matching of former figure; The method finding out the maximum weight matching of former figure is specially:
Step 1 creates proxy server collection Agents and needs the resources bank collection Libs of access, and its concrete steps are:
Proxy server collection Agents={ag1, ag2 ... agN}, represents the set of Agent; Need access resources bank collection Libs=Lib1, Lib2 ..., LibN}, represents the set of resources bank; <Agents, Libs> representative agency with resources bank between combine relation;
If the top mark of vertex set Agents is Agent [i], the top mark of vertex set Libs is lib [j], initialization is carried out to top mark, the most authority on the limit that even the value of Agent [i] is all and described summit Agent [i] to be associated, lib [j]=0, limit power between summit Agent [i] and Lib [j] is W [i, j];
For arbitrary limit (i, j), Agent [i]+Lib [j] >=W [i, j];
Wherein N represents the numbering of element in set, and i, j represent the numbering on two summits on limit respectively, N, i, and j all belongs to integer;
Step 2 asks Agent [i], and the Perfect matching of the subgraph M that lib [j] is formed, its concrete steps are
(1) subgraph M is put for empty;
(2) find out an augmenting path P, obtain larger coupling M ' by xor operation and replace M;
(3) (2) operation is repeated until can not find augmenting path;
Step 3 judges the Perfect matching by whether finding subgraph M after step 2, if found, then terminates to run; Otherwise the top mark that the top mark on Agent [i] summit existed reduces d, Lib [j] summit is increased d, turns back to step 2;
d = Min{Agent[ i ]+Lib[j]-w[i,j] }
Wherein Agent [i] is in alternating tree, and Lib [j] is not in alternating tree.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110266719.6A CN102271167B (en) | 2011-09-09 | 2011-09-09 | A kind of proxy server (Agent) method for parallel processing and structure being applicable to distributed communication middleware |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110266719.6A CN102271167B (en) | 2011-09-09 | 2011-09-09 | A kind of proxy server (Agent) method for parallel processing and structure being applicable to distributed communication middleware |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102271167A CN102271167A (en) | 2011-12-07 |
| CN102271167B true CN102271167B (en) | 2015-08-19 |
Family
ID=45053327
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110266719.6A Expired - Fee Related CN102271167B (en) | 2011-09-09 | 2011-09-09 | A kind of proxy server (Agent) method for parallel processing and structure being applicable to distributed communication middleware |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102271167B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102685010B (en) * | 2012-05-16 | 2016-05-18 | 河南辉煌科技股份有限公司 | Realize the communication means of ultra-large connection TCP/IP network |
| CN104657202A (en) * | 2013-11-19 | 2015-05-27 | 上海联影医疗科技有限公司 | Distributed information processing structure |
| CN112099958B (en) * | 2020-11-17 | 2021-03-02 | 深圳壹账通智能科技有限公司 | Distributed multi-task management method and device, computer equipment and storage medium |
| CN115296958B (en) * | 2022-06-28 | 2024-03-22 | 青岛海尔科技有限公司 | Distribution method and device of equipment control tasks, storage medium and electronic device |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102158554A (en) * | 2011-04-02 | 2011-08-17 | 南京邮电大学 | Mobile agent-based Internet of things middleware development method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070027841A1 (en) * | 2005-07-26 | 2007-02-01 | Williams Michael G | Messaging middleware dynamic, continuous search and response agent system |
-
2011
- 2011-09-09 CN CN201110266719.6A patent/CN102271167B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102158554A (en) * | 2011-04-02 | 2011-08-17 | 南京邮电大学 | Mobile agent-based Internet of things middleware development method |
Non-Patent Citations (1)
| Title |
|---|
| 基于Agent和带权关系网的软件体系结构自适应;刘涛 等;《计算机工程与设计》;20070930;第28卷(第18期);第4340页左栏第3行至第4341页左栏倒数第8行、图1-2 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102271167A (en) | 2011-12-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10795737B2 (en) | Generic distributed processing for multi-agent systems | |
| CN107566153B (en) | Self-management micro-service implementation method | |
| US7519652B2 (en) | Distributed application server and method for implementing distributed functions | |
| CN112799789A (en) | Node cluster management method, device, equipment and storage medium | |
| CN107770269B (en) | A kind of service response method and its terminal | |
| CN106452841A (en) | Method for using transmission service quality in robot operating system | |
| CN102271167B (en) | A kind of proxy server (Agent) method for parallel processing and structure being applicable to distributed communication middleware | |
| CN111258723B (en) | Transaction processing method, device, system, medium and equipment of distributed system | |
| CN113032166B (en) | Inter-core communication method, processor, inter-core communication system, and computer-readable storage medium | |
| CN111797173B (en) | Alliance chain sharing system, method and device, electronic equipment and storage medium | |
| CN106790084A (en) | A kind of heterogeneous resource integrated framework and its integrated approach based on ICE middlewares | |
| Gupta et al. | A survey on comparative study of mobile agent platforms | |
| CN115550354A (en) | Data processing method and device and computer readable storage medium | |
| Kraemer et al. | Aligning UML 2.0 state machines and temporal logic for the efficient execution of services | |
| Kiamari et al. | Coding for edge-facilitated wireless distributed computing with heterogeneous users | |
| KR100833494B1 (en) | Apparatus for lightweighting application through duplicating management of application in environment of OSGi middleware for embedded terminal and method thereof | |
| CN105049255B (en) | A kind of method and device thereof of network element data synchronization | |
| WO2021078369A1 (en) | Distributed network with consensus mechanism | |
| Flauzac et al. | CONFIIT: a middleware for peer-to-peer computing | |
| CN105187244B (en) | A kind of digital communication equipment access information management and its working method for supporting a variety of management modes | |
| CN112395104B (en) | Method and device for realizing distributed transaction context transfer in routing layer | |
| US10489213B2 (en) | Execution of a method at a cluster of nodes | |
| CN112559472B (en) | File transmission method, device, computer equipment and storage medium | |
| JP2004537886A (en) | Service application architecture for integrated network service providers | |
| CN1471018A (en) | Universal interface machine system and method for realising same |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| ASS | Succession or assignment of patent right |
Owner name: SOUTHWEST COMMUNICATION UNIVERSITY Free format text: FORMER OWNER: LIU HAO Effective date: 20111207 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20111207 Address after: 610031 City, Chengdu Province, north section of the ring road, Sichuan Applicant after: Southwest Jiaotong University Address before: 610031 Jinniu District Jiaotong University, Chengdu, Sichuan Province, No. 89, Gui Gui Road, two, 2-4-6B Applicant before: Liu Hao |
|
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: LIU HAO Free format text: FORMER OWNER: SOUTHWEST COMMUNICATION UNIVERSITY Effective date: 20130830 Owner name: CHEN QIAN Effective date: 20130830 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 610031 CHENGDU, SICHUAN PROVINCE TO: 610072 CHENGDU, SICHUAN PROVINCE |
|
| TA01 | Transfer of patent application right |
Effective date of registration: 20130830 Address after: The North Qingyang District of Chengdu City, Sichuan province 610072 1 30 unit 2 Building No. 15 Applicant after: Liu Hao Applicant after: Chen Qian Address before: 610031 City, Chengdu Province, north section of the ring road, Sichuan Applicant before: Southwest Jiaotong University |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150819 Termination date: 20160909 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |