Abstract: One embodiment of the present invention provides a system that keeps track of transitions on signal lines in order to latch a dataword in a stream of datawords. This stream of datawords is generated so that each transition between successive datawords involves a minimum number of transitions on a set of signal lines. During operation, the system monitors the set of signal lines that carries the stream of datawords. Upon detecting a predetermined number of transitions on the set of signal lines, the system waits a fixed time interval to ensure that a dataword is ready to be latched, and then latches the dataword.

Abstract: A system and associated method for authorizing, or withholding authorization of, user access to a selected computer application or other resource, based on the user's response to one or more user authentication tests. If the user is presented with two or more authentication tests, each with an associated test weight, the system optionally sums the weights of the tests satisfied by the user; and if this sum is greater than a selected test score threshold, the user is granted access to the resource. Alternatively, the user is granted access to selected subsets of the application, including an empty or non-empty default subset, depending upon the sum of the weights of the tests satisfied by the user. An authentication test or its associated weight may change at a selected time, and the selected time may be determined with reference to a time at which the resource changes. A smartcard may be used to respond to one or more authentication tests.

Abstract: A method of maintaining informational integrity of a business to business (B2B) message in a distributed e-business environment is described. A sent message is stored a selected portion of which is flagged. A corresponding response message is then compared to the stored sent message. Based upon the comparing, when the response message matches the stored sent message, if a portion of the response message corresponding to the flagged portion is determined to be substantially missing, then the missing portion of the response message is replaced.

Abstract: A diagnostic clearing house comprises a tool repository to store a plurality of diagnostic tools. A communication vehicle allows a plurality of diagnostic tool users to exchange diagnostic information. A management system manages access to and content of the tool repository and the communication vehicle and manages distribution of diagnostic tools from the tool repository to an end user. The diagnostic clearing house may be web-based.

Abstract: A method lookup mechanism is disclosed which not only enforces accessibility constraints imposed by modularity constructs but also enables transitive method override. According to one embodiment, when a method m is invoked on a target object, the resolved method m in a resolved class is checked to determine whether it has been declared as public/protected. If so, then standard method lookup may be used to determine the proper implementation of method m to invoke. However, if the resolved method is not declared as public/protected, then a path stack is constructed. The path stack provides a listing of the class hierarchy between the target object and the resolved class. Once constructed, the path stack is used to determine which implementation of method m to invoke in response to the method invocation. Specifically, the resolved method m is initially set as the candidate method to invoke. Then a downward search is performed through the classes on the path stack.

Abstract: A lightweight indicator provides an indication of divergence of views for a collaboratively used user interface element. The lightweight indicator identifies the magnitude of the divergence of views. The user interface may be, for example, a graphical widget, such as a mouse cursor or a scrollbar. The indicator is “lightweight” in that the indicator only subtly modifies the appearance of the user interface element. The indicator is also “lightweight” in that it provides an indication without incurring significant computational or memory overhead.

Abstract: Methods and apparatus for locking an object using an efficient combination spinning and blocking process are disclosed. According to one aspect of the present invention, a method for acquiring ownership of an object in an object-based environment using a current thread includes determining when the object is owned by another thread, and locking the object when it is determined that the object is not owned by the another thread. A first spinning process, which is implemented when it is determined that the object is owned by the another thread, is arranged such that the current thread spins for up to a predetermined number of spin cycles associated with the current thread and the object. The predetermined number of spin cycles is determined using historical information, and is not based upon an overall system specification. When it is determined that the object has not been locked by the current thread during the first spinning process, a first blocking process is implemented.

Abstract: A method for optimizing loop bandwidth in a delay locked loop is provided. A representative power supply waveform having noise is input into a simulation of the delay locked loop; an estimate of jitter is determined; and the loop bandwidth of the delay looked loop is adjusted until the jitter falls below a pre-selected value. Further, a computer system for optimizing loop bandwidth in a delay locked loop is provided. Further, a computer-readable medium having recorded thereon instructions adapted to optimize loop bandwidth in a delay locked loop is provided.

Abstract: The present invention is a compression scheme for compressing audio and video data. An image is divided into blocks of pixels. In one test, if all of the pixels are approximately equal to the corresponding pixels in the previous block, then no data is sent for that block. In a second test, if all of the pixels in a block are approximately equal to a mean pixel value, then only one color value is transmitted. In a third test, if quantization of the pixels via companding results in an acceptable representation, the quantization is performed. The present invention uses quantization codes that are proportional to the logarithm of the magnitude of the range quantized, computation of a magnitude byte that permits rapid discovery of the number of bits used for quantization of a block, recursive packing and unpacking of quantized pixel data, and two-dimensional paths through the block.

Abstract: A method lookup mechanism is disclosed which not only enforces accessibility constraints imposed by modularity constructs but also enables transitive method override. According to one embodiment, when a method m is invoked on a target object, the method m in a resolved class is checked to determine whether it has been declared as public/protected. If so, then standard method lookup may be used to determine the proper implementation of method m to invoke. However, if the resolved method is not declared as public/protected, then the class of the target object is searched for an implementation of the method m. If no implementation is found, then a superclass of the target object class is searched for an implementation. This process repeats until an implementation is found or until the resolved class is reached.

