Abstract: Factored assert chains allow for improved tracking of implicit information in a computer program. The compiler may generate assert statements at various points in the program where there is implicit information. The dominator tree for the program or section of program may then be constructed. Then ?-nodes may be inserted throughout a control flow graph. Following that, for each statement in the program or section of program, an assert chain may be constructed from each use to the most recent available assert statement for the variable. Then, if the statement is an assert statement, each use may be kept track of as a mapping to an assertion, otherwise a mapping of any reference to an assert statement for each definition may be deleted. This may then iterate through the dominator tree. At the end, a series of factored assert chains remains, which may be utilized by the compiler to improve the efficiency of generated code.

Abstract: A system and method for providing a name service in a peer-to-peer environment is described. A peer group name server may be a standalone name server that may be used in peer-to-peer applications and environments. A network computing platform may be used as a basis for establishing and operating a peer-to-peer network. A peer group name server may cache information about peers, peer groups and other entities. Peers may discover other peers, peer groups and other entities through the peer group name server. A peer group name server may serve as a reverse lookup provider. A peer group name server may act as a registrar for named entities (e.g. peers) in the peer-to-peer networking environment. In one embodiment, peer group name servers may maintain information about other peer group name servers, thus making a network of decentralized peer group name servers.

Abstract: A mechanism is disclosed for migrating large data sets for product upgrades. In one embodiment, an identifier is received as a parameter of a first method of an API. In response to the receipt of the identifier as a parameter of the first method, a utility is invoked. The utility exports, as one or more transportable tablespaces, one or more database objects that are associated with the identifier in a database. The identifier is also received as a parameter of a second method of the same API. In response to the receipt of the identifier as a parameter of the second method of the API, a utility is also invoked. The utility imports, into the database, database objects that are contained in the one or more transportable tablespaces. The utility also associates, with the identifier, the database objects that are contained in the one or more transportable tablespaces.

Abstract: Optimized loading of program data on a device comprises receiving a program including multiple program units, at least one of which is a main program unit. A use graph of the program is obtained, where the root node of the use graph represents the joining of the root node to one or more nodes representing the at least one main program unit. The multiple program units are ordered based at least in part on a depth-first traversal of the use graph and the ordered program is communicated to the device.

Abstract: A method for virtual computing that includes receiving a virtual computer specification, wherein the virtual computer specification defines a plurality of hardware and software configuration requirements for a virtual computer and a duration requirement for use of the virtual computer, requisitioning a plurality of computing resources based on the plurality of hardware and software configuration requirements, provisioning the plurality of computing resources from a pool of computing resources to obtain a provisioned virtual computer, and scheduling the plurality of computing resources of the provisioned virtual computer for use based on the duration requirement.

Abstract: A method for user interface customization in a portal server that includes receiving a selection of a skin, wherein the skin comprises a plurality of files, customizing representation of content in each of a plurality of channels by using the plurality of files to obtain a customized user interface, wherein the content in each of the plurality of channels is obtained by the portal server, and outputting the customized user interface of the portal server.

Abstract: In general, in one aspect, the invention relates to a method for deploying an operating system on a client. The method includes downloading a boot configuration file, downloading a boot kernel and boot loader specified in the boot configuration file, booting the boot kernel on the client, executing the boot loader, by the kernel, to download of a ramdisk image, and mounting the ramdisk image in memory on the client, where the ramdisk image comprises the operating system.

Abstract: A rackmount server has dual-redundant hot-swappable fans for uniformly providing air flow to a plurality of CPU modules housed in the rackmount server. Air flow generated by the fans may also be provided to I/O circuitry disposed in the rackmount server. An airflow zone in which air flow is provided by the fans is separate, however, from an airflow zone in which air flow is provided to at least one power supply and/or disk drive housed in the rackmount server.

Abstract: A telecommunications node architecture is disclosed that comprises multiple switching units that are connected to transceiver banks in a novel topology to enhance the reliability of the telecommunications network. Furthermore, the architecture of the illustrative embodiment facilitates redundancy in a high-bandwidth add/drop multiplexor environment.

Abstract: Embodiments of the present invention relate to a scriptable plug-in API. According to the invention, all of the interfaces in a conventional, non-scriptable plug-in API are mapped to similar interfaces in a scriptable plug-in API. There is no need to change the existing plug-in APIs. In one embodiment, a set of interfaces and a set of wrappers are used to bind the new, scriptable plug-in API to the old one. In another embodiment, C++ wrappers are written to bridge new API to the old one. Inter-threading calls for plug-ins are also made possible using a proxy that functions with scriptable interfaces. In another embodiment, the plug-in is written for a Mozilla™/Netscape™ 6.x browser. In another embodiment, the scripting languages used to develop the plug-in include Python, JavaScript, and Perl.

Abstract: A method and device for managing a data buffer that stores packets for transmission. Packets are loaded into the data buffer, which is managed as a first-in-first-out (FIFO) circular queue, at the tail of the queue. Three sequence numbers index a pointer array addressing the buffer. These sequence numbers correspond to the tail of the queue, the point in the queue from which the next packet is to be transmitted and the head of the queue, corresponding to the last packet acknowledged as correctly received plus one. When a packet is negatively acknowledged, the sequence number corresponding to the next packet to be transmitted is reset to the head of the queue.

