Abstract: Apparatus is provided for reliably generating a random number sequence. The apparatus comprises a digital pseudo-random number sequence generator having a first output and an analog random number sequence generator having a second output. The pseudo-random number sequence on the first output and the random number sequence on the second output are combined using logic such as an exclusive-OR operation to generate an output number sequence.

Abstract: One embodiment of the present invention provides a capacitively-coupled receiver amplifier that has an input with no DC coupling. A DC voltage is programmed on the input. During programming, a transmitter is held at a voltage at a midpoint between a voltage that represents a logical “1” and a voltage that represents a logical “0” and the input voltage of the receiver amplifier is programmed to be substantially the switching-threshold voltage for the receiver amplifier. Then, during normal data communication, the transmitter drives high and low electrical signals that are coupled to the receiver amplifier. Since the input of the receiver amplifier has been substantially set to the DC voltage, the receiver amplifier need not control the DC voltage of the input for each transition in the electrical signals.

Abstract: A system and method for discovering nodes in an M×N torus interconnection fabric of nodes is provided. The method comprises probing an M×N torus interconnection fabric, wherein M and N are integer values and said interconnection fabric includes a first plurality of nodes forming an x-axis and a second plurality of nodes forming a y-axis; and identifying a location of a first node relative to the x and y axes. The computer system comprises an M×N array of nodes, wherein M and N are integer values; and a plurality of interconnects connecting the M×N array. A first plurality of nodes in the M×N array form an x-axis in the M×N array, a second plurality of nodes in the M×N array form a y-axis in the M×N array, and a first node in the M×N array is configured to probe the M×N array to identify a location of the first node relative to the x-axis and the y-axis.

Abstract: A computer-implemented method and apparatus for indicating a failover data path in a graphical user interface environment is provided. The method includes graphically displaying at least one source device; graphically displaying at least one target device; graphically displaying a first data path between at least one source device and at least one target device; and in response to a failure in the first data path: graphically indicating the failure in the first data path; and graphically displaying a failover data path.

Abstract: The present invention provides a method and apparatus for implementation of an input/output stream operator in a dynamically typed language. This operator is built into the language, and allows a value of one type to be streamed to a value of another type by taking the form fromvalue?tovalue. Since the programming language is dynamic, the type of values on either side of the ? operator is of any supported type, and can be modified depending upon the type of operands. For example, a value of any type can be streamed to a value of type “stream”. In this instance, the destination value is attached to, for example, a device such as a terminal or disk drive. A value of type “stream” can also be streamed into a value of any type. In this instance an external source is inputted, for example, into a program.

Abstract: An external cache management unit for use with 3D-RAM and suitable for use in a computer graphics system is described. The unit maintains and tracks the status of level one cache memory in the 3D-RAM. The unit identifies dirty blocks of cache memory and prioritizes block cleansing based on a least used algorithm. Periodic block cleansing during empty memory cycles is provided for, and may also be prompted on demand.

Abstract: A method of automating enforcement of a data validation rule associated with an input field by a Model View Controller software application includes applying an input constraint embodying the data validation rule to a Model to generate an applied constraint, discovering the applied constraint via examination of the Model by a View-Controller Generator to generate a discovered constraint, generating an input field constraint mechanism using the discovered constraint, and constraining the input field using the input field constraint mechanism to generate a constrained input field.

Abstract: A method for marking a transaction, comprising defining an application as a plurality of states, wherein each of the plurality of states is associated with at least one transition, specifying a transaction set comprising at least one of the plurality of states, specifying a commit set comprising at least one of a plurality of states, and marking the transaction using a transaction marking procedure, wherein the transaction marking procedure marks the transaction based on the transaction set, the commit set, and at least one of the plurality of transitions.

Abstract: Disclosed is a method for managing resource usage of a particular resource by a set of related code, such as code executed on behalf of a downloaded applet. A resource indicator is associated with the related code, and the resource indicator indicates an amount of resource usage of the particular resource by the related code. The resource indicator is updated when the related code increases or decreases its collective resource usage of the particular resource.

Abstract: One embodiment of the present invention provides a system that solves an unconstrained interval global optimization problem specified by a function ƒ, wherein ƒ is a scalar function of a vector x=(x1, x2, x3, . . . xn). The system operates by receiving a representation of the function ƒ, and then performing an interval global optimization process to compute guaranteed bounds on a globally minimum value ƒ* of the function ƒ(x) and the location or locations x* of the global minimum. While performing the interval global optimization process, the system deletes all of part of a subbox X for which ƒ(x)>ƒ_bar, wherein ƒ_bar is the least upper bound on ƒ* that has been so far found. This is called the “ƒ_bar test”. The system applies term consistency to the ƒ_bar test over the subbox X to increase that portion of the subbox X that can be proved to violate the ƒ_bar test.

Abstract: The invention relates to the processing of state information such as interrupt status in a hierarchical network of nodes having a tree configuration. There is a root node at the top of the hierarchy, one or more intermediate nodes, and a plurality of leaf nodes at the bottom of the hierarchy. Each leaf node is linked to the root node by zero, one or more intermediate nodes. Each leaf node maintains information about one or more interrupt states, and each intermediate node maintains information derived from the interrupt states of leaf nodes below it in the hierarchy. This interrupt information is then processed by navigating from the root node to a first leaf node having at least one set interrupt state which is then masked out. The status of any intermediate nodes between this first leaf node and the root node is then updated if appropriate to reflect the fact that the particular interrupt state at the first leaf node is now masked out.

