Run-time reconfiguration method for programmable units

Information

  • Patent Grant
  • 7174443
  • Patent Number
    7,174,443
  • Date Filed
    Monday, January 31, 2000
    25 years ago
  • Date Issued
    Tuesday, February 6, 2007
    18 years ago
Abstract
A method of run-time reconfiguration of a programmable unit is provided, the programmable unit including a plurality of reconfigurable function cells in a multidimensional arrangement. An event is detected. The source of the detected event is determined, and an address of an entry in a jump table is calculated as a function of the source of the event, the entry storing a memory address of a configuration for a reconfigurable function cell. The entry is retrieved and a state of a corresponding reconfigurable cell is determined. If the reconfigurable cell is in a reconfiguration state, the reconfigurable cell is reconfigured as a function of the configuration data. If the reconfigurable cell in not in reconfiguration state, the configuration data is stored in a FIFO.
Description
FIELD OF THE INVENTION

The present invention relates to reprogrammable units.


BACKGROUND INFORMATION

Programmable units with a two- or multi-dimensional cell architecture (in particular FPGAs, DPGAs and DFPs, etc.) are programmed today in two different ways.

    • Once, i.e., the configuration cannot be changed after programming. All the configured elements of the unit thus perform the same function over the entire period of time during which the application is being carried out.
    • During operation, i.e., the configuration can be changed after installation of the unit, by loading a configuration data file, at the start of the application. Units such as, for example, FPGA units, cannot be reconfigured during operation. With reconfigurable units, further processing of data during the reconfiguration is usually impossible, and the required reconfiguration time is much too long.


In addition to FPGAs, there are also DPGAs. These units store a number of different configurations which are selected by a special data packet. Run-time reconfiguration of these memory devices is impossible.


Major problems are posed by run-time reconfiguration of all programmable units or parts thereof, especially synchronization. All the possibilities proposed so far involve stopping the processing of the entire unit during reconfiguration. Another problem is selection of the new subconfiguration to be loaded and integration of this subconfiguration into the existing configuration.


SUMMARY OF THE INVENTION

The method according to the present invention makes it possible to reload a run-time reconfigurable unit efficiently and without having any effect on the areas not involved in the reconfiguration. In addition, this method makes it possible to select configurations as a function of the prevailing configuration. The problem of synchronizing the areas involved in the reconfiguration with those not involved in the reconfiguration is also solved.


In accordance with an exemplary embodiment of the present invention, a method is provided for reconfiguring programmable units having a two- or multi-dimensional cell arrangement. The method of the present invention makes it possible to reconfigure the unit(s) without limiting the operability of the cells not involved in the reconfiguration. This method makes it possible to load complete configurations or subconfigurations into the programmable unit(s).





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 shows a flow chart of the steps to be carried out after a system start in accordance with an exemplary embodiment of the present invention.



FIG. 2 shows a flow chart of the steps to be carried out after a reconfiguration request is received in accordance with the exemplary embodiment of the present invention.



FIG. 3 shows a flow chart of the steps to be carried out in the FIFO memory processing in accordance with the exemplary embodiment of the present invention.



FIG. 4 shows a flow chart of the steps to be carried out in configuring the cells in accordance with the exemplary embodiment of the present invention.



FIG. 5 shows the PLU with its registers, as well as the configuration memory, the subdivision into jump table, start configuration, additional configurations and the FIFO memories, in accordance with the exemplary embodiment of the present invention.



FIG. 6 shows two details from a configuration program and four details from the jump table and how they are related in time in accordance with the exemplary embodiment of the present invention.





DETAILED DESCRIPTION OF THE INVENTION

The method in accordance with the exemplary embodiment that is described herein presupposes a programmable unit which has the following properties:

    • Primary logic unit: The primary logic unit (PLU) is the part of the unit that performs the loading and entering of configuration strings into the elements of the unit to be configured (cells).
    • Cells: The unit has a number of cells that can be addressed individually by the PLU.
    • Feedback to the PLU: Each cell or group of cells must be able to notify the PLU whether it can be reconfigured.
    • Feedback to cells: Each cell must have the option of sending a STOP signal to the cells from which it has received its data to be processed.
    • START/STOP identifier: Each cell must have the possibility of setting a START/STOP identifier.
      • The START identifier characterizes a cell as the start of a longer processing chain (macro).
      • The STOP identifier marks the end of the macro, i.e., the point at which the processing of the macro has yielded a result.


Structure of a configuration string: The PLU in accordance with the exemplary embodiment of the present invention is a state machine that can process configuration strings.


In addition to configuration strings for cells, there are entries which can be recognized as commands by the PLU. It is thus possible to differentiate whether the contents of the configuration string are to be transmitted to a cell or whether they represent a command for the state machine.


A configuration string which is transmitted to cells of the unit must contain at least the following data:

    • Address of the cell, e.g., as linear numbers or as X, Y coordinates.


