WO2012055248A1 - 信息投递的方法和装置 - Google Patents
信息投递的方法和装置 Download PDFInfo
- Publication number
- WO2012055248A1 WO2012055248A1 PCT/CN2011/075893 CN2011075893W WO2012055248A1 WO 2012055248 A1 WO2012055248 A1 WO 2012055248A1 CN 2011075893 W CN2011075893 W CN 2011075893W WO 2012055248 A1 WO2012055248 A1 WO 2012055248A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- task
- target task
- core
- kernel
- information
- Prior art date
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/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
-
- 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/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/505—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the load
-
- 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/544—Buffers; Shared memory; Pipes
-
- 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/502—Proximity
Definitions
- the present invention relates to the field of multi-core technology, and in particular, to a method and apparatus for information delivery. Background technique
- each processor consists of multiple cores, each containing one or more hardware threads.
- the communication device due to the complexity of the service, it consists of multiple service modules, control modules, and switch boards. Each board uses one or more multi-core processors.
- the information communication method in the existing multi-core system is shown in Figure 1.
- the information communication method follows the traditional single-core system processing mode, and the tasks between boards and boards pass IPC (Inter-Process Communication). ) Ways to achieve information communication.
- the IPC method implements information communication based on TCP/IP or shared memory.
- this information communication method cannot reflect the advantages of a multi-core system.
- the complexity of the mechanism for the core information communication unit is greatly increased.
- the processing capability of the control plane is overloaded. The reliability is reduced.
- the IPC method cannot implement load balancing for multi-core system processing, which makes it impossible to achieve efficient communication when multi-instance of tasks in a multi-core system. Summary of the invention
- the present invention provides a method for information delivery, which includes the steps of: receiving a to-be-delivered information and a target task name sent by a source task;
- the corresponding kernel is searched for in the multi-core system according to the kernel number, and the to-be-delivered information is sent to the task in the kernel corresponding to the target task name.
- the preset global relationship table includes: a correspondence between a task name in the multi-core system and a kernel number of a kernel where the task is located.
- the source task and the target task are included in the same core of the same multi-core system, or included in different cores of the same multi-core system, or included in the core of different multi-core systems.
- the target task includes one or more target task instances; the plurality of target task instances are included in the same core of the same multi-core system, or included in different cores of the same multi-core system, or included in different multi-core systems. Inside.
- the method for information delivery when the target task includes multiple target task instances, selects the target task instance as the target task to be delivered according to the principle of proximity.
- the invention further provides an apparatus for information delivery, comprising:
- a receiving module configured to receive the to-be-delivered information and the target task name sent by the source task
- a searching module configured to search, in the preset global relationship table, a kernel number corresponding to the target task name according to the target task name
- a sending module configured to search for a corresponding kernel in the multi-core system according to the kernel number, and to be preferentially, the preset global relationship table includes: a correspondence between a task name in the multi-core system and a kernel number of the kernel where the task is located.
- the source task and the target task are included in the same core of the same multi-core system, or included in different cores of the same multi-core system, or included in the core of different multi-core systems.
- the target task includes one or more target task instances; the plurality of target task instances are included in the same core of the same multi-core system, or included in different cores of the same multi-core system, or included in different multi-core systems.
- the searching module is further configured to: when the target task includes multiple target task instances, select the target task instance as the target task to be delivered according to the proximity principle.
- the method and device for information delivery provided by the present invention can realize the delivery of information between multi-core systems or multi-core systems, and the reliability of information delivery is high, and the speed and efficiency of information delivery are improved, and further, Load balancing of task instances in a multi-core system while preventing the failure of information delivery.
- FIG. 1 is a schematic structural view of a multi-core system in the prior art
- FIG. 2 is a schematic flow chart of an embodiment of a method for information delivery according to the present invention.
- FIG. 3 is a schematic structural view of a multi-core system of the present invention.
- Figure 4 is a schematic structural view of a multi-core system of the present invention.
- FIG. 5 is a schematic structural diagram of an apparatus for information delivery according to the present invention.
- Figure 6 is another schematic structural view of the multi-core system of the present invention.
- Fig. 7 is a schematic view showing another structure between the multi-core systems of the present invention. detailed description
- the method includes: Step 101: Receive a to-be-delivered information and a target task name sent by a source task.
- Step 102 Search for a kernel number corresponding to the target task name in the preset global relationship table according to the target task name;
- Step 103 Search for a corresponding kernel in the multi-core system according to the kernel number, and send the to-be-delivered information to the task in the kernel corresponding to the target task name.
- the task corresponding to the target task name in the kernel is the target task.
- the preset global relationship table includes: a correspondence between a task name in the multi-core system and a kernel number of a kernel where the task is located.
- the above method for information delivery is applied in a multi-core system, and the relationship between the task name and the kernel number of the kernel in which the task is located refers to the correspondence between all task names in the multi-core system and the kernel number of the kernel in which the task name is located, or a communication connection. All task names in all multicore systems correspond to the kernel number of the kernel in which the task resides.
- the source task and the target task are included in the same core of the same multi-core system, or included in different cores of the same multi-core system, or included in the core of different multi-core systems.
- the target task includes one or more target task instances; the plurality of target task instances are included in the same core of the same multi-core system, or include different cores in the same multi-core system. Internal, or included in the core of a different multi-core system.
- the multi-core system 1 is an independent multi-core system, and the multi-core system 1 includes: a core 1, a core 2, and a kernel 3.
- the kernel 1 includes the task A-1 and the task C-1;
- the kernel 2 includes the task A-2 and the task B-1;
- the kernel 3 includes the task D-1 and the task E-1.
- the preset global relation table includes the following relationship between the task name and the kernel number of the kernel where the task is located: A-l ⁇ 1, A-2 ⁇ 2, B-l ⁇ 2, C-l ⁇ 1, D-l ⁇ 3, E-l ⁇ 3.
- the multi-core systems 1, 2, and 3 are multi-core systems that communicate with each other, wherein the multi-core system 1 includes a core i, and the core i includes tasks a-1 and b-1.
- the multi-core system 2 includes a core ii and a core iii, the core ii includes a task a-2 and a task d-1; the core iii includes a task a-3 and a task c-1.
- the multi-core system 3 includes a kernel iv and a core V, and the kernel iv includes a task b-2 and a task d-2; the kernel V includes a task e-1 and a task f-1.
- the preset global relation table includes the following relationship between the task name and the kernel number of the kernel where the task is located: al ⁇ i , a-2 ⁇ ii , A-3 ⁇ iii, bl ⁇ i, b-2 ⁇ iv, cl ⁇ iii, dl ⁇ ii, d-2 ⁇ iv, el ⁇ v, fl ⁇ v. Further, in the method embodiment of the above information delivery, when the target task has only one target task instance, the to-be-delivered information is directly sent to the target task instance.
- the target task instance is selected as the target task to be delivered according to the proximity principle.
- the principle of the proximity is as follows: the target task instance in the same kernel as the source task is preferentially selected as the target task to be delivered; if there is no target task instance in the same kernel as the source task, the priority is selected to be in the same multi-core system as the source task.
- the target task instance is used as the target task to be delivered; if there is no target task instance in the same core as the source task and in the same multi-core system as the source task, the target task instance in the different multi-core system from the source task is selected as the target to be delivered.
- the target task of the information is used as the target task to be delivered.
- the load conditions of multiple target task instances in the target task and the specific conditions of the abnormality may be selected.
- a target task instance is used as the target task of the information to be delivered.
- the task d-1 is the source task, and the task d-1 needs to send the information to be delivered to the task a.
- the task a includes three task instances: al, a-2, and a-3. Where task a-2 is in kernel ii, task a-3 is in kernel iii, task a-1 is in kernel i; task d-1 is in kernel ,, according to the proximity principle described above, preference is given to source task d -1
- the target task instance a-2 in the same kernel acts as the target task for the information to be posted. If the target task instance selected as the target task has an abnormality or a high load condition, select one of the other target task instances as the target task to be delivered according to the same principle.
- the target task instance a-2 is abnormal or the load is high
- the target task instance a-3 that is in the same multi-core system as the source task d-1 is preferentially selected as the target task to be delivered information
- Mission the target task instance a-2 and If a-3 is abnormal or the load is high
- task c-1 be the source task
- task c-1 send the message to be delivered to task d.
- task d includes two task instances d-1 and d-2; source task c-1 and task d-1 are in the same multi-core system 2; task d-2 is in multi-core system 3; according to the principle of proximity described above
- the task d-1 is preferentially selected as the target task of the information to be delivered; if the task d-1 is abnormal or the load is high, the task d-2 is selected as the target task of the information to be delivered.
- task d-2 be the source task
- task d-2 send the message to be delivered to task a.
- task a includes three task instances: a-l, a-2, and a-3. All task instances a1, a-2, a-3 of task a are not in the same multi-core system as source task d-2; task a-1 is in multi-core system 1, and tasks a-2 and a-3 are in multi-core Within system 2. According to the above principle, the neighboring principle cannot be selected. In this case, it is necessary to select whether the three task instances are abnormal or the load is high or low, and the task instance with normal operation and low load is used as the target task of the information to be delivered.
- the target task instance with the lowest load may be directly searched according to the principle of proximity, and the target task instance is used as the target task of the information to be delivered.
- task a-1 be the source task
- task b includes two task instances b-1 and b-2
- task b-1 is heavily loaded.
- the task b-2 has a low load, so the task b-2 is selected as the target task to be delivered, and the to-be-delivered information is sent to the task b-2 in the kernel iv. If an abnormal situation occurs in the target task instance selected as the target task, select one of the other target task instances as the target task to be delivered according to the same principle to ensure load balancing of different task instances in the same task, and also It can avoid the phenomenon of information delivery failure.
- the method embodiment of the above information delivery can realize the inter-multi-core system or the multi-core system
- an apparatus 10 for an information delivery apparatus which includes: a receiving module 11, a searching module 12, and a transmitting module 13.
- the receiving module 11 is configured to receive the to-be-delivered information and the target task name sent by the source task
- the searching module 12 is configured to search, in the preset global relationship table, the kernel number corresponding to the target task name according to the target task name; 13. For searching for a corresponding kernel in the multi-core system according to the kernel number, and sending the to-be-delivered information to the task in the kernel corresponding to the target task name.
- the task corresponding to the target task name in the kernel is the target task.
- the preset global relationship table includes: a correspondence between a task name in the multi-core system and a kernel number of a kernel where the task is located.
- the information delivery device 10 is applied to the multi-core system, and the task name corresponds to the kernel number of the kernel where the task is located, and refers to the correspondence between all task names in the multi-core system and the kernel number of the kernel where the task name is located, or a communication connection. All task names in all multi-core systems correspond to the kernel number of the kernel in which the task resides.
- the source task and the target task are included in the same core of the same multi-core system, or included in different cores of the same multi-core system, or included in a kernel of a different multi-core system.
- the target task includes one or more target task instances; the plurality of target task instances are included in the same core of the same multi-core system, or include different cores in the same multi-core system. Internal, or included in the core of a different multi-core system.
- the multi-core system 1 is an independent multi-core system equipped with the information delivery apparatus 10 of the present invention.
- the multi-core system 1 includes: a core 1, a kernel 2, and a kernel 3.
- kernel 1 includes task A-1 and task C-1;
- kernel 2 includes task A-2 and task B-1;
- Kernel 3 includes task D-1 and task El.
- the preset global relationship table includes the following relationship between the task name and the kernel number of the kernel where the task is located: Al ⁇ 1, A-2 ⁇ 2, Bl ⁇ 2, Cl ⁇ 1, Dl ⁇ 3, El ⁇ 3.
- the information to be delivered and the target task name are first sent to the device 10 for information delivery, and the device 10 for information delivery determines the name corresponding to the target task in the preset global relationship table according to the target task name.
- the kernel number is then found in the multi-core system 1 with the kernel corresponding to the kernel number, and the to-be-delivered information is sent to the task in the kernel corresponding to the target task name.
- the multi-core systems 1, 2, and 3 are multi-core systems that communicate with each other, and each of the multi-core systems is configured with the information delivery device 10 of the present invention.
- the multi-core system 1 includes a kernel i, and the kernel i includes a task a-1 and a task b-1.
- the multi-core system 2 includes a core ii and a core iii, the core ii includes a task a-2 and a task d-1; the core iii includes a task a-3 and a task c-1.
- the multi-core system 3 includes a kernel iv and a kernel V, the kernel iv includes a task b-2 and a task d-2; the kernel v includes a task e-1 and a task f-l.
- the preset global relationship table includes the following relationship between the task name and the kernel number of the kernel where the task is located: al ⁇ i, a-2 ⁇ ii, a-3 ⁇ iii, bl ⁇ i, b-2 ⁇ iv, cl ⁇ Iii, dl ⁇ ii, d-2 ⁇ iv, el ⁇ v, fl ⁇ v.
- the information to be delivered and the target task name are first sent to the device 10 for information delivery, and the device 10 for information delivery determines the target in the preset global relationship table according to the target task name.
- the kernel number corresponding to the task name finds the kernel corresponding to the kernel number in the multi-core systems 1, 2, and 3, and sends the to-be-delivered information to the task in the kernel corresponding to the target task name.
- the to-be-delivered information is directly sent to the target task instance.
- the searching module 12 is further configured to: when the target task includes multiple target task instances, select the target task instance as the target task to be delivered according to the principle of proximity.
- the principle of the proximity is as follows: The target task instance in the same kernel as the source task is preferentially selected as the target task to be delivered; if not in the source task.
- the target task instance of the same kernel preferentially selects the target task instance in the same multi-core system as the target task as the target task to be delivered; if there is no target task in the same kernel as the source task, and no target task in the same multi-core system as the source task
- the target task instance that is in a different multi-core system from the source task is selected as the target task to be delivered information.
- the device 10 for information delivery may according to the load condition and abnormality of multiple target task instances in the target task.
- the specific case selects a target task instance as the target task of the information to be delivered.
- the task d-1 is the source task, and the task d-1 needs to send the information to be delivered to the task a.
- the task a includes three task instances: al, a-2, and a-3.
- the task d-1 sends the to-be-delivered information and the target task name a to the information delivery device 10, and the information delivery device 10 searches the preset global relationship table for the kernel number corresponding to the target task name a according to the target task name a. There are i, ii, and iii (including the kernel number of the target task a).
- the cores i, ii, and iii corresponding to the kernel numbers i, ii, and iii are then found in the multi-core systems 1, 2, and 3.
- Task a-2 is in kernel ii
- task a-3 is in kernel iii
- task a-1 is in kernel i
- task d-1 is in kernel ii, according to the proximity principle described above, information delivery device 10 is preferred
- the source task d-1 is in the target task instance a-2 of the same kernel as the target task of the information to be delivered, and then the information to be delivered is sent to the task a-2 in the kernel ii.
- the target task instance a-2 selected as the target task has an abnormality or a high load condition, select one of the other target task instances as the target task to be delivered according to the same principle. That is, if the target task instance a-2 is abnormal or the load is high, the information delivery device 10 preferentially selects the target task instance a-3 that is in the same multi-core system as the source task d-1 as the target task to be delivered, and then waits The delivery information is sent to task a-3 in kernel iii; if both target task instances a-2 and a-3 are abnormal or have a high load, then information delivery device 10 selects a target task instance that is in a different multi-core system than the source task.
- Ai is the target task of the information to be delivered, and then the information to be delivered is sent to task a-1 in kernel i. That is, if selected as the target
- the target task instance of the task has an abnormal condition and a high load condition, and in addition to the selected target task instance, there are two or more target task instances, and then one of the remaining target task instances is selected as the information to be delivered according to the same principle.
- Target tasks to improve the speed and efficiency of information delivery, while avoiding information delivery failures.
- task c-1 is the source task
- task c-1 needs to send the information to be delivered to task d
- task d includes two task instances d-1 and d-2.
- the task c-1 sends the to-be-delivered information and the target task name d to the information delivery device 10, and the information delivery device 10 searches the preset global relationship table for the kernel number corresponding to the target task name d according to the target task name d.
- ii and iv including the kernel number of the target task d).
- the cores ii and iv corresponding to the core numbers ii and iv are then found in the multi-core systems 1, 2 and 3.
- Source task c-1 is in kernel iii
- task d-1 is in kernel ii
- kernel ii and kernel iii are in the same multicore system 2
- task d-2 is in kernel iv within multicore system 3; according to the proximity principle described above, information
- the delivery device 10 preferentially selects the task d-1 as the target task to be delivered, and then transmits the to-be-delivered information to the task d-1; if the task d-1 is abnormal or the load is high, the information delivery device 10 selects the task d -2 is the target task of the information to be delivered, and then the information to be delivered is sent to task d-2.
- task d-2 is the source task, and the task d-2 needs to send the information to be delivered to the task a.
- task a includes three task instances: al, a-2, and a-3.
- the task d-2 sends the to-be-delivered information and the target task name a to the information delivery device 10, and the information delivery device 10 searches for the kernel number corresponding to the target task name a in the preset global relationship table according to the target task name a.
- the target task name a There are i, ii, and iii (including the kernel number of the target task a).
- the cores i, ii, and iii corresponding to the kernel numbers i, ii, and iii are then found in the multi-core systems 1, 2, and 3. All instances a, a-2, a-3 of task a are not in the same core as source task d-2, nor are they in the same multicore system; task a-1 is in multicore system 1, and task a-2 And a-3 are in the multi-core system 2.
- the device 10 for information delivery cannot select according to the principle of the above-mentioned proximity. At this time, it is necessary to select according to whether the three task instances of the task a are abnormal or the load is high or low, and the task that is normally operated and has a low load is required.
- the instance acts as the target task for the information to be delivered.
- the device for information delivery 10 can select the target task by the above-mentioned proximity principle, can improve the speed and efficiency of information delivery, avoid the phenomenon of information delivery failure, and ensure the load balancing of different task instances in the same task.
- the target task instance with the lowest load may be directly searched according to the principle of proximity, and the target task instance is used as the target task of the information to be delivered.
- the task a-1 is the source task, and the task a-1 needs to send the information to be delivered to the task d.
- the task a-1 sends the to-be-delivered information and the target task name d to the device 10 for information delivery.
- the information delivery device 10 searches the preset global relationship table for the kernel numbers corresponding to the target task name d according to the target task name d, ii and iv (including the kernel number of the target task d).
- the kernels ii and iv corresponding to the kernel numbers ii, iv, and the task instances d-1 and d-2 are task instances, wherein the task d-1 is in the kernel ii, the task D-2 is in the kernel iv, the task d-1 is heavy, and the task d-2 is low, so the task d-2 of the kernel iv is selected as the target task to be delivered information, and the information delivery device 10 sends the information to be delivered. Go to task d-2 in kernel iv. If an abnormal situation occurs in the target task instance d-2 selected as the target task, the information delivery device sends the to-be-delivered information to task d-1 of kernel ii. If an abnormal situation occurs in the target task instance selected as the target task, and one of the other target task instances is selected as the target task to be delivered, to ensure load balancing of different task instances in the same task, and information can be avoided. Delivery failure occurs.
- the device embodiment for information delivery described above can realize information delivery between multi-core systems or multi-core systems, high reliability of information delivery, improved speed and efficiency of information delivery, and load balancing of task instances in a multi-core system. It also prevents the failure of information delivery.
- the letter configured in the multi-core system The delivery device independently maintains a preset global relationship table.
- each multi-core system is configured with information delivery devices, and each information delivery device may separately maintain a preset global relationship table, or may select one of the information delivery devices. Maintain a preset global relationship table. If each information delivery device maintains a preset global relationship table, it is necessary to keep the preset global relationship table information in each information delivery device synchronized.
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Hardware Redundancy (AREA)
- Computer And Data Communications (AREA)
- Debugging And Monitoring (AREA)
- Mobile Radio Communication Systems (AREA)
- Information Transfer Between Computers (AREA)
Abstract
Description
Claims
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP11835522.1A EP2634694B1 (en) | 2010-10-25 | 2011-06-17 | Method and device for information delivery |
US13/881,018 US9207974B2 (en) | 2010-10-25 | 2011-06-17 | Information delivery method and device |
RU2013121783/08A RU2566953C2 (ru) | 2010-10-25 | 2011-06-17 | Способ и устройство для доставки информации |
BR112013010079-6A BR112013010079A2 (pt) | 2010-10-25 | 2011-06-17 | método e dispositivo de fornecimento de informação |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201010518285.XA CN101976208B (zh) | 2010-10-25 | 2010-10-25 | 信息投递的方法和装置 |
CN201010518285.X | 2010-10-25 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2012055248A1 true WO2012055248A1 (zh) | 2012-05-03 |
Family
ID=43576095
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2011/075893 WO2012055248A1 (zh) | 2010-10-25 | 2011-06-17 | 信息投递的方法和装置 |
Country Status (7)
Country | Link |
---|---|
US (1) | US9207974B2 (zh) |
EP (1) | EP2634694B1 (zh) |
CN (1) | CN101976208B (zh) |
BR (1) | BR112013010079A2 (zh) |
RU (1) | RU2566953C2 (zh) |
TR (1) | TR201806949T4 (zh) |
WO (1) | WO2012055248A1 (zh) |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101976208B (zh) | 2010-10-25 | 2014-08-13 | 中兴通讯股份有限公司 | 信息投递的方法和装置 |
CN102681905A (zh) * | 2011-03-09 | 2012-09-19 | 新奥特(北京)视频技术有限公司 | 一种任务之间的相互通讯方法及系统 |
CN104572315B (zh) * | 2013-10-23 | 2018-12-25 | 华为技术有限公司 | 实现子系统间通信的方法、通信实体及分布式通信系统 |
CN107786544B (zh) * | 2017-09-29 | 2018-08-17 | 贵州白山云科技有限公司 | 一种消息的任务状态处理方法及系统 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101110043A (zh) * | 2007-09-04 | 2008-01-23 | 杭州华三通信技术有限公司 | 一种多核系统的资源管理方法和控制核 |
US20090094437A1 (en) * | 2007-10-07 | 2009-04-09 | Masahiro Fukuda | Method And Device For Controlling Multicore Processor |
CN101634953A (zh) * | 2008-07-22 | 2010-01-27 | 国际商业机器公司 | 搜索空间计算方法和装置及自适应线程调度方法和系统 |
CN101976208A (zh) * | 2010-10-25 | 2011-02-16 | 中兴通讯股份有限公司 | 信息投递的方法和装置 |
Family Cites Families (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7234139B1 (en) | 2000-11-24 | 2007-06-19 | Catharon Productions, Inc. | Computer multi-tasking via virtual threading using an interpreter |
JP2004334537A (ja) * | 2003-05-07 | 2004-11-25 | Sony Corp | プログラム処理システム及びプログラム処理方法、並びにコンピュータ・プログラム |
EP1987428A2 (en) * | 2006-02-24 | 2008-11-05 | Mbda Uk Limited | Real-time distributed processor environment |
CN100466629C (zh) * | 2006-09-18 | 2009-03-04 | 杭州华三通信技术有限公司 | 一种网络设备和基于多核处理器的报文转发方法 |
CN101262425A (zh) * | 2008-04-28 | 2008-09-10 | 艾诺通信系统(苏州)有限责任公司 | 基于网络地址转换的多播转发的方法 |
CN101403982B (zh) * | 2008-11-03 | 2011-07-20 | 华为技术有限公司 | 一种多核处理器的任务分配方法和系统 |
US20100287320A1 (en) * | 2009-05-06 | 2010-11-11 | Lsi Corporation | Interprocessor Communication Architecture |
US8601556B2 (en) * | 2009-06-22 | 2013-12-03 | Citrix Systems, Inc. | Systems and methods for handling SSL session not reusable across multiple cores |
-
2010
- 2010-10-25 CN CN201010518285.XA patent/CN101976208B/zh not_active Expired - Fee Related
-
2011
- 2011-06-17 TR TR2018/06949T patent/TR201806949T4/tr unknown
- 2011-06-17 EP EP11835522.1A patent/EP2634694B1/en not_active Not-in-force
- 2011-06-17 RU RU2013121783/08A patent/RU2566953C2/ru not_active IP Right Cessation
- 2011-06-17 US US13/881,018 patent/US9207974B2/en not_active Expired - Fee Related
- 2011-06-17 BR BR112013010079-6A patent/BR112013010079A2/pt not_active Application Discontinuation
- 2011-06-17 WO PCT/CN2011/075893 patent/WO2012055248A1/zh active Application Filing
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101110043A (zh) * | 2007-09-04 | 2008-01-23 | 杭州华三通信技术有限公司 | 一种多核系统的资源管理方法和控制核 |
US20090094437A1 (en) * | 2007-10-07 | 2009-04-09 | Masahiro Fukuda | Method And Device For Controlling Multicore Processor |
CN101634953A (zh) * | 2008-07-22 | 2010-01-27 | 国际商业机器公司 | 搜索空间计算方法和装置及自适应线程调度方法和系统 |
CN101976208A (zh) * | 2010-10-25 | 2011-02-16 | 中兴通讯股份有限公司 | 信息投递的方法和装置 |
Non-Patent Citations (1)
Title |
---|
See also references of EP2634694A4 * |
Also Published As
Publication number | Publication date |
---|---|
RU2566953C2 (ru) | 2015-10-27 |
BR112013010079A2 (pt) | 2020-07-07 |
CN101976208B (zh) | 2014-08-13 |
US20130227580A1 (en) | 2013-08-29 |
TR201806949T4 (tr) | 2018-06-21 |
RU2013121783A (ru) | 2014-12-10 |
EP2634694A4 (en) | 2016-05-25 |
EP2634694B1 (en) | 2018-04-04 |
US9207974B2 (en) | 2015-12-08 |
EP2634694A1 (en) | 2013-09-04 |
CN101976208A (zh) | 2011-02-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN104620558B (zh) | 用于支持分布式数据网格集群中的消息预处理的系统和方法 | |
CN112313916B (zh) | 一种融合区块链技术拟态存储防篡改日志的方法及系统 | |
CN1906586B (zh) | 用于在多处理器系统中处置处理错误的方法和设备 | |
CN108200124B (zh) | 一种高可用应用程序架构及构建方法 | |
US10826977B2 (en) | System and method for supporting asynchronous request/response in a network environment | |
WO2012055248A1 (zh) | 信息投递的方法和装置 | |
CN105610972A (zh) | 集群式的任务调派系统 | |
US9411633B2 (en) | System and method for barrier command monitoring in computing systems | |
CN105183549A (zh) | 基于任务分配的自动出票系统 | |
CN102567227A (zh) | 共享缓存设备的双控制器存储系统和方法 | |
CN102025783A (zh) | 集群系统及其消息处理方法和协议转发网关 | |
CN105790825A (zh) | 一种分布式保护中控制器热备份的方法和装置 | |
EP2761453B1 (en) | System and method for preventing single-point bottleneck in a transactional middleware machine environment | |
CN101686261A (zh) | 一种基于rac的冗余服务器系统 | |
CN102231126B (zh) | 一种实现多核处理器中核间备份的方法及系统 | |
CN103179162B (zh) | 一种输出日志的方法及系统 | |
CN114371935A (zh) | 网关处理方法、网关、设备及介质 | |
CN110046064B (zh) | 一种基于故障漂移的云服务器容灾实现方法 | |
CN106294031A (zh) | 一种业务管理方法和存储控制器 | |
TW201140302A (en) | Data storage system with power backup mechanism | |
US9785594B2 (en) | Micro server and switch device thereof | |
JP5061674B2 (ja) | フォールトトレラントコンピュータシステム及びデータ送信制御方法 | |
CN104765420A (zh) | 一种基于Power平台的内存板方案设计方法 | |
CN102662911A (zh) | 一种板级重构红外信号处理机的控制方法 | |
Yu et al. | Design and implementation of open mpi over quadrics/elan4 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 11835522 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 13881018 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2011835522 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 2013121783 Country of ref document: RU Kind code of ref document: A |
|
REG | Reference to national code |
Ref country code: BR Ref legal event code: B01A Ref document number: 112013010079 Country of ref document: BR |
|
REG | Reference to national code |
Ref country code: BR Ref legal event code: B01E Ref document number: 112013010079 Country of ref document: BR Free format text: APRESENTE A TRADUCAO SIMPLES DA FOLHA DE ROSTO DA CERTIDAO DE DEPOSITO DA PRIORIDADE CN 201010518285.X; OU DECLARACAO DE QUE OS DADOS DO PEDIDO INTERNACIONAL ESTAO FIELMENTE CONTIDOS NA PRIORIDADE REIVINDICADA, CONTENDO TODOS OS DADOS IDENTIFICADORES DESTA (TITULARES,NUMERO DE REGISTRO, DATA E TITULO), CONFORME O PARAGRAFO UNICO DO ART. 25 DA RESOLUCAO T7/2013 E ART. 2O DA RESOLUCAO 179/2017. CABE SALIENTAR QUE NAO FOI POSSIVEL IDENTIFICAR O TITULAR DO PEDIDO PRIORITARIO NOS DOCUMENTOS JUNTADOS AO PROCESSO, TAMPOUCO NOS APRESENTADOS NA OMPI. TAL INFORMACAO E NECESSARIA PARA O EXAME DA CESSAO DO DOCUMENTO DE PRIORIDADE. |
|
ENP | Entry into the national phase |
Ref document number: 112013010079 Country of ref document: BR Kind code of ref document: A2 Effective date: 20130425 |