System and method for concatenating data

Information

  • Patent Grant
  • 7287102
  • Patent Number
    7,287,102
  • Date Filed
    Wednesday, January 21, 2004
    20 years ago
  • Date Issued
    Tuesday, October 23, 2007
    16 years ago
Abstract
A storage controller includes a first memory that stores a plurality of data blocks that include first and second noncontiguous data segments. A queue module stores data lengths and data start addresses of the first and second data segments. A read assembly module communicates with the first memory and the queue module, receives a request to read the first and second data segments from a host, reads the plurality of data blocks from the first memory, extracts the first and second data segments from the read plurality of data blocks based on the data lengths and data start addresses after the plurality of data blocks is read from the first memory, and transfers the first and second data segments contiguously to the host.
Description
BACKGROUND OF THE INVENTION

1. Field of the Invention


The present invention relates generally to storage device controllers, and more particularly, to streamlining data flow in storage device controllers.


2. Background


Conventional computer systems typically include several functional components. These components may include a central processing unit (CPU), main memory, input/output (“I/O”) devices, and streaming storage devices (for example, tape drives) (referred to herein as “storage device”). In conventional systems, the main memory is coupled to the CPU via a system bus or a local memory bus. The main memory is used to provide the CPU access to data and/or program information that is stored in main memory at execution time. Typically, the main memory is composed of random access memory (RAM) circuits. A computer system with the CPU and main memory is often referred to as a host system.


The storage device is coupled to the host system via a controller that handles complex details of interfacing the storage devices to the host system. Communications between the host system and the controller is usually provided using one of a variety of standard I/O bus interfaces.


Typically, when data is read from a storage device, a host system sends a read command to the controller, which stores the read command into the buffer memory. Data is read from the device and stored in the buffer memory.


In storage devices, data is stored in blocks of varying sizes and non-contiguous segments. However, data, when sent to the host system must be contiguous. Therefore, data, after being read should be assembled efficiently, so that, to a host system it appears contiguous. Conventional systems do not perform this function efficiently.


Therefore, there is a need for a system to assemble data so that when it is sent to the host it is contiguous.


SUMMARY OF THE INVENTION

In one aspect of the present invention, a read assembly module in a storage controller for concatenating data segments is provided. The read assembly module includes, a first register for receiving data segments and a data start address; and a second register for concatenating data segments having different data segment size.


The read assembly module also includes a third register that holds data before it is sent to the second register; and a fourth register for padding data segments, if padding is needed.


In yet another aspect of the present invention, a system for concatenating data segments before the data segments are sent to a requesting host system is provided. The system includes, a read assembly module; a read command queue, which provides information to the read assembly module; and a controller that controls the read command queue.


In yet another aspect of the present invention, a method for concatenating data segments before the data segments are sent to a requesting host system is provided. The method includes, receiving data start address; and assembling data segments such that the segments appear contiguous.


This brief summary has been provided so that the nature of the invention may be understood quickly. A more complete understanding of the invention can be obtained by reference to the following detailed description of the preferred embodiments thereof concerning the attached drawings.





BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing features and other features of the present invention will now be described with reference to the drawings of a preferred embodiment. In the drawings, the same components have the same reference numerals. The illustrated embodiment is intended to illustrate, but not to limit the invention. The drawings include the following Figures:



FIG. 1A shows a block diagram of a controller, according to one aspect of the present invention;



FIG. 1B is a block diagram of a buffer controller, according to one aspect of the present invention;



FIG. 2 shows examples of using the read assembly unit, according to one aspect of the present invention;



FIG. 3 is a block diagram of a read assembly unit, according to one aspect of the present invention;



FIG. 4 shows a block diagram of a Channel interface used by the buffer controller of FIG. 1B and uses the read assembly unit of FIG. 3, according to one aspect of the present invention;



FIG. 5 is a block diagram of a read assembly command queue (Scatter Gather Module) interfacing with various other components, according to one aspect of the present invention; and



FIG. 6 illustrates steps of a process for concatenating data segments according to one aspect of the present invention.





DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

