Abstract: Some embodiments are directed to a logging within a software application executed over an assembly of information processing devices. More particularly, some embodiments relate to a method allowing process logging in the case of a software application operating with several processes and/or threads.

Abstract: Systems and methods are provided for efficiently maintaining a transaction sequence witness service to ensure that requests to read data provide consistent results across all storage nodes in a distributed system. When a storage node receives a request for a data object, the node may obtain—from transaction sequence witness service—the latest sequence number associated with the object. If the sequence number indicates the object has been modified in the period of time since the currently stored version was stored, the node can obtain the current version from persistent storage.

Abstract: Systems and methods are provided for managing data partitions in a distributed storage system and, in particular, the routing data used by the distributed storage system to route requests to the proper caching layers, persistent storage nodes, etc. Data items may be managed in a multi-tier configuration in which they are grouped into different partitions based on their key prefixes, and partitions are grouped into different cells based on key ranges. When partitions are moved from cell-to-cell, or when cells are split, the routing data is changed accordingly. In order to ensure that the correct routing data is used throughout the distributed storage system, a change to routing data may be accompanied by a special barrier record being written to the transaction log of affected partitions.

Abstract: The invention relates in particular to an administration server (S) of a supercomputer suitable for first loading information on the environment of said supercomputer; receiving an administration task transmitted by an administration client (C1, C2); executing said administration task in collaboration with said information, previously loaded; and transmitting the results of the execution of said administration task to said administration client.

Abstract: The invention relates to a network of equipment interconnected by switches incorporating routing tables, comprising a routing table manager implementing two modes of operation, an off-line mode of operation in which all the routing tables are calculated initially, then loaded subsequently into the switches, at least when booting up the network, an on-line mode of operation in which, in case of an event rendering an element of the network not usable or operational, only the routing tables impacted by said event are recomputed and loaded into the switches, said routing tables being recomputed by a computer of the routing table manager, said recomputed routing tables being loaded by several loaders of routing tables of the routing table manager into their groups of respective switches.

Abstract: Method of routing data in a network, this data originating from a first node and being destined for a second node, this method comprising the following steps: —pre-recording in each of the switches of a list of switches directly interfaced with one or more nodes; —reception of the data by a first switch and determination of its destination; when the first switch is directly interfaced with the second node via an output port-selection then in routing of the data by said output port; otherwise —identification of the switch to which the second node is directly interfaced; —routing of the data to the identified switch via an output port of the first switch, so that the data can be forwarded to said identified switch.

Abstract: The invention relates to a network of equipment interconnected by switches incorporating routing tables, comprising a routing table manager implementing two modes of operation, an off-line mode of operation in which all the routing tables are calculated initially, then loaded subsequently into the switches, at least when booting up the network, an on-line mode of operation in which, in case of an event rendering an element of the network not usable or operational, only the routing tables impacted by said event are recomputed and loaded into the switches, said routing tables being recomputed by a computer of the routing table manager, said recomputed routing tables being loaded by several loaders of routing tables of the routing table manager into their groups of respective switches.

Abstract: A method and apparatus for the processing of at least one command concerning at least one component of a cluster is disclosed. The cluster comprises several components, the at least one component having a dependency link, according to the at least one command, with at least one other component, is disclosed.

Abstract: A server (10) of a system for managing an interconnection network, said server comprising: a key-value associative data structure (2) configured to store a global state of the interconnection network; the following connection interfaces (3-6): a configuration server interface (3) configured to communicate, in response to a configuration request to join the management system, the configuration of said management system; a publication server interface (4) configured to disseminate an update in the key-value associative data structure (2); a collection server interface (5) configured to update, in response to a request for update, the key-value associative data structure (2); a snapshot server interface (6) configured to communicate, in response to a request for snapshot, a snapshot of a subset of the global state.

Abstract: Some embodiments are directed to a logging within a software application executed over an assembly of information processing devices. More particularly, some embodiments relate to a method allowing process logging in the case of a software application operating with several processes and/or threads.

Abstract: Method of routing data in a network, this data originating from a first node and being destined for a second node, this method comprising the following steps:—pre-recording in each of the switches of a list of switches directly interfaced with one or more nodes;—reception of the data by a first switch and determination of its destination; when the first switch is directly interfaced with the second node via an output port-selection then in routing of the data by said output port; otherwise—identification of the switch to which the second node is directly interfaced;—routing of the data to the identified switch via an output port of the first switch, so that the data can be forwarded to said identified switch.

Abstract: The invention relates in particular to an administration server (S) of a supercomputer suitable for first loading information on the environment of said supercomputer; receiving an administration task transmitted by an administration client (C1, C2); executing said administration task in collaboration with said information, previously loaded; and transmitting the results of the execution of said administration task to said administration client.

Abstract: A method allows the determination of an optimal interconnection topology of a system including service nodes which are interconnected using links, and some of which are routers with ports, and belonging to at least one level. This method includes a first step in which a structure is chosen for an optimal interconnection topology to be determined from among a set of structures each defined by at least one structural constraint, and at least one topology parameter is then chosen, and a second step in which one determines using a solver the optimal interconnection topology defined by at least each corresponding structural constraint and each chosen topology parameter and at least one chosen optimisation criterion.

Abstract: The disclosure relates in particular to the processing of commands targeting at least one element of a cluster including a plurality of elements, the at least one element having a link of dependency according to the at least one command with at least one other element. After having identified the at least one element and at least one dependency rule from the at least one command, a dependency graph is generated from the at least one identified element, by applying the at least one identified dependency rule, the dependency graph including peaks representing at least the element and the at least one other element, an action linked with the at least one command being associated with the peaks of the dependency graph. A sequence of instructions is then generated from the dependency graph.

Abstract: A server (10) of a system for managing an interconnection network, said server comprising: a key-value associative data structure (2) configured to store a global state of the interconnection network; the following connection interfaces (3-6): a configuration server interface (3) configured to communicate, in response to a configuration request to join the management system, the configuration of said management system; a publication server interface (4) configured to disseminate an update in the key-value associative data structure (2); a collection server interface (5) configured to update, in response to a request for update, the key-value associative data structure (2); a snapshot server interface (6) configured to communicate, in response to a request for snapshot, a snapshot of a subset of the global state.

Abstract: A method and apparatus for the processing of at least one command concerning at least one component of a cluster is disclosed. The cluster comprises several components, the at least one component having a dependency link, according to the at least one command, with at least one other component, is disclosed.

Abstract: The disclosure relates in particular to the processing of commands targeting at least one element of a cluster including a plurality of elements, the at least one element having a link of dependency according to the at least one command with at least one other element. After having identified the at least one element and at least one dependency rule from the at least one command, a dependency graph is generated from the at least one identified element, by applying the at least one identified dependency rule, the dependency graph including peaks representing at least the element and the at least one other element, an action linked with the at least one command being associated with the peaks of the dependency graph. A sequence of instructions is then generated from the dependency graph.