Abstract: Processing an asynchronous interrupt of a processing entity which executes in a computer system is disclosed. An invocation stack is maintained in the computer system. The invocation stack includes a plurality of stack frames, wherein each of the stack frames has a fixed part of a predetermined length and a variable part of a variable length. An interrupt service routine is pre-defined to service the asynchronous interrupt. Processing of the asynchronous interrupt is performed by determining an address of a next available memory location in the invocation stack. A starting address in the invocation stack for a new stack frame is determined by adding a predetermined "skip" value to the next available memory location address. The new stack frame is to be used by the interrupt service routine.

Abstract: A shared queue is provided to allow any of a plurality of systems to process messages received by clients of a data processing environment. A received message is enqueued onto the shared queue. Any of the plurality of systems having available processing capacity can retrieve the message from the shared queue and process the message. A response to the message, where appropriate, is enqueued onto the shared queue for delivery back to the client. A unique list structure is provided to implement the queue. The list structure is comprised of a plurality of sublists, or queue types. Each queue type is divided into a plurality of list headers. List entries, containing data from the received messages, are chained off of the list headers. A common queue server is used to interface to the queue and to store messages thereon. The common queue server stores message data in storage buffers, and then transfers this data to the list entries. Thus, common queue server coordinates the enqueuing of data onto the shared queue.

Abstract: A method and means for handling events in a computer system which occur during the execution of programs including routines prepared in a plurality of computer programming languages is described. The number and identity of each unique computer programming language used in the preparation of the program is determined using a language list contained in the application program. A unique event handling means (event handler) is initialized for each unique computer programming language used in the program. As the program executes selected events of interest to the event handlers are detected. The parameters associated with the selected event are determined. Optionally the detected events may be divided into two types: broadcast or targeted. Broadcast events are sent to all event handlers (except the debug event handler), whereas, the targeted events are sent to a single event handler.

Abstract: Processing an event signifying a condition in a computer system is described. The computer system maintains an invocation stack which includes a plurality of stack frames. Such event processing operates by selecting a stack frame from the invocation stack, and then determining whether a user specified event processing procedure capable of processing the event has been registered with the selected stack frame. If a user specified event processing procedure has been so registered, then the event is processed using the user specified event processing procedure as specified by a set of rules and options defined for the disposition and/or processing of the specific event. Optionally, it is then determined whether a language specific event processing procedure capable of processing the event has been registered with the selected stack frame.

Abstract: A computer program product for a system and method for destaging changed data from a shared cache castout in a shared data environment distributes castout ownership for a dataset among a plurality of systems having an update interest in the dataset. One system is designated as having castout ownership of the dataset in a primary state. All other systems having an update interest in the dataset hold castout ownership for the dataset in a backup state. When the primary owner relinquishes ownership, primary ownership is passed to one of the backup systems. A structure castout owner for the entire cache assumes the responsibility of castout out changed data for a dataset for which the primary castout owner has had a failure.

Abstract: A data transmission dictionary is provided, which is adapted for use by a computer system for encoding, storing, or retrieving hierarchically related data transmission information. The dictionary is comprised of a group of one or more computer searchable definition trees relating to transmission information of the computer system. The trees are derived from a first definition group which includes characteristics of commands, replies or data usable by the computer system. The characteristics include structure and value properties and restrictions, if any, applying to the commands, replies or data. Each tree represents, respectively, a definition of a the command, reply or data to which it relates. Each tree includes a root node identified by name, e.g., a codepoint. The root node includes information describing the type of definition tree concerned (i.e., whether it relates to a command, reply or data), and may include one or more internal or terminal descendant nodes.

Abstract: A system and method for providing on demand access to information related to a movie while the movie is being presented to a user, where the movie was generated from the movie related information, are described. The system operates by presenting the movie to the user, and then receiving from the user a query pertaining to the movie. The system determines a frame of the movie that was being presented to the user when the user issued the query (the system may extract this information from the query, or may extract this information from the movie itself). The system identifies, as specified by the query, portions of the movie related information relating to the frame, and retrieves those portions of the movie related information. These retrieved portions of said movie related information are presented to the user. Also discussed is a manager to enable users to create personalized versions of movies, and personalized collections of items.

