Abstract: A system consistent with the present invention reduces the number of redundant class descriptors that are sent during remote method calls by using serialization contexts. “Serialization contexts” are dictionary objects that map a class descriptor to a corresponding integer handle. When possible, the integer handle, rather than the full class descriptor, is passed, saving processing time in RMI calls.

Abstract: A method for recovery of data objects on a data storage system includes determining a list of layout map IDs that place data objects on a node of a data storage system. For each layout map ID, a list of object IDs associated with each of the data objects assigned the layout map ID is determined. For each object ID, a list of data object fragments associated with the object ID is determined. A determination is made whether each of the data object fragments is present on the node. If a data object fragment is not present on the node, the data object fragment is reconstructed on the data storage system. The method can be automatically implemented by each of one or more operational nodes of a distributed data storage system at configured time intervals, and/or upon the operational loss of a data storage structure of a node, or a node.

Abstract: One embodiment of the present invention provides a system that solves an overdetermined system of interval linear equations. During operation, the system receives a representation of the overdetermined system of interval linear equations Ax=b, wherein A is a matrix with m rows corresponding to m equations, and n columns corresponding to n variables, and wherein x includes n variable components, b includes m scalar components, and m>n. Next, the system performs a Gaussian Elimination operation to transform Ax=b into the form [ T W ] ? x = [ u v ] , wherein T is a square upper triangular matrix of order n, u is a vector with n components, v is a vector with m?n components, and W is a matrix with m?n rows and n columns, wherein W is zero except in the last column, which is represented as a column vector z with m?n components. Next, the system performs an interval intersection operation based on the equations zixn=vi (i=1, . . . , m?n) and Tnnx=un to solve for xn.

Abstract: A system that records performance parameters from a computer system. During operation, the system periodically monitors performance parameters from the computer system and records the monitored performance parameters in a first storage space. Next, the system recurrently compresses the recorded performance parameters. This involves: (1) compressing the recorded performance parameters from the first storage space; (2) if insufficient space is available in a second storage space which is used to store compressed performance parameters, further compressing data in the second storage space to make room for the compressed performance parameters from the first storage space; and (3) storing the compressed performance parameters from the first storage space in the second storage space.

Abstract: A server system comprises a server blade carrier. The server blade carrier carries a plurality of removably mountable server blades. Each blade includes a blade service controller operable to perform monitoring and management functions in the server blade. The carrier comprises at least one carrier service processor. The carrier service processor is operably connected to the blade service controllers of blade servers mounted in the carrier to provide higher level management functions and is configured to communicate management functions to and from the blades.

Abstract: One embodiment of the present invention provides a system that facilitates keeping track of memory usage of tasks in a shared heap. The system operates by performing a garbage collection operation on the shared heap, wherein the garbage collection operation is a compacting garbage collection operation which preserves the ordering of objects within the shared heap. The system determines a memory usage for each task in the shared heap by adding the memory usage for intervals containing objects for each task in the shared heap to the memory usage count for each task to produce an actual memory usage for each task. This garbage collection may or may not be a generational garbage collection operation.

Abstract: A heat sink uses a ferrofluid-based pump assembly for controlling the direction of nanofluid flow within the heat sink. The nanofluid is thermally conductive and absorbs heat from a heat source, which is then directed away from the heat source by the ferrofluid-based pump assembly. The ferrofluid-based pump assembly uses a motor to rotate at least one magnet so as to rotate ferrofluid contained in the ferrofluid-based pump assembly. The direction of nanofluid flow within the heat sink is dependent on the movement of ferrofluid in the ferrofluid-based pump assembly.

Abstract: A system and method for sharing a resource (e.g., buffers) among multiple queues (e.g., InfiniBand send queues). Each queue has a local context indicating the Current amount of the resource allocated to the queue, the Minimum it is guaranteed, and a Maximum amount. A context may also include one or more pointers for managing the queue. Global Available and Reserve values indicate, respectively, the amount of the resource not currently allocated and the amount of the resource being reserved to guarantee each queue its Minimum. When an element is posted to a queue, a Full signal is raised for every queue to prevent further activity while the global values and the affected queue's context are updated. Then, if Available>0, the signal is de-asserted for any queue for which Current<Minimum or, if Available>Reserve, for any queue for which Current<Maximum.

Abstract: A method for testing computing devices includes providing a suite of test programs on a server for execution by a plurality of the computing devices that are coupled to the server. A respective unique identifier is assigned to each of the plurality of the computing devices, for use in communicating with the server. The test programs are downloaded from the server for execution by the computing devices coupled thereto, so that at least first and second computing devices among the plurality execute different first and second test programs from the suite substantially simultaneously. The server receives messages from the computing devices with respect to execution of the test programs, each of the messages containing the respective unique identifier, and controls the execution of the test programs in the suite based on the messages.

Abstract: One embodiment of the present invention provides a system that limits a maximum repetition rate of an asynchronous circuit. The system operates by receiving a clock signal at a rate-controlling circuit for the asynchronous circuit from a source external to the asynchronous circuit. The system then uses the clock signal to limit the maximum repetition rate of the asynchronous circuit so that only a predetermined number of asynchronous transactions may take place during each cycle of the clock signal.

