EP3531641B1 - Procédé d établissement de routes de communication entre noeuds d'une grappe d' ordinateurs, programme d'ordinateur et grappe d'ordinateurs correspondants - Google Patents
Procédé d établissement de routes de communication entre noeuds d'une grappe d' ordinateurs, programme d'ordinateur et grappe d'ordinateurs correspondants Download PDFInfo
- Publication number
- EP3531641B1 EP3531641B1 EP19155891.5A EP19155891A EP3531641B1 EP 3531641 B1 EP3531641 B1 EP 3531641B1 EP 19155891 A EP19155891 A EP 19155891A EP 3531641 B1 EP3531641 B1 EP 3531641B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- nodes
- numbers
- global
- computer cluster
- cluster
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000004891 communication Methods 0.000 title claims description 79
- 238000000034 method Methods 0.000 title claims description 35
- 238000004590 computer program Methods 0.000 title claims description 7
- 238000004422 calculation algorithm Methods 0.000 claims description 31
- 238000012545 processing Methods 0.000 claims description 9
- 230000003287 optical effect Effects 0.000 claims description 8
- 230000000737 periodic effect Effects 0.000 claims description 8
- 101000606741 Homo sapiens Phosphoribosylglycinamide formyltransferase Proteins 0.000 description 6
- 102100039654 Phosphoribosylglycinamide formyltransferase Human genes 0.000 description 6
- 238000004364 calculation method Methods 0.000 description 5
- 230000015654 memory Effects 0.000 description 4
- 241000287107 Passer Species 0.000 description 2
- 238000011084 recovery Methods 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 101100536354 Drosophila melanogaster tant gene Proteins 0.000 description 1
- 229940082150 encore Drugs 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/46—Cluster building
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0893—Assignment of logical groups to network elements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/56—Routing software
- H04L45/566—Routing instructions carried by the data packet, e.g. active networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/09—Mapping addresses
- H04L61/25—Mapping addresses of the same type
- H04L61/2503—Translation of Internet protocol [IP] addresses
- H04L61/256—NAT traversal
- H04L61/2567—NAT traversal for reachability, e.g. inquiring the address of a correspondent behind a NAT server
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/45—Network directories; Name-to-address mapping
- H04L61/4552—Lookup mechanisms between a plurality of directories; Synchronisation of directories, e.g. metadirectories
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
- H04Q11/0066—Provisions for optical burst or packet networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/021—Ensuring consistency of routing table updates, e.g. by using epoch numbers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
- H04Q2011/009—Topology aspects
Definitions
- the present invention relates to a method of establishing communication routes between nodes of a cluster of computers, a corresponding computer program and a cluster of computers.
- the algorithm is implemented on the basis of numbers of the nodes in which the numbers of the selected nodes do not present the periodicity of at least part of the communication links. This makes it possible to ensure that routes joining these selected nodes do not all pass through one of these communication links. This ensures that the use of communication links is well balanced for the selected nodes. By selecting nodes which exchange a large amount of data, it is possible, thanks to this balancing, to reduce the risks that the same communication link serves many selected nodes and therefore that this communication link is congested.
- the selected nodes have a common characteristic, which the other nodes do not have.
- the common feature is that the selected nodes are optical network interfaces.
- the common feature is that the selected nodes belong to storage computers.
- the common feature is that the selected nodes belong to computing computers having a graphics processor.
- the second global numbers of the selected nodes are successive.
- the nodes are connected to connection ports of some of the switches, these connection ports having local numbers within the switch to which these connection ports belong, and in which the first global numbers are obtained from from local numbers.
- the first global numbers of the nodes connected to connection ports of a switch follow one another consecutively in the same order as the local numbers of the connection ports to which these nodes are respectively connected.
- the cluster of computers is designed to alternate first phases in which the unselected nodes exchange data with each other, and second phases in which the unselected nodes exchange data with the selected nodes.
- the subject of the invention is also a computer program which can be downloaded from a communication network and / or recorded on a medium readable by a computer and / or executable by a processor, characterized in that it comprises instructions for the execution of the steps of a method of establishing communication routes between nodes of a computer cluster as defined above, when said program is executed on a computer.
- the cluster of computers 100 groups together independent computers 102, 104 appearing from the outside as a single computer with very high computing power, called a high processing performance computer or HPC (standing for “High Performance Computing”) computer.
- Each computer 102, 104 comprises, as is known per se, a central processing unit ("central processing unit” in English), a main memory (“main memory” in English) in which instructions for the central processing unit are intended to be recorded and at least one network interface.
- the network interfaces respectively form nodes 106 0 ... 106 63 of the computer cluster 100.
- Several network interfaces (and therefore several nodes 106 0 ... 106 63 ) can belong to the same computer 102, 104, or else , as in the example described, each computer 102, 104 may have only one network interface forming one of the nodes 106 0 ... 106 63 .
- the computers 102, 104 of the computer cluster 100 include calculation computers 102 and storage computers 104, the latter comprising mass memories such as hard disks for recording data. used and / or produced by computing computers 102.
- the computer cluster 100 further includes an administration server 108.
- the administration server 108 is in particular designed to communicate with clients wishing to use the computer cluster 100, the latter then being seen by the clients as a single machine.
- the administration server 108 is further designed to schedule, between the computing computers 102, tasks received from the clients.
- the administration server 108 is further designed to implement a method of establishing communication routes between nodes 106 0 ... 106 63 of the computer cluster, as will be described later.
- the administration server 108 comprises means for carrying out the steps which will be described below.
- the administration server 108 comprises, as is known per se, a central processing unit and a main memory in which instructions for the central processing unit are intended to be recorded.
- the means are software means, in the form of a computer program downloadable from a communication network and / or recorded on a medium readable by computer and / or executable by a processor, comprising instructions. for the execution of the steps of the method when said computer program is executed on the administration server.
- all or part of these means could be micro-programmed or micro-hardwired hardware means in dedicated integrated circuits.
- the administration server 108 could be an electronic device composed solely of digital circuits (without a computer program) for carrying out the same actions.
- the various functions of the administration server 108 could be distributed between several devices, for example between several computers.
- Such a cluster of computers 100 allows the distribution of complex processing operations and / or parallel calculations over at least some of the calculation computers 102.
- computation nodes respectively “storage nodes”, will be used to refer to the nodes formed by a network interface belonging to a computation 102, respectively storage 104 computer.
- the network interfaces of the storage computers 104 are optical network interfaces, while the network interfaces of the computing computers 102 are electrical network interfaces having a lower throughput than that of the optical network interfaces. This is because storage computers 104 generally exchange more data than computing computers 102.
- the computer cluster 100 further comprises a network 110 for interconnecting nodes 106 0 ... 106 63 .
- the network 110 comprises switches 112 1 ... 112 14 and communication links 114 between the switches 112 1 ... 112 14 .
- Each switch 112 1 ... 112 14 has several connection ports (represented by small squares on the figure 1 ) and each communication link 114 is connected between two connection ports of two respective switches 112 1 ... 112 14 .
- the nodes 106 0 ... 106 63 are respectively connected to connection ports of some of the switches 112 1 ... 112 14 , hereinafter called external switches 112 1 ... 112 4 , 112 11 ... 112 14 .
- the other switches 112 5 ... 112 10 will hereafter be called internal switches.
- the cluster of computers 100 has a certain topology defining the relative arrangement of the nodes 106 0 ... 106 63 , of the switches 112 1 ... 112 14 and of the communication links 114.
- the topology is that of an imposing generalized parallel tree ("Parallel Generalized Fat Tree" or PGFT).
- the topology of a PGFT is generally defined by the following nomenclature: PGFT (h; m 1 ... m h ; w 1 ..., w h ; p 1 ... p h ), where h is the number of levels between which switches 112 1 ...
- m n is the number of level n-1 switches (or nodes for the first level) connected to each level n switch
- w n is the number of level switches n connected to each level switch n-1 (or to each node for the first level)
- p n is the number of parallel communication links used between levels n and n-1 (or between level n and the nodes for the first level).
- each communication link 114 is connected between two switches of consecutive hierarchical levels.
- connection ports leading to a lower level (or on nodes 106 0 ... 106 63 in the case of external switches 112 1 ... 112 4 , 112 11 . ..112 14 ) will be called hereinafter “lower connection ports”, while the connection ports leading to a higher level will be called hereinafter “upper connection ports”.
- the PGFT is defined by the nomenclature PGFT (3; 8, 4, 2; 1, 2, 1; 1, 1, 4).
- PGFT 3; 8, 4, 2; 1, 2, 1; 1, 1, 4
- eight nodes are connected to each external switch 112 1 ... 112 4 , 112 11 ... 112 14 , the latter therefore comprising eight lower connection ports.
- each switch 112 1 ... 112 14 are numbered, within this switch 112 1 ... 112 14 , according to a local numbering.
- the local numbers of the lower connection ports and the local numbers of the upper connection ports are shown on the figure 1 in small squares.
- the lower connection ports of each external switch 112 1 ... 112 4 , 112 11 ... 112 14 are numbered each time according to a local numbering assigning them respectively, in the example described, the local numbers of 0 to 7.
- the external switches 112 1 ... 112 4 , 112 11 ... 112 14 are all identical, at least as regards their lower connection ports. Furthermore, in the example described, the lower connection ports of the external switches 112 1 ... 112 4 , 112 11 ... 112 14 with the local number 7 are optical ports to which the optical network interfaces (forming the nodes storage 106 7 , 106 15 , 106 23 , 106 31 , 106 39 , 106 47 , 106 55 , 106 63 ) of the storage computers 104 are connected. The other lower connection ports of the external switches 112 1 ... 112 4 , 112 11 ... 112 14 are electrical connection ports to which the compute nodes are connected. The connection ports (lower and upper) of the internal switches 112 5 ... 112 10 are also electrical connection ports in the example described.
- the administration server 108 is designed to implement an algorithm for establishing communication routes between nodes. More precisely, this algorithm is designed to provide a communication route between a first node 106 0 ... 106 63 and a second node 106 0 ... 106 63 from respective numbers of these nodes 106 0 ... 106 63 and the topology of the computer cluster 100.
- the algorithm used is the D-mod-k algorithm, which expects a number, noted s, from a first node, called the source node, and a number, noted d, from a second node , called destination node, to define a communication route between these two nodes.
- the communication route Starting from the source node, the communication route first passes through the external switch 112 1 ... 112 4 , 112 11 ... 112 14 to which the source node is connected.
- the lower level switch on the shortest path to the destination node is selected, and then the following formula is used to select, in the event that multiple parallel links lead to the selected lower level switch, a lower connection port: d / w 0 * ... * w x - 1 mod p x - 1 where [] represents the whole part and mod represents the modulo.
- the algorithm then returns to the test step.
- the D-mod-k algorithm gives the formula [d] mod 2, which is periodic of period two.
- the D-mod-k algorithm gives the formula [d / 2] mod 4 , which is period eight.
- the algorithm is thus designed to pass through the same communication link routes whose destination nodes have periodic numbers according to a periodicity greater (in the sense “strictly greater”) than one.
- the S-mod-k algorithm could be used.
- formulas similar to those of the D-mod-k algorithm are used, replacing the number s with the number d.
- the S-mod-k algorithm is therefore also designed to pass through the same communication link routes whose source nodes have periodic numbers following a periodicity greater (always in the “strictly greater” sense) than one.
- the administration server 108 implements an exploration (“discovery” in English) of the computer cluster 100.
- the exploration makes it possible to determine the topology of the computer cluster 100.
- the nodes 106 0 ... 106 63 found are numbered according to a first global numbering assigning to the nodes 106 0 ... 106 63 the first respective global numbers.
- the first global numbers are obtained from the local numbers. More precisely, each time an external switch 112 1 ... 112 4 , 112 11 ... 112 14 is discovered, the nodes which are connected to it are numbered consecutively, following, where appropriate, the first numbers already assigned globals, in the order of the local numbering of the lower connection ports to which these nodes are connected.
- the first global numbers 0 - 7 will be assigned to nodes 106 0 ... 106 7 respectively . If the external switch 112 2 is subsequently discovered, the first global numbers 8 - 15 will be assigned to nodes 106 8 ... 106 15 , respectively, and so on. It will therefore be appreciated that, within the framework of the topology of the example described, the first global numbers of the storage nodes 106 7 , 106 15 , 106 23 , 106 31 , 106 39 , 106 47 , 106 55 , 106 63 are periodicals of eight.
- the formula [d / 2] mod 4 for selecting higher connection ports to go from the second level to the third level is also periodic with a periodicity of eight.
- all routes starting from any of the nodes whose first global numbers are 0 - 31 and arriving at the nodes of storage 106 7 , 106 15 , 106 23 , 106 31 , 106 39 , 106 47 , 106 55 , 106 63 would pass through the same communication link 114 extending between the second and third levels.
- this communication link 114 should support all routes to four storage nodes 106 39 , 106 47 , 106 55 , 106 63 .
- the storage nodes 106 7 , 106 15 , 106 23 , 106 31 , 106 39 , 106 47 , 106 55 , 106 63 are generally more stressed than the compute nodes, so that this communication link 114 would risk 'be very congested.
- the operation of the computer cluster 100 to perform a task generally alternates calculation phases during which the calculation nodes exchange data with each other, and data backup and / or recovery phases during which the compute nodes exchange data with the storage nodes to record and / or read data in the storage nodes.
- each communication link 114 taken by several routes each connecting a computing node to a storage node would be highly stressed and would risk being very congested.
- the administration server 108 therefore obtains, during a step 204, the topology of the computer cluster 100, with the first global numbers respectively assigned to the nodes 106 0 .. . 106 63 .
- the administration server 108 selects nodes.
- the storage nodes 106 7 , 106 15 , 106 23 , 106 31 , 106 39 , 106 47 , 106 55 , 106 63 are selected.
- the nodes to be selected are for example indicated to the administration server 108 by a human user through a man-machine interface.
- the administration server 108 could be designed to automatically determine which of the nodes 106 0 ... 106 63 are connected to optical connection ports.
- the selected nodes are preferably those all having a common characteristic (which can for example be detected automatically), while the other nodes do not have this characteristic.
- this characteristic is that the network interface forming the selected node is an optical network interface.
- the common characteristic could be that the node belongs to a storage computer.
- the common characteristic could be the presence of a graphics processor ("Graphics Processing Unit" in English) in the computing computer.
- the administration server 108 numbers the nodes 106 0 ... 106 63 according to a second global numbering, different from the first global numbering at least for some of the selected nodes 106 7 , 106 15 , 106 23 , 106 31 , 106 39 , 106 47 , 106 55 , 106 63 .
- second global numbers are respectively assigned to nodes 106 0 ...
- the second global numbers of the selected nodes 106 7 , 106 15 , 106 23 , 106 31 , 106 39 , 106 47 are chosen consecutive, so that the values separating them are all equal to one and therefore necessarily different from the frequency of all communication links 114.
- This algorithm is used with at least two types of nodes: a first type of node formed by the selected nodes and a second type of node formed by unselected nodes.
- the computation nodes are numbered from 0 to 55 and the storage nodes are numbered from 56 to 63.
- the administration server 108 implements the algorithm by executing it for each pair of nodes, the nodes being identified by their second global numbers.
- the administration server 108 implements in the network 110 the routes provided by the algorithm in step 210.
- the routes are recorded in routing tables transmitted to each switch 112 1 ... 112 14 .
- the administration server 108 receives, from a client, a request for the execution of a task.
- step 216 at least some of the computers 102, 104 perform the required task by communicating with each other through the network 110 using the communication routes established in step 210.
- the second method 300 comprises steps 202, 204, 206 as for the first method 200.
- the second method 300 comprises the following steps 302 to 306.
- the administration server 108 determines the periodicity of each of at least some of the communication links 114, preferably all of them. For example, this periodicity is determined from the formulas of the algorithm used.
- the administration server 108 determines values intended to successively separate the second global numbers of the selected nodes 106 7 , 106 15 , 106 23 , 106 31 , 106 39 , 106 47 , 106 55 , 106 63 , each determined value being different from each determined periodicity.
- the communication links 114 extending between the first and the second level have a periodicity of two
- the communication links 114 extending between the second level and the third level have a periodicity of two. periodicity of eight.
- the values intended to successively separate the second global numbers of the selected nodes 106 7 , 106 15 , 106 23 , 106 31 , 106 39 , 106 47 , 106 55 , 106 63 are each different from two and from eight.
- the administration server 108 numbers the nodes 106 0 ... 106 63 according to a second global numbering, different from the first global numbering at least for some of the selected nodes.
- the second global numbers of the selected nodes 106 7 , 106 15 , 106 23 , 106 31 , 106 39 , 106 47 are successively separated from the values determined in step 304.
- the second method 300 then comprises the steps 210 to 216 described above.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Multi Processors (AREA)
- Computer And Data Communications (AREA)
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR1851558A FR3078220B1 (fr) | 2018-02-22 | 2018-02-22 | Procede d'etablissement de routes de communication entre nœuds d'une grappe d'ordinateurs, programme d'ordinateur et grappe d'ordinateurs correspondants |
Publications (2)
Publication Number | Publication Date |
---|---|
EP3531641A1 EP3531641A1 (fr) | 2019-08-28 |
EP3531641B1 true EP3531641B1 (fr) | 2020-10-28 |
Family
ID=61764038
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP19155891.5A Active EP3531641B1 (fr) | 2018-02-22 | 2019-02-07 | Procédé d établissement de routes de communication entre noeuds d'une grappe d' ordinateurs, programme d'ordinateur et grappe d'ordinateurs correspondants |
Country Status (6)
Country | Link |
---|---|
US (1) | US11190404B2 (pt) |
EP (1) | EP3531641B1 (pt) |
JP (1) | JP2019169135A (pt) |
BR (1) | BR102019003524A2 (pt) |
FR (1) | FR3078220B1 (pt) |
IL (1) | IL264684A (pt) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FR3100069B1 (fr) * | 2019-08-23 | 2021-10-29 | Bull Sas | Procédé rapide d’établissement de routes de communication entre ordinateurs d’un superordinateur |
Family Cites Families (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5987011A (en) * | 1996-08-30 | 1999-11-16 | Chai-Keong Toh | Routing method for Ad-Hoc mobile networks |
US6980537B1 (en) * | 1999-11-12 | 2005-12-27 | Itt Manufacturing Enterprises, Inc. | Method and apparatus for communication network cluster formation and transmission of node link status messages with reduced protocol overhead traffic |
US7426566B2 (en) * | 2001-01-17 | 2008-09-16 | International Business Machines Corporation | Methods, systems and computer program products for security processing inbound communications in a cluster computing environment |
US7281057B2 (en) * | 2002-04-29 | 2007-10-09 | Harris Corporation | Hierarchical mobile ad-hoc network and methods for performing reactive routing therein |
FR2960369B1 (fr) * | 2010-05-20 | 2013-03-01 | Bull Sas | Procede d'optimisation de routage dans un cluster comprenant des liens de communication statiques et programme d'ordinateur mettant en oeuvre ce procede |
JP5849486B2 (ja) * | 2011-07-19 | 2016-01-27 | 富士通株式会社 | ネットワーク装置及びネットワーク管理装置 |
US9130858B2 (en) * | 2012-08-29 | 2015-09-08 | Oracle International Corporation | System and method for supporting discovery and routing degraded fat-trees in a middleware machine environment |
US9331958B2 (en) * | 2012-12-31 | 2016-05-03 | Advanced Micro Devices, Inc. | Distributed packet switching in a source routed cluster server |
FR3037463B1 (fr) * | 2015-06-15 | 2017-06-23 | Bull Sas | Transformation d'infrastructures reseaux non structurees en topologies virtuelles structurees adaptees a des algorithmes de routage specifiques |
FR3040575B1 (fr) * | 2015-09-02 | 2017-08-18 | Bull Sas | Procede de determination automatisee de topologies d'interconnexion optimales de systemes comprenant des nœuds de service, et dispositif de traitement associe |
-
2018
- 2018-02-22 FR FR1851558A patent/FR3078220B1/fr not_active Expired - Fee Related
-
2019
- 2019-02-05 JP JP2019018993A patent/JP2019169135A/ja active Pending
- 2019-02-06 IL IL264684A patent/IL264684A/en unknown
- 2019-02-07 EP EP19155891.5A patent/EP3531641B1/fr active Active
- 2019-02-20 US US16/280,678 patent/US11190404B2/en active Active
- 2019-02-21 BR BR102019003524A patent/BR102019003524A2/pt not_active IP Right Cessation
Non-Patent Citations (1)
Title |
---|
None * |
Also Published As
Publication number | Publication date |
---|---|
EP3531641A1 (fr) | 2019-08-28 |
JP2019169135A (ja) | 2019-10-03 |
FR3078220B1 (fr) | 2020-04-24 |
FR3078220A1 (fr) | 2019-08-23 |
BR102019003524A2 (pt) | 2019-09-10 |
IL264684A (en) | 2019-05-30 |
US20190260645A1 (en) | 2019-08-22 |
US11190404B2 (en) | 2021-11-30 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2015193570A1 (fr) | Méthode de routage de donnée et commutateur dans un réseau | |
EP0616477A1 (fr) | Dispositif de recherche du chemin de moindre coût dans un réseau de télécommunication | |
EP0599706A2 (fr) | Dispositif de traitement de l'information permettant la gestion d'une ressource informatique par un système d'administration | |
EP0715257A1 (fr) | Outil d'aide à la répartition de la charge d'une application répartie | |
WO2008056041A1 (fr) | Methode et appareil pour fournir un equilibrage de charge base sur le flux | |
WO2016034797A1 (fr) | Procédé de surveillance et d'alerte de configuration de routage dans un cluster comprenant des liens de communication statiques et programme d'ordinateur mettant en oeuvre ce procédé | |
US20210234791A1 (en) | Service assurance of ecmp using virtual network function hashing algorithm | |
EP3531641B1 (fr) | Procédé d établissement de routes de communication entre noeuds d'une grappe d' ordinateurs, programme d'ordinateur et grappe d'ordinateurs correspondants | |
FR2903548A1 (fr) | Procede de pilotage automatique d'un reseau de telecommunications avec mutualisation locale de connaissances | |
EP1387538B1 (fr) | Dispositif et procédé de détermination de chemins de routage dans un réseau de communications, en présence d'attributs de sélection | |
FR2714549A1 (fr) | Filtre numérique et convertisseur analogique-numérique à suréchantillonnage employant ce filtre. | |
EP2572478A1 (fr) | Procede d'optimisation de routage dans un cluster comprenant des liens de communication statiques et programme d'ordinateur mettant en oeuvre ce procede | |
FR3091774A1 (fr) | Procédé de déploiement d’une tâche dans un supercalculateur, procédé de mise en œuvre d’une tâche dans un supercalculateur, programme d’ordinateur correspondant et supercalculateur | |
EP3671454A1 (fr) | Procédé de mise en oeuvre d'une tâche dans un supercalculateur, programme d'ordinateur correspondant et supercalculateur | |
EP3671456A1 (fr) | Procédé de déploiement d'une tâche dans un supercalculateur, procédé de mise en oeuvre d'une tâche dans un supercalculateur, programme d'ordinateur correspondant et supercalculateur | |
EP2577920A1 (fr) | Procede de routage pseudo-dynamique dans un cluster comprenant des liens de communication statiques et programme d'ordinateur mettant en oeuvre ce procede | |
FR3037463A1 (fr) | Transformation d'infrastructures reseaux non structurees en topologies virtuelles structurees adaptees a des algorithmes de routage specifiques | |
WO2023018533A1 (en) | Egress traffic engineering in public clouds with commodity routers on the wan edge | |
EP3671455A1 (fr) | Procédé de déploiement d'une tâche dans un supercalculateur, procédé de mise en oeuvre d'une tâche dans un supercalculateur, programme d'ordinateur correspondant et supercalculateur | |
EP3139540B1 (fr) | Procédé de détermination automatisée de topologies d'interconnexion optimales de systèmes comprenant des noeuds de service, et dispositif de traitement associé | |
FR3091770A1 (fr) | Procédé de déploiement d’une tâche dans un supercalculateur, procédé de mise en œuvre d’une tâche dans un supercalculateur, programme d’ordinateur correspondant et supercalculateur | |
FR3091772A1 (fr) | Procédé de mise en œuvre d’une tâche dans un supercalculateur, programme d’ordinateur correspondant et supercalculateur | |
EP3572929A1 (fr) | Procédé d`envoi de données, programme d`ordinateur et système associés | |
EP0595719A1 (fr) | Procédé de détermination automatique des probabilités associées à une fonction booléenne | |
WO2013050682A1 (fr) | Procédé de routage adaptatif pseudo-dynamique dans un cluster comprenant des liens de communication statiques et programme d'ordinateur mettant en oeuvre ce procédé |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION HAS BEEN PUBLISHED |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
AX | Request for extension of the european patent |
Extension state: BA ME |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE |
|
17P | Request for examination filed |
Effective date: 20200210 |
|
RBV | Designated contracting states (corrected) |
Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: GRANT OF PATENT IS INTENDED |
|
INTG | Intention to grant announced |
Effective date: 20200602 |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: H04L 12/753 20130101ALI20200515BHEP Ipc: H04L 12/931 20130101AFI20200515BHEP Ipc: H04L 12/751 20130101ALI20200515BHEP |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE PATENT HAS BEEN GRANTED |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D Free format text: NOT ENGLISH |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: REF Ref document number: 1329376 Country of ref document: AT Kind code of ref document: T Effective date: 20201115 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R096 Ref document number: 602019001055 Country of ref document: DE |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D Free format text: LANGUAGE OF EP DOCUMENT: FRENCH |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: MK05 Ref document number: 1329376 Country of ref document: AT Kind code of ref document: T Effective date: 20201028 |
|
REG | Reference to a national code |
Ref country code: NL Ref legal event code: MP Effective date: 20201028 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: NO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20210128 Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20210129 Ref country code: PT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20210301 Ref country code: RS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 Ref country code: FI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 |
|
REG | Reference to a national code |
Ref country code: LT Ref legal event code: MG4D |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: ES Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 Ref country code: AT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 Ref country code: PL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 Ref country code: LV Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20210228 Ref country code: SE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 Ref country code: BG Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20210128 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: NL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 Ref country code: HR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R097 Ref document number: 602019001055 Country of ref document: DE |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: CZ Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 Ref country code: EE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 Ref country code: SK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 Ref country code: SM Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 Ref country code: RO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 Ref country code: LT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: DK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 |
|
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: MC Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 |
|
26N | No opposition filed |
Effective date: 20210729 |
|
REG | Reference to a national code |
Ref country code: BE Ref legal event code: MM Effective date: 20210228 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: AL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 Ref country code: IT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20210207 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R079 Ref document number: 602019001055 Country of ref document: DE Free format text: PREVIOUS MAIN CLASS: H04L0012931000 Ipc: H04L0049100000 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20210207 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20210228 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: BE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20210228 |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LI Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20220228 Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20220228 |
|
P01 | Opt-out of the competence of the unified patent court (upc) registered |
Effective date: 20230330 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: CY Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: HU Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO Effective date: 20190207 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R081 Ref document number: 602019001055 Country of ref document: DE Owner name: COMMISSARIAT A L'ENERGIE ATOMIQUE ET AUX ENERG, FR Free format text: FORMER OWNER: BULL SAS, LES CLAYES SOUS BOIS, FR Ref country code: DE Ref legal event code: R081 Ref document number: 602019001055 Country of ref document: DE Owner name: BULL SAS, FR Free format text: FORMER OWNER: BULL SAS, LES CLAYES SOUS BOIS, FR |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: 732E Free format text: REGISTERED BETWEEN 20231116 AND 20231122 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: MK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20201028 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20240216 Year of fee payment: 6 Ref country code: GB Payment date: 20240222 Year of fee payment: 6 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 20240222 Year of fee payment: 6 |