EP2695093A1 - Method and device for managing wiring in a cluster - Google Patents
Method and device for managing wiring in a clusterInfo
- Publication number
- EP2695093A1 EP2695093A1 EP12717405.0A EP12717405A EP2695093A1 EP 2695093 A1 EP2695093 A1 EP 2695093A1 EP 12717405 A EP12717405 A EP 12717405A EP 2695093 A1 EP2695093 A1 EP 2695093A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- computer
- connectors
- connector
- cluster
- logical
- 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.)
- Withdrawn
Links
- 238000000034 method Methods 0.000 title claims description 33
- 238000004590 computer program Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 10
- 230000015654 memory Effects 0.000 description 8
- 238000004891 communication Methods 0.000 description 6
- 238000004364 calculation method Methods 0.000 description 5
- 238000009434 installation Methods 0.000 description 4
- 230000008901 benefit Effects 0.000 description 3
- 238000004422 calculation algorithm Methods 0.000 description 3
- 238000002513 implantation Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 238000012937 correction Methods 0.000 description 2
- RYGMFSIKBFXOCR-UHFFFAOYSA-N Copper Chemical compound [Cu] RYGMFSIKBFXOCR-UHFFFAOYSA-N 0.000 description 1
- 239000011230 binding agent Substances 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 239000004020 conductor Substances 0.000 description 1
- 229910052802 copper Inorganic materials 0.000 description 1
- 239000010949 copper Substances 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000011835 investigation Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 239000003550 marker Substances 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 238000003786 synthesis reaction Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/18—Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2113/00—Details relating to the application field
- G06F2113/16—Cables, cable trees or wire harnesses
Definitions
- the present invention relates to the cabling of complex computer systems such as clusters and more particularly a method and a device for managing cabling in a cluster.
- High Performance Computing also known as High Performance Computing (HPC)
- HPC High Performance Computing
- HPC High Performance Computing
- modeling and simulation make it possible to reduce development costs and speed up the launch of innovative, more reliable and less energy-consuming products.
- high performance computing has become an indispensable means of investigation.
- a cluster typically includes a set of interconnected nodes. Some nodes are used to perform compute tasks (compute nodes), others to store data (storage nodes), and one or more others manage the cluster (administration nodes). Each node is for example a server implementing an operating system such as Linux (Linux is a brand). The connection between the nodes is, for example, carried out using Ethernet or Infiniband communication links (Ethernet and Infiniband are trademarks). Each node generally comprises one or more microprocessors, local memories as well as a communication interface.
- Figure 1 schematically illustrates an example of a topology 100 of a cluster, type fat-tree.
- the latter comprises a set of generically referenced nodes 105.
- the nodes belonging to the set 1 10 are here calculation nodes while the nodes of the set 1 15 are service nodes (storage nodes and administration nodes ).
- the calculation units may be grouped into subsets 120 called calculation islands, the set 1 being called the service island.
- the nodes are connected to each other by switches (called switches in English terminology), for example hierarchically.
- switches in English terminology
- the nodes are connected to first level switches 125 which are themselves connected to second level switches 130 which are in turn connected to third level switches 135.
- Such physical links are, for example, copper conductors or optical fibers.
- different types of links can be used within the same cluster.
- cluster cabling All of these links are usually called cluster cabling. They are set up by technicians during the installation of a cluster. This operation is also called cluster cabling.
- nodes of a cluster are often grouped in computer cabinets, also called racks in English terminology, which can themselves be grouped by islands.
- racks in English terminology, which can themselves be grouped by islands.
- a cluster comprising thirty racks each comprising 48 nodes requires several tens of thousands of cables whose total length may be several tens of kilometers.
- the wiring is done according to the know-how of technicians.
- this know-how requires qualified technicians who must be available at a given moment to install a cluster.
- they must be trained and must be able to pass on their knowledge.
- the invention solves at least one of the problems discussed above.
- the invention thus relates to a cabling management computer method in a cluster comprising at least two computer cabinets, each computer cabinet comprising at least one elementary device, each elementary device comprising at least one connector, this method comprising the following steps ,
- the method according to the invention thus makes it possible to create a list of physical connections which can notably be used to facilitate the cabling and configuration of a cluster. Such a list can also be used to check cabling and cluster configuration, the list being used as a reference.
- the method further comprises a step of determining at least one internal logical link between two connectors of at least one of said at least two computer cabinets as well as, preferably, a step of duplication of said at least one internal logical link associated with said at least one of said at least two computer cabinets for at least one other of said at least two computer cabinets, said at least one and at least one other computer cabinets being of the same type.
- the method according to the invention is thus simple and quick to implement. It also limits the risk of error related to the configuration of a computer cabinet by limiting the necessary interactions of a user.
- Said duplication step advantageously comprises a step of assigning an identifier to said at least one and at least one other computer cabinets so that it is possible to identify them in the configuration of the cluster.
- the method further comprises a step of initial configuration of at least one of said at least two cabinets.
- Such a configuration can then be duplicated in order to simplify and speed up the configuration of a cluster while limiting the risks of error related to the configuration of a computer cabinet.
- the method further comprises a step of verifying at least one logical link of said logical interconnection list.
- the method further comprises a step of determining at least one routing rule, said at least one routing rule being used to determine said cable path.
- the method further comprises, preferably, a step of evaluating the length of said cable path, said length of said cable path being determined according to the nature of the cable associated with said cable path. It is thus possible to prepare the installation of a cluster to reduce its installation time.
- the method further comprises a step of creating a set of data for generating at least two tags, each of said at least two tags being intended for one end of the cable associated with said cable path, each at least two tags comprising information relating to the position of a connector to which said cable is to be connected.
- the method of the invention thus facilitates the installation of a cluster by identifying cables and connectors.
- the method according to the invention also facilitates the detection of configuration error of a cluster and its maintenance.
- the method further comprises a step of duplicating logical links specific to said at least two computer cabinets, forming a first set of computer cabinets, for at least a second set of computer cabinets, said first and at least a second set of computer cabinets being of the same type. It is thus possible to configure a cluster according to different levels of granularity, in particular by islands.
- the invention also relates to a computer program comprising instructions adapted to the implementation of each of the steps of the method described above when said program is run on a computer.
- the benefits provided by this computer program are similar to those mentioned above.
- FIG. 1 illustrates an exemplary topology of a cluster
- FIG. 2 illustrates certain steps of a phase of definition of a list of logical interconnections
- FIG. 3 illustrates certain steps of a phase of generating a list of physical interconnections making it possible in particular to generate cabling tags
- FIG. 4 represents an example of an implementation scheme of a part of a cluster
- FIG. 5 comprising FIGS. 5a, 5b and 5c, schematically illustrates the external wiring, via a raised floor, of a computer cabinet, seen from the front, from the side and from behind, respectively;
- FIG. 6, comprising FIGS. 6a and 6b, illustrates an example of two tags of the same cable connecting two connectors in a cluster
- FIG. 7 illustrates an exemplary hardware architecture adapted to implementing certain steps of the invention.
- the purpose of the invention is to define a cabling logic diagram of a cluster that is used, according to physical constraints, to determine a theoretical physical wiring diagram of the cluster.
- This theoretical physical wiring scheme allows itself to determine the number of necessary cables, the length of these cables, their location and label them. With this information, a technician, even an unqualified technician, can efficiently wire a cluster.
- knowledge of the theoretical physical cabling of a cluster makes it possible to perform tests that can be used to determine an inconsistency between the theoretical physical cabling of a cluster and its actual physical cabling.
- the logical and physical cabling schemes can then be used to create a database, called the DB Cluster, which is typically provided to the cluster (client) user and contains the information needed by the cluster management tools.
- the DB Cluster is at the heart of HPC administration.
- a first phase of the method according to the invention therefore aims to define a list of logical interconnections, also called logical netlist.
- the cluster logical schema is created iteratively by duplicating elementary schemas according to a pyramid architecture of the cluster. It is thus considered that a cluster is formed of several islands, each island being formed of several computer cabinets (or racks), each computer cabinet comprising several locations, also called drawers, adapted to receive basic devices of the cluster such as nodes , storage bays, switches or power supply circuits.
- the connectors are here placed on the elementary devices inserted in the drawers.
- each drawer is associated with a particular elementary device. It is therefore possible to define a configuration of connectors for a given computer cabinet according to the types of elementary devices associated with it.
- the logical wiring diagram of a computer cabinet is made to define, in particular, the connections between the drawers of this computer cabinet (internal wiring or intra cabinet).
- the logical wiring diagram of the computer cabinet is then duplicated to create all logical wiring diagrams of the computer cabinets of an island that can then be wired (external wiring or intra island).
- the scheme of The logical wiring of an island is duplicated to create all the logical wiring diagrams of the islands of a cluster can then be wired (inter island wiring).
- Each drawer, each computer cabinet and each island is preferably identified by a type. These types are associated with each other to define drawer types of computer cabinet types and to define types of computer cabinets for island types. In addition, features can be associated with each type. Such characteristics may include in particular a number of inputs / outputs. This information can be entered before or during the logical wiring diagram.
- An identifier is also associated with each drawer, each computer cabinet and each island. However, these identifiers are preferably created dynamically during the creation phase of logical interconnections as described below.
- Figure 2 schematically illustrates some steps of this first phase.
- the example illustrated with reference to this figure is limited to internal wiring and external wiring, without notion of islands.
- islet management is similar to the management of computer cabinets, it adds an additional iteration to the algorithm for creating the list of logical interconnects. Similarly, it is possible to create sets of islets and so on.
- a first phase can be performed using software such as a spreadsheet for working on spreadsheets assembled in the form of binders, each sheet being accessible by a tab mechanism.
- a first step (step 200) here is to enter characteristics of the elements of the cluster whose logic diagram must be established. This step may include creating a tab for each type of computer cabinet. Each tab includes the list of all the elementary devices to be placed in the drawers of the corresponding computer cabinet, organized, for example, by line. Each line corresponds to a device of the type of computer cabinet targeted by the tab. Each line can then include information on the type of device and its position in the computer cabinet.
- the type of device can be used to find its characteristics, including the number and position of its connectors. This information is preferably available in a tab of the spreadsheet used, in another spreadsheet or in a file accessible by the spreadsheet.
- each tab is created for each island type, each tab including the list of computer cabinets, by type, implemented in the corresponding island. .
- Each line corresponds to a computer cabinet implemented in the block and includes information relating to it.
- a summary of the types of computer cabinet is created for each type of computer cabinet. This is for example a blank tab to fill, associated with each type of computer cabinet implemented in the cluster.
- a step of pre-loading the previously created summaries is then performed (step 210). This step is intended to fill the summaries through a correlation of information contained in the summary tab and information describing the connectors of the different basic devices. This step creates the logical netlist structure and gets some of its data.
- the preloading provides, for each type of computer cabinet, the list of all the connectors.
- This list derives directly from the list of devices implemented in each type of computer cabinet and the list of connectors of each device.
- Each line of this summary is aimed at a particular connector of the type of computer cabinet.
- the structure of the netlist comprises a first part, for example left columns, aimed at the characteristics of a connector, in particular its position and type, and a second part, for example right-hand columns, aimed at characteristics of the connector to which the defined connector is to be connected. If a connector is not connected, it is indicated as such.
- Each connector is preferably identified by a position within a drawer and a drawer position within a computer cabinet.
- the summaries can then be checked and / or modified by a user according to specific characteristics of the cluster in question (step 215).
- unused connectors may be removed from the summaries if they are not used.
- step 220 the internal wiring of each type of computer cabinet is realized. This step can be performed by a user or automatically or semi-automatically according to predetermined connection rules.
- a user selects a connector to be connected, that is to say an "origin” connector ("from” connector). Following this selection, a list of connectors to which this connector can be connected is presented to the user who can thus select the connector "destination” (connector "to”). After selecting a destination connector, the summary of the type of computer cabinet being wired is updated.
- the line corresponding to the origin connector is completed with information relating to the destination connector, in particular its position (position within the drawer and position of the drawer).
- the state associated with the original connector is changed to indicate that it is connected to another.
- the line corresponding to the destination connector is completed with information relating to the origin connector, in particular its position (position within the drawer and position of the drawer).
- the state associated with the destination connector is also changed to indicate that it is connected to another one.
- the connectors are organized in a hierarchical and / or ordered manner, for example by type (switch, power supply, etc.), to allow faster selection.
- connectors in groups it is possible, preferably, to connect connectors in groups. For example, it may be possible to select a connector from a source connector list and the following ns from the selection list to connect them, respectively, to a selected connector, a destination connector list, and subsequent ns. .
- this step is here performed for each type of computer cabinet previously defined. Thus, at the end of this step all the internal connections of all types of computer cabinets are made.
- a duplicate check is made to verify, in particular, that a connector is connected to only one other connector and that if an origin connector is connected to a destination connector, the Destination connector is well connected to the original connector. If a problem is detected, it is reported to allow, if necessary, its correction.
- a table is then created to define all the computer cabinets implemented in the cluster and identify their type (step 230).
- the number of computer cabinets in the cluster, by type, can be defined in a configuration file or entered by a user.
- a connector identifier is composed of a connector identifier within a drawer, a drawer identifier within a computer cabinet and a computer cabinet identifier within of the cluster.
- a drawer identifier is composed of a drawer identifier within a computer cabinet and a computer cabinet identifier within the cluster.
- the logical netlist groups all the connectors of all the drawers of all the computer cabinets, that is to say all the connectors of the cluster.
- the number of connectors can reach tens of thousands in current cluster configurations.
- the logical netlist is then used to perform the external wiring
- Step 240 i.e. the wiring between connectors belonging to different computer cabinets. Such wiring is done in a manner similar to internal wiring by selecting an origin connector and a destination connector. Similarly, the logical netlist is updated. The line corresponding to the origin connector is completed with information relating to the destination connector, in particular its position (position within the drawer, position of the drawer and identifier of the computer cabinet to which it belongs). The state associated with the original connector is changed to indicate that it is connected to another. Likewise, the line corresponding to the destination connector is completed with information relating to the origin connector, in particular its position (position within the drawer, position of the drawer and identifier of the computer cabinet to which it belongs). The state associated with the destination connector is changed to indicate that it is connected to another one.
- a duplicate check is again performed (step 245) to check, in particular, that a connector is connected to only one other connector and that a Origin connector is connected to a destination connector, the destination connector is well connected to the original connector. Again, if a problem is detected, it is reported to allow, if necessary, its correction.
- the logical netlist is then created. This is an array associated with the cluster in which each row is associated with a connector. Each line includes information about the identification of the connector to which it is attached, information about the connector to which it is connected, and information about the type of connection and devices connected through that connector.
- the logical netlist comprises twice as many logical links as connections, each connector being considered individually.
- a second phase of the method according to the invention aims to characterize each logical link of the logical netlist according to physical considerations in order to create a physical netlist and determine, in particular, the location and length of each cable to be used.
- Figure 3 illustrates some steps of a generation phase of the physical netlist.
- a first step (300) is to identify the characteristics of the elements of the cluster. It is here based on the logical netlist in which these elements and their type appear and on data describing these elements according to their type. All of this information, referenced here 305, allows, in particular, to define the physical characteristics such as dimensions, mass and the electrical power consumed, for each element.
- the implantation configuration previously defined manually or semi-automatically, for example from positioning rules such as relative positioning rules of computer cabinets according to their type, is obtained (step 310 ). She defined the implementation of all computer cabinets in one or more computer rooms.
- a user defines a location space, typically a client platform, and associates a three-dimensional landmark.
- the position and orientation of the computer cabinets in the implantation space are then entered according to the reference used.
- a reference point is defined for each type of computer cabinet.
- the position of the drawers in a computer cabinet is preferably determined during the creation of the logical netlist as described above.
- the implantation configuration step is also intended to define the cable routing locations, also called chutes, always according to the reference used, as well as information relating to the cable paths, for example paths in the ceiling or under a raised floor.
- All of this setup configuration information can be entered directly by the user or obtained from files.
- routing rules are determined. They can be determined by a user or obtained from files.
- the routing can then be performed (step 320) according to the connections between the connectors as defined in the logical netlist, the location of these connectors as defined by the layout diagram and the determined routing rules.
- the routing is preferably a Manhattan type routing according to which the angles between the paths are multiples of 45 °.
- the algorithm used here is a standard routing algorithm, however part of the routing can be determined manually, especially for optimization purposes. It makes it possible to obtain, for each logical link of the logical netiist, the path of the corresponding cable.
- step 325 the physical netiist is created.
- the calculation of the length of the cables is made here according to the location of the computer cabinets, the location of the possible passages of cables (in particular on the ceiling or on the ground), the location of the devices within the cabinets (in particular on the front, rear, front-to-back), the location of the connectors on the devices (eg on the front, back or inside of the device), the position of the connectors relative to their location ( left, right, top, bottom, top left, bottom left, etc.), the cable path and cable type (eg fiber optic or Ethernet).
- the pairs of connectors here are oriented pairs, that is, the pair (a, b) is different from the pair (b, a), where a and b are identifiers of connectors, although these two pairs forming two logical links correspond to a single connection. Therefore, each physical connection is represented twice in the physical netiist.
- such an embodiment has the advantage of allowing verifications by verifying that each connection of a connector a to connector b, there is a connection from connector b to connector a. It also makes it possible to simply and directly generate labels for each end of connection cable, that is to say a label for a piece of cable connecting the connector a to the connector b and a label for the other end of the same cable connecting connector b to connector a.
- a routing summary is generated.
- it makes it possible to extract from the physical netlist a label file and to define a list of each cable to be controlled according to its type and its length (compared to the existing standard lengths of cables). It also allows to define global characteristics of the cluster, for example, its weight, the necessary amperage and the power consumed.
- the routing synthesis also makes it possible to create layout diagrams on which the wiring appears, by cable type, cable reference, computer cabinet reference, etc.
- FIG. 4 represents an example of an implementation scheme 400 of a part of a cluster. It comprises a three-dimensional marker 405 (O, x, y, z) and a part of the generically referenced computer cabinets 410, forming the cluster, seen from above.
- the computer cabinets are arranged here in rows, forming aisles.
- all the computer cabinets of a row are arranged so that the air used to cool the elements of these computer cabinets is taken in an alley, called cold aisle, for example the aisle 415, and rejected in another alley, called hot alley, for example the alley 420.
- Each computer cabinet includes a vertically arranged volume allowing the passage of cables between several drawers as well as between drawers and external devices, via the floor or the ceiling.
- the computer cabinet 410 includes such a volume whose section in a horizontal plane is here represented by reference 425.
- each computer cabinet includes a reference point for defining a position.
- the computer cabinet 410 includes the reference point 430 whose coordinates are (x 0 , y 0 , z 0 ). Knowing the position of a computer cabinet in the frame (O, x, y, z) as well as the relative position of the connectors in this cabinet (defined according to the technical characteristics of the drawer considered, its position in the cabinet and the technical characteristics of the cabinet), it is possible to determine the position of each connector of this computer cabinet in the reference (O, x, y, z) used. The position of the cable passages and other elements of the cluster can be determined similarly.
- FIG. 5 comprising FIGS. 5a, 5b and 5c, schematically illustrates the external wiring, via a raised floor, of a computer cabinet 500, seen from the front, from the side and from behind, respectively.
- the cabinet 500 here comprises a bay 505 adapted to receive modules generically referenced 510. As shown in Figures 5a and 5b, the connectors of these modules are placed on their front face. Thus, the cables 515 connected to these modules are connected to the front face, pass over the top of the bay 505 and down behind it to join other computer cabinets via an opening 520 made in the false floor 525, as shown in Figure 5b.
- the computer cabinet 500 also includes generically referenced devices 530 whose connectors are located on their rear face, as shown in Figures 5b and 5c.
- the cables 535 connected to these connectors descend directly from these connectors to an opening 540 of the false floor 525.
- Figure 6 including Figures 6a and 6b, illustrates an example of two tags of the same cable connecting two connectors in a cluster.
- the label shown in Figure 6a is intended to be placed at one end of a connection cable of these connectors while the label shown in Figure 6b is intended to be placed at the other end.
- each label 600-1 and 600-2 includes a reference to an origin connector (references 605-1 and 605-2) as well as a reference to a destination connector (references 610-1 and 610-2).
- These references here comprise the coordinates of the connector concerned in the reference used (K.7.ZL and K.11.ZH where K represents abscissae, 7 and 11 represent ordinates and ZL and ZH represent heights), the nature of the drawer including the connector (ETH SWITCH.O and COMPUTE.40) as well as the position of the connector within the drawer (port.41 and Prim / LAN 1). It is observed that the references of the origin connector of a label correspond to the references of the destination connector of the other label and vice versa.
- Each label further comprises a cable reference (references 615-1 and 615-2), a link number (references 620-1 and 620-2) as well as an indication of the side through which the cable is descending, viewed from the front to the connector (references 625-1 and 625-2).
- this second phase makes it possible to provide a layout plan of the computer cabinets, a plan of the locations of the cable passages, a layout plan of the devices in the computer cabinets, a plan of the connectors, a plan of the cable paths, a cable routing plan, a routing summary, a list of physical interconnections including a list of cables, their length and type, as well as cable labels (for example in the form of standard files).
- FIG. 7 illustrates an example of a hardware architecture, for example a server or a computer, adapted to implement certain steps of the invention, for example by means of a spreadsheet.
- the device 700 here comprises a communication bus 705 to which are connected: one or more central processing units or microprocessors 710 (CPU, acronym for Central Processing Unit in English terminology);
- a read only memory 715 may include programs (prog, progl and prog2) necessary for the implementation of the invention
- RAM Random Access Memory
- cache memory 720 (RAM, acronym for Random Access Memory in English terminology) comprising registers adapted to record variables and parameters created and modified during the execution of the aforementioned programs;
- a communication interface 750 adapted to transmit and receive data.
- the device 700 also preferably has the following elements:
- one or more display units 725 making it possible to display data and that can serve as a graphical interface with a user who can interact with programs according to the invention, using a keyboard and a mouse 730 or another pointing device such as a touch screen or a remote control;
- a hard disk 735 that can comprise the aforementioned programs as well as information processed or to be processed according to the invention.
- a memory card reader 740 adapted to receive a memory card 745 and to read or write to it data processed or to be processed according to the invention.
- the communication bus allows communication and interoperability between the various elements included in the device 700 or connected to it.
- the representation of the bus is not limiting and, in particular, the central unit is able to communicate instructions to any element of the device 700 directly or via another element of the device 700.
- the executable code of each program enabling the programmable device to implement the processes according to the invention can be stored, for example, in the hard disk 735 or in the read-only memory 7 5.
- the memory card 745 may contain information, in particular information to be processed according to the invention, as well as the executable code of the aforementioned programs which, once read by the device 700, is stored in the hard disk 735.
- the executable code of the programs and the information to be processed according to the invention may be received, at least partially, via the interface 750, to be stored identically to that described above.
- program (s) and the information to be processed according to the invention may be loaded into one of the storage means of the device 700 before being executed.
- the central unit 710 will control and direct the execution of the instructions or portions of software code of the program or programs according to the invention, instructions which are stored in the hard disk 735 or in the read-only memory 715 or else in the other elements of FIG. aforementioned storage.
- the program or programs that are stored in a non-volatile memory for example the hard disk 735 or the read only memory 715, are transferred into the random access memory 720 which then contains the executable code of the program or programs according to the invention, as well as registers for storing the variables and parameters necessary for the implementation of the invention.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Geometry (AREA)
- General Physics & Mathematics (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Computational Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Design And Manufacture Of Integrated Circuits (AREA)
- Architecture (AREA)
- Software Systems (AREA)
- Power Sources (AREA)
- Details Of Connecting Devices For Male And Female Coupling (AREA)
Abstract
Description
Claims
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR1152924A FR2973903B1 (en) | 2011-04-05 | 2011-04-05 | METHOD AND DEVICE FOR MANAGING WIRING IN A CLUSTER |
PCT/FR2012/050659 WO2012136916A1 (en) | 2011-04-05 | 2012-03-28 | Method and device for managing wiring in a cluster |
Publications (1)
Publication Number | Publication Date |
---|---|
EP2695093A1 true EP2695093A1 (en) | 2014-02-12 |
Family
ID=46017965
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP12717405.0A Withdrawn EP2695093A1 (en) | 2011-04-05 | 2012-03-28 | Method and device for managing wiring in a cluster |
Country Status (4)
Country | Link |
---|---|
US (1) | US10146889B2 (en) |
EP (1) | EP2695093A1 (en) |
FR (1) | FR2973903B1 (en) |
WO (1) | WO2012136916A1 (en) |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11194948B2 (en) | 2014-08-15 | 2021-12-07 | EMC IP Holding Company LLC | System, method, apparatus, and computer program product for generating a cabling plan for a computing system |
US10063428B1 (en) * | 2015-06-30 | 2018-08-28 | Apstra, Inc. | Selectable declarative requirement levels |
CN109740789B (en) * | 2018-11-22 | 2023-07-25 | 平安科技(深圳)有限公司 | Wiring management method, device, equipment and storage medium |
CN109815301A (en) * | 2018-12-21 | 2019-05-28 | 平安科技(深圳)有限公司 | Wire label management method, device, computer equipment and storage medium |
Family Cites Families (27)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5021968A (en) * | 1987-01-13 | 1991-06-04 | Robertson-Ceco Corporation | Graphics-based wire-cable management system |
US5006842A (en) * | 1987-04-13 | 1991-04-09 | The Foxboro Company | Identity insert block for electronic modules |
US4870591A (en) * | 1987-08-24 | 1989-09-26 | International Business Machines Corp. | System for ensuring device compatibility |
US4939668A (en) * | 1987-08-24 | 1990-07-03 | International Business Machines Corp. | System for designing intercommunications networks |
JPS6488881A (en) * | 1987-08-24 | 1989-04-03 | Ibm | Generation of assembling screen |
US5463838A (en) * | 1993-11-09 | 1995-11-07 | Collier; William R. | Methods and apparatus for installing conductor cables in rigid building structures |
US5704189A (en) * | 1993-11-09 | 1998-01-06 | Collier; William R. | Methods and apparatus for installing conductor cables in rigid building structures |
US5995729A (en) * | 1994-07-22 | 1999-11-30 | Hitachi, Ltd. | Method and apparatus for aiding configurating management of a computer system |
DE69832441D1 (en) * | 1997-07-07 | 2005-12-29 | J S T Mfg Co | Information processing device for harnesses |
DE19935422A1 (en) * | 1999-07-28 | 2001-02-01 | Daimler Chrysler Ag | Generation of electrical line structure with cable bundles, using design for mechanical construction portrayed by data-processing installation and adding on connection plan of electrical system |
US6721414B1 (en) * | 1999-08-17 | 2004-04-13 | Nec America, Inc. | Cable management system |
US6784802B1 (en) * | 1999-11-04 | 2004-08-31 | Nordx/Cdt, Inc. | Real time monitoring of cable patch panel |
US20020113714A1 (en) * | 2001-02-16 | 2002-08-22 | Robert Lopez | IP-addressable light-emitting diode |
GB2393549B (en) * | 2002-09-25 | 2006-05-31 | Cormant Technologies Inc | Cabling system |
US6847856B1 (en) * | 2003-08-29 | 2005-01-25 | Lucent Technologies Inc. | Method for determining juxtaposition of physical components with use of RFID tags |
JP2005182245A (en) * | 2003-12-17 | 2005-07-07 | Hitachi Ltd | Connection support method for disk array device |
JP2007052495A (en) * | 2005-08-15 | 2007-03-01 | Toshiba Corp | Apparatus, method, and program for totaling physical quantity of cable |
US7558705B1 (en) * | 2006-03-23 | 2009-07-07 | Dassault Systemes Solidworks Corporation | Connectivity controlled wire routing |
US7996190B2 (en) * | 2006-10-19 | 2011-08-09 | International Business Machines Corporation | Virtual cabling router |
US8421626B2 (en) * | 2006-10-31 | 2013-04-16 | Corning Cable Systems, Llc | Radio frequency identification transponder for communicating condition of a component |
US9330230B2 (en) * | 2007-04-19 | 2016-05-03 | International Business Machines Corporation | Validating a cabling topology in a distributed computing system |
US7850260B2 (en) * | 2007-06-22 | 2010-12-14 | Oracle America, Inc. | Injection/ejection mechanism |
US7853832B2 (en) * | 2007-10-10 | 2010-12-14 | Alcatel Lucent | System and method for tracing cable interconnections between multiple systems |
US7930600B2 (en) * | 2008-02-26 | 2011-04-19 | International Business Machines Corporation | Logical to physical connectivity verification in a predefined networking environment |
US10264331B2 (en) * | 2009-07-29 | 2019-04-16 | Xenoptics Ip Holdings Pty Ltd. | Method device assembly and system for facilitating the interconnection of communication bearing cables |
US9538262B2 (en) * | 2009-08-21 | 2017-01-03 | Commscope, Inc. Of North Carolina | Systems, equipment and methods for automatically tracking cable connections and for identifying work area devices and related methods of operating communications networks |
US8831920B2 (en) * | 2010-12-15 | 2014-09-09 | Fluor Technologies Corporation | Automated cabling layout systems and methods |
-
2011
- 2011-04-05 FR FR1152924A patent/FR2973903B1/en active Active
-
2012
- 2012-03-28 WO PCT/FR2012/050659 patent/WO2012136916A1/en active Application Filing
- 2012-03-28 US US14/110,413 patent/US10146889B2/en active Active
- 2012-03-28 EP EP12717405.0A patent/EP2695093A1/en not_active Withdrawn
Non-Patent Citations (2)
Title |
---|
None * |
See also references of WO2012136916A1 * |
Also Published As
Publication number | Publication date |
---|---|
WO2012136916A1 (en) | 2012-10-11 |
US10146889B2 (en) | 2018-12-04 |
FR2973903A1 (en) | 2012-10-12 |
US20140067339A1 (en) | 2014-03-06 |
FR2973903B1 (en) | 2013-04-05 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10942712B2 (en) | Visual programming system | |
EP2697936B1 (en) | Method and device for processing administration commands in a cluster | |
US10157205B2 (en) | Parallel preparation of a query execution plan in a massively parallel processing environment based on global and low-level statistics | |
ES2612328T3 (en) | Methods and systems to manage power and cooling of an installation | |
EP1387305B1 (en) | Method and system for automatically providing a global model of an architectural simulation | |
CN105378725B (en) | Virtual data base is fallen back | |
EP2695093A1 (en) | Method and device for managing wiring in a cluster | |
FR3021144A1 (en) | METHOD FOR MANAGING THE EQUIPMENT OF A DATA CENTER | |
CN109901876A (en) | Code review method, system, equipment and storage medium | |
FR2946769A1 (en) | METHOD AND DEVICE FOR RECONFIGURING AVIONICS. | |
FR2986887A1 (en) | METHOD FOR ASSISTING THE DESIGN OF A CALCULATION CENTER | |
US11302091B2 (en) | Cloning a computing environment | |
US11409724B2 (en) | Hashed balanced tree data structure | |
CN106155719A (en) | A kind of method and system utilizing USB device to realize openstack rapid deployment | |
EP2278504A1 (en) | Method for routing physical connections in integrated modular avionic | |
EP2254066A1 (en) | Method supporting the realisation and validation of an avionic platform | |
FR3050848B1 (en) | SERVER ARCHITECTURE AND DATA REDISTRIBUTION METHOD FOR DISTRIBUTION OF A VERSIONED GRAPH. | |
CN112333003A (en) | Method and device for acquiring cluster gene information of proprietary cloud container | |
EP2704010A1 (en) | Method and device for processing commands in a set of computing elements | |
CN107534569A (en) | Emerging system accordance inspection | |
US20210248495A1 (en) | Systems and methods for networks of time series | |
WO2019122626A1 (en) | System and method for formulating and executing fonctional tests for cluster de servers | |
CA2932342A1 (en) | Led lighting program | |
CN107305515A (en) | Computer implemented method, computer program product and computing system | |
Unruh | Locality and quantum mechanics |
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 |
|
17P | Request for examination filed |
Effective date: 20131011 |
|
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 |
|
RIN1 | Information on inventor provided before grant (corrected) |
Inventor name: MARTIN, PHILIPPE Inventor name: MERCIER, MICHEL Inventor name: RAZAFINJATOVO, ANDRY |
|
DAX | Request for extension of the european patent (deleted) | ||
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: EXAMINATION IS IN PROGRESS |
|
17Q | First examination report despatched |
Effective date: 20180511 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: EXAMINATION IS IN PROGRESS |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION HAS BEEN WITHDRAWN |
|
18W | Application withdrawn |
Effective date: 20211011 |