Abstract: A method and apparatus for encrypting information. In one embodiment, a method for encrypting information includes obtaining a value A from an array having a plurality of values and determining a value B based on the value A in a first pipeline stage. In a second pipeline stage, a value V may be determined from the value A and the value B. The value V may then be exclusive ORed (XORed) with a data value that forms a portion of the information being encrypted. A first logic unit may include the first pipeline stage, while a second logic unit may include the second pipeline stage. The array may be stored in a plurality of flip-flops in one embodiment, or may be stored in one or more register files in a second embodiment. The method and apparatus may be used for decrypting information as well.

Abstract: One embodiment of the present invention provides a system that uses interval techniques to solve a multi-objective optimization problem. During operation, the system receives a representation of multiple objective functions (ƒ1, . . . , ƒn) at a computer system, wherein (ƒ1, . . . , ƒn) are scalar functions of a vector x=(x1, . . . , xn). The system also receives a representation of a domain of interest for the multiple objective functions. Next, the system performs an interval optimization process to compute guaranteed bounds on a Pareto front for the objective functions (ƒ1, . . . , fn), wherein for each point on the Pareto front, an improvement in one objective function cannot be made without adversely affecting at least one other objective function. While performing the interval optimization process, the system applies a direct-comparison technique between subdomains of the domain of interest to eliminate subdomains that are certainly dominated by other subdomains.

Abstract: A system and method for efficiently managing membership in a multicast communication group. The system may comprise any number of end nodes (e.g., channel adapters, network interface adapters) and routing nodes (e.g., switches), and the method may be implemented by a processor coupled to any node. Each node in a network may be a member of the multicast group and/or the multicast tree (MCT) that routes the group's multicast communications. A node need not be a member of the group to be a member of the tree. Network links included in the multicast tree (MCT) are a subset of a network minimum spanning tree (MST). When a node is added to the group, the minimum spanning tree (MST) is searched from that node until a node within the multicast tree (MCT) is found. Each time a member is removed from the group, the multicast tree (MCT) is pruned to reduce unneeded communications.

Abstract: A method and mechanism of controlling information flow in a firewall. A firewall controls the flow of information between different communities. The enforcement method and mechanism uses a database of associations of sets of communities corresponding to network addresses. Upon receiving an incoming data packet, a packet community set (PCS) is deterined for the data packet. If the PCS is not a subset of an interface community set (IFCS) of the interface upon which the data packet was received, the data packet is discarded. Otherwise, a firewall rule match is determined for the data packet. If a rule match is detected, a PCS attribute of the matching rule is compared to the PCS of the data packet. If the PCS attribute of the rule matches the PCS of the data packet and the rule indicates the data packet is to be forwarded, the PCS of the data packet is changed to a second PCS indicated by the matching rule.

Abstract: A computer system which may allow a centerplaneless design. The computer system may include various client circuit boards including processor circuit boards, memory circuit boards and switch circuit boards. The processor circuit boards may each include at least one processor, while the memory circuit boards may each include memory which is accessible by each processor. The switch circuit boards may include a plurality of detachable connectors for interconnecting each of the processor circuit boards to each of the memory circuit boards. At least one of the switch circuit boards may convey redundant memory access information. Each of the boards may be hot swappable.

Abstract: An eject mechanism for a module includes a module casing; a module engaged in the module casing; the module including a cable port; and an eject button for allowing disengagement of the module from the module casing. The eject button prevents the module from disengagement when a cable is plugged into the cable port. A method of ejecting a module from a module casing includes disengaging the module from the module casing upon the pressing of an eject button, and preventing the module from disengagement when a cable is plugged into a cable port of the module.

Abstract: A method for controlling sharing of resources in a multi-threaded environment includes entering a finite state machine state sequence; controlling resource-sharing threads using the finite state machine state sequence; and exiting the finite state machine state sequence when shared resource control is complete. A multi-threaded shared resource control system includes a finite state machine configured to control multi-threaded access to shared resources; a plurality of producer threads regulated by the finite state machine; and a plurality of consumer threads regulated by the finite state machine.

Abstract: In one embodiment, a memory controller for a node in a multi-node computer system comprises logic and a control unit. The logic is configured to determine if an address corresponding to a request received by the memory controller on an intranode interconnect is a remote address or a local address. A first portion of the memory in the node is allocated to store copies of remote data and a remaining portion stores local data. The control unit is configured to write writeback data to a location in the first portion. The writeback data corresponds to a writeback request from the intranode interconnect that has an associated remote address detected by the logic. The control unit is configured to determine the location responsive to the associated remote address and one or more indicators that identify the first portion in the memory.

Abstract: A lock-free implementation of an ordered data structure allows updating of the data structure without disturbing the ordering relied upon for accessing the data structure. After searching and finding an element in a data structure in accordance with an update operation (i.e., an insert operation or a remove operation), values are successively copied to shift the values either up or down the data structure. If an insert operation is being performed, then the new value is eventually inserted to overwrite a duplicate value in the data structure. If a delete operation is being performed, then a value is shifted over the value to be deleted.