Microsoft Technology Licensing, LLC

Tableau Software, Inc.

Lee B Graber

Sanjib Saha

Bimal Kumar Mehta

Paul Maybee

Eldar Azerovich Musayev

Kevin Bowen Smith

Yossi Levanoni

Satish Ramchandra Thatte

Johannes Klein

Balasubramanian Sriram

Jean-Emile Elien

Paul F Ringseth

Akash Jeevan Sagar

Kartik Paramasivam

Daniel C Battagin

Shahar Prish

Robert C Collie

Raman S Iyer

Balinder Malhi

Su-Piao Bill Wu

Siunie A Sutjahjo

Wei-Lun Lo

Anandhi Somasekaran

Gabhan Berry

Michael Brian Kovner

Brett Allen Taylor

Sean Daye Mann

Sriram Balasubramanian

Sumitra Sujanani

Allen Zhang

Wayne A Clark

Siddhartha Roy

Alexander Dadjomov

Embodiments are directed to managing sandboxed application extensions. A first request that include includes information that identifies an extension may be provided to an extension server. Information included in a first response may be employed to instantiate an extension shell that corresponds to the extension and embed it in the hosting application such that the extension shell is associated with a first security policy included in the first response. A second request may be provided to the extension server based on information included in the extension shell such that the second request includes an identifier associated with an extension body that corresponds to the extension shell. The first security policy or the second security policy may be employed to enable one or more of the extension shell or the extension body to just access the hosting application or just access the extension server.

Sandboxed application extensions

A system and method of using metrics to control throttling and swapping in a message processing system is provided. A workload status of a message processing system is determined, and the system polls for a new message according to the workload status. The message processing system identifies a blocked instance and calculates an expected idle time for the blocked instance. The system dehydrates the blocked instance if the expected idle time exceeds a predetermined threshold.

Use of metrics to control throttling and swapping in a message processing system

Third party data embedding may be provided. Data associated with a third party provider may be saved in a native application save file. If a save file opened by the application is determined to comprise third party data, the application may determine whether an appropriate data provider is available. The application may connect to the data provider and provide on-demand, asynchronous access to the third party data upon request from a user.

Embedding and retrieving data in an application file format

Use of metrics to control throttling and swapping in a message processing

An XLANG/s compiler detects convoy scenarios during compilation and generates runtime directives to correctly correlate incoming messages with business process instances. A convoy scenario, present in event driven processes, is defined by a correlation set initialized during a receive operation which is provided to a subsequent receive operation. The compiler detects those convoy scenarios by analyzing the control and dataflow of a XLANG/s program. Three convoy patterns are distinguished: (1) activation convoys, (2) uniform sequential convoys, and (3) non-uniform sequential convoys. XLANG/s allows declarative descriptions of convoy scenarios without requiring an understanding of the low-level details supporting their correct execution. Convoy scenarios are processed by statically analyzing a written workflow application to deduce the nature and type of convoy scenarios used by the application. Information is extracted at compile time to support the runtime infrastructure. The runtime infrastructure is tightly integrated with the underlying correlation and subscription evaluation framework.

Efficient processing of a convoy workflow scenario in a message driven process

A system and method of processing a message in an asynchronous architecture is provided. In the method, a determination is made that a response to a message sent by an instance of software code is to be received, where the response indicates whether the message succeeded or failed. Another determination is made as to whether the response has been received. If the response has not been received, the instance of the software code is stored in memory, thereby suspending the instance. The response is received, the instance resumed and the response is processed.

Handling a delivery failure as a program exception in a distributed asynchronous architecture

Systems and methods for controlling the work load on a distributed system comprising a plurality of stages are provided. The capacity of a present stage is monitored, using either various resources of the present stage or rates of work completion and work receipt of the present stage. Information indicating the capacity of a succeeding stage are obtained and communicated to the present stage. The monitored capacity information of the present stage and the communicated information of the succeeding stage, either alone or in combination, are used to determine if a throttling action is necessary to control the load of work at the present stage. A provided throttling technique inserts an appropriate delay before the present stage to allow the present stage to process an amount of work without saturating the capacity of the present stage. This technique is applied at each stage of the distributed system to control the work load of the overall system by controlling the work load at each stage.

Providing flow control and moderation in a distributed message processing system

Systems and methods for reducing the latency incurred during the publication of a message in a message publication system are provided. In a message publication system wherein the publishing component and the receiving component are located within the same processing space, several of the latency components that are usually unavoidably incurred may be eliminated. In such a system, the messaging queue is not used as a medium between the two components but is instead used as a secondary back-up storage. This results in the elimination of one latency component as the message is directly published from the publishing component to the receiving component. Further time reductions or optimizations occur when the durability, or reliability, of the message publication is not a concern and the messaging queue can be completely disregarded. Yet another optimization occurs when the identity of the subscriber is known in advance by the publisher.

Optimizing message transmission and delivery in a publisher-subscriber model

Large messages in the form of hierarchically structured documents are processed in a streaming fashion using the ultimate consumer read requests as the driving force for the processing. The messages are partitioned into fixed length segments. The segments are processed in pipeline fashion. This processing chain includes simulating random access of hierarchical documents using stream transformations, mapping streams to a transport's native capabilities, composing streams into chains and using pipeline processing on the chains, staging fragments into a database and routing messages when complete messages have been formed, and providing tools to allow the end user to inspect partial messages.

Scalable storage and processing of hierarchical documents

Methods for providing dynamic process recovery that supports recovery of event driven services. The present invention addresses situations where a service-hosting process fails as well as all of the services which were running in that process. To recover from this scenario, the present invention restarts the services from a last known good state. The present invention also provides for situations where a process is shut down in a controlled manner, but the services running within it are still able to drive. Here again, the services are restarted in a secondary process. The recovery modal described here, therefore, advantageously addresses a problem in the design of a distributed event-driven environment.

Dynamic process recovery in a distributed environment

A transport-neutral in-order delivery in a distributed environment is provided. Typically, in-order delivery guarantees that sequential orders received by a transport engine are sent out in the same order they are received. Such delivery may be forwarded either to another transport engine or to some application. In case there is a failure of delivery of messages in a stream, the messages are either resubmitted, suspended, or moved to backup. A user or administrator can configure the desired action. Additionally, any stream can be manually aborted or a specified port can be unenlisted. Deliverable streams of messages are locked on to a back-end transport engines or applications and dequeued sequentially unless one of the above mentioned failure scenarios occurs.

Transport-neutral in-order delivery in a distributed system

Systems and methods for using metrics to control throttling and swapping in a message processing system

Growing community of inventors

Kirkland, WA, United States of America

Lee B Graber