Patents by Inventor Manuel Alfred Fahndrich

Manuel Alfred Fahndrich 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).

  • Publication number: 20200225991
    Abstract: A job that receives as input a data stream is executed. For the job, it is iteratively determined a backlog growth over a first period of time; a backlog volume; and whether to adjust a quantity of processing resources. For each iteration for which the quantity of processing resources allocated to the job are determined to be adjusted, adjusting the quantity of processing resources allocated to the job. For each iteration for which the quantity of processing resources allocated to the job are determined not to be adjusted, maintaining the quantity of processing resources allocated to the job.
    Type: Application
    Filed: February 4, 2020
    Publication date: July 16, 2020
    Inventors: Robert Bradshaw, Rafael de Jesús Fernández Moctezuma, Daniel Mills, Samuel Green McVeety, Samuel Carl Whittle, Andrei Maksimenka, Cosmin Ionel Arad, Mark Brian Shields, Harris Samuel Nover, Manuel Alfred Fahndrich, Jeffrey Paul Gardner, Mikhail Shmulyan, Reuven Lax, Ahmet Altay, Craig D. Chambers
  • Patent number: 10558501
    Abstract: A job that receives as input a data stream is executed. For the job, it is iteratively determined a backlog growth over a first period of time; a backlog volume; and whether to adjust a quantity of processing resources. For each iteration for which the quantity of processing resources allocated to the job are determined to be adjusted, adjusting the quantity of processing resources allocated to the job. For each iteration for which the quantity of processing resources allocated to the job are determined not to be adjusted, maintaining the quantity of processing resources allocated to the job.
    Type: Grant
    Filed: December 30, 2016
    Date of Patent: February 11, 2020
    Assignee: Google LLC
    Inventors: Robert Bradshaw, Rafael de Jesús Fernández Moctezuma, Daniel Mills, Samuel Green McVeety, Samuel Carl Whittle, Andrei Maksimenka, Cosmin Ionel Arad, Mark Brian Shields, Harris Samuel Nover, Manuel Alfred Fahndrich, Jeffrey Paul Gardner, Mikhail Shmulyan, Reuven Lax, Ahmet Altay, Craig D. Chambers
  • Publication number: 20170255491
    Abstract: A job that receives as input a data stream is executed. For the job, it is iteratively determined a backlog growth over a first period of time; a backlog volume; and whether to adjust a quantity of processing resources. For each iteration for which the quantity of processing resources allocated to the job are determined to be adjusted, adjusting the quantity of processing resources allocated to the job. For each iteration for which the quantity of processing resources allocated to the job are determined not to be adjusted, maintaining the quantity of processing resources allocated to the job.
    Type: Application
    Filed: December 30, 2016
    Publication date: September 7, 2017
    Inventors: Robert Bradshaw, Rafael de Jesús Fernández Moctezuma, Daniel Mills, Samuel Green McVeety, Samuel Carl Whittle, Andrei Maksimenka, Cosmin Ionel Arad, Mark Brian Shields, Harris Samuel Nover, Manuel Alfred Fahndrich, Jeffrey Paul Gardner, Mikhail Shmulyan, Reuven Lax, Ahmet Altay, Craig D. Chambers
  • Patent number: 7584458
    Abstract: Techniques and tools for implementing a source code annotation language are described. In one aspect, keywords are added to a function interface to define a contract for the function independent of function call context. In another aspect, annotations are inserted at global variables, formal parameters, return values, or user-defined types. The annotations include, for example, properties and qualifiers. A property can indicate, for example, a characteristic of a buffer. In another aspect, an annotation indicates that a value has usability properties sufficient to allow a function to rely on the value, where the usability properties depend on value type.
    Type: Grant
    Filed: October 2, 2003
    Date of Patent: September 1, 2009
    Assignee: Microsoft Corporation
    Inventors: Manuvir Das, Manuel Alfred Fahndrich, Ramanathan Venkatapathy, Daniel W. Weise, William Hunter Hudson, Sameet Harishanker Agarwal, William Hiroaki Shihara, Hannes Ruescher, Spencer Wong Low, F. Soner Terek
  • Patent number: 7526755
    Abstract: A system and method employing pre- and/or post-condition(s) specified at a source code level and persisted (e.g., in associated object code and/or a specification repository) facilitating static checking of the object code is provided. The system and method are based, at least in part, upon a framework that employs rules for using an interface to be recorded as declarative specifications in an existing language. A specifier can give a method a plug-in pre- and postcondition, which is arbitrary code that examines an object's current state and a static approximation of the method's actuals, decides whether the call is legal and returns the object's state after the call.
    Type: Grant
    Filed: October 8, 2003
    Date of Patent: April 28, 2009
    Assignee: Microsoft Corporation
    Inventors: Robert Anthony DeLine, Manuel Alfred Fahndrich
  • Patent number: 7421680
    Abstract: A system and method employing pre- and/or post-condition(s) specified at a source code level and persisted (e.g., in associated object code and/or a specification repository) facilitating static checking of the object code is provided. The system and method are based, at least in part, upon a framework that employs rules for using an interface to be recorded as declarative specifications in an existing language. The system can employ a range of annotations that allow a developer to specify interface rule(s) with varying precision. At the simplest end of the range, a specifier can mark those methods that allocate and release resource(s). A specifier can also limit the order in which an object's methods may be called to the transitions of a finite state machine.
    Type: Grant
    Filed: September 22, 2003
    Date of Patent: September 2, 2008
    Assignee: Microsoft Corporation
    Inventors: Robert Anthony DeLine, Manuel Alfred Fahndrich