Configuration string which is transmitted to the cell.


Identifiers and commands for the PLU: For correct operation of the PLU, it must be able to recognize only two command strings, namely:

    • END


This is a command that sets the PLU in a state in which it waits for the arrival of events from cells (FIG. 2).

    • DISPATCH (entry number, address)


The PLU enters the value of the address parameter into the address, which is given by the entry number parameter, of the jump table.


In addition, the PLU can recognize an entry as a blank entry. This is accomplished by defining a certain bit pattern as a blank identifier which can be recognized by the PLU.


The jump table: There is a jump table (0506) in the configuration memory. The size of the jump table is selected, for example, so that there is exactly one single entry for each cell that can be addressed by the PLU. For each cell address there is exactly one single entry in the jump table which can be calculated by the PLU (FIGS. 5 and 6).


There is a memory address (0601) in an entry in the jump table. This memory address indicates where additional configuration data (0508) from the configuration memory are to be read if there is a feedback from this cell to the PLU.


Start of the system: By resetting the system, the PLU begins to receive or load configuration data from a memory into the configuration memory (0101). All the cells of the unit are in the state in which they can be configured. Then, by loading the program counter (PC) (0505), the PLU jumps to a memory site containing (0102) the address of a start configuration (0507). This start configuration is processed until the PLU recognizes an END identifier (0103). This start configuration programs the unit in such a way that processing of data can begin. After entering the start configuration, the PLU changes on the basis of the END identifier to a state in which it waits for results from the cells (0104).


Arrival of an event from a cell: After processing data, a cell can send a feedback to the PLU. This feedback (event) indicates that the cell and thus the macro in which the cell is contained has completed its work and reloading can begin.


However, before beginning with the loading of a new configuration, the FIFO memory (first-in-first-out memory) described below is processed (0201).


It is advantageous for the memory to be organized as a FIFO memory. This organization guarantees, for example, that cells which could not be reloaded in the first attempt are guaranteed to be the first in line in the second attempt. This prevents cells which have signaled in the meantime that they can be reconfigured from slipping to the back in processing. In this case, a deadlock situation could occur in which one macro can be reconfigured only when another macro has been reconfigured.


Through the feedback to the PLU, the PLU also receives the address or the number of the cell that triggered the feedback. With this number, the proper entry in the jump table is selected (0203, 0204). The address contained in this entry indicates the start of the configuration to be loaded within the configuration memory (0205).


FIFO memory: The method in accordance with the exemplary embodiment of the present invention takes into account the fact that some cells might not have completed their work, although these cells should already be reloaded. All configuration data of cells in which such a condition applies are copied to a special memory area (FIFO memory) (0506).


Each time before a new configuration is to be loaded, the FIFO memory is run through. Since a new configuration is to be loaded, some cells have completed their work and have entered the “reconfigurable” state. These cells may also include those in which reconfiguration by the PLU has failed in a previous attempt because these cells had not yet completed their work but now this reconfiguration can be performed successfully.


This PLU loads the PC with the contents of the register which indicates the start of FIFO memory (FIFO start REG) (0502) and reads data out of the FIFO memory. A comparison ascertains whether the end of the FIFO memory has been reached (0301). If this is the case, the system returns to the point in the state machine where reconfiguration is continued (0202).


The FIFO memory is processed like a configuration within the configuration memory. The case can occur where a cell cannot be reconfigured even with another attempt. In this case the configuration data is copied (0302) to this memory location if there is an empty memory location closer to the front of FIFO memory.


This copying operation is accomplished by virtue of the fact that the PLU has stored the start address of the FIFO memory in FIFO start REG (0502) and the end address in FIFO end REG (0503). In addition, the PLU identifies the address of the next free entry (starting from the beginning of the FIFO memory) by means of FIFO free entry REG (0504, 0303). After the configuration string has been copied (0304) to the free entry, the PLU positions the pointer of FIFO free entry REG at the next free entry (0305) within the FIFO memory. The search is then conducted in the direction of the end of the FIFO memory. Then the PC is set at the next entry within the FIFO memory (0306).


Reloading cells: The PLU then reads the configuration data out of the configuration memory. This data contains the address of the cell to be reloaded (FIG. 4). Each cell can signal that it can be reloaded. The PLU tests this (0401). If the cell can be reloaded, the configuration data is transferred from the PLU to the cell.


If the cell is not yet ready, the data read by the PLU are written to a memory area, the FIFO memory, within the configuration memory (0402). The address to which the data is written is stored in a register (FIFO end REG) (0503) in the PLU.


This process is repeated until the PLU recognizes the END identifier of the configuration program and returns it to the state in which the PLU waits for events from the cells (0403).


