Microsoft Technology Licensing, LLC

Google Inc.

Mark Brian Shields

Brian C Beckman

Henricus Johannes Maria Meijer

Anders Hejlsberg

Steven E Lucco

Christopher Wellington Brumme

Jeffrey Van Gogh

Craig D Chambers

Danny Van Velzen

Daniel Mills

Reuven Lax

Robert Bradshaw

Charles P Jazdzewski

Manuel Alfred Fahndrich

John Wesley Dyer

Lucas James Hoban

Wei Zhu

Harish Venkata Kantamneni

Ahmet Altay

Samuel Green McVeety

Rafael De Jesús Fernández Moctezuma

Andrei Maksimenka

Harris Samuel Nover

Mikhail Shmulyan

Jeffrey Paul Gardner

Samuel Carl Whittle

Cosmin Ionel Arad

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.

Resource allocation for computer processing

A dynamic programming environment includes a dynamic runtime infrastructure configured to receive static metadata as source text in a source code written in a dynamic programming language. The dynamic runtime infrastructure determines an object representation based on the static metadata from the source text in the source code.

Static metadata in dynamic programs

A system and method for controlling the execution of notifications in a computer system with multiple notification contexts. A RunOn operator enables context hopping between notification contexts. Push-based stream operators optionally perform error checking to determine if notifications combined into a push-based stream share a common notification context. Context boxes group together notification creators and associate their notifications with a common scheduler and notification context. Operators employ a composition architecture, in which they receive one or more push-based streams and produce a transformed push-based stream that may be further operated upon. Components may be used in combinations to implement various policies, including a strict policy in which all notifications are scheduled in a common execution context, a permissive policy that provides programming flexibility, and a hybrid policy that combines flexibility with error checking.

Execution context control

A spectrum of tier-splitting mechanisms facilitates distributed programming. A rich application model and associated tools enable programmers to write rich distributed applications that can run anywhere. A program can be developed simply as a single tier or tier agnostic application. Subsequently or concurrently, the program can be sliced into multiple tiers in different ways to reflect, for instance, capabilities and/or constraints of a server, client and/or network.

Tier splitting support for distributed execution environments

A virtual machine is extended to include native support for co-routines. In this manner, high-level programmers are afforded access to such functionality. More particularly, supplied is a mechanism inside the virtual machine to enable method/function state to be maintained and subsequently restored. Consequently, a method/function can be called multiple times and resume where it last left off. This provides direct support for tier splitting patterns, iterators and comprehensions, among other things.

Co-routines native to a virtual execution environment

Growing community of inventors

Seattle, WA, United States of America

Mark Brian Shields