Microsoft Technology Licensing, LLC

Stefan R Batres

Nicholas Alexander Allen

Kenneth David Wolf

Justin David Brown

John Anthony Taylor

Richard Douglas Hill

Shy Cohen

Amanda K Silver

Geoffrey M Kizer

Nathan Christopher Talbert

Gaurav Seth

Edmund S V Pinto

Margaret J Lye

Evgeny Osovetsky

Edmund Pinto

Edmund Samuel Victor Pinto

Rodney Thomas Limprecht

Stephen Jared Maine

Jayteerth Narasingrao Katti

Bin Li

Michael Thomas Dice

Philbert L Henning, Ii

Christopher G Kaler

Erik B Christensen

Stephen James Millet

David Wortendyke

Giovanni Moises Della-Libera

James Ernest Johnson

Tirunelveli R Vishwanath

Lance Olson

Karthik Raman

Umesh Madan

Michael James Coulson

Stefan Harrington Pharies

John David Doty

Craig Andrew Critchley

Michael Marucheck

Vijay Gajjala

Krishnan Srinivasan

Uday Sooryakant Hegde

Elliot Lee Waingold

Tomasz Janczuk

Jean-Emile Elien

Geary L Eppley

Matthew Thomas Tavis

Michael Steven Vernal

Stephen T Swartz

David Edwin Levin

Max A Feingold

Richard Dievendorff

Douglas M Purdy

Natasha Harish Jethanandani

David Owen Driver

Siddhartha Puri

Saurab Nog

Aaron Stern

Douglas A Walter

Jesus Ruiz-Scougall

Anastasios Kasiolas

Kapil Gupta

Vipul A Modi

Ryan Thomas Sturgell

Mohammad Makarechian

Alexander Martin DeJarnatt

Sowmyanarayanan K Srinivasan

Scott Christopher Seely

Jonathan T Wheeler

Erin Honeycutt

Yaniv Pessach

Mauro Ottaviani

Chaitanya Dutt Upadhyay

Eugene Shvets

Kirill Gavrylyuk

Yasser Shohoud

Alfred M Lee, Iv

Jesse R Yurkovich

Michael J Moroney

Anand Rjagopalan

Mohamed-Hany Essam Ramadan

Serge Sverdlov

Vaithialingam B Balayogan

Ondrej Hrebicek

Methods, systems, and products are provided for thread-agile dynamic programming language ('DPL') program execution. Thread-agile DPL program execution may be carried out by receiving, in a message queue, a message for an instance of a DPL program and determining whether the host application has a stored state object for the instance of the DPL program identified by the message. If the host application has a stored state object for the DPL program, thread-agile DPL program execution may also carried out by retrieving the state object; preparing a thread available from a thread pool for execution of the instance of the DPL program in dependence upon the state object and an execution context for the instance of the DPL program; providing, to an execution engine for executing the DPL program, the state object and the prepared thread; and passing the message to the execution engine.

Thread-agile execution of dynamic programming language programs

An episodic execution of program instances and a coordinated message exchange protocol are combined to achieve eventual consistency in the communication between nodes of a distributed system. Program instances run in episodic loops that are triggered by defined input events and that generate checkpoints. The checkpoints indicate when messages are to be sent from the one instance to another instance or other device. The coordinated message exchange protocol allows the instance to send a message to a receiver, to acknowledge that the message has been received, and to confirm the acknowledgement to the receiver.

Episodic coordination model for distributed applications

The present invention extends to methods, systems, and computer program products for coordinating application sate and communication mediums state. Embodiments of present invention provide a mechanism for a communication medium to provide a view of message content for a message (a peek) to an application along with the communication medium preventing further access to the message (a lock) until the application signals back how to handle the message. Thus, the communication medium indicates that the message is locked for the duration of processing at the application. Indicating that the message is locked significantly reduces the chance of the message being provided to another application (or another consumer of the same application) during the time the application is processing the view of message content.

Coordinating application state and communication medium state

The present invention extends to methods, systems, and computer program products for hierarchically disassembling messages. The functionality of disassemblers and framers is decoupled such that framers for different types of messages can be utilized at the same level in a hierarchy without having to also change disassemblers. Virtually any level of disassembly is possible to address any corresponding level of message nesting. Disassembly can be performed on a per message or per session basis.

Hierarchically disassembling messages

