Microsoft Technology Licensing, LLC

Intel Corporation

Yossi Levanoni

Bimal Kumar Mehta

Sanjib Saha

Paul Maybee

Lee B Graber

Balasubramanian Sriram

Eldar Azerovich Musayev

Kevin Bowen Smith

Ali-Reza Adl-Tabatabai

Gad Shlomo Sheaffer

Bratin Saha

Jan Stephen Gray

Vinod Grover

Martin Taillefer

Akash Jeevan Sagar

Vadim Bassin

Balinder Malhi

Siunie A Sutjahjo

Wei-Lun Lo

Anandhi Somasekaran

Dave Detlefs

Mike Magruder

Matt Tolton

Allen Zhang

Alexander Dadiomov

Dana D Groff

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

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

In one embodiment, the present invention includes a method for selecting a first transaction execution mode to begin a first transaction in a unbounded transactional memory (UTM) system having a plurality of transaction execution modes. These transaction execution modes include hardware modes to execute within a cache memory of a processor, a hardware assisted mode to execute using transactional hardware of the processor and a software buffer, and a software transactional memory (STM) mode to execute without the transactional hardware. The first transaction execution mode can be selected to be a highest performant of the hardware modes if no pending transaction is executing in the STM mode, otherwise a lower performant mode can be selected. Other embodiments are described and claimed.

Performing mode switching in an unbounded transactional memory (UTM) system

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

A processing system includes a transactional memory, first and second resource managers, and a transaction manager for a concurrent program having a thread including an atomic transaction having a side-effecting action. The first resource manager is configured to enlist in the atomic transaction and manage a resource related to the side effecting action. The second resource manager is configured to enlist in the atomic transaction and manage the transaction memory. The transaction manager is coupled to the first and second resource managers and manager is configured to receive a vote from the first and second resource managers as to whether to commit the transaction. The side-effecting action is postponed until after the transaction commits or applied along with a compensating action to the side-effecting action.

Transaction processing for side-effecting actions in transactional memory

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

Growing community of inventors

Redmond, WA, United States of America

Yossi Levanoni