Patents by Inventor Nicolas Morey-Chaisemartin

Nicolas Morey-Chaisemartin has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 9749219
    Abstract: The invention relates in particular to the optimization of routing in a cluster comprising a plurality of nodes and static communication links connecting nodes of the plurality of nodes, said routing being based on load levels associated with the communication links. In order to establish a connection between at least two nodes of the cluster that have been identified (505), at least one route is determined (510) that connects the identified nodes according to the communication links, said route being determined according to the nodes identified, communication links and at least one load level associated with each communication link. A determined route is selected. Subsequently, a value of weight associated with the selected route is estimated (520) and a load level associated with each communication link of the selected route is incremented (525).
    Type: Grant
    Filed: May 13, 2011
    Date of Patent: August 29, 2017
    Assignee: BULL SAS
    Inventors: Sebastien Dugue, Jean-Vincent Ficet, Yann Kalemkarian, Nicolas Morey-Chaisemartin
  • Patent number: 9203733
    Abstract: The invention relates to the pseudo-dynamic routing in a cluster comprising nodes, of the static communication links connecting these nodes. The routing is based on load levels associated with the links. After having received (635) a list of node identifiers, these identifiers designating a set of nodes allotted to the execution of a task, a weight having a first predetermined value is assigned (655) to a pair formed of an identifier of a first and of a second node of said set of nodes, the first and second nodes being distinct, a weight having a second predetermined value, distinct from the first value, being assigned by default to the formed pairs of identifiers of nodes allotted to different tasks. The cluster is then routed, the routing comprising the selecting (610) of a route between the first and second nodes and the incrementing (625) of a load level associated with each link comprising the selected route of the first value.
    Type: Grant
    Filed: May 25, 2011
    Date of Patent: December 1, 2015
    Assignee: BULL SAS
    Inventors: Sebastien Dugue, Jean-Vincent Ficet, Yann Kalemkarian, Nicolas Morey-Chaisemartin
  • Patent number: 8873412
    Abstract: Methods and devices for characterizing the interconnection efficiency of a computer network based upon a static routing scheme are disclosed. The network comprises a plurality of items of equipment. After having determined (105) a plurality of types of links between said items of equipment, a theoretical number of routes per link and the associated number of links are determined (120, 125) for each type of at least one subset of said plurality of types of links according to the topology of said network. The determined theoretical number of routes per link and the associated number of links are then aggregated (135) to estimate at least one optimal routing point characterizing the theoretical efficiency of the network. Such optimal routing points can be compared with estimated actual routing points based upon the aggregation of actual numbers of routed per link and associated actual numbers of links to characterizes the network efficiency.
    Type: Grant
    Filed: June 28, 2010
    Date of Patent: October 28, 2014
    Assignee: Bull SAS
    Inventors: Jean-Vincent Ficet, Philippe Couvee, Nicolas Morey-Chaisemartin
  • Publication number: 20130070647
    Abstract: The invention relates to the pseudo-dynamic routing in a cluster comprising nodes, of the static communication links connecting these nodes. The routing is based on load levels associated with the links After having received (635) a list of node identifiers, these identifiers designating a set of nodes allotted to the execution of a task, a weight having a first predetermined value is assigned (655) to a pair formed of an identifier of a first and of a second node of said set of nodes, the first and second nodes being distinct, a weight having a second predetermined value, distinct from the first value, being assigned by default to the formed pairs of identifiers of nodes allotted to different tasks. The cluster is then routed, the routing comprising the selecting (610) of a route between the first and second nodes and the incrementing (625) of a load level associated with each link comprising the selected route of the first value.
    Type: Application
    Filed: May 25, 2011
    Publication date: March 21, 2013
    Applicant: BULL SAS
    Inventors: Sebastien Dugue, Jean-Vincent Ficet, Yann Kalemkarian, Nicolas Morey-Chaisemartin
  • Publication number: 20130067113
    Abstract: The invention relates in particular to the optimization of routing in a cluster comprising a plurality of nodes and static communication links connecting nodes of the plurality of nodes, said routing being based on load levels associated with the communication links. In order to establish a connection between at least two nodes of the cluster that have been identified (505), at least one route is determined (510) that connects the identified nodes according to the communication links, said route being determined according to the nodes identified, communication links and at least one load level associated with each communication link. A determined route is selected. Subsequently, a value of weight associated with the selected route is estimated (520) and a load level associated with each communication link of the selected route is incremented (525).
    Type: Application
    Filed: May 13, 2011
    Publication date: March 14, 2013
    Applicant: Bull SAS
    Inventors: Sebastien Dugue, Jean-Vincent Ficet, Yann Kalemkarian, Nicolas Morey-Chaisemartin
  • Publication number: 20120093023
    Abstract: Methods and devices for characterizing the interconnection efficiency of a computer network based upon a static routing scheme are disclosed. The network comprises a plurality of items of equipment. After having determined (105) a plurality of types of links between said items of equipment, a theoretical number of routes per link and the associated number of links are determined (120, 125) for each type of at least one subset of said plurality of types of links according to the topology of said network. The determined theoretical number of routes per link and the associated number of links are then aggregated (135) to estimate at least one optimal routing point characterizing the theoretical efficiency of the network. Such optimal routing points can be compared with estimated actual routing points based upon the aggregation of actual numbers of routed per link and associated actual numbers of links to characterizes the network efficiency.
    Type: Application
    Filed: June 28, 2010
    Publication date: April 19, 2012
    Applicant: BULL SAS
    Inventors: Jean-Vincent Ficet, Philippe Couvee, Nicolas Morey-Chaisemartin