Abstract: A multiple compressor refrigeration heat sink module is suitable for use in standard electronic component environments. The multiple compressor refrigeration heat sink module is self-contained and is specifically designed to have physical dimensions similar to those of a standard air-based cooling system. As a result, the multiple compressor refrigeration heat sink module can be utilized in existing electronic systems without the need for significant system housing modification or the “plumbing” associated with prior art liquid-based cooling systems. The multiple compressor refrigeration heat sink module is also well suited for applications that require a highly reliable, energy and space efficient, cooling systems for electronic components such as multi-chip modules and mainframe computer applications.

Abstract: A method implemented in a computer system for storing non-volatile configuration information (NVCI), wherein NVCI is stored in one or more active segments of a segmented flash memory. The NVCI consists of a series of key-value pairs. When the computer system is started, the key-value pairs are read from the active segment, beginning with the least recently stored and ending with the most recently stored. The key-value pairs are inserted into a hash table, with later-read key-value pairs replacing earlier-read key-value pairs of the same key. Write accesses to the NVCI are made to both the hash table and the active segment of flash memory. When an active segment of the flash memory is filled to a threshold capacity, current key-value pairs stored in the hash table are written to a new flash memory segment, which then becomes the active segment.

Abstract: The invention provides efficient apparatus and methods for using direct memory access (DMA) to store and retrieve data and associated check information in fixed-size blocks on a data storage device. A DMA controller of the invention obtains check information from computer main memory rather than computing the check information internally. In accordance with some embodiments of the invention, the DMA controller implements additional registers to specify, for example, the location of check information in computer main memory. The DMA controller itself carries out interleaving of data with its associated check information as it transfers information between main memory and the storage device. In accordance with some aspects of the invention, scatter/gather capability is supported.

Abstract: Various embodiments of a method and system for sharing a cache such as an on-chip L1 cache are disclosed. In one embodiment, a processing device includes a shared cache and a plurality of processors that are each coupled to the shared cache and each configured to store the result of a data integrity operation in the shared cache. Each of the processors performs the same data integrity operation on the same data to generate its result. Because the results are stored in the shared cache, a first processor may quickly access and operate on the results. In one embodiment, the first processor may perform a comparison operation or voting operation on the results stored in the shared cache.

Abstract: The present invention utilizes peer groups in a distributed architecture to decentralize its task dispatching and post-processing functions and to provide the ability to manage and run many different applications simultaneously, in an efficient and reliable manner. Jobs may be submitted to a task dispatcher or to a monitor which distributes the jobs to task dispatchers. Through a series of processes, the task dispatchers may then distribute the jobs to workers. This allows work to be distributed without utilizing a centralized server.

Abstract: Automated techniques to correct certain rule violations with respect to non-design geometries are used, simplifying and automating the design layout of an electronic circuit, whether embodied as a design encoding or as a fabricated electronic circuit. Correcting minimum spacing rule violations between wide class objects of non-design geometries is accomplished by deducting an enlarged wide class object of a first non-design geometry from a second non-design geometry; wherein the enlarged wide class object of the first non-design geometry is formed by enlarging a wide class object of the first non-design geometry at one or more non-virtual edges of the wide class object of the first non-design geometry but not at one or more virtual edges of the wide class object of the first non-design geometry wherein the wide class object of the first non-design geometry has at least one virtual edge.

Abstract: A method for dynamically routing web procedure calls is disclosed. A “web procedure call” refers to any interaction between two devices or services in network environment where the calling party requests some activity by the called party (e.g., to accept data or perform a specific task). When a user requests a service from a server, and the request fails due to the server's unavailability or inability to complete a request, a dynamic routing approach is initiated. A “look up” service finds an alternate server that provides the same service as that which was requested. The device dynamically routes the service request to the alternate server and the request is processed. The alternate server returns the response of the request to the device. The client can determine the desired format of the return data using MIME encoding. A present invention also discloses a method for an abstract service.

Abstract: Provided are a method, system, and program for loading program components into a runtime environment. A loader hierarchy is provided indicating an order in which loaders are invoked to load multiple types of program components. A plurality of first type loaders are used to load a first type of program components that are capable of being used by a second type of program components loaded by at least one second type loader. The second type loader is defined at a lower level in the loader hierarchy than the first type component loaders.

Abstract: Automated techniques to correct certain rule violations with respect to non-design geometries are used, simplifying and automating the design layout of an electronic circuit, whether embodied as a design encoding or as a fabricated electronic circuit. Correcting minimum width rule violations of non-design geometries is accomplished by forming one or more cutting areas adjoining one or more erroneous edges of a non-design geometry, and deducting the cutting areas form the non-design geometry, splitting the non-design geometry into two or more remaining non-design geometries. Any slivers of remaining non-design geometries, i.e., any pieces that are smaller than a minimum size amount, are removed. Cutting areas are formed by stretching ends of erroneous edge segments by a minimum width rule amount and sizing the stretched edge segments which are inside the non-design geometry outward by a minimum spacing rule amount.

Abstract: Provided are a method, system, and program for processing objects in a distributed computing environment. A determination is made of a program is needed to process a component. A file including the determined program is requested from a remote process. The requested file is received from the remote process, wherein the requested file includes a plurality of sections, each including different programs. At least one section includes programs that are intended only to be executed in a remote address space of the remote process and at least one other section includes programs that are intended to be downloaded from the remote process and execute in a client address space that is different than the remote address space. The programs are loaded from the section including the determined program to execute in the client address space to process the component.