Abstract: A method of requesting location-based services using a rejection model. Responsive to receiving from a pervasive device a network request for location-based processing, the received network request can be stored prior to being forwarded to a selected location-based application. A rejection response to the forwarded network request can be received subsequently and a request for required location information can be identified in the rejection response. The required location information can be identified within the stored network request and a specific network request can be formulated with the required location information. Finally, the specific network request can be forwarded to the selected location-based application. The selected location-based application, in turn, can perform the requested location-based processing using the required location information provided in the specific network response.

Abstract: A method and system for constructing rule-based intelligent agents that process events on behalf of one or more users. The intelligent agents have event-generating modules that supply events to be processed, and event-processing modules that process the events by evaluating rules. Each event-processing module of the agent includes multiple sets of rules, one or more such sets for each user of the agent. A selection key related to the user is associated with a rule set, and for event-generating modules a selection key indicates the user on whose behalf the event was generated. When the event-processing module receives an event with a selection key, the module locates and evaluates the rule set(s) which have a matching key to launch the corresponding actions.

Abstract: An addressing method using large addresses in a guest/host environment within a computer system. The guests are operating-systems, and the host is a hypervisor program. Each guest has a guest real address space (guest RAS) mapped onto a host large real address space (host LRAS) using means disclosed herein. To do this, each guest RAS is first assigned to a contiguous part of a host large virtual address space (LVAS) by assigning each guest RAS to one or more contiguous units of virtual addressing in the host LVAS, each unit having a 2 gigabyte (GB) size. The host LVAS is represented by a sequence of entries (ALEs) in a host access list (AL), in which each ALE represents a 2 GB unit of virtual addressing in the host LVAS. An ALE is selected in the AL by using a high-order part of a host large virtual address (host LVA) representing a guest RA or LRA. A host LVA is generated from a guest RA for obtaining the guest address in host main storage.

Abstract: A computer system for processing and committing data comprises a processor, an external storage device such as DASD or tape coupled to the processor, and a working memory such as RAM. An application program updates data in the working memory and then requests that the data be committed, i.e. written to the external storage device. In response, an operating system function determines which data or blocks have been changed and supplies to an I/O service an identification of the changed data or blocks to cause the I/O service to write the changed data or blocks to the external storage device. Thus, the application program is not burdened with the management of the I/O. The operating system permits the program to continue with other processing while the data is being written from the working memory to the external storage device. As a result, the program need not wait while the data is written to the external storage.

Abstract: A method and apparatus for providing common access to data spaces by a plurality of virtual machine guests emulated on a host computer system. A token received from a given one of the virtual machine guests is used to identify a particular host data space. The guest also supplies an offset. The offset and the identified host data space are then used to derive a host absolute address representative of a data location in the host data space.

Abstract: A method for executing application programs written in a high level program language on tightly coupled multiprocessor systems in a Multiple Instruction/Multiple Data (MIMD) environment includes the steps of: initializing a MIMD environment in a data processing system by a call to an initialization routine from an application program; maintaining the MIMD environment until all independently executable portions of the application program have been executed; scheduling execution of those tasks representing independently executable portions of the application program; synchronizing execution and completion of the tasks until all tasks have completed execution; terminating the MIMD environment on completion of all the tasks.