Abstract: A symmetrical multiprocessing system includes a plurality of nodes interconnected by a hierarchical bus. To allow for the transfer of data between nodes and to restrict the global transfer of local transactions, a plurality of address partitions are defined: global space, local space, remote read space, and remote read and write space. Process private and local data is accessed using local space. Global data is accessed using global space. In one embodiment, a kernel of the operating system is resident in the local space of each node.

Abstract: An improved system for database query processing by means of “query decomposition” intercepts database queries prior to processing by a database management system (“DBMS”). The system decomposes at least selected queries to generate multiple subqueries for application, in parallel, to the DBMS, in lieu of the intercepted query. Responses by the DBMS to the subqueries are assembled by the system to generate a final response. The system also provides improved methods and apparatus for storage and retrieval of records from a database utilizing the DBMS's cluster storage and index retrieval facilitates, in combination with a smaller-than-usual hash bucket size.

Abstract: A method for acquiring and storing schedule event information in an interactive television system. The schedule event information includes events and a start time and date for each of the events. The method includes creating a window defined by a start time and date and an end time and date and receiving the schedule event information at a receiving station. The schedule event information is stored for events having a start time and date within the window. The method further includes automatically moving the window forward relative to the start time and date at a specified interval such that the end time and date of the window are always after a current time and date. A system for acquiring and storing schedule event information is also disclosed.

Abstract: A computer system comprises a plurality of processes, each having an associated memory region, and a shared memory region shared by the processes. One of the processes is configured to control allocation of space for an array in the shared memory region, generate a descriptor therefor pointing to the allocate space and transmit the descriptor to the other processes. Therafter, all of the processes are configured to identify regions of the array for which they are to process data therein, and to perform predetermined processing operations in connection therewith.

Abstract: A method and mechanism for configuring a node in a computing system to route data to a predetermined observation point. A node in a computing device or system is configured to identify and convey an observation data stream via a non-critical path. A non-critical path is configured within the computer system for the transmission of the generated stream of data to a convenient client location where the data may be observed. This stream of data is routed through the computer system via disabled, replicated, monitor or other links which correspond to a non-critical path. The observation data stream conveyed by the node may be generated by the node and correspond to an internal state of the node. Additionally, the node may be configured to duplicate and convey received data streams or extract debug data from a received data stream for conveyance to a predetermined observation point.

Abstract: A method and mechanism operating within the Application layer of the architectural model for maintaining high availability in a two node computer network which utilizes alternate pathing. A failover mechanism operating within the Application layer monitors the original, primary network path. Upon detecting a failure of the primary path, the failover mechanism halts monitoring of the primary connection, configures the alternate network interface with the parameters of the primary network interface, and brings up the backup interface.

Abstract: A method and mechanism of enforcing, in a computer network, a community separation policy wherein the data of a particular user community should be accessible only by members of that community. A Multi-Community Node (MCN) processes information for users in multiple communities and must enforce the community separation policy. In an open MCN, which may run both trusted and untrusted applications, the method and mechanism performs a set of checks on packets received from and to be transmitted on a network, and on application processes which correspond to those packets, to ensure that all communications comply with the community separation policy. The enforcement method and mechanism use a database of associations of sets of communities corresponding to ports, applications, and other network addresses within the computer network.

Abstract: A method and mechanism for performing an unconditional stack switch in a processor. A processor includes a processing unit coupled to a memory. The memory includes a plurality of stacks, a special mode task state segment, and a descriptor table. The processor detects interrupts and accesses a descriptor corresponding to the interrupt within the descriptor table. Subsequent to accessing the descriptor, the processor is configured to access an index within the descriptor in order to determine whether or not an interrupt stack table mechanism is enabled. In response to detecting the interrupt stack table mechanism is enabled, the index is used to select an entry in the interrupt stack table. The selected entry in the interrupt stack table indicates a stack pointer which is then used to perform an unconditional stack switch.

Abstract: A system and method implemented in an interactive television system for scheduling delivery of modules of interactive television applications from a broadcast station to a receiving station. In one embodiment, a list of modules and corresponding start times, end times and durations is provided. Minimum beginning times and maximum beginning times are determined for each of the modules. The modules in the list are prioritized, first according to minimum beginning times and then according to maximum beginning times. A module having the earliest maximum beginning time is selected from those modules for which the minimum beginning time is equal or prior to a current time. A portion of the selected module is scheduled. After a portion of a module is scheduled, the information in the module list is updated, the modules in the list are re-prioritized, and another module is selected for scheduling. This is repeated until all of the modules have been scheduled.

Abstract: A method and mechanism operating within the Application layer of the architectural model for maintaining high availability in a computer network utilizing trunking technology. A backup connection is created wherein a second multi-port network card is added to a node of a computer network. A failover mechanism operating within the Application layer monitors an original, primary trunked network connection. Upon detecting a degradation in performance of the primary trunked connection that exceeds a threshold, the failover mechanism halts monitoring of the primary trunked connection, configures the second multi-port network interface with the parameters of the primary multi-port network interface, and brings up the second interface.

