Patent application number | Description | Published |
20090083296 | Metadata endpoint for a generic service - A metadata endpoint for a generic service is disclosed. The technology initially defines an endpoint for metadata which was previously combined with a corresponding data endpoint. The metadata and corresponding data endpoint were combined in a first Service Oriented Environment (SOE) in which a combining constraint is not placed upon metadata and corresponding data endpoints. A location for accessing the endpoint for metadata is published for use by a second SOE in which a combining constraint is placed upon metadata and corresponding data. | 03-26-2009 |
20090083762 | Dynamically mapping an action of a message - A system and method for dynamically mapping an action of a message is disclosed. The technology initially receives a first message generated by a first Service Oriented Architecture (SOA). The first message comprises an operation which is described within the message context of the first message. It is then determined that the operation corresponds to an action of a second SOA. A second message is then generated which is compatible with the second SOA. The second message comprises metadata which describes the action of the second SOA. | 03-26-2009 |
20090133036 | COORDINATING RESOURCES USING A VOLATILE NETWORK INTERMEDIARY - The present invention extends to methods, systems, and computer program products for coordinating resources using a volatile network intermediary. Embodiments provide a mechanism for an network intermediary to facilitate a state coordination pattern between an application and a communication medium when the communication medium does not support the state coordination pattern. In some embodiments, receiving applications can make use of this network intermediary by changing the receive location. However, the receiving application may not be able to distinguish the network intermediary from a native implementation of the state coordination pattern. Further, the network intermediary does not require deployment of a persistent or durable store to coordinate state between receiving applications and the original communication medium. | 05-21-2009 |
20090133037 | COORDINATING APPLICATION STATE AND COMMUNICATION MEDIUM STATE - 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. | 05-21-2009 |
20100057863 | COMPOSING MESSAGE PROCESSING PIPELINES - The present invention extends to methods, systems, and computer program products for composing message processing pipelines. Embodiments utilize intra-pipeline communication links to physically and/or temporally decouple pipeline stages, configure branching message flows, and bridge protocols. The use of intra-pipeline communication links permits composition of a message processing pipeline without having to alter the pipeline components or application. Each communication link is itself an application with incoming and outgoing message processing pipelines that bridge messages across time and/or space and application logic for satisfying message processing requirements. | 03-04-2010 |
20100057933 | PROBABILISTIC MESH ROUTING - 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. | 03-04-2010 |
20110138399 | COMPOSING MESSAGE PROCESSING PIPELINES - The present invention extends to methods, systems, and computer program products for composing message processing pipelines. Embodiments utilize intra-pipeline communication links to physically and/or temporally decouple pipeline stages, configure branching message flows, and bridge protocols. The use of intra-pipeline communication links permits composition of a message processing pipeline without having to alter the pipeline components or application. Each communication link is itself an application with incoming and outgoing message processing pipelines that bridge messages across time and/or space and application logic for satisfying message processing requirements. | 06-09-2011 |
20110179303 | PERSISTENT APPLICATION ACTIVATION AND TIMER NOTIFICATIONS - The present invention extends to methods, systems, and computer program products for persistent application activation and timer notifications. A durable instance manager, instance execution hosts, and an instance store interoperate to transition instances between executing and persisted states. System properties are associated with an instance. System properties can define re-activation conditions, that when satisfied, indicate that an instance is to be re-activated for execution. System properties can define timers as well as indications that instances are in a persisted but ready to run state. | 07-21-2011 |
20110231702 | COORDINATING COMMUNICATION MEDIUM STATE FOR SUBTASKS - The present invention extends to methods, systems, and computer program products for coordinating communication medium state for subtasks. Embodiments of the invention use a received view of the contents of a message to produce a stream of subtask messages. Subtask message properties are each connected to the mechanism for performing the state coordination pattern on the original message. Subtask messages may each have the same message contents as the original message or may have message contents that vary according to the subtask. A message processor may then consume subtask messages from the subtask message stream and perform the state coordination pattern on each subtask message to reflect partial forward progress executing the original message. The outcome of the state coordination pattern for the original message is responsive to the collective outcomes of the state coordination patterns for the subtask messages. | 09-22-2011 |
20110264738 | HIERARCHICALLY DISASSEMBLING MESSAGES - 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. | 10-27-2011 |
20120030169 | APPLICATION INSTANCE AND QUERY STORES - An instance persistence command for an update to a state of an instance of an application can be issued. In response to the persistence command, a transaction with an instance store can be initiated. As part of the transaction, a first representation of the update can be stored in the instance store and a second representation of the update can be stored in a queue. The transaction can be committed after storing the first and second representations. After the transaction is committed, the second representation can be processed to store a third representation of the update in a query store. Application instance state information in the query store can be updated and queried without locking the instance store so that such operations in the query store can be performed asynchronously with operations in the instance store. | 02-02-2012 |
20120102493 | ORDERED SCHEDULING OF SUSPENDED PROCESSES BASED ON RESUMPTION EVENTS - A method includes receiving a plurality of resumption events associated with a plurality of suspended processes. Each resumption event is associated with a suspended process. Each resumption event also includes an execution time and a resumption time window. The method includes determining resumption deadlines for the suspended processes and determining a resumption order based on the resumption deadlines. The resumption deadline for a suspended process is based on the execution time and the resumption time window of the corresponding resumption event. The suspended processes are scheduled for execution in accordance with the resumption order. | 04-26-2012 |
20120246663 | HIERARCHICALLY DISASSEMBLING MESSAGES - 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. | 09-27-2012 |
20130160027 | COMPOSING MESSAGE PROCESSING PIPELINES - The present invention extends to methods, systems, and computer program products for composing message processing pipelines. Embodiments utilize intra-pipeline communication links to physically and/or temporally decouple pipeline stages, configure branching message flows, and bridge protocols. The use of intra-pipeline communication links permits composition of a message processing pipeline without having to alter the pipeline components or application. Each communication link is itself an application with incoming and outgoing message processing pipelines that bridge messages across time and/or space and application logic for satisfying message processing requirements. | 06-20-2013 |
20130185694 | DECLARATIVE DYNAMIC CONTROL FLOW IN CONTINUATION-BASED RUNTIME - Techniques are described herein that are capable of executing a computer program in accordance with a declarative dynamic control flow in a continuation-based runtime. A declarative dynamic control flow identifies a set of continuations. A representation of logic that corresponds to the declarative dynamic control flow is provided in accordance with execution of the computer program in the continuation-based runtime. The declarative dynamic control flow identifies a set of continuations. Each continuation identifies a respective rule, which defines a respective event, and a respective action, which is to be performed upon occurrence of the respective event. A determination is made that a specified event occurs. The set of continuations is dynamically modified based on occurrence of the specified event. | 07-18-2013 |