Abstract: In general, the invention relates to a method for storing data. The method includes receiving an Input/Output (I/O) request to store data in a storage pool, determining whether the I/O request is a resilvering I/O request, if the I/O request is a resilvering I/O request: associating the I/O request with a first deadline, wherein the first deadline is associated with a low priority, and determining the quantized deadline for the I/O request using the first deadline. If the I/O request is not the resilvering I/O request: associating the I/O request with a second deadline, determining the quantized deadline for the I/O request using the second deadline, placing the I/O request in the I/O queue using the quantized deadline, and issuing the I/O request to the storage pool using the I/O queue.

Abstract: An integrated circuit including embedded test functionality. An integrated circuit may include a plurality of processor cores each configured to execute instructions, and a test access port configured to interface circuits included within the integrated circuit with a test environment external to the integrated circuit for testing of the circuits. The test access port may include virtualization logic configured to allow a first set of instructions executing on the given processor core to control activity of the test access port for testing of the circuits. In one embodiment, the circuits may be accessible for testing via a plurality of scan chains, wherein the scan chains and the test access port are compliant with a version of Joint Test Access Group (JTAG) standard IEEE 1149, and wherein the test access port includes a Test Data In (TDI) pin, a Test Data Out (TDO) pin, and a Test Clock (TCK) pin.

Abstract: Concurrent cuckoo hashing is performed on a hash table that includes a number of locations; each may hold a value. A plurality of processes may concurrently execute on the table; each process includes a sequence of operations, which are divided into a number of phases. Each phase corresponds to one operation in the sequence. An overflow buffer is provided for each location in the table. Each overflow buffer may hold a value displaced from its corresponding location in the table. A plurality of sequences of operations is concurrently executed. Each phase in a sequence executes by acquiring one or two locks on two locations in the table; a lock acts on a location and its overflow buffer. An operation of a phase is then executed. If, on conclusion of the phase execution, any overflow buffer holds a value, the execution is repeated until all overflow buffers are empty.

Abstract: A method and apparatus for conveying test response data from an integrated circuit to ATE via a plesiochronous interconnect. The integrated circuit includes a core logic unit and a first transmitter coupled thereto by a first data path. In a normal mode, data conveyed from the core logic unit to the transmitter may be transmitted plesiochronously over an interconnect coupled to the transmitter output. The integrated circuit further includes a second data path coupled between the core logic unit and the interconnect. During a test mode, test response data may be conveyed from the core logic unit to ATE via the second data path and the interconnect, wherein the test response data is synchronously transmitted over the interconnect.

Abstract: A resource discovery and description mechanism for decentralized device and service description and discovery in networking environments is described that generates advertisements in a uniform description format to describe resources on a network. The mechanism may translate resource descriptions from other resource description and discovery protocols to generate the advertisements. The advertisements may be used for cross-network discovery and access of the resources. An advertisement may include, but is not limited to, physical endpoints, virtual endpoints, user-extensible metadata, location information, and a universal unique identifier (UUID) for the associated resource. If a resource cannot provide a UUID, the mechanism generates a UUID for the resource. One embodiment may support proxy nodes for generating advertisements for resources that cannot participate directly in the resource discovery and description mechanism.

Abstract: Embodiments of a distributed instant messaging system that uses a distributed index in peer-to-peer networks. A distributed index may be used to implement an instant messaging system in a group of participating peers. The distributed index may be used, for example, to route messages between participating peers, in identifying and authenticating peers wishing to participate, in notifying peers of newly joined peers, and in notifying joining peers of participating peers. In one embodiment, zones of the distributed index may be moved to joining peers. In one embodiment, zones of the distributed index stored on departing peers may be moved to participating peers. One embodiment may be implemented in peer-to-peer networks implemented according to a peer-to-peer platform including one or more peer-to-peer platform protocols for enabling peer nodes to discover each other, communicate with each other, and cooperate with each other to form peer groups and share network resources.

Abstract: Some embodiments of the present invention provide a system that estimates an ambient temperature of air outside of a computer system. During operation, a temperature inside the computer system is measured for different flow rates of air into the computer system. Next, the temperature measurements are used to determine a relationship between the temperature inside the computer system and a parameter related to the flow rate of air into the computer system. Then, the ambient temperature of air outside the computer system is estimated based on the relationship.

Abstract: Some embodiments of the present invention provide a system that characterizes a response of a device in a computer system to vibration over a frequency range. During operation, the device is vibrated at each frequency in a set of frequencies in the frequency range, wherein the device is vibrated at each frequency, one frequency at a time, until a stabilized response of the device is determined. The response of the device to vibration over the frequency range is then characterized based on information related to the stabilized response at each frequency in the set of frequencies.

Abstract: Some embodiments of the present invention provide a system that includes a drive carrier for a hard disk drive (HDD) and one or more vibration control clips affixed to the drive carrier. Within this system, a mode of vibration of the HDD is modulated by contact between each of the vibration control clips and a surface within the computer system.

