Abstract: A method, computer program product, and computing system for determining a queue depth and a flush rate for each of a plurality of pending data queues associated with a cache system, thus defining a queue depth/flush rate pair for each of the plurality of pending data queues. A predicted drain time is determined for each of the plurality of pending data queues based, at least in part, upon the queue depth/flush rate pair, thus defining a plurality of predicted drain times that are respectively associated with the plurality of pending data queues.

Abstract: Described are techniques for evaluating a plurality of caching techniques. Cache decision engines (CDEs) are executed where each CDE uses a different caching technique. The CDEs includes a first CDE that performs data caching in accordance with a plurality of I/O operations and one or more other CDEs each simulating data caching in accordance with the plurality of I/O operations. Sets of performance data are determined with a different one of the sets of performance data determined for each of the CDEs thereby denoting measured performance for the CDE. Using the sets of performance data, it is determined whether any of the one or more other CDEs each simulating data caching has better performance than the first CDE.

Abstract: Multiple corruptions and/or erasures in data storage or data communication systems are corrected. An encoder generates M of parity fields from N data channels. Each item of the generated parity fields is the result of simple exclusive-or operations on one item from one or more data fields and possibly one item from one or more of the other parity fields. A decoder can regenerate as many as M missing or corrupted fields of either data or parity using combinations of correct and/or previously corrected items as inputs using M independent parity equations to solve for and correct each missing or corrupted item in turn.

Abstract: Multiple corruptions and/or erasures in data storage or data communication systems are corrected. An encoder generates M of parity fields from N data channels. Each item of the generated parity fields is the result of simple exclusive-or operations on one item from one or more data fields and possibly one item from one or more of the other parity fields. A decoder can regenerate as many as M missing or corrupted fields of either data or parity using combinations of correct and/or previously corrected items as inputs using M independent parity equations to solve for and correct each missing or corrupted item in turn.

Abstract: Multiple corruptions and/or erasures in data storage or data communication systems are corrected. An encoder generates M of parity fields from N data channels. Each item of the generated parity fields is the result of simple exclusive-or operations on one item from one or more data fields and possibly one item from one or more of the other parity fields. A decoder can regenerate as many as M missing or corrupted fields of either data or parity using combinations of correct and/or previously corrected items as inputs using M independent parity equations to solve for and correct each missing or corrupted item in turn.

Abstract: An electronic game wherein an electronic controller, connected to introduce RF signals through the antenna circuit of a television receiver, introduces to the receiver electric signals that produce on the screen thereof the simulation of at least part of a playing area and the simulation of active parts or components of a game.

Abstract: A frequency locked loop that provides an output voltage waveform locked in frequency with an input voltage waveform. The output waveform is provided by a voltage controlled oscillator that is resettable to permit adjustment of the frequency of its output waveform.