To facilitate an understanding of the preferred embodiment, the general architecture and operation of a controller will initially be described. The specific architecture and operation of the preferred embodiment will then be described with reference to the general architecture.


The system of FIG. 1A is an example of a streaming storage drive system (e.g., tape drive), included in (or coupled to) a computer system. The host computer (not shown) and the storage device 115 communicate via port 102, which is connected to a data bus (not shown). In an alternate embodiment (not shown), the storage device 115 is an external storage device, which is connected to the host computer via a data bus. The data bus, for example, is a bus in accordance with a Small Computer System Interface (SCSI) specification. Those skilled in the art will appreciate that other communication buses known in the art can be used to transfer data between the drive and the host system.


As shown in FIG. 1A, the system includes controller 101, which is coupled to SCSI port 102, port 114, buffer memory 111 and microprocessor 100. Interface 118 serves to couple microprocessor bus 107 to microprocessor 100. A read only memory (“ROM”) omitted from the drawing is used to store firmware code executed by microprocessor 100. Port 114 couples controller 101 to device 115.


Controller 101 can be an integrated circuit (IC) that comprises of various functional modules, which provide for the writing and reading of data stored on storage device 115. Microprocessor 100 is coupled to controller 101 via interface 118 to facilitate transfer of data, address, timing and control information. Buffer memory 111 is coupled to controller 101 via ports to facilitate transfer of data, timing and address information.


Data flow controller 116 is connected to microprocessor bus 107 and to buffer controller 108. A DMA interface 112 is connected to microprocessor bus 107 and to data and control port 113.


SCSI controller 105 includes programmable registers and state machine sequencers that interface with SCSI port 102 on one side and to a fast, buffered direct memory access (DMA) channel on the other side.


Sequencer 106 supports customized SCSI sequences, for example, by means of a 256-location instruction memory that enables users to customize command automation features. Sequencer 106 is organized in accordance with the Harvard architecture, which has separate instruction and data memories. Sequencer 106 includes, for example, a 32-byte register file, a multi-level deep stack, an integer algorithmic logic unit (ALU) and other special purpose modules. Sequencer 106 supports firmware and hardware interrupts schemes. The firmware interrupt enables microprocessor 100 to initiate an operation within Sequencer 106 without stopping sequencer operation. Hardware interrupt comes directly from SCSI controller 105.


Buffer controller (also referred to as “BC”) 108 connects buffer memory 111, DMA I/F 112, a SCSI channel of SCSI controller 105 and to bus 107. Buffer controller 108 regulates data movement into and out of buffer memory 111.


To read data from device 115, a host system sends a read command to controller 101, which stores the read commands in buffer memory 111. Microprocessor 100 then reads the command out of buffer memory 111 and initializes the various functional blocks of controller 101. Data is read from device 115 and is passed through DMA I/F 112 to buffer controller 108.



FIG. 1B shows a block diagram of BC 108 with Channel 1108A and Channel 0108D interfaces for moving data to and from buffer 111. BC 108 includes register(s) 108E and an Arbiter 108C. Arbiter 108C arbitrates between plural channels in BC 108, for example, Channel 0108D and Channel 1108A. Register 108E is coupled to interface 118 via bus 107 that allows microprocessor 100 and BC 108 to communicate. Data 108G and status 108F is moved in and out of register 108E.


BC 108 also includes a memory controller 108B that interfaces with buffer 111 through a synchronous dynamic random access memory (“SDRAM”) or dynamic random access memory (“DRAM”) interface 108J.



FIG. 4 shows a block diagram, of Channel 1108A interface, which includes read assembly unit 403 and read assembly command queue 402 (may also be referred to as “scatter gather module 402”) that are described below, according to one aspect of the present invention.


Channel 1108A also includes a first-in first-out memory buffer (“FIFO”) 404 that receives data from SCSI interface 105. Channel 1108A also has plural registers 400 that are operationally coupled to a controller 401 that is coupled to a buffer memory 111 via interface 108J. Controller 401 includes a state machine 501 (FIG. 5) that monitors/controls queue 402, as described below.


