CN101604264A - The method for scheduling task of supercomputer and system - Google Patents
The method for scheduling task of supercomputer and system Download PDFInfo
- Publication number
- CN101604264A CN101604264A CNA2009101087124A CN200910108712A CN101604264A CN 101604264 A CN101604264 A CN 101604264A CN A2009101087124 A CNA2009101087124 A CN A2009101087124A CN 200910108712 A CN200910108712 A CN 200910108712A CN 101604264 A CN101604264 A CN 101604264A
- Authority
- CN
- China
- Prior art keywords
- task
- computing node
- parallel section
- energy consumption
- load table
- 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.)
- Granted
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The invention provides a kind of method for scheduling task and system of supercomputer, described method comprises: the A. computing node is consulted the application load table, judge whether computing node can finish the parallel section of the task of waiting for operation, if then request moves the parallel section of described task; B. the dispatching center receives the operation request of computing node, obtains the energy consumption that parallel section increased that computing node is finished described task; C. the computing node of the energy consumption minimum of described increase is selected by described dispatching center, and the parallel section of described task is dispatched to this computing node.Adopt the method for scheduling task and the system of supercomputer provided by the invention, can effectively reduce the energy consumption of supercomputer.
Description
Technical field
The present invention relates to field of computer technology, more particularly, relate to a kind of method for scheduling task and system of supercomputer.
Background technology
Supercomputer is meant the parallel computing machine that carries out large-scale calculations or data processing of energy that a plurality of computing nodes combine, and is also referred to as parallel computer.Supercomputer the time can consume a large amount of electric energy in operation, and usually, the supercomputing chance is added up the state of all computing nodes by the dispatching center, according to the node state scheduling task of computing node.And supercomputer has thousands of computing nodes, only add up, screen and dispatch, be difficult to travel through all computing nodes, and cause congested easily by the dispatching center, thereby consume lot of energy when making the supercomputer operation, also reduced the operational efficiency of supercomputer simultaneously.
Summary of the invention
Based on this, be necessary to provide a kind of method for scheduling task that can reduce the supercomputer of energy consumption.
In addition, also be necessary to provide a kind of task scheduling system that can reduce the supercomputer of energy consumption.
The method for scheduling task of described supercomputer comprises: the A. computing node is consulted the application load table, judges whether computing node can finish the parallel section of the task of waiting for operation, if then request moves the parallel section of described task; B. the dispatching center receives the operation request of computing node, obtains the energy consumption that parallel section increased that computing node is finished described task; C. the computing node of the energy consumption minimum of described increase is selected by described dispatching center, and the parallel section of described task is dispatched to this computing node.
Preferably, the content of described application load table record comprises: the computing power that the operation address of the running status of task, task, the parallel section of operation task are required and the required energy consumption of parallel section of operation task.
Judge in the described steps A computing node can finish the task of waiting for operation parallel section step specifically: computing node is consulted the application load table, obtain the required computing power of parallel section of finishing the task of waiting for operation, when the residue computing power of described computing node self during, judge that then described computing node can finish the parallel section of the task of described wait operation greater than the required computing power of described parallel section.
Also comprise after the described step C: D. moves the running status of the parallel section of described task by waiting for that operation is updated to, and the operation address of upgrading the parallel section of described task.
In addition, described method also comprises: the E. computing node is consulted the application load table, judges whether computing node can finish the parallel section of moving of task, if then request moves the parallel section of described moving of task; F. the dispatching center receives the operation request of computing node, obtains the parallel section of described moving of task is moved to the energy consumption that parallel section increased that computing node and this computing node move this task; G. the application load table is consulted by described dispatching center, obtain the required energy consumption of parallel section of the described task of operation, the required energy of the parallel section of the described task of operation that writes down in less than described application load table when the energy consumption of described increase is consuming time, then the parallel section of described moving of task is moved to described computing node.
Preferably, also comprise after the described step G: upgrade the operation address of parallel section of described task and the required energy consumption of parallel section of upgrading the described task of operation.
The task scheduling system of described supercomputer comprises: at least one computing node, described computing node is used to consult the application load table, judge whether computing node can finish the parallel section of the task of waiting for operation, if then request moves the parallel section of described task; The dispatching center, carry out alternately with described computing node, be used to receive the operation request of computing node, obtain computing node and finish the energy consumption that parallel section increased of described task, and the computing node of selecting the energy consumption minimum of described increase, and the parallel section of the task of described wait operation is dispatched to this computing node.
Preferably, described computing node also is used to consult the application load table, judges whether computing node can finish the parallel section of moving of task, if then request moves the parallel section of described task.
Further preferably, described dispatching center also is used to receive the operation request of computing node, the parallel section that obtains will moving of task is moved to the energy consumption that parallel section increased that computing node and this computing node move described task, and consult the application load table, obtain the required energy consumption of parallel section of the described task of operation, the required energy of the parallel section of the described task of operation that writes down in less than described application load table when the energy consumption of described increase is consuming time, then the parallel section of described task is moved to described computing node.
In the method for scheduling task and system of above-mentioned supercomputer, consult the application load table by computing node, when computing node self can be finished the parallel section of the task of waiting for operation, then active request is moved this parallel section, and obtaining each computing node, the dispatching center finishes the energy consumption that this parallel section increases, select the computing node of the energy consumption minimum increased, and with task scheduling to this computing node.Because computing node is according to self-ability active request operation task, and the computing node operation task of energy consumption minimum is selected by the dispatching center, like this, can effectively reduce the energy consumption of supercomputer.
Description of drawings
Fig. 1 is the process flow diagram of the method for scheduling task of supercomputer among the embodiment;
Fig. 2 is the process flow diagram of the method for scheduling task of supercomputer among another embodiment;
Fig. 3 is the synoptic diagram of the task scheduling system of supercomputer among the embodiment.
Embodiment
Fig. 1 shows the method for scheduling task flow process of supercomputer among the embodiment, and detailed process is as follows:
In step S101, computing node is consulted the application load table, judges when computing node can be finished the parallel section of the task of waiting for operation, then the parallel section of the described task of request operation.
In step S102, the dispatching center receives the operation request of computing node, obtains the energy consumption that parallel section increased that computing node is finished described task.
In step S103, the computing node of the energy consumption minimum of described increase is selected by the dispatching center, and the parallel section of described task is dispatched to this computing node.
In one embodiment, the application load table can be stored on the computing node, consults for dispatching center and each computing node.The recordable content of application load table comprises: energy consumption that the computing power that the operation address of the running status of task, task, each parallel section of operation task are required and each parallel section of operation task are required etc.Wherein, the running status of task comprises: wait moves, moves and operation is finished; The computing node address of each parallel section of this task is promptly moved in the operation address of task.
In one embodiment, judge computing node can finish the task of waiting for operation parallel section process specifically: computing node is consulted the application load table, obtain the required computing power of parallel section of finishing the task of waiting for operation, when the residue computing power of computing node self during greater than the required computing power of described parallel section, then this computing node of Pan Duaning can be finished the parallel section of the task of described wait operation.The computing power here is meant central processing power (specifically can be flops), memory power (specifically can be memory size) and the network capabilities (specifically can be the network bandwidth) etc. of computing node.
In one embodiment, task scheduling behind the computing node that increases the energy consumption minimum, is upgraded the application load table, specifically: the running status of the parallel section of described task is moved by waiting for that operation is updated to; Upgrade the operation address (promptly moving the address of the computing node of this parallel section) of the parallel section of described task.Because all computing nodes can both initiatively participate in the process of dispatching, when computing node is judged a certain parallel section that self can finish the work, then active request is moved this parallel section, calculating it simultaneously finishes the energy consumption that this parallel section increases and offers the dispatching center, the minimum computing node of energy consumption is then selected by the dispatching center, make task scheduling more reasonable, fair and quick like this, can effectively reduce the energy consumption of supercomputer, also can improve the operational efficiency of supercomputer.
Fig. 2 shows the method for scheduling task flow process of supercomputer among another embodiment, and this flow process has been described the process of the parallel section of the task that computing node request operation moving, and detailed process is as follows:
In step S201, computing node is consulted the application load table, judges when computing node can be finished the parallel section of moving of task, then the parallel section of the described task of request operation.
In step S202, the dispatching center receives the operation request of computing node, obtains the energy consumption that parallel section increased of the parallel section of this moving of task being moved to computing node and this computing node operation task.
In step S203, the application load table is consulted by the dispatching center, obtains the required energy consumption of parallel section of the described task of operation.This energy consumption is promptly just at the energy that computing node consumed of the parallel section of operation task.
In step S204, whether the energy consumption of judging described increase is less than the required energy consumption of parallel section of the described task of operation that writes down in the application load table, if then enter step S205, otherwise finish.
In step S205, the parallel section of described moving of task is moved to described computing node.
In step S206, upgrade the operation address of parallel section of described task and the required energy consumption of parallel section of upgrading the described task of operation.In one embodiment, finish the energy consumption that a certain parallel section increased of moving of task and this parallel section is moved to the summation of the energy consumption that this computing node increases consuming time less than the energy of the computing node that moves this parallel section when computing node, then computing node can be moved to this parallel section of task in the dispatching center.And the operation address of the parallel section of this task that writes down in the application load table also will be updated to the address of new computing node by the address of former computing node, and the required energy consumption of parallel section of this task of operation of record also will be changed to the energy consumption that new computing node moves this parallel section by the energy consumption of former computing node.
Fig. 3 shows the task scheduling system of supercomputer among the embodiment, this system call center 100 and carry out at least one mutual computing node (computing node 200,300......N) with it.Wherein:
Each computing node (computing node 200,300......N) is used to consult the application load table, judges whether computing node finishes the parallel section of the task of waiting for operation, if then request moves the parallel section of described task.
Dispatching center 100 is used to receive the operation request of each computing node, obtain computing node and finish the energy consumption that parallel section increased of described task, and the computing node of selecting the energy consumption minimum of described increase, and the parallel section of the task of described wait operation is dispatched to this computing node.
In one embodiment, the application load table can be stored on the computing node, consults for dispatching center and each computing node.The recordable content of application load table comprises: energy consumption that the computing power that the operation address of the running status of task, task, each parallel section of operation task are required and each parallel section of operation task are required etc.Wherein, the running status of task comprises: wait moves, moves and operation is finished; The address at computing node place of the parallel section of this task is promptly moved in the operation address of task.
In one embodiment, each computing node (computing node 200,300......N) also can be used for consulting the application load table, judge whether it can finish the parallel section of moving of task, if then request moves the parallel section of this moving of task.The 100 operation requests that receive computing node in dispatching center, the parallel section that obtains will moving of task is moved to the energy consumption that parallel section increased that computing node and this computing node move described task, simultaneously, the application load table is consulted by dispatching center 100, obtain the required energy consumption of parallel section of this task of operation that writes down in the application load table, the required energy of the parallel section of the operation task that writes down in less than the application load table when the energy consumption of above-mentioned increase is consuming time, and then the parallel section of the task that this is being moved is moved to this computing node.
The above only is preferred embodiment of the present invention, not in order to restriction the present invention, all any modifications of being done within the spirit and principles in the present invention, is equal to and replaces and improvement etc., all should be included within protection scope of the present invention.
Claims (9)
1, a kind of method for scheduling task of supercomputer is characterized in that, described method comprises:
A. computing node is consulted the application load table, judges whether computing node can finish the parallel section of the task of waiting for operation, if then request moves the parallel section of described task;
B. the dispatching center receives the operation request of computing node, obtains the energy consumption that parallel section increased that computing node is finished described task;
C. the computing node of the energy consumption minimum of described increase is selected by described dispatching center, and the parallel section of described task is dispatched to this computing node.
2, the method for scheduling task of supercomputer according to claim 1, it is characterized in that the content of described application load table record comprises: the computing power that the operation address of the running status of task, task, the parallel section of operation task are required and the required energy consumption of parallel section of operation task.
3, the method for scheduling task of supercomputer according to claim 2 is characterized in that, judge in the described steps A computing node can finish the task of waiting for operation parallel section step specifically:
Computing node is consulted the application load table, obtain the required computing power of parallel section of finishing the task of waiting for operation, when the residue computing power of described computing node self during, judge that then described computing node can finish the parallel section of the task of described wait operation greater than the required computing power of described parallel section.
4, the method for scheduling task of supercomputer according to claim 1 is characterized in that, also comprises after the described step C:
D. the running status of the parallel section of described task is moved by waiting for that operation is updated to, and the operation address of upgrading the parallel section of described task.
5, the method for scheduling task of supercomputer according to claim 4 is characterized in that, described method also comprises:
E. computing node is consulted the application load table, judges whether computing node can finish the parallel section of moving of task, if then request moves the parallel section of described moving of task;
F. the dispatching center receives the operation request of computing node, obtains the parallel section of described moving of task is moved to the energy consumption that parallel section increased that computing node and this computing node move this task;
G. the application load table is consulted by described dispatching center, obtain the required energy consumption of parallel section of the described task of operation, the required energy of the parallel section of the described task of operation that writes down in less than described application load table when the energy consumption of described increase is consuming time, then the parallel section of described moving of task is moved to described computing node.
6, the method for scheduling task of supercomputer according to claim 5 is characterized in that, also comprises after the described step G:
Upgrade the operation address of parallel section of described task and the required energy consumption of parallel section of upgrading the described task of operation.
7, a kind of task scheduling system of supercomputer is characterized in that, described system comprises:
At least one computing node, described computing node is used to consult the application load table, judges whether computing node can finish the parallel section of the task of waiting for operation, if then request moves the parallel section of described task;
The dispatching center, carry out alternately with described computing node, be used to receive the operation request of computing node, obtain computing node and finish the energy consumption that parallel section increased of described task, and the computing node of selecting the energy consumption minimum of described increase, and the parallel section of the task of described wait operation is dispatched to this computing node.
8, the task scheduling system of supercomputer according to claim 7, it is characterized in that described computing node also is used to consult the application load table, judge whether computing node can finish the parallel section of moving of task, if then request moves the parallel section of described task.
9, the task scheduling system of supercomputer according to claim 8, it is characterized in that, described dispatching center also is used to receive the operation request of computing node, the parallel section that obtains will moving of task is moved to the energy consumption that parallel section increased that computing node and this computing node move described task, and consult the application load table, obtain the required energy consumption of parallel section of the described task of operation, the required energy of the parallel section of the described task of operation that writes down in less than described application load table when the energy consumption of described increase is consuming time, then the parallel section of described task is moved to described computing node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009101087124A CN101604264B (en) | 2009-07-08 | 2009-07-08 | Task scheduling method and system for supercomputer |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009101087124A CN101604264B (en) | 2009-07-08 | 2009-07-08 | Task scheduling method and system for supercomputer |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101604264A true CN101604264A (en) | 2009-12-16 |
| CN101604264B CN101604264B (en) | 2012-07-25 |
Family
ID=41470005
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009101087124A Active CN101604264B (en) | 2009-07-08 | 2009-07-08 | Task scheduling method and system for supercomputer |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101604264B (en) |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102289277A (en) * | 2011-07-06 | 2011-12-21 | 中国科学院深圳先进技术研究院 | Dispatching method for data center application services |
| CN102420863A (en) * | 2011-11-30 | 2012-04-18 | 北京蓝汛通信技术有限责任公司 | Rapid file distribution system, method thereof and apparatus thereof |
| CN102508714A (en) * | 2011-11-03 | 2012-06-20 | 南京邮电大学 | Green-computer-based virtual machine scheduling method for cloud computing |
| CN102567106A (en) * | 2010-12-30 | 2012-07-11 | ***通信集团云南有限公司 | Task scheduling method, system and device |
| CN102567076A (en) * | 2011-12-12 | 2012-07-11 | 华中科技大学 | Selection method of server integration scheme based on energy consumption |
| CN104331326A (en) * | 2014-11-25 | 2015-02-04 | 华南师范大学 | Scheduling method and system for cloud computing |
| WO2015051685A1 (en) * | 2013-10-12 | 2015-04-16 | 华为技术有限公司 | Task scheduling method, device and system |
| CN105162844A (en) * | 2015-08-05 | 2015-12-16 | 中国联合网络通信集团有限公司 | Task distribution method and device |
| CN106095586A (en) * | 2016-06-23 | 2016-11-09 | 东软集团股份有限公司 | A kind of method for allocating tasks, Apparatus and system |
| CN106095572A (en) * | 2016-06-08 | 2016-11-09 | 东方网力科技股份有限公司 | The Dispatching System of a kind of big data process and method |
| WO2016177258A1 (en) * | 2015-05-06 | 2016-11-10 | 阿里巴巴集团控股有限公司 | Computing resource management method and apparatus |
| CN106126323A (en) * | 2016-06-17 | 2016-11-16 | 四川新环佳科技发展有限公司 | Real-time task scheduling method based on cloud platform |
| CN103677996B (en) * | 2012-08-28 | 2016-12-28 | 国际商业机器公司 | Collaboration method and system for balancing workload distribution |
| CN107153573A (en) * | 2016-03-02 | 2017-09-12 | 阿里巴巴集团控股有限公司 | Distributed task scheduling treating method and apparatus |
| CN110543148A (en) * | 2018-05-28 | 2019-12-06 | 华为技术有限公司 | task scheduling method and device |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6986066B2 (en) * | 2001-01-05 | 2006-01-10 | International Business Machines Corporation | Computer system having low energy consumption |
| CN1302412C (en) * | 2003-11-11 | 2007-02-28 | 联想(北京)有限公司 | Computer group system and its operation managing method |
-
2009
- 2009-07-08 CN CN2009101087124A patent/CN101604264B/en active Active
Cited By (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102567106A (en) * | 2010-12-30 | 2012-07-11 | ***通信集团云南有限公司 | Task scheduling method, system and device |
| CN102567106B (en) * | 2010-12-30 | 2014-10-01 | ***通信集团云南有限公司 | Task scheduling method, system and device |
| CN102289277A (en) * | 2011-07-06 | 2011-12-21 | 中国科学院深圳先进技术研究院 | Dispatching method for data center application services |
| CN102508714A (en) * | 2011-11-03 | 2012-06-20 | 南京邮电大学 | Green-computer-based virtual machine scheduling method for cloud computing |
| CN102420863A (en) * | 2011-11-30 | 2012-04-18 | 北京蓝汛通信技术有限责任公司 | Rapid file distribution system, method thereof and apparatus thereof |
| CN102567076A (en) * | 2011-12-12 | 2012-07-11 | 华中科技大学 | Selection method of server integration scheme based on energy consumption |
| CN102567076B (en) * | 2011-12-12 | 2014-12-17 | 华中科技大学 | Selection method of server integration scheme based on energy consumption |
| CN103677996B (en) * | 2012-08-28 | 2016-12-28 | 国际商业机器公司 | Collaboration method and system for balancing workload distribution |
| US9577869B2 (en) | 2012-08-28 | 2017-02-21 | International Business Machines Corporation | Collaborative method and system to balance workload distribution |
| CN104572272A (en) * | 2013-10-12 | 2015-04-29 | 杭州华为数字技术有限公司 | Task scheduling method, device and system |
| WO2015051685A1 (en) * | 2013-10-12 | 2015-04-16 | 华为技术有限公司 | Task scheduling method, device and system |
| CN104572272B (en) * | 2013-10-12 | 2018-02-09 | 杭州华为数字技术有限公司 | A kind of method for scheduling task, apparatus and system |
| CN104331326A (en) * | 2014-11-25 | 2015-02-04 | 华南师范大学 | Scheduling method and system for cloud computing |
| WO2016177258A1 (en) * | 2015-05-06 | 2016-11-10 | 阿里巴巴集团控股有限公司 | Computing resource management method and apparatus |
| CN105162844B (en) * | 2015-08-05 | 2018-07-13 | 中国联合网络通信集团有限公司 | A kind of method and device of task distribution |
| CN105162844A (en) * | 2015-08-05 | 2015-12-16 | 中国联合网络通信集团有限公司 | Task distribution method and device |
| CN107153573A (en) * | 2016-03-02 | 2017-09-12 | 阿里巴巴集团控股有限公司 | Distributed task scheduling treating method and apparatus |
| CN106095572B (en) * | 2016-06-08 | 2019-12-06 | 东方网力科技股份有限公司 | distributed scheduling system and method for big data processing |
| CN106095572A (en) * | 2016-06-08 | 2016-11-09 | 东方网力科技股份有限公司 | The Dispatching System of a kind of big data process and method |
| CN106126323A (en) * | 2016-06-17 | 2016-11-16 | 四川新环佳科技发展有限公司 | Real-time task scheduling method based on cloud platform |
| CN106126323B (en) * | 2016-06-17 | 2019-11-22 | 广州商品清算中心股份有限公司 | Real-time task scheduling method based on cloud platform |
| CN106095586A (en) * | 2016-06-23 | 2016-11-09 | 东软集团股份有限公司 | A kind of method for allocating tasks, Apparatus and system |
| CN110543148A (en) * | 2018-05-28 | 2019-12-06 | 华为技术有限公司 | task scheduling method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101604264B (en) | 2012-07-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101604264B (en) | Task scheduling method and system for supercomputer | |
| US10474504B2 (en) | Distributed node intra-group task scheduling method and system | |
| CN103365726B (en) | A kind of method for managing resource towards GPU cluster and system | |
| CN102707995B (en) | Service scheduling method and device based on cloud computing environments | |
| CN105580407A (en) | Network resource deployment method and device | |
| CN102262567A (en) | Virtual machine scheduling decision system, platform and method | |
| CN103856512A (en) | Cloud computing management server, working host, idle host and resource scheduling method | |
| CN105183554A (en) | Hybrid computing system of high-performance computing and cloud computing, and resource management method therefor | |
| CN102223281A (en) | Method for remapping resource demand dynamic change based on virtual network | |
| CN102968344A (en) | Method for migration scheduling of multiple virtual machines | |
| CN103297499A (en) | Scheduling method and system based on cloud platform | |
| CN104050137B (en) | The method and device that kernel is run in a kind of OS | |
| CN101414270A (en) | Method for implementing assist nuclear task dynamic PRI scheduling with hardware assistant | |
| CN103970587A (en) | Resource scheduling method, device and system | |
| CN105491150A (en) | Load balance processing method based on time sequence and system | |
| CN106293933A (en) | A kind of cluster resource configuration supporting much data Computational frames and dispatching method | |
| CN105321346A (en) | Method for utilizing cloud computing basic resource pool to control urban intelligent traffic | |
| CN110149377A (en) | A kind of video service node resource allocation methods, system, device and storage medium | |
| CN103019854A (en) | Distributed dynamic process management method and system | |
| JP6081212B2 (en) | Computer system, resource management apparatus, and resource management method | |
| CN103744735A (en) | Method and device for scheduling multi-core resource | |
| Whaiduzzaman et al. | Pefc: Performance enhancement framework for cloudlet in mobile cloud computing | |
| CN103501509A (en) | Method and device for balancing loads of radio network controller | |
| CN104461471A (en) | Unified instruction scheduling and register allocating method on clustering VLIW processor | |
| CN104281587A (en) | Connection establishing method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20170523 Address after: Room office building No. 1068 Shenzhen Institute of advanced technology A-301 518000 in Guangdong city of Shenzhen province Nanshan District Shenzhen University city academy Avenue Patentee after: Shenzhen shen-tech advanced Cci Capital Ltd Address before: 1068 No. 518055 Guangdong city in Shenzhen Province, Nanshan District City Xili Road School of Shenzhen University Patentee before: Shenzhen Advanced Technology Research Inst. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20170607 Address after: 4, 8288 building, 66 Shenzhen software Town, Longgang Road, Longgang District, Shenzhen, Guangdong 518000, China Patentee after: Shenzhen Yao Yuan Technology Co., Ltd. Address before: Room office building No. 1068 Shenzhen Institute of advanced technology A-301 518000 in Guangdong city of Shenzhen province Nanshan District Shenzhen University city academy Avenue Patentee before: Shenzhen shen-tech advanced Cci Capital Ltd |
|
| TR01 | Transfer of patent right |