Structure of the configuration program: After a cell has given the signal for reloading and the macro in which the cell is integrated has been reloaded, a new configuration is obtained. The cell which has previously given the signal to the PLU can now have a very different function, in particular it may no longer be the cell which sends a reload signal to the PLU. In the new configuration, it is possible for the same cell to again send the reload signal to the PLU.


By means of the DISPATCH command within the configuration program, a new address can be written to the entry position of the cell in the jump table (0604). This new address may point to a new configuration or subconfiguration to be loaded upon feedback from this cell.



FIG. 1 shows a flow chart of the steps to be carried out after a system start. The system goes to the waiting state (0104) upon comparison of the start configuration with the END identifier.



FIG. 2 shows a flow chart of the required steps to be carried out during the waiting state and after a reconfiguration has been signaled by a cell. The flow chart has an entry point (0202) which is accessed from another location.



FIG. 3 shows a flow chart of how the FIFO memory is to be handled. It also shows how the copy process works within the FIFO memory.



FIG. 4 shows in a flow chart which steps are necessary in reconfigurating the cells and how a configuration is processed within the configuration program.



FIG. 5 shows the PLU and its registers. The PLU has five different registers, namely:

    • The start configuration REG (0501). This register contains the address of the start configuration within the configuration memory. The data is contained in the configuration program in such a way that it can be recognized by the PLU and transferred to the start configuration REG.
    • A FIFO start REG (0502). The FIFO start REG indicates the start of the FIFO memory area within the configuration memory.
    • A FIFO end REG (0503). The FIFO end REG denotes the end of the FIFO memory. The configuration strings which could not be processed by the PLU are copied to this location.
    • A FIFO free entry REG (0504). The FIFO free entry REG indicates the free entry closest to the beginning (FIFO start REG) of the FIFO memory. The configuration strings which again could not be processed by the PLU during the run-through of The FIFO memory are copied to this location.
    • A program counter (PC). The PC points to the address within the configuration memory where the next configuration string to be processed by the PLU is located.
    • An address REG (0510). The address of a cell to be addressed is stored in this register.
    • A data REG (0511). This register stores the configuration data to be sent to the cell addressed by address REG.
    • A dispatch REG (0512). Dispatch REG stores the address of the entry in the jump table accessed by the PLU.


In addition, the configuration memory and its various sections are also shown. These are:

    • The jump table (0506). For each cell that can be configured by the PLU there is a single entry. This entry contains the address which is loaded into the PC when signaled by this cell.
    • A start configuration (0507). The start configuration is any configuration loaded into the unit after starting the system.
    • Additional configurations (0508). These configurations can be loaded into the unit during system run time. The configurations consist of configuration strings and PLU commands.
    • A FIFO memory area (0509). The FIFO memory area contains all configuration strings that could not be processed successfully in a first attempt.



FIG. 6 shows two sections of a configuration. These sections show the commands and configuration strings processed by the PLU. It also shows two sections from the jump table (0601 and 0607) and the status of these sections (0602 and 0608) after processing of the two configuration sections.


Embodiments: It is assumed that one or more units are to be reconfigured by a PLU as described in the invention. In addition, it is assumed that the system has already loaded the start configuration and that the PLU is in the state of “waiting for an event.” The execution begins with the arrival of an event from cell number 41.


The PLU begins first with the processing of The FIFO memory (0201). The start of the FIFO memory is transferred to the PC from the FIFO start REG register. The data at the location to which the PC is pointing is read. Then a check is performed to determine whether the end of the FIFO memory has been reached. This is the case in this embodiment, because the system is being reloaded for the first time.


The address of the cell which has triggered the signal is converted by the PLU to an address in the jump table. This calculated address is loaded into the dispatch REG (0512). The PLU then reads the address out of the jump table (0506) which is stored at the memory address addressed by the dispatch REG (0601). This address is loaded into the PC.


Then the processing of the configuration strings begins (0603). It is assumed that command number 3 (1.3 MUL) cannot be executed because the cell with the address (1.3) cannot be reconfigured. The data is then copied to the FIFO memory. On reaching the DISPATCH command (0604), a new address is entered (0602) at address 41 in the jump table. The END command again puts the PLU in the state of “waiting for an event.”


After a period of time, a signal again arrives from cell 41. Now there is another address (0602) at address 42 in the jump table. The PLU again processes the FIFO memory first. Now the data is in the FIFO memory.


The data from the FIFO memory is read and an attempt is made to load the addressed cell with the data. Since the cell can now be reconfigured, this attempt is successful. A blank identifier is then written into the entry in the FIFO memory.


The original processing is continued and the reading of configuration data then begins at a different address (0605).


This configuration is processed; this time the DISPATCH command writes an address into entry number 12 of the jump table (0606). Then the END command causes the PLU to return to the state of “waiting for an event.”


This interplay is repeated for the entire run time of the system.


Definition of Terms