Read Assembly Module:



FIG. 3 shows a block diagram of read assembly unit 403 in BC 108, according to one aspect of the present invention. Read assembly operations in controller 101 use the read assembly module 403 and the Scatter-Gather module 402 to concatenate data segments to be written into channel 1108A FIFO 404. Each data segment is defined by a scatter-gather entry for length and location (data start address) within external buffer memory 111 with the start address of the data block. As the data blocks containing the data segments are read, module 403 extracts the data segments and writes them into Channel 1108A FIFO 404. Entire data blocks are read to verify data integrity by using the CRC (cyclic redundancy code). The data segments then appear contiguous to a host that had a read request and can include multiple data blocks. Also, multiple blocks are pieced together without loosing any data integrity because data length can span multiple blocks and when data length crosses over CRC, the CRC is not transferred to FIFO 404.


In one embodiment of the present invention, read assembly module (or unit) 403 (may also be referred to as module 403 or unit 403) is a pipelined design. Buffer controller 108 control signals, address, data and masks are registered in register 301 of read assembly module 403. Data collection starts when a cycle includes the byte address contained in a data start address register 510 (FIG. 5).


Register 301 receives address from register 510, data 311, mask, cyclic redundancy code (“CRC”) and data acknowledgement (DACK_REG). The address denotes the location from where data is to be read.


A “shuttle” register 302 is used to hold data temporarily for later assembly in register 303. Although shuttle register 302 may be of any size, in one aspect of the present invention, it may be 7 bytes wide. Shuttle register 302 receives data from register 301.


“Data-Out” (or output) register 303 collects data from shuttle register 302 and register 301 via multiplexer (“Mux”) shifter 304 for assembly. Mux shifter 304 selects the valid byte(s) from registers 301 and 302.


In one aspect, register 303 collects an 8-byte word. Channel 1 FIFO 404 may be written 8 bytes at a time, except for the last write, which may only be 4 bytes. A segment can be of any byte length supported by the Data Length counter/register (511, FIG. 5), so it is possible to end up with a non-MOD4 residue in shuttle register 302.


A force transfer signal (FORCE_XFR) is used to push non-MOD4 residues into the FIFO 404. The non-MOD4 residue is padded (305A) to the nearest MOD4 boundary before it is written into the FIFO 404 via register 306. The padding 305A occurs in register 306.


Read assembly unit 403 also includes logic for two adders, 308 and 310. Logic 308 receives the number of new bytes from register 301 and the number of valid bytes 309 from register 302. Output 308A of logic 308 is sent to register 302.


Logic 310 receives the number of new bytes from register 301 and the number of valid bytes from register 302. Output 310A of logic 310 is sent to register 303.


Read Assembly Operations:


Read assembly operations concatenate data segments and write them into FIFO 404. Data segments reside in buffer 111 and are defined using a data length register/counter 511 and a data start address register 510. The data length register 511 contains the segment length in bytes. The data start address register 510 contains the byte address from where the segment begins. The data start address can be loaded with any byte address within the BC 108-address space into register 301.


Read assembly module 403 sends to FIFO 404 the selected data segment, but the entire block where the segment resides is read so that CRC can confirm data integrity. CRC bytes are not written into FIFO 404 nor accounted for in data length counter 511. In one aspect of the present invention, channel 1108A operations are in double-word multiples, and the read-tape-assembly module 403 may pad (305A) the last word written into FIFO 404.


Multiple segments are concatenated using the scatter-gather queue 402. Each scatter-gather entry includes all data required to define a segment.



FIG. 5 shows a block diagram showing read command queue 402 interaction with various components, according to one aspect of the present invention. Read command queue 402 may have any number of queues. FIG. 5 illustrates only 8 queues (0-7). Each queue, for example queue 0, has various entries, collectively shown as 507, which includes, last block bit, sector size, the start address for a sector, the start address for the data and the data length.


Queue management logic 508 controls queue entries and loads queue 402 using a valid bit 502. Queue 402 is functionally coupled to a transfer counter 509, address counter 506, data start address register 510 and data length counter 511.