A distributed instance system manages instances and communications between the instances. The distributed instance system provides a restricted set of communication methods to the instances. Based on the type of communication method used, the distributed instance system has knowledge of the messages sent by instances and can make decisions on how to handle the messages. When one of the instances involved in a message exchange ends, the host uses its knowledge of the message exchange type to determine whether to drop the message, drop a reply to the message, and/or send an error message to the surviving instance. An instance may create one or more child instances in a tree-like configuration. Status data is passed up the tree from children instances and aggregated in the parent instances. Monitoring data may be generated from the aggregated status data.

Managing and simplifying distributed applications

Processing messages. Messages are processed based on a characteristic derived from information in messages, metadata about messages, or other information external to messages. Values for one or more pieces of information are received. At least one of the values for one or more pieces of information is associated with a first message. Queries are received. The queries specify one or more of the pieces of information. At least a portion of the plurality of values for the one or more pieces of information is processed in conjunction with the one or more queries to create one or more normalized characteristics for the first message. The one or more normalized characteristics for the first message are in a same format irrespective of the format of the pieces of information. The first message, and/or other messages, is processed based on at least one of the one or more normalized characteristics.

Query-oriented message characterization

A rendezvous abstraction that is used to correlate messages within message exchange. The rendezvous abstraction may be instantiated to correlate messages regardless of the type of message exchange pattern, and regardless of the underlying protocols used to communication message. Messages exchanges of primitive protocols are modeled as unilateral message exchanges. The rendezvous abstraction is used to correlate messages of the unilateral message exchange, and serves as an abstraction that is used to represented the rendezvous point where the message of the message exchange pattern are handled. Accordingly, instead of focusing on the protocol-specific mechanisms for correlation, if even available, the application author may simply work with a standard rendezvous abstraction.

Message exchange pattern rendezvous abstraction

Methods are provided for thread-agile script execution. Thread-agile script execution may be carried out by receiving, in a message queue, a message for an instance of a script and determining whether the web browser has a stored state object for the instance of the script identified by the message. If the web browser has a stored state object for the script, thread-agile script execution may be carried out by retrieving the state object; preparing a thread available from a thread pool for execution of the instance of the script in dependence upon the state object and an execution context for the instance of the script; providing, to an execution engine for executing the script, the state object and the prepared thread; and passing the message to the execution engine.

The present invention extends to methods, systems, and computer program products for multiplexed communication for duplex applications. Embodiments of the invention facilitate a multiplexed variant of long polling over a request/reply communication medium that (potentially significantly) reduces the resources utilized when exchanging messages. The lightweight address generation mechanism facilitates polling and routing for a pool of many clients and many services while minimizing allocated resources to each established session. Further, the benefits of a lower latency bidirectional communication medium between clients and services can be utilized.

Multiplexed communication for duplex applications

Messages are processed based on a characteristic derived from information in messages, metadata about messages, or other information external to messages. Values for one or more pieces of information are received. At least one of the values for one or more pieces of information is associated with a first message. Queries are received. The queries specify one or more of the pieces of information. At least a portion of the plurality of values for the one or more pieces of information is processed in conjunction with the one or more queries to create one or more normalized characteristics for the first message. The one or more normalized characteristics for the first message are in a same format irrespective of the format of the pieces of information. The first message, and/or other messages, is processed based on at least one of the one or more normalized characteristics.

The dispatching of messages from an incoming message pool to service instance(s). Message are received non-destructively and exclusively from the incoming message pool. If a particular service instance receives a message out of order, the processing of the message is deferred without releasing the exclusivity in the incoming message queue. Thus, the target service instance may continue to process one or more other messages until the target service instance is ready to process one or more deferred messages. In this way, messages may be pulled from the incoming message queue for dispatch to service instance(s), while maintaining correct order of processing, even if messages do not arrive into the incoming message queue in the correct order.

Out of order durable message processing

Routing messages using unreliable routing data. A method includes receiving a message from a computer readable communication medium. Characteristic properties of the message are calculated so as to determine state requirements for a service instance at a service for processing of the message. An attempt is made to acquire an appropriate service instance that satisfies the state requirements for processing the message. A determination is made that attempting to acquire an appropriate service instance that satisfies the state requirements for processing the message is not successful at acquiring an appropriate service instance. As a result, the message is redirected using an unreliable local cache of routing information and without coordination between processing nodes.

Probabilistic mesh routing

Growing community of inventors

Sammamish, WA, United States of America

Stefan R Batres