Abstract: Embodiments of a method for determining locations of computers in a group of computers, which may be performed by a system, are described. During operation, the system receives a location of a first computer in the group of computers. Then, the system determines locations of one or more additional computers in the group of computers relative to the first computer based on vibration spectra associated with the first computer and the one or more additional computers.

Abstract: Some embodiments of the present invention provide a system that characterizes a computer system parameter by analyzing a target electromagnetic signal radiating from the computer system. First, the target electromagnetic signal is monitored using a conductor in an interface of the computer system. Then, the target electromagnetic signal is analyzed to characterize the computer system parameter.

Abstract: A recording mechanism is disclosed for automatically capturing high level events on user interface (UI) components of a set of software. In one implementation, the recording mechanism registers with a UI component to receive notification when an event occurs on the UI component. When an event does occur, the recording mechanism receives notification thereof from the UI component. In one implementation, the notification includes some high level event-specific information. After the notification is received, the recording mechanism creates and stores a record of the event, which includes at least a portion of the event-specific information, as well as information indicating the UI component as the target of the event. The record may further include information indicating a component hierarchy in which the UI component is contained. Overall, the record contains all of the information needed to reproduce the event on the UI component of the software at a later time.

Abstract: A message brokering mechanism for performing a recovery operation in a transaction processing system including first and second stages operable to exchange message requests and responses. The first stage may receive a message request from a message source and may check whether the message request is a special message request. This may be by way of checking if a recovery attribute of the message request is set. A normal message request may have a recovery attribute that is not set. If the message request is a special message request, it may be dispatched to the second stage. If the message request is a normal message request, it may be dispatched to the second stage if the normal message request is not a repeat normal message request.

Abstract: An incremental collector can include memory pages, preferably virtual memory (VM) pages containing objects. A bit or byte map is created with one entry corresponding to each VM page. The VM page being collected is first write-protected and then the reachable objects are copied or relocated. Application induced changes to objects that have already been relocated are flagged in the map. Later the collector will suspend the application, scan the map and update the relocated objects that were changed and update the references to these objects. In one embodiment aimed at concurrent collecting, the map is copied to a second map, and the second map is scanned for changes that are propagated as before. The application may be suspended on the last pass through the map for the updating of remaining relocated objects by scanning the first map. The incremental collector can be a Train algorithm.

Abstract: A method for analyzing a target system that includes generating a characteristics model using a schema defining a domain, obtaining a plurality of characteristics from the target system using a characteristics extractor, wherein the plurality of characteristics is associated with the characteristics model storing each of the plurality of characteristics in a characteristics store, and analyzing the target system by issuing at least one query to the characteristics store to obtain an analysis result.

Abstract: One embodiment of the present invention provides a system that reduces coherence traffic in a multiprocessor system by supporting both coherent memory accesses and non-coherent memory accesses. During operation, the system receives a request to perform a memory access. Next, the system obtains a page table entry (PTE) associated with the memory access. The system then determines if the memory access is coherent or non-coherent by examining an indicator in the PTE. If the memory access is coherent, the system performs the memory access using a coherence protocol. On the other hand, if the memory access is non-coherent, the system performs the memory access without generating coherence traffic.

Abstract: Texture mapping includes (i) calculating the weighted average of the colors of two texels near a particular pixel, (ii) determining a fractional portion of a texture coordinate of the pixel, and (iii) retrieval of a pair of complementary coefficients from a table of pairs of predetermined, complementary coefficients according to the fractional portion of the coordinate of the pixel. Each of the complementary coefficients corresponds to the relative distance between the pixel and each of the two texels as represented by the fractional portion of the first coordinate of the pixel in the coordinate space of the texture image since each texel has whole, integer coordinates in the coordinate space of the texture image. Each coefficient of the pair of complementary coefficients is used to weight a respective one of the colors of the two texels and the weighted colors are summed to produce a weighted average color of the two texels.

Abstract: A method of arbitrating data transmissions to prevent data collisions in an optical data interconnect system including a transmitting node, a plurality of receiving nodes, and one or more remaining nodes connected through an optical data channel. The method involves transmitting a transmission request signal from the transmitting node over an arbitration channel corresponding to the transmitting node, monitoring, at the transmitting node, a plurality of arbitration channels corresponding to each of the plurality of receiving nodes and the one or more remaining nodes at the transmitting node for a predetermined period of time, determining a start time for a data transmission from the transmitting node based on the monitored signals to prevent a data collision, and initiating a data transmission of a data signal from the transmitting node over the optical data channel at the determined start time.

Abstract: A method of controlling memory operations in a transactional shared memory system having a plurality of nodes connected through an interconnect network.

Abstract: A method of detecting transmission collisions in an optical data interconnect system including a transmitting node, a plurality of receiving nodes, and one or more remaining nodes connected through an optical data channel.