Abstract: According to one aspect of the invention, a method and apparatus for a server node is disclosed. This server node consists of one or more processors. The processors are configured to perform server functions as well as switch and router functions including load balancing and fail-over. The server nodes also have a plurality of ports. These ports allow the server nodes to be connected combined to form blocks and networks as well as to provide connection to external networks. When a server node receives a request, it determines whether it can handle the request. If possible, the server node handles the request. If the server node cannot handle the request, it routes the request to a second, neighboring server node.

Abstract: A one gate delay output noise insensitive latch includes an input node, an output node, a storage node, a not storage node, and a data clock line. A primary latch element is connected to the input node, the output node, and the data clock line. A mirror primary latch element is connected to the input node in parallel with the primary latch element, to the storage node, and to the data clock line. A weak keeper is connected to the storage node and to the not storage node. A strong enabled tri-state keeper is connected to the not storage node, to the data clock line, and to the output node. The input node is either a dynamic data input node or a static data input node. Optionally, the weak keeper is also clock enabled.

Abstract: A distributed system having a client and a server includes a state manager interposed between the client and the server. The state manager has a capability to generate a list of object attributes required to represent a state of the distributed system and a capability to cache object attributes so as to be locally accessible by the client. The distributed system further includes a service component interposed between the state manager and the server. The service component has a capability to fetch data from the server based on the list of object attributes.

Abstract: Post-manufacture compensation for a sensing offset can be provided, at least in part, by selectively exposing one of a pair of cross-coupled transistors in a sense amplifier to a bias voltage selected to cause a compensating shift in a characteristic of the exposed transistor. In designs susceptible to post-manufacture data dependent creep in a device characteristic, such exposure may be advantageously provided in situ by causing the sense amplifier to sense values purposefully skewed toward a predominate value selected to cause the compensating shift. In some realizations, an on-chip test block is employed to identify and characterize sensing mismatch. Typically, the techniques described herein may be employed to address sensing offsets that have developed post-manufacture due to a data-dependent effect. However, in some realizations, the techniques described herein may be used to address a sensing offset arising at least in part from other or additional sources.

Abstract: A system for compressing an image. The system determines a set of commonly occurring color values in the image and associates a designator with each commonly occurring color value. For each pixel in the image, the system identifies a color value for the pixel. If the pixel has a commonly occurring color value, the system substitutes the associated designator for the commonly occurring color value. Otherwise, if the pixel does not have a commonly occurring color value, the system adds the color value to a rare color list, and substitutes a special designator for the color value to indicate that the color value for the pixel is contained in the rare color list.

Abstract: The invention proposes a directory server capable of interacting with entries organized in a tree structure in a directory server system. The entries comprise user entries. The directory server has a password checking function capable of checking the password for a user entry, based on password-related data. The password checking function is responsive to a user entry having extra data associated thereto, and identifying an additional entry, for executing a distinct password checking based on the password related data defined in that additional entry.

Abstract: An invention is disclosed for a load balancing method in a JAVA based environment. The method includes executing an application having a first service module and a control module. The control module includes application-specific policies for the application. During execution, the utilization of system resources is sensed. In response to the sensed utilization of system resources, a second service module is generated using the first service module. In addition, the state of the first service module is transferred to the second service module, and the first service module is terminated. To sense the system resource utilization, embodiments of the present invention can poll system resources, or receive notifications from the system resources. Further, some embodiments of the present invention include application-specific policies that include specific servers on which to generate the second service module during load balancing or module moving.

Abstract: A multi-lingual tag extension mechanism suitable for use with the JAVASERVER computer software Pages platform. Rather than creating a closure abstraction, the present invention “in-lines” a body evaluation for the tags. A doStart ( ) method processes a start tag and determines if a body needs to be evaluated. If so, a body evaluation buffer is passed to a doBody ( ) method for body evaluation. Once the body evaluation is complete, a doEnd ( ) method completes the processing by synchronizing the variables. The scripting details of the present invention match any nesting of the tag, so the at the structure corresponding to the original scripting is preserved. Furthermore, the present invention is not dependent on the specifics of the scripting language used to form the Web page.

Abstract: Testing of computing devices is automated by recording each of the tests once, capturing user interface operations as a record, and then rerunning the tests repetitively and automatically on the same or different instances of the target device, substantially without human intervention. A successful test is indicated by identity of corresponding screens captured from a reference device and the target device.

Abstract: One embodiment of the present invention provides a system for managing surplus memory in a multitasking system. The system operates by reserving a guaranteed amount of memory from a heap for a task. Heap memory not reserved for a task is surplus memory. When the system receives a request from the task to allocate memory for a new object, the system determines if memory is available within the guaranteed amount of memory. If so, the system allocates memory for the new object from the guaranteed memory. Otherwise, if available, the system reserves an additional amount of memory to the task from surplus memory in the heap. The system then allocates memory for the new object from the additional amount of memory. Allocating memory for the new object from the additional amount of memory delays garbage collection of the memory. Surplus memory can be transparently reclaimed.

