Abstract: A computer program product and computer readable storage medium directed to decentralized load placement in an event-driven system so as to minimize energy and cooling related costs. Included are receiving a data flow to be processed by a plurality of tasks at a plurality of nodes in the event-driven system having stateful and stateless event processing components, wherein the plurality of tasks are selected from the group consisting of hierarchical tasks (a task that is dependent on the output of another task), nonhierarchical tasks (a task that is not dependent on the output of another task) and mixtures thereof. Nodes are considered for quiescing whose current tasks can migrate to other nodes while meeting load distribution and energy efficiency parameters and the expected duration of the quiesce provides benefits commensurate with the costs of quiesce and later restart.

Abstract: A computer program product and computer readable storage medium directed to decentralized load placement in an event-driven system so as to minimize energy and cooling related costs. Included are receiving a data flow to be processed by a plurality of tasks at a plurality of nodes in the event-driven system having stateful and stateless event processing components, wherein the plurality of tasks are selected from the group consisting of hierarchical tasks (a task that is dependent on the output of another task), nonhierarchical tasks (a task that is not dependent on the output of another task) and mixtures thereof. Nodes are considered for quiescing whose current tasks can migrate to other nodes while meeting load distribution and energy efficiency parameters and the expected duration of the quiesce provides benefits commensurate with the costs of quiesce and later restart.

Abstract: A computer-implemented method, computer program product and computer readable storage medium directed to decentralized load placement in an event-driven system so as to minimize energy and cooling related costs. Included are receiving a data flow to be processed by a plurality of tasks at a plurality of nodes in the event-driven system having stateful and stateless event processing components, wherein the plurality of tasks are selected from the group consisting of hierarchical tasks (a task that is dependent on the output of another task), nonhierarchical tasks (a task that is not dependent on the output of another task) and mixtures thereof. Nodes are considered for quiescing whose current tasks can migrate to other nodes while meeting load distribution and energy efficiency parameters and the expected duration of the quiesce provides benefits commensurate with the costs of quiesce and later restart.

Abstract: A computer-implemented method, computer program product and computer readable storage medium directed to decentralized load distribution in an event-driven system. Included are receiving a data flow to be processed by a plurality of tasks at a plurality of nodes in the event-driven system having stateful and stateless event processing components, wherein the plurality of tasks are selected from the group consisting of hierarchical tasks (a task that is dependent on the output of another task), nonhierarchical tasks (a task that is not dependent on the output of another task) and mixtures thereof. Tasks are considered for migration to distribute the system load of processing tasks. The target node, to which the at least one target task is migrated, is chosen wherein the target node meets predetermined criteria in terms of load distribution quality.

Abstract: A computer-implemented method, computer program product and computer readable storage medium directed to decentralized load distribution in an event-driven system. Included are receiving a data flow to be processed by a plurality of tasks at a plurality of nodes in the event-driven system having stateful and stateless event processing components, wherein the plurality of tasks are selected from the group consisting of hierarchical tasks (a task that is dependent on the output of another task), nonhierarchical tasks (a task that is not dependent on the output of another task) and mixtures thereof. Tasks are considered for migration to distribute the system load of processing tasks. The target node, to which the at least one target task is migrated, is chosen wherein the target node meets predetermined criteria in terms of load distribution quality.

Abstract: A computer-implemented method, computer program product and computer readable storage medium directed to decentralized load placement in an event-driven system so as to minimize energy and cooling related costs. Included are receiving a data flow to be processed by a plurality of tasks at a plurality of nodes in the event-driven system having stateful and stateless event processing components, wherein the plurality of tasks are selected from the group consisting of hierarchical tasks (a task that is dependent on the output of another task), nonhierarchical tasks (a task that is not dependent on the output of another task) and mixtures thereof. Nodes are considered for quiescing whose current tasks can migrate to other nodes while meeting load distribution and energy efficiency parameters and the expected duration of the quiesce provides benefits commensurate with the costs of quiesce and later restart.

Abstract: A system and method to support runtime model extension in an Object Relational Mapping (ORM) System. The system includes a relational data storage subsystem for storing and retrieving objects in form of relational data, a tuple storage subsystem for storing and retrieving objects in form of tuple, and a dispatcher/assembler for storing and retrieving original part and extended part of the object respectively into/from the relational data storage subsystem and the tuple storage subsystem. Thus, model extension can be carried out dynamically in the runtime of the ORM system without modifying schema and migrating data in the relational database.

Abstract: A method and system for manipulating or modifying identifiable objects in a standard broadcast or Internet-based multimedia stream according to a control specification and a content specification. Viewers and/or organizations can independently specify acceptable levels of content on multiple dimensions to satisfy the content specification while minimizing the filtering or blocking to the viewers. A “fuzz ball” control specification is provided for masking some portion of a video frame. Several fuzz ball specifications can be overlaid to address multidimensional content specifications or rating systems. The manipulation of the multimedia stream can take place at the client (set-top box or computer), intermediate node, the content server or a combination thereof. Proxy servers can modify content specifications for outgoing requests, enabling organizations to specify intranet-wide policies.

