Patents by Inventor Michael Marty

Michael Marty 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: 11953459
    Abstract: A multi-functional sensor assembly includes an electrically non-conductive substrate defining at least a distal region, intermediary region, and proximal region that are each covered with electrically conductive traces. The proximal region is configured to be exposed to a media to be sensed and the distal and intermediary regions are configured to be protected from the media. The electrically conductive traces comprise at least electrical circuits to sense temperature and flow of the media and one or more electrodes to sense one or more of conductivity, oxidation reduction potential (ORP), and acidity (pH) of the media.
    Type: Grant
    Filed: January 22, 2021
    Date of Patent: April 9, 2024
    Assignees: MASCO CORPORATION, The Regents of the University of Michigan
    Inventors: Klaus Brondum, Mark Andrew Burns, Wen-Chi Lin, Michael McCague, Stephen Michael Stec, Brian N. Johnson, Garry Marty
  • Publication number: 20230362098
    Abstract: A system includes a first processor configured to analyze packets received over a communication protocol system and determine one or more congestion indicators from the analysis of the data packets, the one or more congestion indicators being indicative of network congestion for data packets transmitted over a reliable transport protocol layer of the communication protocol system. The system also includes a rate update engine separate from the packet datapath and configured to operate a second processor to receive the determined one or more congestion indicators, determine one or more congestion control parameters for controlling transmission of data packets based on the received one or more congestion indicators, and output a congestion control result based on the determined one or more congestion control parameters.
    Type: Application
    Filed: July 17, 2023
    Publication date: November 9, 2023
    Inventors: Xiaoming Wang, Prashant Chandra, Neelesh Bansod, Nandita Dukkipati, Hassan Wassel, Gautam Kumar, Weihuang Wang, Michael Marty, Nicholas McDonald
  • Patent number: 11711311
    Abstract: A system includes a first processor configured to analyze packets received over a communication protocol system and determine one or more congestion indicators from the analysis of the data packets, the one or more congestion indicators being indicative of network congestion for data packets transmitted over a reliable transport protocol layer of the communication protocol system. The system also includes a rate update engine separate from the packet datapath and configured to operate a second processor to receive the determined one or more congestion indicators, determine one or more congestion control parameters for controlling transmission of data packets based on the received one or more congestion indicators, and output a congestion control result based on the determined one or more congestion control parameters.
    Type: Grant
    Filed: June 22, 2020
    Date of Patent: July 25, 2023
    Assignee: Google LLC
    Inventors: Xiaoming Wang, Prashant Chandra, Neelesh Bansod, Nandita Dukkipati, Hassan Wassel, Gautam Kumar, Weihuang Wang, Michael Marty, Nicholas McDonald
  • Publication number: 20230057500
    Abstract: An automated system for lipid exchange-mass spectrometry, e.g., measuring affinity of a membrane protein for lipids. The automated systems herein can measure the specificity of membrane protein-lipid interactions, detect remodeling of the membrane environment, and determine optimal lipid composition for membrane proteins.
    Type: Application
    Filed: February 4, 2021
    Publication date: February 23, 2023
    Inventors: Michael Marty, James Keener, Guozhi Zhang
  • Publication number: 20210399990
    Abstract: A system includes a first processor configured to analyze packets received over a communication protocol system and determine one or more congestion indicators from the analysis of the data packets, the one or more congestion indicators being indicative of network congestion for data packets transmitted over a reliable transport protocol layer of the communication protocol system. The system also includes a rate update engine separate from the packet datapath and configured to operate a second processor to receive the determined one or more congestion indicators, determine one or more congestion control parameters for controlling transmission of data packets based on the received one or more congestion indicators, and output a congestion control result based on the determined one or more congestion control parameters.
    Type: Application
    Filed: June 22, 2020
    Publication date: December 23, 2021
    Applicant: Google LLC
    Inventors: Xiaoming Wang, Prashant Chandra, Neelesh Bansod, Nandita Dukkipati, Hassan Wassel, Gautam Kumar, Weihuang Wang, Michael Marty, Nicholas McDonald
  • Patent number: 10541927
    Abstract: A computing system dedicates one or more processing units, such as cores, for the purposes of packet processing software, wherein other processing units simultaneously run application software. In some examples, the system uses dynamic load information to dynamically increase and decrease the number of processing units dedicated to packet processing. The system may further include a mechanism for establishing shared-memory regions for interacting with other applications' users. The shared memory mechanisms provide an abstraction of per-application “command” and “completion queues”. The system may poll per-application command queues for detecting the arrival of new requests. The mechanism also provides detection of application termination, as well as an ability for an application to expose portions of its address space for the reception and transmission of data.
    Type: Grant
    Filed: December 29, 2016
    Date of Patent: January 21, 2020
    Assignee: Google LLC
    Inventors: Michael Marty, Joel Scherpelz, Marc de Kruijf, Christopher Alfeld
  • Patent number: 10261780
    Abstract: Systems and methods for updating an application without a restart are provided. A processor can start a second application instance while a first application instance is still executing. The first application instance can transfer a first set of state information to the second application instance. The second application instance can declare its readiness for activation in response to completion of the transfer. The first application instance can deactivate in response to the declaration. Deactivation includes transferring a second set of state information from the first application instance to the second application instance and releasing single-access resources. The second application instance can activate. Activation includes receiving the second set of state information, and accessing the single-access resources. The second application instance can declare that activation is complete in response to completion of the activation. The first application instance can terminate in response to the declaration.
    Type: Grant
    Filed: May 1, 2017
    Date of Patent: April 16, 2019
    Assignee: Google LLC
    Inventors: Marc de Kruijf, Christopher Alfeld, William Evans, Michael Marty
  • Publication number: 20180314515
    Abstract: Systems and methods for updating an application without a restart are provided. A processor can start a second application instance while a first application instance is still executing. The first application instance can transfer a first set of state information to the second application instance. The second application instance can declare its readiness for activation in response to completion of the transfer. The first application instance can deactivate in response to the declaration. Deactivation includes transferring a second set of state information from the first application instance to the second application instance and releasing single-access resources. The second application instance can activate. Activation includes receiving the second set of state information, and accessing the single-access resources. The second application instance can declare that activation is complete in response to completion of the activation. The first application instance can terminate in response to the declaration.
    Type: Application
    Filed: May 1, 2017
    Publication date: November 1, 2018
    Inventors: Marc de Kruijf, Christopher Alfeld, William Evans, Michael Marty
  • Publication number: 20180191623
    Abstract: A computing system dedicates one or more processing units, such as cores, for the purposes of packet processing software, wherein other processing units simultaneously run application software. In some examples, the system uses dynamic load information to dynamically increase and decrease the number of processing units dedicated to packet processing. The system may further include a mechanism for establishing shared-memory regions for interacting with other applications' users. The shared memory mechanisms provide an abstraction of per-application “command” and “completion queues”. The system may poll per-application command queues for detecting the arrival of new requests. The mechanism also provides detection of application termination, as well as an ability for an application to expose portions of its address space for the reception and transmission of data.
    Type: Application
    Filed: December 29, 2016
    Publication date: July 5, 2018
    Inventors: Michael Marty, Joel Scherpelz, Marc de Kruijf, Christopher Alfeld
  • Patent number: 9391871
    Abstract: Probabilistic arbitration is combined with distance-based weights to achieve equality of service in interconnection networks, such as those used with chip multiprocessors. This arbitration desirably used incorporates nonlinear weights that are assigned to requests. The nonlinear weights incorporate different arbitration weight metrics, namely fixed weight, constantly increasing weight, and variably increasing weight. Probabilistic arbitration for an on-chip router avoids the need for additional buffers or virtual channels, creating a simple, low-cost mechanism for achieving equality of service. The nonlinearly weighted probabilistic arbitration includes additional benefits such as providing quality-of-service features and fairness in terms of both throughput and latency that approaches the global fairness achieved with age-base arbitration. This provides a more stable network by achieving high sustained throughput beyond saturation.
    Type: Grant
    Filed: April 17, 2014
    Date of Patent: July 12, 2016
    Assignee: Google Inc.
    Inventors: Dennis C. Abts, Michael Marty
  • Patent number: 9270489
    Abstract: Systems and methods are provided for congestion notification in mixed-fabric InfiniBand networks. In one aspect, a system and apparatus is provided wherein a receiving endpoint receives, from a sending endpoint, InfiniBand messages over a mixed-fabric network. The mixed-fabric network may include an InfiniBand transport layer and a non-InfiniBand messaging fabric. The non-InfiniBand massaging fabric may be any type of non-InfiniBand data-link-layer and network-layer network (e.g. Ethernet, IP). For example, the receiving endpoint may receive a non-InfiniBand protocol data unit (PDU) that contains at least a part of a first InfiniBand PDU as payload. The receiving endpoint may extract signaling from the received non-InfiniBand PDU that indicates whether congestion has been detected in the non-InfiniBand layers of the mixed-fabric network.
    Type: Grant
    Filed: March 19, 2012
    Date of Patent: February 23, 2016
    Assignee: Google Inc.
    Inventors: Philip Wells, Michael Marty
  • Patent number: 8806244
    Abstract: Energy proportional solutions are provided for computer networks such as datacenters. Congestion sensing heuristics are used to adaptively route traffic across links. Traffic intensity is sensed and links are dynamically activated as they are needed. As the offered load is decreased, the lower channel utilization is sensed and the link speed is reduced to save power. Flattened butterfly topologies can be used in a further power saving approach. Switch mechanisms are exploit the topology's capabilities by reconfiguring link speeds on-the-fly to match bandwidth and power with the traffic demand. For instance, the system may estimate the future bandwidth needs of each link and reconfigure its data rate to meet those requirements while consuming less power. In one configuration, a mechanism is provided where the switch tracks the utilization of each of its links over an epoch, and then makes an adjustment at the end of the epoch.
    Type: Grant
    Filed: November 19, 2013
    Date of Patent: August 12, 2014
    Assignee: Google Inc.
    Inventors: Dennis Charles Abts, Peter Michael Klausler, Hong Liu, Michael Marty, Philip Michael Wells
  • Patent number: 8730965
    Abstract: Adaptive packet routing is employed in a multiprocessor network configuration such as an InfiniBand switch architecture. Packets are routed from host to host through one or more switches. Upon receipt of a packet at a switch, the packet header is inspected to determine the destination host. A destination field in the header is used to index into a lookup table or other memory, which produces a route type and an output port grouping. Depending on the route type, one or more primary and secondary output port candidates are identified. An output port arbitration module chooses an output port from which to send a given packet, using congestion sensing inputs for the specified ports. A heuristic may include the congestion information that is provided to the arbitration module. Switching may be performed among minimal or non-minimal routes along each hop in the path, depending upon link and packet injection information.
    Type: Grant
    Filed: January 5, 2011
    Date of Patent: May 20, 2014
    Assignee: Google Inc.
    Inventors: Dennis Charles Abts, Peter Michael Klausler, Michael Marty, Philip Wells
  • Patent number: 8705368
    Abstract: Probabilistic arbitration is combined with distance-based weights to achieve equality of service in interconnection networks, such as those used with chip multiprocessors. This arbitration desirably used incorporates nonlinear weights that are assigned to requests. The nonlinear weights incorporate different arbitration weight metrics, namely fixed weight, constantly increasing weight, and variably increasing weight. Probabilistic arbitration for an on-chip router avoids the need for additional buffers or virtual channels, creating a simple, low-cost mechanism for achieving equality of service. The nonlinearly weighted probabilistic arbitration includes additional benefits such as providing quality-of-service features and fairness in terms of both throughput and latency that approaches the global fairness achieved with age-base arbitration. This provides a more stable network by achieving high sustained throughput beyond saturation.
    Type: Grant
    Filed: December 3, 2010
    Date of Patent: April 22, 2014
    Assignee: Google Inc.
    Inventors: Dennis Charles Abts, Michael Marty
  • Patent number: 8601297
    Abstract: Energy proportional solutions are provided for computer networks such as datacenters. Congestion sensing heuristics are used to adaptively route traffic across links. Traffic intensity is sensed and links are dynamically activated as they are needed. As the offered load is decreased, the lower channel utilization is sensed and the link speed is reduced to save power. Flattened butterfly topologies can be used in a further power saving approach. Switch mechanisms are exploit the topology's capabilities by reconfiguring link speeds on-the-fly to match bandwidth and power with the traffic demand. For instance, the system may estimate the future bandwidth needs of each link and reconfigure its data rate to meet those requirements while consuming less power. In one configuration, a mechanism is provided where the switch tracks the utilization of each of its links over an epoch, and then makes an adjustment at the end of the epoch.
    Type: Grant
    Filed: June 18, 2010
    Date of Patent: December 3, 2013
    Assignee: Google Inc.
    Inventors: Dennis C. Abts, Peter Michael Klausler, Hong Liu, Michael Marty, Philip Wells
  • Publication number: 20120170582
    Abstract: Adaptive packet routing is employed in a multiprocessor network configuration such as an InfiniBand switch architecture. Packets are routed from host to host through one or more switches. Upon receipt of a packet at a switch, the packet header is inspected to determine the destination host. A destination field in the header is used to index into a lookup table or other memory, which produces a route type and an output port grouping. Depending on the route type, one or more primary and secondary output port candidates are identified. An output port arbitration module chooses an output port from which to send a given packet, using congestion sensing inputs for the specified ports. A heuristic may include the congestion information that is provided to the arbitration module. Switching may be performed among minimal or non-minimal routes along each hop in the path, depending upon link and packet injection information.
    Type: Application
    Filed: January 5, 2011
    Publication date: July 5, 2012
    Applicant: GOOGLE INC.
    Inventors: Dennis Charles Abts, Peter Michael Klausler, Michael Marty, Philip Wells