1. Field of the Invention
The present invention relates to bus management. In particular, the present invention relates to the behavior of border nodes within a high performance serial bus system.
2. The Prior Art
Modern electronic equipment has greatly enhanced the quality of our lives. However, as the use of such equipment has increased, so has the need to connect equipment purchased from different manufacturers. For example, while a computer and a digital camera may each be useful when used alone, the ability to connect the digital camera to the computer and exchange information between the two makes the combination even more useful. Therefore, a need was apparent for a serial bus standard that would allow for the connection and communication between such devices.
The IEEE 1394-1995 standard was developed to satisfy this need. This standard revolutionized the consumer electronics industry by providing a serial bus management system that featured high speeds and the ability to “hot” connect equipment to the bus; that is, the ability to connect equipment without first turning off the existing connected equipment. Since its adoption, the IEEE 1394-1995 standard has begun to see acceptance in the marketplace with many major electronics and computer manufacturers providing IEEE 1394-1995 connections on equipment that they sell.
However, as technologies improved, the need to update the IEEE 1394-1995 standard became apparent. Two new standards are being proposed at the time of the filing of this application, herein referred to as the proposed IEEE 1394a, or P1394a standard, and the proposed IEEE 1394b, or P1394b standard. Improvements such as higher speeds and longer connection paths will be provided.
In the discussion that follows, it will be necessary to distinguish between the various standards that are being proposed as of the date of this application. Additionally, it will be necessary to distinguish hardware and packet transmissions that are compatible with the P1394b standard and not earlier standards.
Thus, the term “Legacy” will be used herein to refer to the IEEE 1394-1995 standard and all supplements thereof prior to the P1394b standard. Thus, for example, a Legacy node refers to a node compatible with the IEEE 1394-1995 standard and all supplements thereof up to, but not including, the P1394b standard.
Additionally, packets of data will be referred to herein depending on the context the packets are in. For example, a packet of data that is compatible with the P1394b standard and is travelling through a PHY compatible with the P1394b standard will be referred to as Beta format packets. Packets of data that are compatible with the Legacy standard but are travelling through a PHY compatible with the P1394b standard will be referred to as Legacy format packets. Finally, packets of data that are compatible with the Legacy format and are travelling across a data strobe link will be referred to as Alpha format packets.
Furthermore, in the discussion that follows PHYs that are compatible with the P1394b standard may be referred to in various ways, depending upon the context the PHY is operating in and the capability of the PHY. For example, a PHY that has circuitry compatible with the P1394b standard but not any previous standards will be referred to as a B only PHY. Also, a PHY that is compatible with the P1394b standard and is directly attached with only devices compatible with the P1394b standard will be referred to as B PHYs. Finally, a PHY that is communicating with both Legacy devices and devices compatible with the P1394b standard will be referred to as a border device, border PHY, or border node.
Finally, a communications systems that has only B PHYs attached will be referred to as a B bus.
Data Transmission in Legacy Systems
One area that has been improved in the P1394b standard is in the way that data transmission takes place on the bus.
Typically, a DP is followed by the transmission of clocked data, known as the payload, shown as clocked data 104 in
Finally, the payload is followed by a Data End (“DE”), shown as DE 106 in
As is appreciated by one of ordinary skill in the art, the Legacy specifications thus define a timer-based system, where data transmission begins and ends according to a fixed timer.
Compatibility Issues in Legacy Systems
As mentioned above, there are three clocked data rates present in Legacy systems, S100, S200, and S400. Initially, when the IEEE 1394-1995 standard was introduced, devices could only communicate at the S100 rate. Later, devices were introduced that communicated at the S200 and S400 rates.
One problem that occurred in the prior art was how to insure compatibility between the various devices on the market that were communicating at these different rates.
In the
Data Transmission in P1394b
In
Compatibility Problems Between P1394b and Legacy Nodes and Clouds
Legacy node #4 is connected to border node #3. Border node #3 is connected to B PHYs #1 and #2, forming what is known as a “Beta cloud” of border and B PHYs.
One problem encountered with systems containing both Legacy and P1394b compliant nodes is how to ensure that the newer P1394b PHYs know that there are older Legacy devices present on the bus. Hence there is a need for a method to determine the existence of a hybrid bus such as that of
Furthermore, given a hybrid bus, there is a need to establish one border node as the senior border node within a given cloud. Furthermore, given a hybrid system with many clouds, there is a need to establish one border node from each cloud as a senior border node.
Another problem raised by the configuration of
However, there may be a case where the BOSS node is unaware of when the bus enters into an isochronous phase. For example, this may happen when there are no isochronous-aware nodes within the Beta cloud that the BOSS is in, while a Legacy cloud is introducing an isochronous request into the Beta cloud. In these cases, the nodes in the Beta cloud will continue to assume that the phase of the bus is asynchronous, and the grant for the Legacy isochronous request may be handled incorrectly. Therefore, there is a need for an arbitration protocol for properly handling arbitration requests throughout multiple clouds.
Another problem raised by the configuration shown in
Border devices already contain the necessary logic to manage gap timers, since by definition border nodes have Legacy compatible ports. However, B only devices do not contain the circuitry necessary to manage timers according to the Legacy standard. Therefore, there is a need for a protocol for freeing B only devices of the gap timer requirements and transferring this responsibility to border nodes, thus freeing B only devices from the requirement of having gap timer logic built in.
Another issue raised by the hybrid system shown in
A final issue concerning the system of
There is a danger in a hybrid bus of a B PHY granting requests during this quiet time. Currently, there is no protocol for insuring that B PHYs do not interfere with Legacy arbitration timing schemes, other than forcing B PHYs to adhere to Legacy standards, which is undesirable since the performance gains inherent in the P1394b standard are lost. Hence, there is a need for a protocol that allows the coexistence of Legacy and P1394b arbitration in a hybrid bus.
The invention satisfies the above needs. The present invention relates to bus management. In particular, the present invention relates to the behavior of border nodes within a high performance serial bus system.
In a first aspect of the invention, a method of preventing a serial bus device from granting requests during one or more intervals of time is disclosed. In one embodiment, the method comprises determining whether the serial bus device has the right to grant requests among a first set of serial bus devices; detecting the type of the serial bus; selecting a protocol based at least in part upon the detected type of the serial bus; and determining whether requests are presently allowed to be transmitted over the serial bus, wherein the determination is based at least in part upon the protocol. A first protocol allows the serial bus device to grant requests after receiving one of either (a) a first signal indicating the end of an isochronous packet or (b) a second signal indicating the end of an asynchronous packet and the end of a subaction has been detected; and the first protocol prohibits the serial bus from granting requests during an interval of time if the serial bus receives either (a) a third signal indicating the end of an asynchronous packet and the end of a subaction has not been detected or (b) a fourth signal indicating the end of an asynchronous packet and an acknowledgement has not been detected over the serial bus.
In a second aspect of the invention, a method for controlling when a serial bus device on a hybrid bus is able to grant requests is disclosed. In one embodiment, the method comprises preventing the serial bus device from granting requests during a first interval of time comprising a first idle period of bus activity that comprises an arbitration reset gap and a first period of hysteresis comprising an arbitration delay period. The first interval of time commences after a second interval of time and a third interval of time, the second interval of time comprising a second idle period of bus activity and a second period of hysteresis. The third interval of time occurs after the second interval of time but before the first interval of time. The method further comprises allowing the serial bus device to grant requests during the second interval of time only when the end of an asynchronous packet has been detected and the end of a subaction has been detected.
In a third aspect of the invention, an apparatus adapted to prevent a serial bus device from granting requests during one or more intervals of time is disclosed. In one embodiment, the apparatus includes a first module adapted to determine whether the serial bus device can grant requests among a first set of serial bus devices; a second module adapted to detect the type of the serial bus; a third module adapted to select a protocol based at least in part upon the detected type of the serial bus; and a fourth module adapted to determine whether requests are presently allowed to be transmitted over the serial bus, said determination based at least in part upon said protocol. A first protocol allows the serial bus device to grant requests after receiving one of either (a) a first signal indicating the end of an isochronous packet or (b) a second signal indicating the end of an asynchronous packet and the end of a subaction has been detected. The first protocol prohibits the serial bus from granting requests during an interval of time if the serial bus receives either (a) a third signal indicating the end of an asynchronous packet and the end of a subaction has not been detected or (b) a fourth signal indicating the end of an asynchronous packet and an acknowledgement has not been detected over the serial bus.
Persons of ordinary skill in the art will realize that the following description of the present invention is illustrative only and not in any way limiting. Other embodiments of the invention will readily suggest themselves to such skilled persons having the benefit of this disclosure.
The present invention relates to data communications. More particularly, the present invention relates to a method and apparatus for an arbitration and fairness protocol on a serial bus. The invention further relates to machine readable media on which are stored embodiments of the present invention. It is contemplated that any media suitable for retrieving instructions is within the scope of the present invention. By way of example, such media may take the form of magnetic, optical, or semiconductor media.
The present invention relates to data structures and the transmission of such data structures. It is contemplated that the present invention may by embodied in various computer and machine readable data structure. Furthermore, it is contemplated that data structures embodying the present invention will be transmitted across computer and machine readable media.
The present invention may be described through the use of flowcharts. Often, a single instance of an embodiment of the present invention will be shown. As is appreciated by those of ordinary skill in the art, however, the protocols and procedures described herein may be repeated continuously or as often as necessary to satisfy the needs described herein. Accordingly, the representation of the present invention through the use of flowcharts should not be used to limit the scope of the present invention.
The present invention further relates to devices that embody the P1394b standard. By way of example, such devices may include those typically used in an audio/video entertainment system, such as home theater receivers, DVD players, computers, or hand-held devices such as cameras and the like. The devices may also include those industrial in nature, such as test and measurement equipment, professional audio/video recording devices, as well as system control or robotic devices found in an industrial environment.
The invention also relates to nodes and physical computers, such as state machines. The present invention may be embodied in any collection of nodes linked together through a bus. Typically, each device connected to the bus will also have one corresponding node physical layer controller embedded therein. However, a given device may have more than one node, and therefore it follows that one device may have more than one connection to more than one bus. For the discussion that follows, the examples will show the typical situation were one node corresponds to one device.
Each node may communicate to other nodes in an P1394b-compatible system though links. Typically, a cable is used for a link, as is provided for in the P1394b standard. However, any communication means may be employed. By way of example, an infrared, RF, or other wireless system may be used, as well as an optical system.
Typically, a link is coupled to a node through a port. A port transmits and receives messages and data between the node and link. As is known by those of ordinary skill in the art, each node may have more than one port.
Detecting the Presence of a Hybrid Bus
As mentioned in the prior art discussion above, one problem associated with the prior art was the need for a method of identifying a hybrid bus. Two methods according to the present invention for detecting a hybrid bus will now be disclosed.
Detection Through the Use of P1394B Request Symbols
A first preferred embodiment takes advantage of certain characteristics inherent in the P1394b standard to detect the presence of a Legacy device or a Legacy link layer. As is known by those of ordinary skill in the art, when a P1394b PHY device is connected to a bus, the P1394b PHY will cycle through certain start-up procedures, known as the “up-start” procedure. One of the by-products of the up-start procedure is that a P1394b PHY will have knowledge of all of the connections that have been made to its ports when the up-start procedure is finished. As a result, at the conclusion of the up-start procedure, if a node has both Legacy and P1394b connections, it will know that is a border node.
As is known by those of ordinary skill in the art, arbitration in the P1394b standard occurs through the use of requests that are pipelined to the BOSS node according to priorities. Furthermore, the protocols in P1394b provide that a node will forward the highest priority request it hears on to the BOSS node. In order to communicate knowledge of the existence of a hybrid bus to the rest of the bus, a special symbol known as Border_low was developed.
If the node is not a border node, then in act 601 the node will forward any asynchronous and isochronous requests present as normal, and the process ends.
If the node is a border node, then in query 602 the node next determines whether there are any asynchronous requests to forward on this port. If there are asynchronous requests pending, the node will drain those requests as shown in act 603. If there are no asynchronous requests to forward, then the node will issue a Border_low request as shown in act 604.
Next, in query 606, the node determines whether there are any isochronous requests to forward on this port. If there are isochronous requests pending, the node will forward those requests as shown in act 605. If there are no isochronous requests to forward, then the node will issue a Border_low request as shown in act 608.
In a preferred embodiment of the present invention, the Border_low request is given a low enough priority to allow normal arbitration to take place first. Then, when there are no other in-phase arbitration requests pipelined, all other nodes will forward the Border_low request towards the BOSS node, thus communicating to the BOSS node and those nodes along the path towards the BOSS node that there is a Legacy device on the bus.
In another preferred embodiment of the present invention, there are separate Border_low request symbols for both the asynchronous and isochronous arbitration phases.
In one embodiment, the Border_low request has been encoded within data packets transmitted on a P1394b-compliant bus. In another embodiment, the Border_low request has been programmed and encoded in logic on a PHY.
Detection of a Hybrid Bus Through the Use of the Self-ID Sequence
As is known by those of ordinary skill in the art, when a node initializes there is a Self-ID stage wherein each node transmits its identity and certain characteristics about itself to the rest of the bus. As is further known by those of ordinary skill in the art, when a node transmits a packet on a bus, there is a speed code contained therein that identifies the clock rate of the data being transmitted. The S100 Alpha format packet contains no speed code, and thus no speed code is repeated into the Beta cloud. The present invention utilizes both of these characteristics.
In one embodiment of the present invention, this storing is accomplished by way of setting a designated bit within logic in the PHY. In another embodiment of the present invention, this storing is accomplished through the use of a variable in which the state of the bus is stored.
Establishing a Senior Border Node
As mentioned in the prior art section above, there is a need to establish a senior border node among border nodes in one or more clouds. The following discussion discloses a method for determining the path to, and the identification of, a senior border node.
As is known by those of ordinary skill in the art, nodes assign themselves a number, known as a physical ID or a PHY-ID, during the Self-ID process with the lowest numbers being assigned first. It is contemplated that the process according to the present invention may take place at any time after a bus reset and before the completion of the Self-ID process.
As is known by those of ordinary skill in the art, in the Self-ID process a node will first receive Self-ID packets from its children, if any. The node will then generate its own Self-ID packet. Then, the node will receive Self-ID packets from its parent port.
The following process describes how a particular border node will detect the path to the senior border.
In act 1000, the border node will mark itself as the senior border node. It is contemplated that this act takes place any time after bus reset. In query 1002, the border node will then determine whether it has received a packet on its parent beta port that does not contain a Speed Code during the Self-ID process. It is contemplated that the detection may take place through different methods. By way of example, in one preferred embodiment of the present invention, all of the received Self-ID packets are stored in a queue and the detection for the absence of a Speed Code is performed on all received packets at once. In another preferred embodiment of the present invention, the detection for the absence of a Speed Code takes place at the time each Self-ID packet is received.
If the border node has received a packet on its parent beta port that does not contain a Speed Code during the Self-ID process, then the node marks its parent port as path towards senior node and cancels its own status as senior border node in act 1004. If the border node fails to receive a packet on its parent beta port that does not contain a Speed Code during the Self-ID process, then the process ends.
In one embodiment of the present invention, this marking is accomplished by way of setting a designated bit within logic in the PHY. In another embodiment of the present invention, this marking is accomplished through the use of a variable in which the location of, or the path to, the senior border node is stored.
If the B PHY has not received a Legacy Self-ID packet in query 1100, then the process ends.
Properly Carrying Out Arbitration Requests Across Multiple Clouds
As mentioned in the prior art section above, there is a need for an arbitration protocol for properly handling arbitration requests throughout multiple clouds. The following discussion will disclose a protocol whereby a border node may properly forward an arbitration request received from an Legacy cloud.
As is known by those of ordinary skill in the art, when an Legacy device requests arbitration, it may only do so at a time when it is proper. This is due to the strict arbitration protocol of the Legacy standard. Therefore, if a border node receives an arbitration request from a Legacy device or link, the border node may safely assume that the request was made properly in relation to the quiet times describe above.
However, as mentioned in the prior art section above, it is possible that a pipelined P1394b request may not be properly granted in relation to the quiet times within the Beta cloud because of the dual-phase approach used in P1394b. To solve this problem, the present invention introduces a new request, known as a Legacy request. In a preferred embodiment of the present invention, the Legacy request is deemed to be a current request and will be given a higher priority than both asynchronous and isochronous requests. Thus, the Legacy request will be forwarded to the BOSS node unimpeded and immediately granted.
According to a preferred embodiment of the present invention, when a border node receives an arbitration request from a Legacy cloud, the border node will “convert” the request into a Legacy request and forward the Legacy request to the current BOSS. Thus, because of this new type of request, a B PHY which is unaware of the current bus phase may correctly service a Legacy request without interrupting the current bus phase by incorrectly granting an out-of-phase request.
In one embodiment, the Legacy request has been encoded as a request symbol transmitted on a P1394b-compliant bus. In another embodiment, the Legacy request has been programmed and encoded in logic on a PHY.
Freeing B only PHYs from Legacy Gap Timers
As mentioned in the prior art discussion, there is a need for a protocol that transfers the gap timing requirement away from B only devices and to border devices, which already have the necessary logic built into them. The following discussion will now disclose such a protocol.
In a preferred embodiment of the present invention, when one or more border devices is present in a system, B PHYs will refrain from issuing gap tokens, and the border devices will take over the responsibility of timing the IDLE duration. Gap tokens are the BOSS equivalent to a Legacy gap event. This means that when a border device detects a duration which amounts to a subaction_gap, the border will issue an Asynch_start. Likewise, when the border device detects a duration amounting to an Arb_reset_gap, the border device will issue an Arb_reset_even/odd.
The above protocol may be implemented in a number of ways. For example, in one embodiment, all border devices automatically time the gaps and issue an event gap token when their individual timers expire.
In another embodiment, the border devices will utilize a low-priority arbitration to select one of the border devices to ensure that one border device is selected as BOSS before an extended period of IDLE appears on the bus.
In a preferred embodiment, the senior border as disclosed above, is given responsibility for issuing gap tokens in the Beta cloud. Normally, when a P1394b PHY has finished all of its tasks, it would issue a phase change. However, in this embodiment, when a P1394b PHY is finished with its tasks, it turns over control to the senior border node. The senior border can then ensure compliance with the gap timers. Recall from the discussion of the senior borders that all P1394b PHYs within the Beta cloud will know the path to their senior border node.
Restoring the Local Root as BOSS
In a preferred embodiment of the present invention, when a hybrid bus is present, control within a Beta cloud will be passed to the senior border node within the cloud. Thus by passing control to the senior border node, the Beta cloud is assured that arbitration will be performed correctly, even if the senior border node has a Legacy cloud as a parent.
To accomplish this, the present invention discloses a protocol in which a BOSS device which is transmitting immediately communicates one of two intentions regarding its BOSS status, or “BOSSship”, at the end of its transmission: 1) either explicitly grant BOSSship to a specific port, or 2) pass control towards the senior border node. By passing control towards the senior border node, this protocol insures that eventually control will revert to a device which may proxy between clouds in a hybrid bus. Thus, after transmitting, there is no longer a question as to who has control of the bus, and race conditions are thus prevented.
A preferred embodiment of the present invention is implemented through the use of new packet-ending symbols, shown in Table 1. In one embodiment, these symbols have been encoded and transmitted on a bus. In another embodiment, these symbols have been programmed and encoded in logic on a PHY.
If the node is not the senior border node, then in act 1206 the current BOSS sends a GRANT symbol out its senior port, and a DATA_END symbol out its junior ports. Thus, this process achieves the goal of returning BOSSship towards the senior border node, while communicating to the receiving node connected to the senior port that an EOS was achieved.
Referring still to
Thus, in an example where an acknowledge packet is never received, control will be returned to the local senior border node, which has the capability to perform any necessary recovery. This recovery can occur even if the senior border node has a Legacy node as a parent.
BOSS OK to Grant
As mentioned in the prior art section, there is a need for a protocol to ensure compatibility when arbitration takes place on a hybrid bus. Such a protocol will now be discussed.
A protocol according to the present invention comprises two variables: BOSS and OK_TO_GRANT. Prior to issuing a grant, the BOSS will check the status of each of these variables. In a first embodiment of the present invention, only if both are true will the BOSS be able to issue a grant for pipelined P1394b request. In a second embodiment of the present invention, the BOSS may grant a Legacy request when only the BOSS variable is set.
In a preferred embodiment, these variables have been programmed and encoded in logic on a PHY.
BOSS
In the present invention, the BOSS variable indicates whether the BOSS has BOSSship—the right to issue a grant. The BOSS indicator can be moved freely within a cloud between nodes. The BOSS indicator can be set in one of two ways: 1) a P1394b-compliant node which receives a GRANT either implicitly or explicitly; or 2) a node which first transmits a packet into a Beta cloud automatically becomes BOSS of that cloud. An explicit grant occurs by way of receiving a grant symbol, while an implicit grant occurs by way of receiving a DATA_END symbol from a junior port.
Furthermore, the present invention relates to a protocol which determines when a BOSS device must surrender its BOSSship by resetting its BOSS indicator. In one embodiment, whenever a packet is received from a P1394b port, the receiving PHY ceases to be BOSS. In another embodiment, whenever an implicit or explicit grant is issued, the issuing PHY ceases to be BOSS.
Thus, the BOSS indicator indicates whether the BOSS has acquired the exclusive right to issue a grant, either explicitly or implicitly. However, just because the BOSS has the right to issue a grant does not necessarily mean that it is safe to do so within a hybrid bus.
OK TO GRANT
At the intersection of the columns and rows in
B Bus/End of Isoch
Referring still to
B Bus/!EOS
This example represents the case where an EOP has arrived that was not observed to be the end of a subaction. By way of example, this may occur when the end of a primary packet has been marked with a data end. This illustrates the example where an ACK is expected but is missing. On a B bus, the BOSS must wait some predetermined amount of time before it may issue a grant, just in case an ACK arrives. This time period is represented by the time period shown between the EOP and ACK missing time markers prior to the OK_TO_GRANT being set. According to a preferred embodiment of the present invention, after the predetermined amount of time, the BOSS will assume that the ACK is missing, and will set its OK_TO_GRANT indicator.
B Bus/EOS
Referring still to
Hybrid Bus/End of Isoch
Referring now to
Hybrid Bus/!EOS
Referring still to
Hybrid Bus/EOS
Referring still to
While embodiments and applications of this invention have been shown and described, it would be apparent to those skilled in the art that many more modifications than mentioned above are possible without departing from the inventive concepts herein. The invention, therefore, is not to be restricted except in the spirit of the appended claims.
This application is a divisional of and claims priority to U.S. patent application Ser. No. 10/635,835 filed Aug. 5, 2003 now U.S. Pat. No. 7,266,617 and entitled “METHOD AND APPARATUS FOR BORDER NODE BEHAVIOR ON A FULL-DUPLEX BUS”, which is a divisional of co-owned U.S. patent application Ser. No. 09/484,479 filed Jan. 18, 2000 and entitled “METHOD AND APPARATUS FOR BORDER NODE BEHAVIOR ON A FULL-DUPLEX BUS”, now U.S. Pat. No. 6,639,918, each of the foregoing incorporated herein by reference in its entirety. This application is also related to co-pending U.S. patent application Ser. No. 10/635,706 filed Aug. 5, 2003 and entitled “METHOD AND APPARATUS FOR BORDER NODE BEHAVIOR ON A FULL-DUPLEX BUS”, U.S. patent application Ser. No. 10/635,834 filed Aug. 5, 2003 and entitled “METHOD AND APPARATUS FOR BORDER NODE BEHAVIOR ON A FULL-DUPLEX BUS”, now U.S. Pat. No. 6,891,848, U.S. patent application Ser. No. 10/635,749 filed Aug. 5, 2003 and entitled “METHOD AND APPARATUS FOR BORDER NODE BEHAVIOR ON A FULL-DUPLEX BUS”, U.S. patent application Ser. No. 10/635,836 filed Aug. 5, 2003 and entitled “METHOD AND APPARATUS FOR BORDER NODE BEHAVIOR ON A FULL-DUPLEX BUS”, U.S. patent application Ser. No. 10/635,593 filed Aug. 5, 2003 and entitled “METHOD AND APPARATUS FOR BORDER NODE BEHAVIOR ON A FULL-DUPLEX BUS”, U.S. patent application Ser. No. 10/741,782 filed Aug. 5, 2003 and entitled “METHOD AND APPARATUS FOR BORDER NODE BEHAVIOR ON A FULL-DUPLEX BUS”, now abandoned, and U.S. patent application Ser. No. 11/601,487 filed Nov. 16, 2006 and entitled “METHOD AND APPARATUS FOR BORDER NODE BEHAVIOR ON A FULL-DUPLEX BUS”, each of the foregoing incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4156798 | Doelz | May 1979 | A |
4194113 | Fulks et al. | Mar 1980 | A |
5014262 | Harshavardhar | May 1991 | A |
5148545 | Herbst et al. | Sep 1992 | A |
5175855 | Putnam et al. | Dec 1992 | A |
5274631 | Bhardwaj | Dec 1993 | A |
5321812 | Benedict et al. | Jun 1994 | A |
5343461 | Barton et al. | Aug 1994 | A |
5377334 | Boldt et al. | Dec 1994 | A |
5390301 | Scherf | Feb 1995 | A |
5394106 | Black et al. | Feb 1995 | A |
5394486 | Eisenbarth et al. | Feb 1995 | A |
5394556 | Oprescu | Feb 1995 | A |
5406643 | Burke et al. | Apr 1995 | A |
5430486 | Fraser et al. | Jul 1995 | A |
5452330 | Goldstein | Sep 1995 | A |
5490250 | Reschke et al. | Feb 1996 | A |
5490253 | Laha et al. | Feb 1996 | A |
5493568 | Sampat et al. | Feb 1996 | A |
5495481 | Duckwall | Feb 1996 | A |
5524254 | Morgan | Jun 1996 | A |
5539390 | Nagano et al. | Jul 1996 | A |
5541670 | Hanai | Jul 1996 | A |
5559548 | Davis et al. | Sep 1996 | A |
5563886 | Kawamura et al. | Oct 1996 | A |
5568487 | Sibton et al. | Oct 1996 | A |
5568641 | Nelson | Oct 1996 | A |
5583922 | Davis et al. | Dec 1996 | A |
5621659 | Matsumoto et al. | Apr 1997 | A |
5630173 | Oprescu | May 1997 | A |
5632016 | Hoch et al. | May 1997 | A |
5640595 | Baugher et al. | Jun 1997 | A |
5642515 | Jones et al. | Jun 1997 | A |
5654657 | Pearce | Aug 1997 | A |
5684715 | Palmer | Nov 1997 | A |
5701476 | Fenger | Dec 1997 | A |
5701492 | Wadsworth et al. | Dec 1997 | A |
5706278 | Robillard et al. | Jan 1998 | A |
5712834 | Nagano et al. | Jan 1998 | A |
5719862 | Lee et al. | Feb 1998 | A |
5754765 | Danneels et al. | May 1998 | A |
5764930 | Staats | Jun 1998 | A |
5784648 | Duckwall | Jul 1998 | A |
5802048 | Duckwall | Sep 1998 | A |
5802057 | Duckwall et al. | Sep 1998 | A |
5802365 | Kathail et al. | Sep 1998 | A |
5805073 | Nagano et al. | Sep 1998 | A |
5805822 | Long et al. | Sep 1998 | A |
5809331 | Staats et al. | Sep 1998 | A |
5819115 | Hoese et al. | Oct 1998 | A |
5826027 | Pedersen et al. | Oct 1998 | A |
5832298 | Sanchez et al. | Nov 1998 | A |
5835761 | Ishii et al. | Nov 1998 | A |
5844619 | Songer | Dec 1998 | A |
5845152 | Anderson et al. | Dec 1998 | A |
5867730 | Leyda | Feb 1999 | A |
5875301 | Duckwall et al. | Feb 1999 | A |
5923663 | Bontemps et al. | Jul 1999 | A |
5930480 | Staats | Jul 1999 | A |
5935208 | Duckwall et al. | Aug 1999 | A |
5938764 | Klein | Aug 1999 | A |
5940600 | Staats et al. | Aug 1999 | A |
5954796 | McCarty et al. | Sep 1999 | A |
5968152 | Staats | Oct 1999 | A |
5970052 | Lo et al. | Oct 1999 | A |
5987605 | Hill et al. | Nov 1999 | A |
5991842 | Takayama | Nov 1999 | A |
6009480 | Pleso | Dec 1999 | A |
6032202 | Lea et al. | Feb 2000 | A |
6032261 | Hulyalkar | Feb 2000 | A |
6038234 | LaFollette et al. | Mar 2000 | A |
6038625 | Ogino et al. | Mar 2000 | A |
6070187 | Subramaniam et al. | May 2000 | A |
6073206 | Piwonka et al. | Jun 2000 | A |
6091726 | Crivellari | Jul 2000 | A |
6115764 | Chisholm et al. | Sep 2000 | A |
6118486 | Reitmeier | Sep 2000 | A |
6122248 | Murakoshi et al. | Sep 2000 | A |
6131129 | Ludtke et al. | Oct 2000 | A |
6131134 | Huang et al. | Oct 2000 | A |
6131163 | Wiegel | Oct 2000 | A |
6133938 | James | Oct 2000 | A |
6138163 | Nam et al. | Oct 2000 | A |
6138196 | Takayama et al. | Oct 2000 | A |
6141702 | Ludtke et al. | Oct 2000 | A |
6141767 | Hu et al. | Oct 2000 | A |
6145018 | LaFollette et al. | Nov 2000 | A |
6157972 | Newman et al. | Dec 2000 | A |
6160796 | Zou | Dec 2000 | A |
6167532 | Wiseccup | Dec 2000 | A |
6173327 | De Borst et al. | Jan 2001 | B1 |
6178445 | Dawkins et al. | Jan 2001 | B1 |
6185622 | Sato | Feb 2001 | B1 |
6188700 | Kato et al. | Feb 2001 | B1 |
6192189 | Fujinami et al. | Feb 2001 | B1 |
6192397 | Thompson | Feb 2001 | B1 |
6199119 | Duckwall et al. | Mar 2001 | B1 |
6202210 | Ludtke | Mar 2001 | B1 |
6212171 | LaFollette et al. | Apr 2001 | B1 |
6212633 | Levy et al. | Apr 2001 | B1 |
6233615 | Van Loo | May 2001 | B1 |
6233624 | Hyder et al. | May 2001 | B1 |
6247063 | Ichimi et al. | Jun 2001 | B1 |
6247083 | Hake et al. | Jun 2001 | B1 |
6253114 | Takihara | Jun 2001 | B1 |
6253255 | Hyder et al. | Jun 2001 | B1 |
6260063 | Ludtke et al. | Jul 2001 | B1 |
6266334 | Duckwall | Jul 2001 | B1 |
6266344 | Fujimori et al. | Jul 2001 | B1 |
6266701 | Sridhar et al. | Jul 2001 | B1 |
6275889 | Saito | Aug 2001 | B1 |
6282597 | Kawamura | Aug 2001 | B1 |
6292840 | Blomfield-Brown et al. | Sep 2001 | B1 |
6295479 | Shima et al. | Sep 2001 | B1 |
6308222 | Krueger et al. | Oct 2001 | B1 |
6311228 | Ray | Oct 2001 | B1 |
6314461 | Duckwall et al. | Nov 2001 | B2 |
6343321 | Patki et al. | Jan 2002 | B2 |
6345315 | Mishra | Feb 2002 | B1 |
6347362 | Schoinas et al. | Feb 2002 | B1 |
6353868 | Takayama et al. | Mar 2002 | B1 |
6356558 | Hauck et al. | Mar 2002 | B1 |
6363085 | Samuels | Mar 2002 | B1 |
6373821 | Staats | Apr 2002 | B2 |
6385679 | Duckwall et al. | May 2002 | B1 |
6405247 | Lawande et al. | Jun 2002 | B1 |
6411628 | Hauck et al. | Jun 2002 | B1 |
6418150 | Staats | Jul 2002 | B1 |
6425019 | Tateyama et al. | Jul 2002 | B1 |
6426062 | Chopra et al. | Jul 2002 | B1 |
6426962 | Cabezas et al. | Jul 2002 | B1 |
6442630 | Takayama et al. | Aug 2002 | B1 |
6446142 | Shima et al. | Sep 2002 | B1 |
6452975 | Hannah | Sep 2002 | B1 |
6457086 | Duckwall | Sep 2002 | B1 |
6466982 | Ruberg | Oct 2002 | B1 |
6496862 | Akatsu et al. | Dec 2002 | B1 |
6519657 | Stone et al. | Feb 2003 | B1 |
6529522 | Ito et al. | Mar 2003 | B1 |
6529984 | Teener et al. | Mar 2003 | B1 |
6587904 | Hauck et al. | Jul 2003 | B1 |
6591300 | Yurkovic | Jul 2003 | B1 |
6618750 | Staats | Sep 2003 | B1 |
6618785 | Whitby-Streves | Sep 2003 | B1 |
6628607 | Hauck et al. | Sep 2003 | B1 |
6810452 | James et al. | Oct 2004 | B1 |
6850486 | Saleh et al. | Feb 2005 | B2 |
6944705 | Whitby-Strevens | Sep 2005 | B1 |
7020076 | Alkalai et al. | Mar 2006 | B1 |
20010001151 | Duckwall et al. | May 2001 | A1 |
20010019561 | Staats | Sep 2001 | A1 |
20010024423 | Duckwall et al. | Sep 2001 | A1 |
20020057655 | Staats | May 2002 | A1 |
20020085581 | Hauck et al. | Jul 2002 | A1 |
20020101231 | Staats | Aug 2002 | A1 |
20020103947 | Duckwall et al. | Aug 2002 | A1 |
20020188780 | Duckwall | Dec 2002 | A1 |
20020188783 | Duckwall et al. | Dec 2002 | A1 |
20030037161 | Duckwall et al. | Feb 2003 | A1 |
20030055999 | Duckwall et al. | Mar 2003 | A1 |
20050021873 | Papadimitriou et al. | Jan 2005 | A1 |
20060020729 | Nakamura et al. | Jan 2006 | A1 |
Number | Date | Country |
---|---|---|
1 085 706 | Mar 2001 | EP |
1 085 706 | Oct 2002 | EP |
Number | Date | Country | |
---|---|---|---|
20070294449 A1 | Dec 2007 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10635835 | Aug 2003 | US |
Child | 11895871 | US | |
Parent | 09484479 | Jan 2000 | US |
Child | 10635835 | US |