Configurable element: A configurable element is a unit of a logic unit which can be set by a configuration string for a specific function. Configurable elements are thus all types of RAM cells, multiplexers, arithmetic logic units, registers and all types of internal and external interconnection description, etc.


Configuring: Setting the function and interconnection of a configurable element.


Configuration memory: The configuration memory contains one or more configuration strings.


Configuration string: A configuration string consists of a bit sequence of any length. This bit sequence represents a valid setting for the element to be configured, so that a functional element results.


PLU: Unit for configuring and reconfiguring programmable units. Embodied by a state machine or a microcontroller adapted specifically to its function.


Macro: A macro is a quantity of cells which together implement a task, function, etc.


Reconfiguring: New configuration of any number of configurable elements of a programmable unit while any remaining number of configurable elements continue their own functions (see configuring).


Feedback: Feedback is an action that can be triggered by a cell. With feedback, various pieces of information can be sent to the unit receiving the feedback.


Cell: See configurable element.


State machine: Logic unit which can assume various states. The transitions between states depend on various input parameters. These are known machines for controlling complex functions.

Claims
  • 1. A system for reconfiguring a programmable unit, the programmable unit including a plurality of reconfigurable function cells in a multidimensional arrangement, comprising: a primary logic unit in communication with at least one of the plurality of reconfigurable function cells, the primary logic unit configured to detect an event and to detect a state of the at least one of the plurality of reconfigurable function cells;a first memory configured to store a first configuration data associated with a selected one of the plurality of reconfigurable function cells;a jump table coupled to the primary logic unit having a plurality of entries, at least one of the plurality of entries configured to store a memory address of the first configuration data; anda first-in first out (“FIFO”) memory shared by the plurality of reconfigurable function cells and coupled to the primary logic unit configured to store a plurality of configuration data associated with the plurality of reconfigurable function cells, the plurality of configuration data including the first configuration data;wherein, when the primary logic unit detects the event, the primary logic unit reads the FIFO memory to determine whether a particular configuration data from the plurality of configuration data is stored in the FIFO memory.
  • 2. The system according to claim 1, wherein, when the primary logic unit determines that no configuration data is stored in the FIFO memory, the primary logic unit retrieves the memory address, retrieves the first configuration data from the first memory based on the memory address, reconfigures the selected one of the plurality of reconfigurable function cells based on the configuration data if the selected one of the plurality of reconfigurable function cells is in a reconfigurable state, and stores the first reconfiguration data in the FIFO memory if the selected one of the plurality of reconfigurable function cells is not in a reconfigurable state.
  • 3. The system according to claim 1, wherein, when the primary logic unit determines that some configuration data from the plurality of configuration data is stored in the FIFO memory, if the first configuration data is not stored in the FIFO memory, the primary logic unit retrieves the first configuration data from the first memory based on the memory address, and stores the first configuration data in the FIFO memory.
  • 4. The system according to claim 1, wherein, when the primary logic unit determines that some configuration data from the plurality of configuration data is stored in the FIFO memory, if the first configuration data is stored in the FIFO memory and is not the first entered into the FIFO memory, the primary logic unit does not retrieve the first configuration data.
  • 5. The system according to claim 1, wherein, when the primary logic unit determines that some configuration data from the plurality of configuration data is stored in the FIFO memory, if the first configuration data is the first entered into the FIFO memory, the primary logic unit retrieves the first configuration data from the FIFO memory.
  • 6. A method for reconfiguring a programmable unit, the programmable unit including a plurality of reconfigurable function cells in a multidimensional arrangement, comprising: detecting an event and a state of at least one of the plurality of reconfigurable function cells;storing, in a first memory, a first configuration data associated with a selected one of the plurality of reconfigurable function cells;storing a memory address of the first configuration data; andstoring, in a first-in first-out (“FIFO”) memory shared by the plurality of reconfigurable function cells, a plurality of configuration data associated with the plurality of reconfigurable function cells, that includes the first configuration data;wherein, when detecting the event, the FIFO memory is read to determine whether a particular configuration data from the plurality of configuration data is stored in the FIFO memory.
  • 7. The method according to claim 6, wherein, when determining that no configuration data is stored in the FIFO memory, the memory address is retrieved, the first configuration data is retrieved from the first memory based on the memory address, and, if the selected one of the plurality of reconfigurable function cells is not in a reconfigurable state, the first reconfiguration data is stored in the FIFO memory.
  • 8. The method according to claim 6, wherein, when determining that some configuration data from the plurality of configuration data is stored in the FIFO memory, if the first configuration data is not stored in the FIFO memory, the first configuration data is retrieved from the first memory based on the memory address, and is stored in the FIFO memory.
  • 9. The method according to claim 6, wherein, when the determining that some configuration data from the plurality of configuration data is stored in the FIFO memory, if the first configuration data is the first entered into the FIFO memory, the first configuration data is retrieved from the FIFO memory.
  • 10. The method according to claim 6, wherein, when determining that some configuration data from the plurality of configuration data is stored in the FIFO memory, if the first configuration data is stored in the FIFO memory and is not the first entered into the FIFO memory, the first configuration data is not retrieved.
  • 11. The method according to claim 6, wherein, when determining that no configuration data is stored in the FIFO memory, the memory address is retrieved, the first configuration data is retrieved from the first memory based on the memory address, and, if the selected one of the plurality of reconfigurable function cells is in a reconfigurable state, the selected one of the plurality of reconfigurable function cells is reconfigured based on the configuration data.
  • 12. A system for run-time reconfiguration of a programmable unit, the programmable unit including a plurality of reconfigurable function cells in a multi-dimensional arrangement, comprising: a primary logic unit in communication with at least one of the plurality of reconfigurable function cells, the primary logic unit configured to detect an event and to detect a state of the at least one of the plurality of reconfigurable function cells;a first memory configured to store a first configuration data associated with a selected one of the plurality of reconfigurable function cells;a jump table coupled to the primary logic unit having a plurality of entries, at least one of the plurality of entries configured to store a memory address of the first configuration data, wherein when the primary logic unit detects the event, the primary logic unit calculates the address of the at least one of the plurality of entries in the jump table based on a source of the event, retrieves the memory address, and retrieves the stored first configuration data based on the memory address; anda first-in first-out (“FIFO”) memory shared by the plurality of reconfigurable function cells and coupled to the primary logic unit configured to store a plurality of configuration data associated with the plurality of reconfigurable function cells, the plurality of configuration data including the first configuration data, the first configuration data stored in the FIFO memory if the selected one of the plurality of reconfigurable function cells is not in a reconfiguration state, and the primary logic unit configured to reconfigure the selected one of the plurality of reconfigurable function cells if the selected one of the plurality of reconfigurable function cells is in a reconfigurable state;wherein, when the primary logic unit detects the event, the primary logic unit reads the FIFO memory to determine whether a particular configuration data from the plurality of configuration data is stored in the FIFO memory.
  • 13. The system according to claim 12, wherein the first memory is configured to store a plurality of configuration data, at least one configuration data from the plurality of configuration data including a complete configuration of the at least one of the plurality of reconfiguration function cells.
  • 14. The system according to claim 12, wherein the first memory is configured to store at least one subconfiguration data configured to represent only a part of a complete configuration of the at least one of the plurality of reconfiguration function cells.
  • 15. The system according to claim 12, wherein the primary logic unit contains a start configuration register which points to a start configuration that puts the at least one of the plurality of reconfiguration function cells in a valid state.
  • 16. The system according to claim 12, wherein the primary logic unit contains a FIFO start register which points to a start of a memory area to which a configuration data is copied.
  • 17. The system according to claim 12, wherein the primary logic unit contains a FIFO end register which points to an end of a memory area to which a configuration data is copied.
  • 18. The system according to claim 12, wherein the primary logic unit contains a FIFO free entry register which points to a free entry of a memory area to which a configuration data is copied and which is closest to a start of the memory area.
  • 19. The system according to claim 12, wherein the primary logic unit contains a program counter register which points to an entry to be processed within the first memory.
  • 20. The system according to claim 12 wherein the primary logic unit contains an address register which points to an address of the cell which has triggered the event.
  • 21. The system according to claim 12, wherein the primary logic unit contains a data register containing a configuration data which is transmitted to the at least one of the plurality of reconfiguration function cells in a reconfiguration.
  • 22. The system according to claim 12, wherein the primary logic unit contains a dispatch register which contains the address of an entry in the jump table calculated from a cell address.
  • 23. A system for reconfiguring a programmable unit, the programmable unit including a plurality of reconfigurable function cells in a multidimensional arrangement, comprising: a primary logic unit for reconfiguring at least a selected one of the plurality of function cells and in communication with at least one of the plurality of reconfigurable function cells, the primary logic unit configured to detect an event when in communication with the at least one of the plurality of reconfigurable function cells;a first memory configured to store a configuration data associated with at least the selected one of the plurality of function cells;a first-in first-out (“FIFO”) memory shared by the plurality of reconfigurable function cells; anda selection unit for selecting the configuration data from the first memory in response to the detection of the event,wherein the primary logic unit is configured to check a reconfigurability state of the selected one of the plurality of function cells, reconfigure the selected one of the plurality of function cells according to the selected configuration data upon a condition that the selected one of the plurality of function cells is in a reconfigurable state, and otherwise store the selected configuration data in the FIFO memory; andwherein, when the primary logic unit detects the event, the primary logic unit reads the FIFO memory to determine whether a particular configuration data from the plurality of configuration data is stored in the FIFO memory.
  • 24. A method for deadlock-free run-time reconfiguration of a programmable unit, the programmable unit including a plurality of reconfigurable function cells in a multidimensional arrangement, comprising: detecting an event;selecting at least one of the plurality of reconfigurable function cells in response to the detected event;reading entries of a first-in first-out (“FIFO”) memory shared by the plurality of reconfigurable function cells and that stores configuration data associated with the plurality of reconfigurable function cells;determining whether particular configuration data associated with the selected at least one function cell is stored in the FIFO memory;in response to a determination that the configuration data associated with the selected at least one function cell is not stored in the FIFO memory and upon a condition that the determination is made, retrieving configuration data associated with the selected at least one function cell from another configuration memory; andif a state of the selected at least one function cell is not a reconfiguration state, storing the retrieved configuration data in the FIFO memory.
