Patents by Inventor Michael Roger Marty
Michael Roger 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: 10218538Abstract: The expansion of a network by converting the network from a 2-stage folded Clos network to a 3-stage folded Clos network can be cost prohibitive. The system and methods described herein relate to a hybrid network topology. More particularly, the disclosure describes a hybrid topology having internal switches configured in a multidimensional topology configuration. Each of the internal switches are connected to the network hosts with a folded Clos topology.Type: GrantFiled: January 30, 2014Date of Patent: February 26, 2019Assignee: Google LLCInventors: Peter Michael Klausler, Angela Chen, Michael Roger Marty, Philip Michael Wells, Adi Avidor
-
Patent number: 10038753Abstract: Systems and methods include a distributed system that uses a declarative language to separate application logic from the network technology used to communicate. For example, in a system with a plurality of processing nodes, each processing node may include at least one processor, a networking layer for communicating with other processing nodes, and a memory storing instructions that, when executed by the at least one processor, cause the processing node to perform operations. The operations may include receiving a processing plan using the networking layer and analyzing the processing plan to determine a service to perform and a number of inputs anticipated for the service. The operations may also include performing the determined service. The processing plan defines a processing tree comprising a subset of the plurality of processing nodes, the processing tree having unidirectional communication from the root to a final level of the tree.Type: GrantFiled: December 4, 2017Date of Patent: July 31, 2018Assignee: Google LLCInventors: Michael Roger Marty, Nicholas Andrew Kidd, Marcus Fontoura, Charles Acknin
-
Publication number: 20180091607Abstract: Systems and methods include a distributed system that uses a declarative language to separate application logic from the network technology used to communicate. For example, in a system with a plurality of processing nodes, each processing node may include at least one processor, a networking layer for communicating with other processing nodes, and a memory storing instructions that, when executed by the at least one processor, cause the processing node to perform operations. The operations may include receiving a processing plan using the networking layer and analyzing the processing plan to determine a service to perform and a number of inputs anticipated for the service. The operations may also include performing the determined service. The processing plan defines a processing tree comprising a subset of the plurality of processing nodes, the processing tree having unidirectional communication from the root to a final level of the tree.Type: ApplicationFiled: December 4, 2017Publication date: March 29, 2018Inventors: Michael Roger Marty, Nicholas Andrew Kidd, Marcus Fontoura, Charles Acknin
-
Patent number: 9843641Abstract: Systems and methods include a distributed system that uses a declarative language to separate application logic from the network technology used to communicate. For example, in a system with a plurality of processing nodes, each processing node may include at least one processor, a networking layer for communicating with other processing nodes, and a memory storing instructions that, when executed by the at least one processor, cause the processing node to perform operations. The operations may include receiving a processing plan using the networking layer and analyzing the processing plan to determine a service to perform and a number of inputs anticipated for the service. The operations may also include performing the determined service. The processing plan defines a processing tree comprising a subset of the plurality of processing nodes, the processing tree having unidirectional communication from the root to a final level of the tree.Type: GrantFiled: November 18, 2016Date of Patent: December 12, 2017Assignee: Google LLCInventors: Michael Roger Marty, Nicholas Andrew Kidd, Marcus Fontoura, Charles Acknin
-
Publication number: 20170070583Abstract: Systems and methods include a distributed system that uses a declarative language to separate application logic from the network technology used to communicate. For example, in a system with a plurality of processing nodes, each processing node may include at least one processor, a networking layer for communicating with other processing nodes, and a memory storing instructions that, when executed by the at least one processor, cause the processing node to perform operations. The operations may include receiving a processing plan using the networking layer and analyzing the processing plan to determine a service to perform and a number of inputs anticipated for the service. The operations may also include performing the determined service. The processing plan defines a processing tree comprising a subset of the plurality of processing nodes, the processing tree having unidirectional communication from the root to a final level of the tree.Type: ApplicationFiled: November 18, 2016Publication date: March 9, 2017Inventors: Michael Roger Marty, Nicholas Andrew Kidd, Marcus Fontoura, Charles Acknin
-
Patent number: 9563588Abstract: The present disclosure provides methods and systems to allow user space applications running on different cores to efficiently communicate interrupts between each other without have to enter an OS kernel. In one aspect, a hardware device for delivering inter-processor interrupts is provided. The hardware device includes a memory having a memory space that corresponds to a virtual memory space of a first guest process and a controller coupled to the memory. The controller may be configured to detect when interrupt information is recorded in the memory space. In that regard, the interrupt information is directed to a second guest process associated with a particular CPU core. In response to detecting interrupt information recorded in the memory space, the controller is configured to cause the second guest process to run on a different CPU core without making an operating system call.Type: GrantFiled: March 13, 2014Date of Patent: February 7, 2017Assignee: Google Inc.Inventors: Michael Roger Marty, Joel Scherpelz
-
Patent number: 9531842Abstract: Systems and methods include a distributed system that uses a declarative language to separate application logic from the network technology used to communicate. For example, in a system with a plurality of processing nodes, each processing node may include at least one processor, a networking layer for communicating with other processing nodes, and a memory storing instructions that, when executed by the at least one processor, cause the processing node to perform operations. The operations may include receiving a processing plan using the networking layer and analyzing the processing plan to determine a service to perform and a number of inputs anticipated for the service. The operations may also include performing the determined service. The processing plan defines a processing tree comprising a subset of the plurality of processing nodes, the processing tree having unidirectional communication from the root to a final level of the tree.Type: GrantFiled: September 24, 2015Date of Patent: December 27, 2016Assignee: Google Inc.Inventors: Michael Roger Marty, Nicholas Andrew Kidd, Marcus Fontoura, Charles Acknin
-
Patent number: 9247033Abstract: A method of processing client requests on a data processing apparatus. The method includes receiving control portions of client requests from respective clients. Each client request has control and payload portions, where the payload portion includes data and the control portion includes information relating to the data of the payload portion. The method also includes buffering, in non-transitory memory of the data processing apparatus, the received client request control portions, and retrieving the payload portion of a client request before processing that client request.Type: GrantFiled: December 26, 2012Date of Patent: January 26, 2016Assignee: Google Inc.Inventors: Lawrence Elias Greenfield, Michael Roger Marty, Frank Dabek, Daniel Jonathan Peng
-
Publication number: 20160014236Abstract: Systems and methods include a distributed system that uses a declarative language to separate application logic from the network technology used to communicate. For example, in a system with a plurality of processing nodes, each processing node may include at least one processor, a networking layer for communicating with other processing nodes, and a memory storing instructions that, when executed by the at least one processor, cause the processing node to perform operations. The operations may include receiving a processing plan using the networking layer and analyzing the processing plan to determine a service to perform and a number of inputs anticipated for the service. The operations may also include performing the determined service. The processing plan defines a processing tree comprising a subset of the plurality of processing nodes, the processing tree having unidirectional communication from the root to a final level of the tree.Type: ApplicationFiled: September 24, 2015Publication date: January 14, 2016Inventors: Michael Roger Marty, Nicholas Andrew Kidd, Marcus Fontoura, Charles Acknin
-
Patent number: 9185156Abstract: Systems and methods include a distributed system that uses a declarative language to separate application logic from the network technology used to communicate. For example, in a system with a plurality of processing nodes, each processing node may include at least one processor, a networking layer for communicating with other processing nodes, and a memory storing instructions that, when executed by the at least one processor, cause the processing node to perform operations. The operations may include receiving a processing plan using the networking layer and analyzing the processing plan to determine a service to perform and a number of inputs anticipated for the service. The operations may also include performing the determined service. The processing plan defines a processing tree comprising a subset of the plurality of processing nodes, the processing tree having unidirectional communication from the root to a final level of the tree.Type: GrantFiled: February 14, 2013Date of Patent: November 10, 2015Assignee: Google Inc.Inventors: Michael Roger Marty, Nicholas Andrew Kidd, Marcus Fontoura, Charles Acknin
-
Patent number: 9049265Abstract: A method of processing client requests that includes receiving a client request from a client for access to data, issuing a direct memory access command to non-transitory storage resources to load data to a target memory location without accessing the target memory location, and instructing a network interface controller in communication with the storage resources to send a response to the client. The response includes an information portion and a data portion.Type: GrantFiled: December 26, 2012Date of Patent: June 2, 2015Inventors: Lawrence Elias Greenfield, Michael Roger Marty
-
Publication number: 20140181181Abstract: A method of processing client requests on a data processing apparatus. The method includes receiving control portions of client requests from respective clients. Each client request has control and payload portions, where the payload portion includes data and the control portion includes information relating to the data of the payload portion. The method also includes buffering, in non-transitory memory of the data processing apparatus, the received client request control portions, and retrieving the payload portion of a client request before processing that client request.Type: ApplicationFiled: December 26, 2012Publication date: June 26, 2014Applicant: Google Inc.Inventors: Lawrence Elias Greenfield, Michael Roger Marty, Frank Dabek, Daniel Jonathan Peng