Transfer counter 509 counts the number of sectors that have been transferred. Address counter 506 maintains a count for buffer 111 addresses.


Data start address register 510 provides the address of the data to register 301 in read assembly unit 403 (shown as read assembly data path 504 in FIG. 5). Data length counter 511 maintains the count of data that is moved, which terminates the operation after the last block.


Output 505 is used for diagnostic purposes and is sent to register 400. State machine 501 (in controller 401) interfaces with read assembly path 504 and queue 402.



FIG. 6 shows a process flow diagram for concatenating data segments so that the data segments appear contiguous. The process starts in step S601. Register 301 receives data start address from register 510. In step S602, data segments are loaded in register 301.


In step S603, data assembly takes place in register 303 that receives the number of bytes from register 301 and valid bytes from shuttle register 302. If any padding 305A is required, then it is done in register 306.


Thereafter, in step S604, data concatenated data segments are moved into FIFO 404. The process stops based on the value of data length counter 511.



FIG. 2 shows an example of how data is concatenated, using the foregoing adaptive aspects of the present invention. It is noteworthy that the example in FIG. 2 is not intended to limit the invention, but is only to provide an example.



FIG. 2 shows three data segments in buffer 111. Data block address is shown as 0, 8, 16, 24, 32 and 40 on one side and 7, 15, 23, 31, 39 and 47 on another side. Multiple data blocks can be read and concatenated, while maintaining data integrity. Hence, if a large block of data has to be transferred, for example 10 MB, the data is broken in to chunks, for example, 512 bytes with 4 bytes of CRC. These blocks are then stored and read in segments, according to one aspect of the present invention.


The first data segment has a data block address of 0, data start address of 3, length 3 bytes and block size 16. This segment is copied into FIFO 404. The second data segment has a length of 1 byte, a start address 16 and data block address of 16. The third segment also has a data block address of 16, length of 7 bytes, and data start address of 27. All this information is sent to register 301.


All three data segments are concatenated and written into FIFO 404 so that they appear contiguous to a requesting host system (not shown). Also, FIFO 404 may have three (3) pad bytes because the total length (addition of the three segments) was not mod4 and the last segment goes across a block boundary operation. It is noteworthy that the CRC is not transferred to FIFO 404. As shown in FIG. 2, multiple blocks of data from buffer memory 111 are concatenated together, while data integrity is maintained.


In one aspect of the present invention, data fragments are efficiently concatenated.


Although the present invention has been described with reference to specific embodiments, these embodiments are illustrative only and not limiting. Many other applications and embodiments of the present invention will be apparent in light of this disclosure.

