|Publication number||US20070118841 A1|
|Application number||US 11/285,496|
|Publication date||May 24, 2007|
|Filing date||Nov 22, 2005|
|Priority date||Nov 22, 2005|
|Also published as||US7467388|
|Publication number||11285496, 285496, US 2007/0118841 A1, US 2007/118841 A1, US 20070118841 A1, US 20070118841A1, US 2007118841 A1, US 2007118841A1, US-A1-20070118841, US-A1-2007118841, US2007/0118841A1, US2007/118841A1, US20070118841 A1, US20070118841A1, US2007118841 A1, US2007118841A1|
|Inventors||David Driver, Geoffrey Kizer, Krishnan Srinivasan, Uday Hedge|
|Original Assignee||Driver David O, Kizer Geoffrey M, Krishnan Srinivasan, Hedge Uday S|
|Export Citation||BiBTeX, EndNote, RefMan|
|Referenced by (9), Classifications (7), Legal Events (3)|
|External Links: USPTO, USPTO Assignment, Espacenet|
Background and Relevant Art
Computers and computing systems have affected nearly every aspect of modern living. Computers are generally involved in work, recreation, healthcare, transportation, entertainment, household management, etc. Computers include one or more processors that run application code to implement applications that perform the computer functions. Typically, applications input data and output data. Data can be received by an application where the data can be operated on or be used to modify other data so as to implement various functions.
To receive input data, applications may receive the data through a queue. A queue may be implemented as a data structure that receives data and organizes the data for consumption by an application according to a set of rules. For example, a queue may receive data and store the received data in a fashion that allows the application to consume the received data in the order that it was received at the queue. Data queues serve as a buffer to store data while applications or processors running applications are busy performing other tasks. Additionally, data queues can mitigate the loss of data that may occur when different pieces of data are sent to an application at the same or a nearby time.
In one exemplary use of data queues, an application continuously polls a data queue to discover messages in the data queue for the application. Understandably, this example configuration may occupy valuable resources such as system memory, processor time etc.
The subject matter claimed herein is not limited to embodiments that solve any disadvantages or that operate only in environments such as those described above. Rather, this background is only provided to illustrate one exemplary technology area where some embodiments described herein may be practiced.
One embodiment described herein includes a method of allowing queue messages to be pulled by one or more applications. The method may be practiced, for example, in a computing environment including applications configured to receive messages from queues. The method includes correlating applications to queues by correlating queue names to application locations. A queue is monitored to discover new messages in the queue. The method further includes receiving a notification that a new message has been added to the queue. An indication is provided to an activation service to allow the activation service to activate an application correlated to the queue and to allow the application to pull the new message from the queue.
In another embodiment, a method of correlating queues to applications is disclosed. The method may be practiced, for example, in a computing environment including applications configured to receive messages from queues. The method include polling a message queue center to obtain a list of queues. The list of queues includes queues names in a hierarchical naming structure. Application configuration data is received from an activation service. The applications are located and accessible via a physical path. Queues are matched to applications by matching the hierarchical naming structure to application locations.
Yet another embodiment disclosed herein includes a system configured to allow queue messages to be pulled by one or more applications. The system may be used, for example, in a computing environment including applications configured to receive messages from queues. The system includes a message queue center. The message queue center includes one or more queues configured to receive messages for applications in the system. The system further includes an activation service. The activation service is configured to provide configuration information about applications to a listener adapter. The system further includes the listener adapter. The listener adapter includes a binding monitor configured to poll the message queue center to discover queues at the message queue center. The binding monitor is also configured to match applications to queues at the message queue center by comparing application locations with queue names. The listener adapter further includes a queue monitor for each queue matched to an application. The queue monitor is configured to monitor queues for new messages and to request activation of an application matched to a queue when new messages arrive in the queue matched to the application.
This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.
Additional features and advantages will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by the practice of the teachings herein. Features and advantages of the invention may be realized and obtained by means of the instruments and combinations particularly pointed out in the appended claims. Features of the present invention will become more fully apparent from the following description and appended claims, or may be learned by the practice of the invention as set forth hereinafter.
In order to describe the manner in which the above-recited and other advantages and features can be obtained, a more particular description of the subject matter briefly described above will be rendered by reference to specific embodiments which are illustrated in the appended drawings. Understanding that these drawings depict only typical embodiments and are not therefore to be considered to be limiting in scope, embodiments will be described and explained with additional specificity and detail through the use of the accompanying drawings in which:
Embodiments herein may comprise a special purpose or general-purpose computer including various computer hardware, as discussed in greater detail below.
One embodiment described herein includes a listener adapter that monitors queues on behalf of applications. When the listener adapter discovers a new message for an application, the listener adapter alerts an activation service, which facilitates activation of the application. The activation service can also configure the application with appropriate knowledge about the queue, such as a location of the queue. The application can then pull the message from the queue and start any appropriate services to consume the message. In one embodiment, the queue uses a hierarchical naming structure that can be mapped to application locations. In this way, applications can use hierarchical naming to retrieve messages from queues.
Referring now to
The computer system 100 further includes a listener adapter 104. The listener adapter 104 as described above includes functionality for monitoring queues in the message queue center 102. In one embodiment, the listener adapter 104 includes a software module which functions as a queue monitor 106. The queue monitor 106 is tasked with monitoring queues at the message queue center 102 to discover new messages in the queues at the message queue center 102.
An activation service 108 is connected to the listener adapter 104. When the queue monitor 106 discovers new messages in the message queue center 102, the activation service 108 can be notified such that the activation service 108 can activate an application for which the new message in the queue is available. In one embodiment, the activation service 108 may be embodied as Windows Activation Service (WAS) available from Microsoft Corporation of Redmond, Wash.
Illustrating now a more detailed description of the functionality of the computer system 100 shown in
When the listener adapter 104 registers with the activation service 108, the activation service 108 provides configuration data to the listener adapter as illustrated by the arrow labeled 2. The configuration data may include information such as protocol information, name and/or path of applications using the message queue center protocol, and machine information specifying where queues are located. Queues are often located at the local host, thus the activation service often provides an indication that the local host is the machine where queues for applications managed by the activation service 108 are located. As will be described in more detail below, registering with the activation service also results in the creation of a binding filter 112 that corresponds to each application using message queue center protocols.
The listener adapter 104 then ensures that a binding monitor 110 is configured for each machine. For example, if queues for the applications managed by the activation service 108 exist only on the local host, then a single binding monitor 110 for the local host will be configured for the local host. When queues are located at other remote machines, a binding monitor 10 will be configured for each remote machine.
As illustrated in
At the listener adapter 104, the binding filter 112 is configured for each application managed by the activation service 108 that communicates using message queue center protocols. The label 5 at the binding monitor 110 illustrates an action of matching queues to applications. In one embodiment, and as discussed in more detail below, matching queues to applications involves a process whereby queue names in the form of URIs are mapped to disk locations of applications managed by the activation service 108. As explained previously, this may be accomplished by matching queues at the message queue center 102 with binding filters 112 established for each of the applications managed by the activation service 108.
A queue monitor 106 is set up for each queue in the message queue center 102 as illustrated by the label 6 at the queue monitor 106. Each queue monitor 106 monitors each queue in the message queue center 102 to discover new messages in the queue. As illustrated by the arrow labeled 7, the queue monitor 106 peeks for messages at a queue in the message queue center 102. In one embodiment, the peeks may be asynchronous. In response to the peek, a peek response is received by the queue monitor 106 as illustrated by the arrow labeled 8. The queue monitor 106 includes a reference back to an application that is interested in the queue being monitored by the queue monitor 106 such that if the peek response indicates that a new message has been received in a queue for an application, a request for activation of an application is sent to the activation service 108 as illustrated by the arrow labeled 9.
The activation service 108 may then start a worker 114 to activate the application for which the new message in the queue is directed. As illustrated in
As illustrated by the arrow labeled 11, the binding monitor 116 at the worker 114 polls the message queue center 102 for queues at the message queue center 102. The message queue center 102 returns a list of queues at the message queue center 102 which is received by the worker 114 as illustrated by the arrow labeled 12. The worker 114 illustrated in
Each queue includes information that corresponds to a service of the application. For example, the activation service 108 has a configuration file that maps an application to a physical address. For example, the application /myapp may be mapped to the hard drive location at c:\foo. The queue name may have a name that corresponds to the application. For example, a queue may have a name myapp/a/b/bar.svc. As such, the service path for the queue is c:\foo\a\b\bar.svc. In this example, that application prefix is replace by the physical path and mapped to a file. Thus, the worker 114 can determine that a service exists for queues matching the binding filter 118. If such a service exists, the worker 114 starts the service to consume messages at a queue at the message queue center 102. In some situations a service may not exist for the queue. This may occur because of matching that is performed by the binding monitor 110 to match queues to applications. As will be explained below in more detail, one embodiment uses a best match matching such that a queue may be selected as one that should be monitored even when an application or service is not registered with the activation service 108 for the queue. When this occurs, no service will be started for the new message at the queue.
Once an application has been activated to process messages in a queue at the message queue center 102, the application can assume responsibility for discovering and retrieving messages at the queue at the message queue center 102 so long as the application is active. Thus, in one embodiment, when the listener adapter 104 is aware that an application is monitoring queues at the message queue center 102, the listener adapter can ignore those queues so long as the application is active. At a subsequent time the application may determine that it should shut down. At that point, the application can inform the activation service, which in turn informs the listener adapter 104 that the application is shutting down such that the listener adapter 104 can again peek for messages, as illustrated by arrow 7, while the application is in a shut down state.
As alluded to previously, embodiments include functionality for correlating applications to queues at the message queue center 102. Notably, some embodiments allowing for multiple queues to be mapped to a single application. In one embodiment, the activation service 108 may be configured to operate using uniform resource indicators (URIs). Thus, in one embodiment, to correlate queues with applications, a mechanism may be used to match names in a flat namespace to hierarchical names such as those used in a web application namespace. For example, the readers attention is directed to the following mapping:
In this example, the namespace my_app is mapped to the physical hard drive directory at c:\foo. The directory at c:\foo may contain an application named my_app.exe and several services labeled svc1.svc, svc2.svc, svc3.svc, etc. Each queue that is intended to receive messages for my_app.exe can be labeled with a hierarchical name in the namespace my_app. For example, a queue named my_app/svc1.svc is intended to provide messages to the application my_app stored at the directory c:\foo. More particularly, messages at my_app/svc1.svc will be consumed by a service svc1.svc at the directory c:\foo. In this way, applications can be mapped to multiple queues.
Additionally, this type of hierarchical naming may be used in some embodiments to implement web application type messaging. In one particular embodiment, Web Services may be used to implement messaging within a system. Web Services is a standardized way of integrating applications. Standardized XML documents can be used with SOAP (Simple Object Access Protocol) messages and WSDL (Web Services Description Language) descriptions to integrate applications without an extensive knowledge of the applications being integrated.
Because of redundancies that may exist in application naming, the binding monitor 110 may include functionality to perform a best match matching of queues to applications. For example, consider a queue that is named myapp/a/b/x.svc. In the same system are three applications at c:\foo\a, c:\foo \a\b, and c:\foo \b. Various rules may be used to match the name of the queue with an appropriate application. For example, one set of rules may count the number of matching parameters in the prefix to identify the best match. An application with the longest matching prefix to the queue name will own the queue. Typically, this set of rules also specifies that a root parameter must be the same between the name and the application location for any score to be assigned. As such, in the example set forth above, c:\foo\a receives a score of 2 when compared with a/b/x.svc because c:\foo\a matches the root portion (/a) of the name. c:\foo \a\b receives a score of 4 because c:\foo \a\b matches the root portion and the next subsequent portion. c:\foo \b receives a score of 0 because c:\foo \b does not have a matching root parameter. Thus, an application at c:\foo \a\b will be correlated to the queue /a/b/x. svc.
Returning now to the actions illustrated by arrows 3 and 4, additional functionality of the binding monitor 110 will be illustrated. The binding monitor 110 may perform either in a static or dynamic fashion. When performing in a static fashion, the binding monitor 110 polls for queues at the queue message center 102 and receives a list of queues a single time. In an alternative embodiment, the binding monitor 110 acts in a dynamic fashion. In this example, the binding monitor 110 may poll for queues and receive a list of queues continuously over a period of time. This may be performed according to a periodic function, a random function, or other appropriate polling and message receiving method. As the binding monitor 110 discovers new queues and/or new applications as represented by binding filters 112, the binding monitor can reevaluate matches of queues to applications. Thus, if a queue-application pair becomes available with a longer prefix match than a previous queue-application pair, the binding monitor 110 can dynamically re-associate queues and application to have better prefix matches.
Referring now to
As described previously, in one embodiment correlating applications to queues (act 202) may be performed by performing a best match matching on the prefix of the queue name and the application. For example, the queue names may include a hierarchical name such as a URI. By comparing the hierarchical name with a storage location of applications, queues can be matched to applications. A best match matching process may include, for example, giving ownership of a queue to an application with the longest matching prefix as described previously herein. In one embodiment, two or more queues may be correlated to a single application. Queues can be named such that more than one queue can correspond to one application.
The method 200 further includes an act of monitoring a queue to discover new messages in the queue (act 204). As illustrated in
The method 200 includes an act of receiving a notification that a new message has been added to the queue (act 206). As shown in
The method 200 includes an act of providing an indication to an activation service (act 208) to allow the activation service to activate an application correlated to the queue and to allow the application to pull the new message from the queue. As illustrated in
In one embodiment the method 200 may further include activating a service corresponding to the queue name. For example, the queues may include hierarchical naming that includes not only information corresponding to an application, but also information corresponding to a service at the application. Thus, the queue naming may provide functionality for activating services for queues.
In one embodiment the method of 200 may further include polling for queues at a message queue center; receiving an indication of queues at the message queue center and setting-up a queue monitor for individual queues correlated to applications at the message queue center to monitor queues. As illustrated in
The method 200 may further include registering with the activation service as the protocol adapter for a message queue center comprising the queue, and receiving configuration data for applications managed by the activation service. Referring again to
The method 200 may further include an act of transmitting messages using Web Services. As described previously, Web Services includes a messaging system that allows computer systems and applications to communicate without advanced knowledge of the inner workings of the computer systems and applications.
Referring now to
The method 300 further includes an act of receiving application configuration data from an activation service (304), the applications being located and accessible via a physical path. For example, Referring to
The method 300 further includes an act of matching queues to applications by matching the hierarchical naming structure to application locations (act 306). In one embodiment, matching queues to applications (act 306) includes matching using a best match method by matching prefix parameters of the queue names and application locations. As described previously, a score may be a assigned to matches of prefixes of hierarchical queue names and application locations to discover a best match. In the example above, a queue that is named myapp/a/b/x.svc is compared to three applications at c:\foo \a, c:\foo \a\b, and c:\foo \b. Of the applications, the application at c:\foo \a receives a score of 2, the application at c:\foo \a\b receives a score of 4, and the application at c:\foo \b receives a score of 0. As such, the application at c:\foo \a\b is correlated to the queue- named myapp/a/b/x.svc.
In the method 300 illustrated at
In the method to 300 illustrated at
In the method 300 illustrated at
In the method 300 illustrated at
The method 300 may further include setting up a queue monitor for each queue matched to an application. For example, and referring again to
The following discussion is intended to provide a brief, general description of a suitable computing environment in which the invention may be implemented. Although not required, the invention will be described in the general context of computer-executable instructions, such as program modules, being executed by computers in network environments. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Computer-executable instructions, associated data structures, and program modules represent examples of the program code means for executing steps of the methods disclosed herein. The particular sequence of such executable instructions or associated data structures represents examples of corresponding acts for implementing the functions described in such steps.
Those skilled in the art will appreciate that the invention may be practiced in network computing environments with many types of computer system configurations, including personal computers, hand-held devices, multi-processor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, and the like. The invention may also be practiced in distributed computing environments where tasks are performed by local and remote processing devices that are linked (either by hardwired links, wireless links, or by a combination of hardwired or wireless links) through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.
Embodiments may also include computer-readable media for carrying or having computer-executable instructions or data structures stored thereon. Such computer-readable media can be any available media that can be accessed by a general purpose or special purpose computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to carry or store desired program code means in the form of computer-executable instructions or data structures and which can be accessed by a general purpose or special purpose computer. When information is transferred or provided over a network or another communications connection (either hardwired, wireless, or a combination of hardwired or wireless) to a computer, the computer properly views the connection as a computer-readable medium. Thus, any such connection is properly termed a computer-readable medium. Combinations of the above should also be included within the scope of computer-readable media.
Computer-executable instructions comprise, for example, instructions and data which cause a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.
The present invention may be embodied in other specific forms without departing from its spirit or essential characteristics. The described embodiments are to be considered in all respects only as illustrative and not restrictive. The scope of the invention is, therefore, indicated by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7873964 *||Oct 30, 2006||Jan 18, 2011||Liquid Computing Corporation||Kernel functions for inter-processor communications in high performance multi-processor systems|
|US7908372||Jun 12, 2007||Mar 15, 2011||Liquid Computing Corporation||Token based flow control for data communication|
|US8284802||Aug 9, 2010||Oct 9, 2012||Liquid Computing Corporation||High performance memory based communications interface|
|US8631106||Jun 12, 2007||Jan 14, 2014||Kaiyuan Huang||Secure handle for intra- and inter-processor communications|
|US8819701||Dec 12, 2009||Aug 26, 2014||Microsoft Corporation||Cloud computing monitoring and management system|
|US9110739||Jun 7, 2011||Aug 18, 2015||Microsoft Technology Licensing, Llc||Subscribing to multiple resources through a common connection|
|US20110289159 *||May 20, 2010||Nov 24, 2011||International Business Machines Corporation||Message broadcasting in a clustered computing environment|
|EP2510653A2 *||Nov 5, 2010||Oct 17, 2012||Microsoft Corporation||Cloud computing monitoring and management system|
|WO2011071624A2||Nov 5, 2010||Jun 16, 2011||Microsoft Corporation||Cloud computing monitoring and management system|
|Cooperative Classification||G06F2209/543, G06F9/542, G06F9/546|
|European Classification||G06F9/54M, G06F9/54B|
|Dec 9, 2005||AS||Assignment|
Owner name: MICROSOFT CORPORATION, WASHINGTON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:DRIVER, DAVID O.;KIZER, GEOFFREY M.;SRINIVASAN, KRISHNAN;AND OTHERS;REEL/FRAME:016876/0236;SIGNING DATES FROM 20051112 TO 20051118
|May 16, 2012||FPAY||Fee payment|
Year of fee payment: 4
|Dec 9, 2014||AS||Assignment|
Owner name: MICROSOFT TECHNOLOGY LICENSING, LLC, WASHINGTON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MICROSOFT CORPORATION;REEL/FRAME:034543/0001
Effective date: 20141014