Abstract: A method of creating a data transmission dictionary by deriving a group of one of more computer searchable definition trees from a first definition group of nodes defining portions of commands, replies, or data usable by a computer system, compacting each of the nodes by retaining only information necessary for the processing of data transmission streams according to the definition trees; assembling each definition tree by sequencing the compacted nodes in a linear form, starting with the root node of each of the definition trees, by placing information included in each compacted node in a resulting implemented dictionary; and by assembling each child node in the resulting implemented dictionary and assembling each of the child's child nodes in turn. The process of assembling a terminal node involves placing information included in the terminal node in the resulting implemented dictionary.

Abstract: A data transmission dictionary is provided, which is adapted for use by a computer system for encoding, storing, or retrieving hierarchically related data transmission information. The dictionary is comprised of a group of one or more computer searchable definition trees relating to transmission information of the computer system. The trees are derived from a first definition group which includes characteristics of commands, replies or data usable by the computer system. The characteristics include structure and value properties and restrictions, if any, applying to the commands, replies or data. Each tree represents, respectively, a definition of a the command, reply or data to which it relates. Each tree includes a root node identified by name, e.g., a codepoint. The root node includes information describing the type of definition tree concerned (i.e., whether it relates to a command, reply or data), and may include one or more internal or terminal descendant nodes.

Abstract: A data transmission dictionary is provided, which is adapted for use by a computer system for encoding, storing, or retrieving hierarchically related data transmission information. The dictionary is comprised of a group of one or more computer searchable definition trees relating to transmission information of the computer system. The trees are derived from a first definition group which includes characteristics of commands, replies or data usable by the computer system. The characteristics include structure and value properties and restrictions, if any, applying to the commands, replies or data. Each tree represents, respectively, a definition of a the command, reply or data to which it relates. Each tree includes a root node identified by name, e.g., a codepoint. The root node includes information describing the type of definition tree concerned (i.e., whether it relates to a command, reply or data), and may include one or more internal or terminal descendant nodes.

Abstract: A system for processing diverse and non-diverse result sets is described. The system includes a client process in a client computer system that constructs a client process execution request identifying a stored procedure and specifying constraints on the quantity of response data that the client process is capable of handling. The client process execution request is transferred from the client process in the client computer system to a server process in a server computer system. The server process invokes the stored procedure identified by the client process execution request. Execution of the stored procedure results in the generation of answer set data for a plurality of diverse query result sets. Result set generators obtain answer set data for X of the query result sets, where X is defined by the constraints. The server process then generates an initial response containing, for each of the X query result sets, an amount of the obtained answer set data consistent with the constraints.

Abstract: A data transmission dictionary is provided, which is adapted for use by a computer system for encoding, storing, or retrieving hierarchically related data transmission information. The dictionary is comprised of a group of one or more computer searchable definition trees relating to transmission information of the computer system. The trees are derived from a first definition group which includes characteristics of commands, replies or data usable by the computer system. The characteristics include structure and value properties and restrictions, if any, applying to the commands, replies or data. Each tree represents, respectively, a definition of a the command, reply or data to which it relates. Each tree includes a root node identified by name, e.g., a codepoint. The root node includes information describing the type of definition tree concerned (i.e., whether it relates to a command, reply or data), and may include one or more internal or terminal descendant nodes.

Abstract: Processing of an asynchronous signal directed to a thread comprising a software routine executing in a computer system such that data consistency is maintained is discussed. Such processing proceeds by determining whether the routine is signal safe such that processing of the routine may be interrupted in order to process the signal without possibly causing inconsistency of data. The routine is asynchronously interrupted and the signal is processed immediately if the routine is signal safe. If the routine is not signal safe, then the routine is not asynchronously interrupted and processing of the signal is deferred to a time when the signal may be processed without possibly causing inconsistency of data.

Abstract: In a distributed data processing system comprising a plurality of different computer systems, each system having a central processing unit (CPU), memory, a database stored in the memory, and a DBMS, a computerized method is provided for generating a plurality of objects in a standardized format. A unique object identifier is associated with each of the plurality of objects. Each unique object identifier is stored in memory in association with at least one object location type or instance, an object generation specification for each object location type or instance, and a generation specification type. For a requested object type at a specified location, identifying from the computer memory an object generation specification, and a specification type. The requested object is generated in a standardized format from the specified location using the identified process type and the identified object generation specification.