Claims
  • 1. A storage controller, comprising: a first memory that stores a plurality of data blocks that include first and second noncontiguous data segments;a queue module that stores data lengths and data start addresses of the first and second data segments; anda read assembly module that communicates with the first memory and the queue module, that receives a request to read the first and second data segments from a host, that reads the plurality of data blocks from the first memory, that extracts the first and second data segments from the read plurality of data blocks based on the data lengths and data start addresses after the plurality of data blocks is read from the first memory, and that transfers the first and second data segments contiguously to the host.
  • 2. The storage controller of claim 1 wherein the read plurality of data blocks include data integrity verification data.
  • 3. The storage controller of claim 2 wherein the data integrity verification data is cyclic redundancy code (CRC) data.
  • 4. The storage controller of claim 2 wherein the read assembly module does not transfer the data integrity verification data to the host.
  • 5. The storage controller of claim 1 wherein the read assembly module concatenates the first and second data segments.
  • 6. The storage controller of claim 1 further comprising a second memory, wherein the read assembly module transfers the first and second data segments to the second memory and the second memory transfers the first and second data segments to the host.
  • 7. The storage controller of claim 6 wherein the second memory is a first in first out (FIFO) buffer.
  • 8. The storage controller of claim 1 wherein the first memory is a buffer memory.
  • 9. The storage controller of claim 8 wherein the buffer memory receives the first and second data segments from a storage device.
  • 10. The storage controller of claim 9 wherein the storage device is a hard disk drive (HDD).
  • 11. A storage controller, comprising: first memory means for storing a plurality of data blocks that include first and second noncontiguous data segments;queue means for storing data lengths and data start addresses of the first and second data segments; andread assembly means for communicating with the first memory and the queue module, for receiving a request to read the first and second data segments from a host, for reading the plurality of data blocks from the first memory, for extracting the first and second data segments from the read plurality of data blocks based on the data lengths and data start addresses after the plurality of data blocks is read from the first memory means, and for transferring the first and second data segments contiguously to the host.
  • 12. The storage controller of claim 11 wherein the read plurality of data blocks include data integrity verification data.
  • 13. The storage controller of claim 12 wherein the data integrity verification data is cyclic redundancy code (CRC) data.
  • 14. The storage controller of claim 12 wherein the read assembly means does not transfer the data integrity verification data to the host.
  • 15. The storage controller of claim 11 wherein the read assembly means concatenates the first and second data segments.
  • 16. The storage controller of claim 11 further comprising second memory means for storing data, wherein the read assembly means transfers the first and second data segments to the second memory means and the second memory means transfers the first and second data segments to the host.
  • 17. The storage controller of claim 16 wherein the second memory means is a first in first out (FIFO) buffer.
  • 18. The storage controller of claim 11 wherein the first memory means receives the first and second data segments from a storage device.
  • 19. The storage controller of claim 18 wherein the storage device is a hard disk drive (HDD).
  • 20. A method for operating a storage controller, comprising: storing a plurality of data blocks that include first and second noncontiguous data segments in a first memory;storing data lengths and data start addresses of the first and second data segments in a queue module;receiving a request to read the first and second data segments from a host at a read assembly module;reading the plurality of data blocks from the first memory;extracting the first and second data segments from the read plurality of data blocks based on the data lengths and data start addresses after the plurality of data blocks is read from the first memory; andtransferring the first and second data segments contiguously to the host.
  • 21. The method of claim 20 wherein the read plurality of data blocks include data integrity verification data.
  • 22. The method of claim 21 wherein the data integrity verification data is cyclic redundancy code (CRC) data.
  • 23. The method of claim 21 wherein the read assembly module does not transfer the data integrity verification data to the host.
  • 24. The method of claim 20 further comprising concatenating the first and second data segments.
  • 25. The method of claim 20 further comprising: transferring the first and second data segments from the read assembly module to a second memory; andtransferring the first and second data segments from the second memory to the host.
  • 26. The method of claim 25 wherein the second memory is a first in first out (FIFO) buffer.
  • 27. The method of claim 20 further comprising receiving the first and second data segments from a storage device.
  • 28. The method of claim 27 wherein the storage device is a hard disk drive (HDD).
CROSS REFERENCE TO RELATED APPLICATIONS

This patent application is related to and claims priority to U.S. provisional patent application Ser. No. 60/444,339, Filed on Jan. 31, 2003, entitled “System and Method for Coalescing Data”, the disclosure of which is incorporated herein by reference in its entirety.