Priority Claims (1)
Number Date Country Kind
196 54 593 Oct 1997 DE national
Parent Case Info

This application is a continuation of application 08/946,998 filed Oct. 8, 1997, now U.S. Pat. No. 6,021,490.

US Referenced Citations (224)
Number Name Date Kind
2067477 Cooper Jan 1937 A
3242998 Gubbins Mar 1966 A
3681578 Stevens Aug 1972 A
3757608 Willner Sep 1973 A
3855577 Vandierendonck Dec 1974 A
4498172 Bhavsar Feb 1985 A
4566102 Hefner Jan 1986 A
4663706 James et al. May 1987 A
4682284 Schrofer Jul 1987 A
4706216 Carter Nov 1987 A
4720780 Dolecek Jan 1988 A
4739474 Holsztynski Apr 1988 A
4811214 Nosenchuck et al. Mar 1989 A
4852043 Guest Jul 1989 A
4852048 Morton Jul 1989 A
4860201 Miranker et al. Aug 1989 A
4870302 Freeman Sep 1989 A
4891810 de Corlieu et al. Jan 1990 A
4901268 Judd Feb 1990 A
4910665 Mattheyses et al. Mar 1990 A
4967340 Dawes Oct 1990 A
5014193 Garner et al. May 1991 A
5015884 Agrawal et al. May 1991 A
5021947 Campbell et al. Jun 1991 A
5023775 Poret Jun 1991 A
5047924 Matsubara et al. Sep 1991 A
5065308 Evans Nov 1991 A
5072178 Matsumoto Dec 1991 A
5081375 Pickett et al. Jan 1992 A
5109503 Cruickshank et al. Apr 1992 A
5113498 Evan et al. May 1992 A
5123109 Hillis Jun 1992 A
5125801 Nabity et al. Jun 1992 A
5144166 Camarota et al. Sep 1992 A
5193202 Lee et al. Mar 1993 A
5203005 Horst Apr 1993 A
5204935 Mihara et al. Apr 1993 A
5208491 Ebeling et al. May 1993 A
5226122 Thayer et al. Jul 1993 A
RE34363 Freeman Aug 1993 E
5233539 Agrawal et al. Aug 1993 A
5247689 Ewert Sep 1993 A
5274593 Proebsting Dec 1993 A
5287472 Horst Feb 1994 A
5294119 Vincent et al. Mar 1994 A
5301284 Estes et al. Apr 1994 A
5301344 Kolchinsky Apr 1994 A
5303172 Magar et al. Apr 1994 A
5336950 Popli et al. Aug 1994 A
5347639 Rechtschaffen et al. Sep 1994 A
5349193 Mott et al. Sep 1994 A
5353432 Richek et al. Oct 1994 A
5361373 Gilson Nov 1994 A
5379444 Mumme Jan 1995 A
5410723 Schmidt et al. Apr 1995 A
5418952 Morley et al. May 1995 A
5421019 Holsztynski et al. May 1995 A
5422823 Agrawal et al. Jun 1995 A
5425036 Liu et al. Jun 1995 A
5426378 Ong Jun 1995 A
5428526 Flood et al. Jun 1995 A
5430687 Hung et al. Jul 1995 A
5440245 Galbraith et al. Aug 1995 A
5442790 Nosenchuck Aug 1995 A
5444394 Watson et al. Aug 1995 A
5448186 Kawata Sep 1995 A
5455525 Ho et al. Oct 1995 A
5457644 McCollum Oct 1995 A
5465375 Thepaut et al. Nov 1995 A
5473266 Ahanin et al. Dec 1995 A
5473267 Stansfield Dec 1995 A
5475583 Bock et al. Dec 1995 A
5475803 Stearns et al. Dec 1995 A
5475856 Kogge Dec 1995 A
5483620 Pechanek et al. Jan 1996 A
5485103 Pedersen et al. Jan 1996 A
5485104 Agrawal et al. Jan 1996 A
5489857 Agrawal et al. Feb 1996 A
5491353 Kean Feb 1996 A
5493239 Zlotnick Feb 1996 A
5497498 Taylor Mar 1996 A
5506998 Kato et al. Apr 1996 A
5510730 El Gamal et al. Apr 1996 A
5511173 Yamaura et al. Apr 1996 A
5513366 Agarwal et al. Apr 1996 A
5521837 Frankle et al. May 1996 A
5522083 Gove et al. May 1996 A
5530873 Takano Jun 1996 A
5530946 Bouvier et al. Jun 1996 A
5532693 Winters et al. Jul 1996 A
5532957 Malhi Jul 1996 A
5535406 Kolchinsky Jul 1996 A
5537057 Leong et al. Jul 1996 A
5537601 Kimura et al. Jul 1996 A
5541530 Cliff et al. Jul 1996 A
5544336 Kato et al. Aug 1996 A
5548773 Kemney et al. Aug 1996 A
5555434 Carlstedt Sep 1996 A
5559450 Ngai et al. Sep 1996 A
5561738 Kinerk et al. Oct 1996 A
5570040 Lytle et al. Oct 1996 A
5574930 Halverson, Jr. et al. Nov 1996 A
5586044 Agrawal et al. Dec 1996 A
5587921 Agrawal et al. Dec 1996 A
5588152 Dapp et al. Dec 1996 A
5590345 Barker et al. Dec 1996 A
5600265 El Gamal et al. Feb 1997 A
5611049 Pitts Mar 1997 A
5625806 Kromer Apr 1997 A
5649176 Selvidge et al. Jul 1997 A
5649179 Steenstra et al. Jul 1997 A
5655069 Ogawara et al. Aug 1997 A
5657330 Matsumoto Aug 1997 A
5659797 Zandveld et al. Aug 1997 A
5675743 Mavity Oct 1997 A
5680583 Kuijsten Oct 1997 A
5717943 Barker et al. Feb 1998 A
5732209 Vigil et al. Mar 1998 A
5734921 Dapp et al. Mar 1998 A
5748872 Norman May 1998 A
5754827 Barbier et al. May 1998 A
5760602 Tan Jun 1998 A
5773994 Jones Jun 1998 A
5784636 Rupp Jul 1998 A
5794059 Barker et al. Aug 1998 A
5794062 Baxter Aug 1998 A
5801715 Norman Sep 1998 A
5802290 Casselman Sep 1998 A
5828229 Cliff et al. Oct 1998 A
5844888 Markkula, Jr. et al. Dec 1998 A
5848238 Shimomura et al. Dec 1998 A
5854918 Baxter Dec 1998 A
5859544 Norman Jan 1999 A
5865239 Carr Feb 1999 A
5867723 Peters et al. Feb 1999 A
5884075 Hester et al. Mar 1999 A
5887162 Williams et al. Mar 1999 A
5889982 Rodgers et al. Mar 1999 A
5892370 Eaton et al. Apr 1999 A
5901279 Davis, III May 1999 A
5924119 Sindhu et al. Jul 1999 A
5933642 Baxter et al. Aug 1999 A
5966534 Cooke et al. Oct 1999 A
5970254 Cooke et al. Oct 1999 A
6011407 New Jan 2000 A
6021490 Vorbach et al. Feb 2000 A
6023564 Trimberger Feb 2000 A
6023742 Ebeling et al. Feb 2000 A
6034538 Abramovici Mar 2000 A
6038650 Vorbach et al. Mar 2000 A
6038656 Cummings et al. Mar 2000 A
6047115 Mohan et al. Apr 2000 A
6049222 Lawman Apr 2000 A
6058469 Baxter May 2000 A
6081903 Vorbach et al. Jun 2000 A
6085317 Smith Jul 2000 A
6086628 Dave et al. Jul 2000 A
6088795 Vorbach et al. Jul 2000 A
6092174 Roussakov Jul 2000 A
6105105 Trimberger et al. Aug 2000 A
6108760 Mirsky et al. Aug 2000 A
6119181 Vorbach et al. Sep 2000 A
6122719 Mirsky et al. Sep 2000 A
6125408 McGee et al. Sep 2000 A
6172520 Lawman et al. Jan 2001 B1
6173434 Wirthlin et al. Jan 2001 B1
6202182 Abramovici et al. Mar 2001 B1
6219833 Solomon et al. Apr 2001 B1
6230307 Davis et al. May 2001 B1
6243808 Wang Jun 2001 B1
6260179 Ohsawa et al. Jul 2001 B1
6263430 Trimberger et al. Jul 2001 B1
6279077 Nasserbakht et al. Aug 2001 B1
6282627 Wong et al. Aug 2001 B1
6288566 Hanrahan et al. Sep 2001 B1
6289440 Casselman Sep 2001 B1
6298472 Phillips et al. Oct 2001 B1
6311200 Hanrahan et al. Oct 2001 B1
6321366 Tseng et al. Nov 2001 B1
6321373 Ekanadham et al. Nov 2001 B1
6338106 Vorbach et al. Jan 2002 B1
6341318 Dakhil Jan 2002 B1
6347346 Taylor Feb 2002 B1
6349346 Hanrahan et al. Feb 2002 B1
6370596 Dakhil Apr 2002 B1
6378068 Foster et al. Apr 2002 B1
6389379 Lin et al. May 2002 B1
6389579 Phillips et al. May 2002 B1
6392912 Hanrahan et al. May 2002 B1
6405299 Vorbach et al. Jun 2002 B1
6421817 Mohan et al. Jul 2002 B1
6425068 Vorbach et al. Jul 2002 B1
6457116 Mirsky et al. Sep 2002 B1
6477643 Vorbach et al. Nov 2002 B1
6480937 Vorbach et al. Nov 2002 B1
6480954 Trimberger et al. Nov 2002 B2
6513077 Vorbach et al. Jan 2003 B2
6519674 Lam et al. Feb 2003 B1
6526520 Vorbach et al. Feb 2003 B1
6538468 Moore Mar 2003 B1
6539477 Seawright Mar 2003 B1
6542998 Vorbach et al. Apr 2003 B1
6571381 Vorbach et al. May 2003 B1
6587939 Takano Jul 2003 B1
6657457 Hanrahan et al. Dec 2003 B1
6687788 Vorbach et al. Feb 2004 B2
6697979 Vorbach et al. Feb 2004 B1
20020038414 Taylor et al. Mar 2002 A1
20020143505 Drusinsky Oct 2002 A1
20020144229 Hanrahan Oct 2002 A1
20020165886 Lam Nov 2002 A1
20030014743 Cooke et al. Jan 2003 A1
20030046607 Vorbach Mar 2003 A1
20030052711 Taylor et al. Mar 2003 A1
20030055861 Lai et al. Mar 2003 A1
20030056085 Vorbach Mar 2003 A1
20030056091 Greenberg Mar 2003 A1
20030056202 Vorbach Mar 2003 A1
20030093662 Vorbach et al. May 2003 A1
20030097513 Vorbach et al. May 2003 A1
20030123579 Safavi et al. Jul 2003 A1
20030135686 Vorbach et al. Jul 2003 A1
20040015899 May et al. Jan 2004 A1
20040025005 Vorbach et al. Feb 2004 A1
Foreign Referenced Citations (62)
Number Date Country
42 21 278 Jan 1994 DE
38 55 673 Nov 1996 DE
196 54 593 Jul 1998 DE
197 04 044 Aug 1998 DE
197 04 742 Sep 1998 DE
198 07 872 Aug 1999 DE
198 61 088 Feb 2000 DE
199 26 538 Dec 2000 DE
100 28 397 Dec 2001 DE
100 36 627 Feb 2002 DE
101 29 237 Apr 2002 DE
102 04 044 Aug 2003 DE
0 208 457 Jan 1987 EP
0 221 360 May 1987 EP
0428327 May 1991 EP
0 477 809 Apr 1992 EP
0 485 690 May 1992 EP
0 497 029 Aug 1992 EP
0539595 May 1993 EP
0 628 917 Dec 1994 EP
0 678 985 Oct 1995 EP
0 686 915 Dec 1995 EP
0707269 Apr 1996 EP
0 726 532 Aug 1996 EP
0726532 Aug 1996 EP
0 735 685 Oct 1996 EP
735 685 Oct 1996 EP
0748051 Dec 1996 EP
0735685 Oct 1998 EP
0 926 594 Jun 1999 EP
1 146 432 Oct 2001 EP
A9004835 May 1990 WO
WO9011648 Oct 1990 WO
A9311503 Jun 1993 WO
9408399 Apr 1994 WO
9500161 Jan 1995 WO
9526001 Sep 1995 WO
WO9826356 Jun 1998 WO
WO9828697 Jul 1998 WO
WO9829952 Jul 1998 WO
WO9831102 Jul 1998 WO
WO9835299 Aug 1998 WO
WO9900731 Jan 1999 WO
WO9900739 Jan 1999 WO
WO9932975 Jul 1999 WO
WO9940522 Aug 1999 WO
WO9944120 Sep 1999 WO
WO9944147 Sep 1999 WO
WO0017771 Mar 2000 WO
WO0038087 Jun 2000 WO
WO0077652 Dec 2000 WO
WO0213000 Feb 2002 WO
WO0221010 Mar 2002 WO
WO0229600 Apr 2002 WO
WO0271248 Sep 2002 WO
WO0271249 Sep 2002 WO
WO02103532 Dec 2002 WO
WO0317095 Feb 2003 WO
WO0323616 Mar 2003 WO
WO0325781 Mar 2003 WO
WO0332975 Apr 2003 WO
WO0336507 May 2003 WO
Continuations (1)
Number Date Country
Parent 08946998 Oct 1997 US
Child 09494567 US