Abstract: Method, system and computer program product for collaboratively processing a data object in a client-server hierarchy based on meta-information associated with the object. Processing results are indicated by the server that performed the processing as updates to the meta-information associated with the data object. The PICS protocol may be used to communicate the meta-information. Digital signing and authentication of the object and associated meta-information are also described. Further, servers can determine processing by considering various factors, e.g., their current load condition; if the object is to be multicast; if the object can be cached; and/or if the specified cost and time constraints can be met. The overall processing applied to data objects can be divided between servers based on object types, steps, functions, software packages or versions/releases. Other aspects of the invention are also described.

Abstract: A method, apparatus and computer program product for identifying and creating persistent object fragments from a named object. For example, a digital content description of a named digital object can be dynamically parsed, and persistent fragment identities created and maintained to facilitate caching. Named digital objects include but are not limited to: Web pages described in XML, SGML, and HTML. The object description is revised by replacing each object fragment with its newly created persistent identity. The revised object description is then sent to the requesting node. Depending upon the properties of a fragment, this can either enable the fragment or the revised object description to be cacheable at the server and/or client device. For example, the object description can include a dynamic part which would otherwise prevent the object from being cached. The dynamic part can be recognized and treated as a separate fragment from the object description.

Abstract: A method and apparatus to dynamically maintain META-tag information specifying categorization and/or degree of compound documents, which are collections or hierarchy of collections of objects (possibly web pages), for efficient retrieval of leaf or intermediate objects with specific characteristics without the need to search any content of the collection. The specific characteristic and the contents of the collection can change constantly both qualitatively and quantitatively (including the insertion, deletion and update of objects). While dynamically maintaining the META-tag information, there are no inclusion restrictions on these compound documents, i.e., any collection can contain itself either directly or recursively; and all objects within a META-tagged compound document are not required to participate.

Abstract: A push-based filtering of objects in a client-server hierarchy based on usage information. A method of annotating a push object with meta information on its content and/or urgency is also described. Objects can be staged at the server(s) to provide fast access when the filtered object is later requested. The PICS protocol may be used to communicate various types of information: e.g., by the content provider or a higher level proxy to annotate the object, including an urgency, a summary or title, a group classification, and/or an identity of the push; to convey usage or preference information on pushed objects up the hierarchy, including usage information and user preferences based on object group classifications; and to convey a staging status of each staged object down the hierarchy to improve caching efficiency. An object may include a content hierarchy such as a title, a summary and the full content.

Abstract: A method and system of collaboratively caching information to allow improved caching decisions by a lower level or sibling node. In a caching hierarchy, the client and/or servers may factor in the caching status at the higher level in deciding whether to cache an object and which objects are to be replaced. The PICS protocol may be used to pass the caching information of some or all the upper hierarchy down the hierarchy. Furthermore, the caching status information can also be used to direct the object request to the closest higher level proxy which has potentially cached the object, instead of blindly requesting it from the next immediate higher level proxy. A selection policy used to select objects for replacement in the cache may be prioritized not only on the size and the frequency of access of the object, but also on the access time required to get the object if it is not cached.

Abstract: A system and method which can efficiently develop new and revised advisories on content loaded (or available to be loaded) by a client from a content server via a protocol between the client and any number of advisory servers that maintain "ratings" knowledge bases. In one example, the advisory servers can be any number of independent non-co-located or combined servers in the World Wide Web. Alternatively, the functions of the advisory server can be integrated with the functions of the content server. Advisories can be efficiently developed based on rational factors, including: suggestions from users of an advisory service; as yet unrated content for which queries are being received; and requests from providers of new and revised primary content. Embodiments of the operation of an advisory server and reviewer's tool are described wherein content which clients are sending queries about, but which have not yet been reviewed, (i.e.

Abstract: The content of free speech over distributed networks, such as the Internet, is often inappropriate for minors as well as offensive to some adults. The invention comprises an advisory server operated by, for example, a third party watchdog group, which rates the content of data downloaded from a content server to a client in order to block or censor unwanted material. In operation, each time data (e.g., a web page) is downloaded from a content server to the client, prior to display, the client sends a request signal to the advisory server asking that it advise the client on the content of the web page. The advisory server rates the page and sends a classification rating back to the client. The client thereafter displays or does not display the web page according to the classification rating based on the client's selected preferences. The advisory server may also assign a rating to any links contained on the web page or may also be asked by the client to block any pages which require a fee.

Abstract: In a scheduling system, events and/or groups of events are checked at a scheduling time to insure that certain fixed conditions associated with the event(s) are satisfied. The events are also checked at one or more times, between scheduling time and a performance time (when the event(s) are to be performed), called "prepare to perform time(s)." At the prepare to perform time(s), certain dynamic conditions and/or data associated with the events are checked to determine whether the dynamic conditions are satisfied. If the dynamic conditions are satisfied, the event(s) are confirmed for performance. If one or more of the dynamic conditions are not satisfied, the event(s) are modified. Events can be modified by cancelling, altering or postponing. When an event(s) is modified, a notification can be sent out. Further, a modification of a event(s) can cause modifications to one or more subsequent events in the event group (propagation.