US Referenced Citations (181)
Number Name Date Kind
3800281 Devore et al. Mar 1974 A
3988716 Fletcher et al. Oct 1976 A
4001883 Strout et al. Jan 1977 A
4016368 Apple, Jr. Apr 1977 A
4050097 Miu et al. Sep 1977 A
4080649 Calle et al. Mar 1978 A
4156867 Bench et al. May 1979 A
4225960 Masters Sep 1980 A
4275457 Leighou et al. Jun 1981 A
4390969 Hayes Jun 1983 A
4451898 Palermo et al. May 1984 A
4486750 Aoki Dec 1984 A
4500926 Yoshimaru et al. Feb 1985 A
4587609 Boudreau et al. May 1986 A
4603382 Cole Jul 1986 A
4625321 Pechar et al. Nov 1986 A
4667286 Young et al. May 1987 A
4777635 Glover Oct 1988 A
4805046 Kuroki et al. Feb 1989 A
4807116 Katzman et al. Feb 1989 A
4807253 Hagenauer et al. Feb 1989 A
4809091 Miyazawa et al. Feb 1989 A
4811282 Masina Mar 1989 A
4812769 Agoston Mar 1989 A
4860333 Bitzinger et al. Aug 1989 A
4866606 Kopetz Sep 1989 A
4881232 Sako et al. Nov 1989 A
4920535 Watanabe et al. Apr 1990 A
4949342 Shimbo et al. Aug 1990 A
4970418 Masterson Nov 1990 A
4972417 Sako et al. Nov 1990 A
4975915 Sako et al. Dec 1990 A
4989190 Kuroe et al. Jan 1991 A
5014186 Chisholm May 1991 A
5023612 Liu Jun 1991 A
5027357 Yu et al. Jun 1991 A
5050013 Holsinger Sep 1991 A
5051998 Murai et al. Sep 1991 A
5068755 Hamilton et al. Nov 1991 A
5068857 Yoshida Nov 1991 A
5072420 Conley et al. Dec 1991 A
5088093 Storch et al. Feb 1992 A
5109500 Iseki et al. Apr 1992 A
5117442 Hall May 1992 A
5127098 Rosenthal et al. Jun 1992 A
5133062 Joshi et al. Jul 1992 A
5136592 Weng Aug 1992 A
5146585 Smith, III Sep 1992 A
5157669 Yu et al. Oct 1992 A
5162954 Miller et al. Nov 1992 A
5193197 Thacker Mar 1993 A
5204859 Paesler et al. Apr 1993 A
5218564 Haines et al. Jun 1993 A
5220569 Hartness Jun 1993 A
5237593 Fisher et al. Aug 1993 A
5243471 Shinn Sep 1993 A
5249271 Hopkinson Sep 1993 A
5257143 Zangenehpour Oct 1993 A
5261081 White et al. Nov 1993 A
5271018 Chan Dec 1993 A
5274509 Buch Dec 1993 A
5276564 Hessing et al. Jan 1994 A
5276662 Shaver, Jr. et al. Jan 1994 A
5276807 Kodama et al. Jan 1994 A
5280488 Glover et al. Jan 1994 A
5285327 Hetzler Feb 1994 A
5285451 Henson et al. Feb 1994 A
5301333 Lee Apr 1994 A
5307216 Cook et al. Apr 1994 A
5315708 Eidler et al. May 1994 A
5339443 Lockwood Aug 1994 A
5361266 Kodama et al. Nov 1994 A
5361267 Godiwala et al. Nov 1994 A
5408644 Schneider et al. Apr 1995 A
5420984 Good et al. May 1995 A
5428627 Gupta Jun 1995 A
5440751 Santeler et al. Aug 1995 A
5465343 Henson et al. Nov 1995 A
5473761 Parks et al. Dec 1995 A
5487170 Bass et al. Jan 1996 A
5488688 Gonzales et al. Jan 1996 A
5491701 Zook Feb 1996 A
5500848 Best et al. Mar 1996 A
5506989 Boldt et al. Apr 1996 A
5507005 Kojima et al. Apr 1996 A
5519837 Tran May 1996 A
5523903 Hetzler et al. Jun 1996 A
5544180 Gupta Aug 1996 A
5544346 Amini et al. Aug 1996 A
5546545 Rich Aug 1996 A
5546548 Chen et al. Aug 1996 A
5563896 Nakaguchi Oct 1996 A
5572148 Lytle et al. Nov 1996 A
5574867 Khaira Nov 1996 A
5581715 Verinsky et al. Dec 1996 A
5583999 Sato et al. Dec 1996 A
5592404 Zook Jan 1997 A
5600662 Zook et al. Feb 1997 A
5602857 Zook et al. Feb 1997 A
5615190 Best et al. Mar 1997 A
5623672 Popat Apr 1997 A
5623692 Priem et al. Apr 1997 A
5626949 Blauer et al. May 1997 A
5627695 Prins et al. May 1997 A
5640602 Takase Jun 1997 A
5649230 Lentz Jul 1997 A
5664121 Cerauskis Sep 1997 A
5689656 Baden et al. Nov 1997 A
5691994 Acosta et al. Nov 1997 A
5692135 Alvarez, II et al. Nov 1997 A
5692165 Jeddeloh et al. Nov 1997 A
5719516 Sharpe-Geisler Feb 1998 A
5729718 Au Mar 1998 A
5740406 Rosenthal et al. Apr 1998 A
5740466 Geldman Apr 1998 A
5745793 Atsatt et al. Apr 1998 A
5754759 Clarke et al. May 1998 A
5758188 Appelbaum et al. May 1998 A
5784569 Miller et al. Jul 1998 A
5794073 Ramakrishnan et al. Aug 1998 A
5801998 Choi Sep 1998 A
5818886 Castle Oct 1998 A
5822142 Hicken Oct 1998 A
5831922 Choi Nov 1998 A
5835930 Dobbek Nov 1998 A
5841722 Willenz Nov 1998 A
5844844 Bauer et al. Dec 1998 A
5850422 Chen Dec 1998 A
5854918 Baxter Dec 1998 A
5890207 Sne et al. Mar 1999 A
5890210 Ishii et al. Mar 1999 A
5907717 Ellis May 1999 A
5912906 Wu et al. Jun 1999 A
5925135 Trieu et al. Jul 1999 A
5937435 Dobbek et al. Aug 1999 A
5950223 Chiang et al. Sep 1999 A
5968180 Baco Oct 1999 A
5983293 Murakami Nov 1999 A
5991911 Zook Nov 1999 A
6029226 Ellis et al. Feb 2000 A
6029250 Keeth Feb 2000 A
6041417 Hammond et al. Mar 2000 A
6065053 Nouri et al. May 2000 A
6067206 Hull et al. May 2000 A
6070200 Gates et al. May 2000 A
6078447 Sim Jun 2000 A
6081849 Born et al. Jun 2000 A
6092231 Sze Jul 2000 A
6094320 Ahn Jul 2000 A
6124994 Malone, Sr. Sep 2000 A
6134063 Weston-Lewis et al. Oct 2000 A
6157984 Fisher Dec 2000 A
6178486 Gill et al. Jan 2001 B1
6185207 LaBerge et al. Feb 2001 B1
6192499 Yang Feb 2001 B1
6201655 Watanabe et al. Mar 2001 B1
6223303 Billings et al. Apr 2001 B1
6279089 Schibilla et al. Aug 2001 B1
6297926 Ahn Oct 2001 B1
6330626 Dennin et al. Dec 2001 B1
6381659 Proch et al. Apr 2002 B2
6401149 Dennin et al. Jun 2002 B1
6470461 Pinvidic et al. Oct 2002 B1
6487631 Dickinson et al. Nov 2002 B2
6490635 Holmes Dec 2002 B1
6530000 Krantz et al. Mar 2003 B1
6574676 Megiddo Jun 2003 B1
6662334 Stenfort Dec 2003 B1
6816921 Jahnke et al. Nov 2004 B2
6826650 Krantz et al. Nov 2004 B1
20010044873 Wilson et al. Nov 2001 A1
20010054121 Proch et al. Dec 2001 A1
20020176301 Kim Nov 2002 A1
20030037225 Deng et al. Feb 2003 A1
20030059118 Suzuki Mar 2003 A1
20030097525 Aruga May 2003 A1
20030120797 Brodeur et al. Jun 2003 A1
20030172325 Wyatt et al. Sep 2003 A1
20030177435 Budd et al. Sep 2003 A1
20040004964 Lakshmanamurthy et al. Jan 2004 A1
20040260866 Davis Dec 2004 A1
Foreign Referenced Citations (8)
Number Date Country
0528273 Feb 1993 EP
0622726 Nov 1994 EP
0718827 Jun 1996 EP
2285166 Jun 1995 GB
63-292462 Nov 1988 JP
01-315071 Dec 1989 JP
03183067 Aug 1991 JP
9814861 Apr 1998 WO
Provisional Applications (1)
Number Date Country
60444339 Jan 2003 US