Abstract: One embodiment of the present invention provides a system that solves a global optimization problem specified by a function ƒ and a set of inequality constraints pi(x)?0 (i=1, . . . , m), wherein ƒ and pi are scalar functions of a vector x=(x1, x2, x3, . . . xn). The system operates by receiving a representation of the function ƒ and the set of inequality constraints, and then storing the representation in a memory within the computer system. Next, the system performs an interval inequality constrained global optimization process to compute guaranteed bounds on the minimum value of the function ƒ(x) subject to the set of inequality constraints. While performing the interval global optimization process, the system applies term consistency at various places in the process over a subbox X, and excludes any portion of the subbox X that violates term consistency.

Abstract: The present invention provides a method and apparatus for a bandwidth adaptive image compression/decompression scheme. In one embodiment, the present invention uses a special protocol between the sender and the receiver to measure the latency of the connection. This protocol and its result are sent and received at an interval based on a dynamic feedback loop algorithm. Based on the results of the protocol, a compression scheme is chosen. This scheme uses CPU time conservatively, and also transmits the most interesting data first. In another embodiment, the present invention throws away data that is repetitious, especially when the connection is down for a short period of time. In yet another embodiment of the present invention, measurements are taken for the perceptual degradation of the image for various compression schemes, and the results are supplemented with the results of the protocol to choose a viable compression/decompression scheme.

Abstract: A garbage collector that operates in accordance with the train algorithm designates some cars as “special” cars into each of which at most a single object is allowed. When an object in a car being collected is referred to by a reference located in such a special car, the collector may depart from the conventional evacuation approach of placing the evacuated object into the train containing the reference referring to it. If the reference is located in an object referred to from a train younger than the train in which the reference is located, the referred-to object in the car being collected is not evacuated to the train that contains the reference to it. Instead, it is evacuated to the train from which the object containing that reference is referred to.

Abstract: Various embodiments of systems and methods for implementing filter-based attribute value access control are disclosed. In one embodiment, a method involves designating a location in the directory server, providing attribute related data that includes a filter expression, and selectively controlling access to an entry situated at the designated location using the filter expression in the attribute related data. For example, access to an attribute of the entry may be denied if a criterion defined by the filter expression associated with the attribute is not met by a first value of the attribute.

Abstract: A distributed system provides for separate management of dynamic cluster membership and distributed data. Nodes of the distributed system may include a state manager and a topology manager. A state manager handles data access from the cluster. A topology manager handles changes to the dynamic cluster topology. The topology manager enables operation of the state manager by handling topology changes, such as new nodes to join the cluster and node members to exit the cluster. A topology manager may follow a static topology description when handling cluster topology changes. Data replication and recovery functions may be implemented, for example to provide high availability.

Abstract: Method and apparatus are disclosed that allow boot code within the apparatus to be updated using a system controller. The apparatus includes a central processing unit (CPU) and a programmable memory that contains boot code at a predetermined location for use in booting the CPU. The apparatus further includes a bus and a bus master for the bus. The CPU accesses the boot code via the bus and the bus master. The apparatus further includes a system controller. This is operable to write boot code into the programmable memory over the bus. In one embodiment, the above components form a single subsystem within an array of such subsystems. A single control point for the array can transmit updated boot code to the system controller for loading into the programmable memory. This then provides a single interface for simultaneously updating the boot code in all subsystems.

Abstract: Mechanisms and techniques provide a system for composing a complex constructs for use on a graphical display of a computerized device. The system receives a selection of basic constructor objects for use in the complex object. The basic constructor objects are chosen from a set of basic constructor object types including a button object type, a dial object type, an edit object type, and a container object type. The systems also receives a selection of one or more personalities to assign to the basic constructor objects. The personalities define extensions to basic constructor object operation and define a view for the object when rendered on an interface. The system combines the personalities and the basic constructor objects to define complex constructs such as menus, a scrollbars and the like. Personalities can be modified to alter the complex construct from one operational state to another.

Abstract: A register window spill technique for an retirement window having an entry size less than a number of spill instructions used in a spill condition is provided. The technique uses modified spill instructions that allow the retirement window to retire a portion of the spill instructions without having to determine whether a remaining portion of the spill instructions will execute without exceptions.

Abstract: A rendering unit positions a supertile so that it intersects a primitive. The rendering unit repeatedly walks over bins of the supertile, applying a layer of texture to the bins of the supertile in each iteration of said repeated walking. The rendering unit advances to the next texture layer after having applied the current texture layer to each candidate bin of the supertile. The results of each texture layer application to the bins may be stored in a texture accumulation buffer. The size of the supertile corresponds to the size of the texture accumulation buffer. After applying a last layer of texture to the bins of the supertile, the supertile may be advanced to a new position. The rendering unit traverses the primitive with the supertile so that the union of areas visited by the supertile covers the primitive.