Abstract:
A computer system having a chief system control program (CHIEF SCP) running in a real machine as a host where the host controls standard system control programs (SCP's)(SCP(1), SCP(n)) and controls virtual machines (Domains) called guests (GUEST (a), GUEST (p)). Guests operate with interpretive execution as second-level guests. Control is transferred from a second-level guest to the guest SCP or to the chief SCP with only one control interception. Control is transferred directly between the second-level guest and Chief SCP bypassing the first-level guest.
Abstract:
A computer system that has means for processing (266) interrupt requests that are generated both by hardware interrupt request generators (260..., 265) and by control software (264). A common register array is provided having locations for the general registers and the control registers and having specifically interrupt register locations (261) for storing interrupt requests. The hardware generators (260..., 265) store the interrupt requests into the interrupt register locations (261). Similarly, the control software (264) reads and writes to the interrupt register locations (261) whereby interrupt requests can be generated and terminated in a unified manner under software and hardware control.
Abstract:
A file system for managing data files for access by a plurality of users of a data processing system that includes internal storage (41) for buffering, external storage (44), and a file user interface (I) by which the plurality of users request access to data files. A first level, coupled to the file user interface (41) for temporary storage of data to be accessed by the plurality of users, and generates requests for transactions with external storage (44) in support of such allocations. A second level is coupled to the first level and the external storage (44) and responds to the request for transactions with the external storage (44) for managing the transactions for storage of data to, and retrieval of data from, the external storage (44).
Abstract:
To perform a sort of N records, a two-dimensional tree structure is formed with a tree of subtrees, where each subtree is formed by a plurality of nodes organized in a binary tree. For each leaf node in the tree, there is an ancestor chain of nodes (from child to parent, from parent to grand-parent, from grand-parent to great-grand-parent, ... and so on) that connects each leaf node to the root node. To perform the sort, the processing unit stores codes representing keys into nodes in the two-dimensional tree and performs a tree sort of the keys using the codes. The codes are accessed in the subtrees and processed to determine the sort order of the keys and therefore the sort order of the corresponding records. The size of the subtrees is adapted to the size of the cache.
Abstract:
A distributed computing system (6) having a distributed protocol stack (12). In a system including one or more general purpose computers or other application processors (8) for running applications (22), the distributed protocol stack (12) off-loads communication or other I/O processing from the application processor (8) to dedicated I/O processors (9) using a STREAMS environment thereby enhancing the performance/capacity of the system. The distributed protocol stack (12) is formed of a STREAMS stack top (15) and a stack bottom (16) so that together the stack top (15) and stack bottom (16) comprise a full stack (12) functionally equivalent to a non-distributed stack running on an application processor (8). Both the application processors (8) and the I/O processors (9) together appear to execute the full protocol stack (12), but the application processor (8) only executes the stack top (15) while the I/O processor only executes the stack bottom (16).
Abstract:
A set of scan latches (SL) is partitioned into unique groups (243a, b, c) where each group is addressable by a group initializing circuit (350, 360). The group initializing circuit initializes all the latches of an addressed group to a predefined state thereby quickly loading a test vector into the addressed group of scan latches while leaving other latches undisturbed.
Abstract:
A system for program development and execution consisting of a high level programming language based on a four part rule organization (31), consisting of a rule definition, a list of conditions, a list of actions taken upon satisfaction of a corresponding condition, and a list of exception handlers. Data access events are supplied through a table access method (21) which provides an interface to the variety of sources of data (22-30) coupled to the system. A table data store (103) organizes data in an object oriented, relational system, where each table is ordered on a primary key (502). The table access method (21) performs selection and ordering operations on the tables accessible through the table access method (21), implements and triggers invalidation routines upon data access events, and provides a common view of data stored across heterogeneous data stores coupled through servers (203-205) to the table access method (21). Ordered tables (103) are subdividable by additional parameters associated with table names.