Abstract: One embodiment of the present invention provides a system that determines a severity of degradation in a signal. During operation, the system receives signal values for the signal, wherein the signal values are received with a constant sampling interval. Next, for each received signal value, the system applies a Sequential Probability Ratio Test (SPRT) to the signal value. If the SPRT generates an alarm on the signal value, the system increments a cumulative counter which records a running total number of the SPRT alarms. Upon receiving each signal value, the system updates a cumulative function using a value in the cumulative counter. Next, the system determines the severity of degradation in the signal from the shape of the cumulative function.

Abstract: One embodiment of the present invention provides a system and method for determining a cache optimized ordering of cells in an unstructured graph. Cells bounding a region defined along a portion of a stored logically-defined grid are identified and each cell is added into an element of a level set array block in order of traversal through the region along the boundary. The level set array block is reordered for each additional cell in the data object that is contiguous to at least one such cell added previously to the level set array block. Each such additional cell is added into an element of the level set array block. Each cell remaining in the data object independent of any element in the level set array block is iteratively added.

Abstract: A method is provided for safely editing a binary code to be executed on a computer system. The method allows the binary code to be directly edited without compromising its integrity. More specifically, a larger binary code is transformed into a number of smaller binary code segments having sizes within a reference range of a control transfer function such as a branch instruction. A branch slamming operation can then used to displace a binary instruction contained within a smaller binary code segment with a branch instruction referring to a binary patch that is appended to the smaller binary code segment. The binary instruction displaced by the branch instruction is preserved in the binary patch. Upon completion of the binary patch execution, the smaller binary code segment continues executing with a binary instruction immediately following the branch instruction.

Abstract: In a method for dynamic allocation of memory address space, an original version of a program is executed. This execution includes the execution of a request to use memory address space occupied by an optimized version of the program that is protected from modification. When this request is detected, execution control is passed to an optimization code that was used to define the optimized program. The optimization code copies a portion of the optimized program residing in the memory address space requested by the original program, writes the copied portion to unallocated memory address space, and adjusts the code of the optimized program. The protection of the copied portion of the optimized program is released, and execution control is returned to the original program. The request to use the memory address space occupied by the portion of the optimized for which the protection has been released is then re-executed.

Abstract: A system and method for previewing a reboot. In one embodiment the method comprises modifying a configuration of a computer system and previewing a reboot, wherein previewing the reboot comprises comparing a current configuration of the computer system to a predicted configuration of the computer system. In an additional embodiment, the method may further comprise determining errors in the current configuration of the computer system by comparing the current configuration of the computer system to the predicted configuration of the computer system. The system incorporates the idea of a “preview” boot mode for both the operating system and it resource scripts and resources. Application of this method allows the risks associated with boot processes to be safely determined a priori. The method also allows an “instantaneous” reboot by swapping actual data structures and resources with predicted data structures and resources of the live system.

Abstract: The present invention manages memory buffers in a computer network system. In one embodiment, a managing system on a thin client unit modifies an amount of central processing unit (CPU) resource on the thin client unit that is granted to a server application (e.g., a X server application). The modification is based on a function of how many network information packets are in a packet queue of the thin client unit. By dropping the amount of CPU resource granted lower and lower as the queue gets more and more full, the server application reduces the rate at which it sends commands, thus giving the thin client unit the opportunity to catch up in processing the commands already in the queue. When the number of packets in the queue passes a high critical threshold, the granted CPU resource is dropped to zero, effectively shutting off the server application.

Abstract: A heat sink uses a pump assembly to generate a magnetic field. Flow directions of electrically and thermally conductive liquid flowing through multiple pipes that go through the pump assembly are dependent on an orientation of the magnetic field and/or the direction of electrical current induced across flowing fluid in the magnetic field. In such a manner, cool liquid may be directed toward a heat source and warmer liquid may be directed to flow away from the heat source, where heat transfer occurs between the liquid and the heat sink. Additional pump assemblies that generate separate magnetic fields may be used to increase fluid flow volume, thereby increasing heat transfer away from the heat source.

Abstract: A reconfiguration system, and associated methods, for remotely reconfiguring a client's date storage system. The system includes a storage management host communicatively linked with a reconfiguration center. The storage management host is installed at a customer's site within a data storage system, which includes at least one data storage subsystem in a first configuration with a one or more master data storage units and hosts. The storage management host may be a terminal server that provides both Ethernet access to a local area network connected to the master storage units and serial communication with the master storage units. The reconfiguration center receives a reconfiguration request for the client data storage system and creates and transmits a logical implementation of a second configuration. The client data storage system operates to process the logical implementation to configure the data storage subsystem in the second configuration.

Abstract: An object cache stores objects in a cyclic buffer to provide highly efficient creation of cache entries. The cache efficiently manages storage of a large number of small objects because the cache does not write objects into a file system as individual files, rather the cache utilizes cyclical buffers in which to store objects as they are added to the cache. Because of the use of a cyclic buffer, the high-overhead process of purging cache entries never needs to be performed. Cache entries are automatically purged as they are overwritten when the cyclic buffer becomes full and the input pointer wraps around from the end of a cyclic buffer to the beginning of a cyclic buffer. Additionally, in the event of a system crash or disk subsystem malfunction, inspect and repair time is independent of the size of the cache, as opposed to conventional file systems in which the time is proportional to the size of the file system.