Abstract: System and method for the dynamic and transparent migration of services in a peer-to-peer networking environment. Member peers in a peer group using a peer-to-peer platform may cooperate to provide redundant instances of services to member peers. Dynamic migration of a service may be performed by unbinding one or more peer-to-peer platform pipes from a peer hosting an instance of the service and binding the pipes to another peer hosting a different instance of the service. Using pipes, services may transparently failover from one physical peer endpoint to another in order to mask a service or peer failure, or to access a newly published instance of a service. Thus, a collection of peers may provide a high level of fault tolerance, where, for example, a new peer at a different location may replace a crashed peer, with the new peer taking over the existing pipe to keep the communication going.

Abstract: In some embodiments, a computer accessible medium comprises a plurality of instructions which, when executed, probe nodes in a network to determine if one or more nodes are experiencing any events indicative of a fault. The nodes are probed in a sequence. The instructions, when executed, in response to receiving a first alert transmitted by a first node in the network asynchronous to the probes performed according to the sequence, probe one or more neighbor nodes of the first node. In some other embodiments, the instructions, when executed, in response to receiving a first alert transmitted by a first node in the network asynchronous to the probes performed according to the sequence, interrupt probing according to the sequence to probe at least the first node.

Abstract: A system and method for selectively checkpointing application components. In one embodiment this method may include deploying a plurality of application components on a server, determining checkpoint information for each application component on the server, and selectively checkpointing each component during execution of each component according to the checkpoint information for each component. In one embodiment the checkpoint information may be provided by a checkpoint selection heuristic, which makes checkpoint selections based on a description of one or more methods of the application component. In one embodiment the checkpoint information may be provided by a deployment descriptor, which may have multiple overriding tiers to facilitate precise selection of methods, components and modules for checkpointing. In one embodiment the checkpoint and activation process may include callback routines which prepare an application component for checkpointing and activation.

Abstract: An electromagnetic (EM) shielding assembly shields an electronic component mounted on a circuit board. The assembly includes a shielding portion that is electrically conductive and can be mounted adjacent an electronic component that it is desired shield. The shielding portion at least partially surrounds the component, thereby providing a degree of EM shielding. The assembly also includes at least one resiliently biased electrically conductive connection member in electrical communication with the shielding portion. The connection member is operable electrically to connect the shielding portion to a predetermined voltage by bearing down upon an electrically conductive contact of the circuit board.

Abstract: A system and method for excluding from a transaction accesses to one or more data sources marked as read-only. Data sources may be designated as read-only at a data source level, connection level, or on a registry. A global transaction may be delayed until two or more non-read-only data sources are being used. A transaction involving multiple data sources may still be managed as a non-global transaction if only one of the data sources is non-read-only. The other read-only data sources may be left out of the transaction.

Abstract: A method for executing processing tasks in a distributed processing framework system is provided. The method includes identifying a main task of a tasklist and identifying a subtask of the main task. Also included is allocating computing resources for each of the main task and the subtask. The method further includes deploying the main task to a first computing system that is part of the distributed processing framework system. A code of the main task is executed on the first computing system. The code of the main task has program instructions for requesting loading of code for the subtask to a second computing system. The second computing system is part of the allocated computing resources. The code for the subtask is in client-server communication with the code for the main task, such that the code for the main task receives processing results directly from the code for the subtask.

Abstract: Various embodiments of a multiprocessing computer system employing capacity prefetching are disclosed. In one embodiment, a cache subsystem implements a method for prefetching data. The method includes the cache subsystem receiving a request for data, and determining a cause of a cache miss that occurs in response to the request. The cache subsystem includes a controller that selectively prefetches additional data depending upon the cause of the cache miss. In one embodiment, determining the cause of the cache miss includes determining whether a cache line corresponding to the request exists in the cache memory of the cache subsystem in an invalid state. Additional data is prefetched in response to determining that the cache line is not present in the cache memory in an invalid state.

Abstract: A method for program verification comprises receiving a program unit, determining data types used by the program unit, creating a first mapping for the data types and using the first mapping to represent type information in verification information for the program unit. The verification information comprises the data type of entries on an operand stack or in a register file during simulated execution of the program unit.

Abstract: Disclosed is a technique for matching character sets. One or more data set files are stored. One or more character set files are created, wherein each character set file is associated with a character set and includes indexes associated with the one or more data set files. A request specifying one or more character sets is received. One or more of the data set files that contain one or more of the requested character sets are identified using the indexes in the character set files.

Abstract: A profiling program determines a set of routines that impacts the performance of a selected root routine. Because the set of routines impacts the performance of the routine of interest, the members of the set are excellent candidates for profiling in order to more precisely measure the performance the selected root routine. Thus, routines that cannot be reached from the root routine need not be profiled, thereby reducing the amount of profiling code injected into a target program, and thereby reducing execution inefficiency of the target program.