Abstract: A method and mechanism operating within the Application layer of the architectural model for maintaining high availability in a two node computer network. A backup connection is created wherein a second network card is added to each node of a two node network and a crossover cable is coupled between them. Each backup network card is configured with dummy parameters and taken down upon startup. A failover mechanism operating within the Application layer monitors the original, primary network connection. Upon detecting a failure of the primary connection, the failover mechanism halts monitoring of the primary connection, configures the backup network interface with the parameters of the primary network interface, and brings up the backup interface.

Abstract: A system and method implemented in an interactive television system for selectively controlling the verification of interactive television content delivered to a receiver wherein a notification is provided to the receiver to identify content which can be trusted and, when trusted content is delivered to the receiver, verification procedures on the trusted content are inhibited. The notification may be delivered prior to or with the trusted content, and it may be delivered via the same transmission means as the content or by some separate delivery means. The notification may identify the trusted content positively or negatively and may use wildcards in the identification. The trusted content may be identified by its source (e.g., a trusted channel) or by reference to the content itself. The notification may contain an expiration time beyond which is no longer valid.

Abstract: A method and mechanism, operating within an application layer of the architectural model of a communications protocol, for maintaining high availability in a computer network utilizing virtual Internet Protocol (IP) addresses. A backup connection is created wherein a second network card is added to a node of a computer network. A failover mechanism operating within the application layer captures an original virtual IP configuration corresponding to a primary network connection of the node and monitors the primary network connection. Upon detecting a failure of the primary network connection, the failover mechanism halts monitoring of the primary connection, captures the current virtual IP configuration of the primary network connection, configures the second network interface with the parameters of the primary network interface, and brings up the second interface. If the current virtual IP configuration was successfully captured, it is used in the configuration of the second interface.

Abstract: A communications arrangement is described for facilitating transfer of messages among a plurality of processes in a computer system. The communications arrangement comprises a channel data structure, a status daemon and an exit handler. The channel data structure includes a channel status flag normally having one of a plurality of conditions, and a plurality of storage locations each configured to receive message information. The status daemon is configured to determine the operational status of the processes. The exit handler is configured to, in response to the status daemon determining a predetermined condition in connection with at least one of the processes, condition the channel status flag to another of the conditions, thereby to indicate to the other processes a failure condition in connection with the communications arrangement.

Abstract: A multiprocessor digital data processing system comprises a plurality of processing cells arranged in a hierarchy of rings. The system selectively allocates storage and moves exclusive data copies from cell to cell in response to access requests generated by the cells. Routing elements are employed to selectively broadcast data access requests, updates and transfers on the rings.

Abstract: A bi-directional output buffer includes active termination and separate driving and receiving impedances. The buffer has at least a driving mode and a receiving mode. In driving mode, the output impedance of the buffer is calibrated to a specified strength. In receiving mode, the buffer is calibrated to another specified impedance as an active termination. In addition, the buffer may be configured such that resistive components are shared in driving and receiving modes.

Abstract: A method and system for incorporating previously broadcast content into a program recording. The method includes receiving a broadcast containing a program and automatically recording the broadcast at the start of the program to store a first portion of the program in a first storage area. Space is allocated within a second storage area after the start of the program upon receiving a record command from a viewer. A second portion of the program is recorded in the allocated space of the second storage area and the first and second portions of the program are combined within the second storage area to create a recording of the program.

Abstract: In a first aspect of the invention, branch prediction hardware, comprising logic and interconnect, is configurable via a control line to alter the manner in which the branch prediction is generated. The configuration can be done programmatically in software. Or, the configuration can be done by hardware in response to processor events. Such processor events include the loading of the CS register and changes in the instruction workload. In a second aspect of the invention, related to speculative execution, the directions of a plurality of branches are predicted based partly on resolved branch history information. Tentative branch history information is then stored for each of the predicted branches. When a predicted branch is resolved, the resolved branch history information is updated based on the stored tentative branch history information for the branch most recently resolved. Additionally, the predictions may be partly based on preceding unresolved branch predictions if any are outstanding.

Abstract: Method and system for configuring a network computer to distinguish between a first address path for a first logging module and a second address path for a second logging module for a log report, using full distinguished names (FDNs) that provide first and second address paths for the first and second logging modules, where the first and second address paths have different object level addresses at an object level immediately below the root level. Where a local distinguished name (LDN) (or relative distinguished name RDN) is used for an address path, the system forwards a log report to an associated Log Server only if the first component of the address path is a selected object level address, such as ‘/system’.

Abstract: A portion of the global memory of a multiprocessing computer system is allocated to each node, called local memory space. Data from a remote node may be copied to local memory space of a node such that accesses to the data may be performed locally rather than globally. The global address of the data is translated to a local physical address for the node to which the data is copied. To reduce the size of the translation tables for converting between global addresses and local physical addresses, multiple pages of the address space are mapped to an entry in a translation table. To decrease the probability that an entry is not available for a page, the translation table may be implemented as a skewed-associative cache that implements an insertion algorithm that realigns the translations in the table to maximize the utilization of the available entries is implemented.