US 7,328,289 B2Grant
Communication between processors
Issue Date:2008-02-05
•17 Claims
•8 Drawing Sheets
Abstract
A method of communicating between a first and a second processor includes the first processor sending a datum over a common control bus, and the second processor receiving the datum from the common control bus.
Metadata
Assignee
- Intel Corporation
Inventors
- Gilbert Wolrich
- Debra Bernstein
- Matthew J. Adiletta
Application Information
Application Number:US 10/931,454
Filing Date:2004-09-01
Priority Date:1999-12-30
Art Unit:2111
Classifications
IPC:
G06F13/00G06F13/14G06F15/16
Patent Drawings (8 sheets)
Description
Priority Claim Under 35 U.S.C. §120
[0001] This application is a continuation of application Ser. No. 10/440,079, filed on May 15, 2003, (Now U.S. Pat. No. 6,792,488), which was a continuation of application Ser. No. 09/475,609, filed on Dec. 30, 1999 (Now U.S. Pat. No. 6,584,522).
Background
[0002] The invention relates to communication between processors.
[0003] Multi-processor computer systems have more than one processor. Each processor executes a separate stream (“thread”) of instructions. It is sometimes necessary for two processors of a computer system to communicate data between themselves.
Summary
[0004] In one general aspect of the invention, a method of communicating between a first and a second processor includes the first processor sending a datum over a common control bus, and the second processor receiving the datum from the common control bus.
[0005] Advantages and other features of the invention will become apparent from the following description and from the claims.
Brief Description of the Drawings
[0006] FIG. 1 shows a computer system that has a first and a second processor.
[0007] FIG. 2A shows a program executed by the first processor of FIG. 1 that includes a GET instruction and a PUT instruction.
[0008] FIG. 2B shows a get FIFO of the first processor of FIG. 1 .
[0009] FIG. 2C shows a send FIFO of the second processor of FIG. 1 .
[0010] FIG. 3 is a flow chart of the execution of the GET instruction of FIG. 2A .
[0011] FIG. 4A shows the get FIFO of FIG. 2B after the execution of the GET instruction of FIG. 3 .
[0012] FIG. 4B shows the send FIFO of FIG. 2C after the execution of the GET instruction of FIG. 3 .
[0013] FIG. 5A shows a send FIFO of the first processor of FIG. 1 prior to the PUT instruction of FIG. 2A .
[0014] FIG. 5B shows a get FIFO of the second processor of FIG. 1 prior to the PUT instruction of FIG. 2A .
[0015] FIG. 6 is a flow chart of the execution of the PUT instruction of FIG. 2A .
[0016] FIG. 7A shows the send FIFO of FIG. 5A after the execution of the put instruction of FIG. 6 .
[0017] FIG. 7B shows the get FIFO of FIG. 5B after the execution of the put instruction of FIG. 6 .
Detailed Description
[0018] Referring to FIG. 1 , a computer system 26 includes two processors 1, 2. Each processor 1, 2 has a corresponding static random access memory (SRAM) 21, 22 for storing data that needs to be accessed with a low latency and a corresponding synchronous dynamic random access memory (SDRAM) 23, 24 for processing large volumes of data.
[0019] The processors 1,2 each have an Fbus FIFO 3, 4, which is connected to a 64-bit FIFO bus 25, for communicating to peripheral devices, such as media access controller (MAC) 16. MAC 16 may be a Gigabit Ethernet device that complies with the IEEE 802.3z standard. MAC 16 has two data ports 17, 18. Multiple peripheral devices may be concurrently connected to the FIFO bus 25. Through the FIFO bus 25, each of the processors 1, 2 can communicate with any peripherals 16 connected to the FIFO bus.
[0020] At any time, one processor (“the master”) controls the FIFO bus 25 using signals sent over the Ready Control Bus 14, while the other processor (“the slave”) responds to instructions from the master. In FIG. 1 , processor 1 is the master while processor 2 is the slave.
[0021] The master controls communications on the first-in-first-out-buffer (FIFO) bus using signals sent on a 5-bit Ready Control Bus 14. The signals allow the master to directly address a device or a slave processor on the bus and to send a query to determine whether the device is ready to transmit (TRRdy) or receive (RRdy) data on the bus. The computer system may include a decoder 15 for decoding signals from the Ready Control Bus into a single TRRdy signal 19 and a single Rrdy signal 20 for a device 16 on the bus.
[0022] Additionally, the computer system includes an 8-bit Ready Bus 13, which is used by the master processor 1 to control data flow on the devices on the FIFO bus 25. For example, master processor 1 may use the Ready Bus 13 to direct MAC 16 to send data from port 1 instead of sending data from port 2 onto the bus. Each processor 1, 2 has a send FIFO 9, 10 for buffering data elements that are to be sent on the Ready Bus 13, and a get FIFO 11, 12 for buffering data elements that are received from the Ready Bus 13. Each FIFO 9-12 is capable of storing a number of data elements, and each data element may be a byte, a word, a long word, or a quad word. In the example of FIG. 1 , the FIFOs 9-12 are configured to store up to eight long words, each of which has 32 bits. Because each data element is 32 bits, it takes four data transfers on the ready bus to transmit a data element from one processor to other. Other implementations with different bus width and data element sizes may take a different number of transfers to transmit a data element.
[0023] Each processor 1, 2 has a Ready Bus controller 5, 6 for controlling the Ready Control Bus 14, the Ready Bus 13 and the FIFO bus 25. The Ready Bus controller 5, 6 may be a microcode program, logic, or a processing unit within the processor. In the embodiment of FIG. 1 , the Ready Bus Controller 5, 6 includes a sequencer 5a, 6a for executing a sequence of bus control instructions. The bus control instructions are part of a program 5b, 6b.
[0024] The system 26 provides a way of communicating between processors 1, and 2 over the Ready Bus 13, when the Ready Bus is not being used to communicate data to peripheral devices. Referring to FIG. 2A , processor 1 executes a sequence of instructions contained within program 5b. The instructions include a “GET 6” instruction 32a, which directs the processor 1 to retrieve six data elements from processor 2 and a “PUT 3” instruction, which directs processor 1 to send three data elements to processor 2.
[0025] Referring to FIGS. 2B and 2C , the state, of the get FIFO 11 of processor 1 and the send FIFO 10 of processor 2 prior to the execution of the GET instruction 32a (FIG. 2A ) will be described. As shown, get FIFO 11 contains three data elements 30a-c that were previously retrieved from processor 2. However, the number of data elements is less than the six data elements required by the GET instruction 32a. Send FIFO 10 of processor 2 contains 3 data elements 31a-c that are to be sent to processor 1. The data 31 in the send FIFO 10 is transferred to the get FIFO 11 by the GET instruction 32a as described below.
[0026] Referring to FIG. 3 , communication of data from a slave processor 2 to the master processor 1 over the Ready Bus 13 will be described. Upon decoding 100 a GET instruction, such as instruction 32a of FIG. 2A , processor 1 determines 101 the number of data elements to be retrieved based on an argument to the GET instruction. For instruction 32a, the number of items to be retrieved is six. The processor 1 determines 102 the number of data elements that are already in its get FIFO 1. The number of data elements in the get FIFO 11 of FIG. 2B is three. The processor 1 sets 103 the count of the number of transfers required (transfer count) to four times the difference between the number of data elements to be retrieved and the number of data elements in the get FIFO 11. The number is multiplied by four because the transmission of each 32-bit data element requires four transfers on the 8-bit ready bus. For instruction 32a and the FIFO of FIG. 2B , the number transfer count is twelve, i.e. 4*(6−3). The processor 1 checks 104 whether the transfer count is greater than zero. If it is not then the transfer of data is complete 105. Otherwise if it is, the processor 1 drives 106 the Ready Control Bus 14 with a signal (GET signal) that represents a command to get data.
[0027] Upon receiving 107 the GET signal, the slave processor 2 determines 108 the number of data elements in its send FIFO 10. The number of data elements in the send FIFO of FIG. 2C is 3. If the number of entries is greater than zero, processor 2 drives 110 the Ready Bus 13 with a signal representing the first entry in its send FIFO and removes the entry from the send FIFO. For the send FIFO of FIG. 2C , the first entry is datum 31a. Otherwise if the number of entries is zero, processor 2 drives 111 the Ready Bus 13 with a predetermined signal, such as a signal representing zero, that signifies an empty send FIFO.
[0028] Processor 1 gets 112 a signal representing data from the Ready Bus 13 and decrements the transfer count, to reflect the receipt of a datum. Processor 1 checks 113 whether the received datum is zero, which signifies an empty send FIFO.
[0029] If the received datum is zero, processor 1 sets 104 the transfer count to zero to terminate the transfer of data and proceeds to 104. In instances where each data element is transmitted in multiple transfers because the bus is narrower than the data element (as shown in FIG. 1 ), it is possible that only part of the required transfers associated with a data element may be completed. For example, in the system of FIGS. 1-2 c, the number of transfers may not be a multiple of four, signifying that an incomplete data element has been received. Should that happen, the received data corresponding to the incomplete datum is discarded so that the received data that is processed is a multiple of four.
[0030] Otherwise if the received datum is not zero, the processor stores 115 the received datum in the get FIFO 11 of processor 1 and proceeds to 104. This process is repeated until the number of data elements in the receive FIFO 11 is equal to the argument of the GET command.
[0031] Referring to FIGS. 4A and 4B , the effects of the process of FIG. 3 on the get FIFO 11 and the send FIFO 10 of FIGS. 2B and 2C will be described. The process has transferred data 31 from send FIFO 10 to get FIFO 11. Get FIFO 11 now has six data elements, as specified in the GET instruction 32a (FIG. 2A ). Thus, the GET instruction provides a way to communicate data from a slave processor to a master processor using bus signals that are also used to control communication between peripherals.
[0032] Referring to FIGS. 5A and 5B , the state of the send FIFO 9 of processor 1 and the get FIFO 12 of processor 2 prior to the PUT instruction 32b (FIG. 2A ) will be described. The send FIFO 9 has three data elements 33a-c. The get FIFO 12 has three data elements 34a-c. The get FIFO 12 also has space 36 for accommodating additional data. The PUT instruction 32b transfers data from the send FIFO 9 to the get FIFO 12 as described below.
[0033] Referring to FIG. 6 , upon decoding 200 a PUT instruction, the master processor 1 establishes 201 the number of items (put count) to be sent to the slave processor based on the argument of the PUT instruction. Where each data element is transmitted in multiple transfers, the put count is computed by multiplying the argument with the number of transfers required to transmit a data element. For the PUT instruction 32b (FIG. 2A ), the put count is 12, i.e. 3*4. The processor 2 checks 201 whether the put count is greater than zero. If the put count is not greater than zero, the process is done 202 because there are no more data elements to send. Otherwise if the put count is greater than zero, processor 1 sends 203 a signal to processor 2 over the Ready Control Bus 14 querying processor 2 to determine whether the get FIFO 12 of processor 2 is full.
[0034] Upon receiving 204 the query from processor 1, processor 2 checks 205 whether its get FIFO 12 is full. If the get FIFO 12 is full, processor 2 sends a FULL signal over the Ready Bus 13 to indicate to processor 1 that it is not ready to receive any additional data. Otherwise, processor 2 sends a NOTFULL signal over the Ready Bus to processor 1 to indicate that the get FIFO 12 is not full.
[0035] Upon receiving a signal from processor 2, processor 1 checks the signal to determine whether the get FIFO 12 of processor 2 is full. If the get FIFO 12 is full, the process is done 209 and the process terminates. Otherwise if the get FIFO 12 is not full, processor 1 drives 210 the Ready Control Bus 14 with a SEND signal to alert processor 2 that processor 1 is about to send data to processor 2. Processor 1 drives 212 the Ready Bus 13 with a datum that processor 2 stores in its get FIFO 12. Processor 1 removes 212 the sent datum from the send FIFO 9 and decrements 213 the put count, to reflect the sending of the datum. Processor 1 proceeds to 201 and repeats the process until the number of data elements sent is equal to the argument of the put instruction.
[0036] Referring to FIGS. 7A and 7B , the state of the send FIFO 9 (FIG. 5A ) of processor 1 and the get FIFO 12 (FIG. 5B ) of processor 2 after the process of FIG. 6 will be described. As shown, three data elements 33a-c have been transferred from the send FIFO 9 of processor 1 to the get FIFO 12 of processor 2 in response to the instruction 32b (FIG. 2A ). Thus, the put instruction provides a method of transferring data from one processor to another processor using bus signals that are also used to control communication between peripheral devices.
[0037] Other embodiments are within the scope of the following claims. For example, alternative implementations may control data flow using the Ready Control Bus 14 signals, instead of using a separate Ready Bus 13. In these embodiments, the data communicated between the FIFOs would be sent over the Ready Control Bus, instead of the Ready Bus.
[0038] The communication method could also be used between process that share the same SRAM or SDRAM memory, instead of the separate memories shown in FIG. 1 . A different kind of memory buffer could be used instead of the send or receive FIFO. For example, a LIFO may be used for the communications on the Ready Bus.
[0039] Commonly known methods may be used to transfer control from processor 1 to processor 2 so that either processor 1 or 2 can become the master as needed.
Claims
What is claimed is:
1. A method, comprising:
receiving, at a first processor over a first bus, data from a media access controller;
sending signals from the first processor over a second bus to the media access controller to control operation of the media access controller, the second bus being a different bus than the first bus; and
sending data from the first processor to a second processor over the second bus.
2. The method of claim 1, further comprising receiving, at the second processor, data from the media access controller over the first bus.
3. The method of claim 1 wherein the sending data from the first processor to the second processor over the second bus comprises sending data in response to a put operation initiated by the first processor.
4. The method of claim 3 wherein the put operation identifies a number of elements to send; and the method further comprises:
transferring fewer than the identified number of elements.
5. The method of claim 1, further comprising, receiving at the first processor over a third bus, a signal from the second processor identifying a buffer of the second processor used to store data sent by the first processor as full, the third bus being a different bus than the first or second buses.
6. The method of claim 1 wherein the sending data from the first processor to the second processor comprises sending data in response to a get operation initiated by the second processor.
7. The method of claim 6 wherein the get operation identifies a number of elements to receive; and the method further comprises:
sending fewer than the identified number of elements if a buffer of the first processor does not at least the identified number of units.
8. The method of claim 1 further comprising:
sending from the first processor to the second processor over a third bus a signal indicating that the first processor does not store any elements to send.
10. The method of claim 9 wherein the receiving data from the second processor comprises:
receiving data in response to a get operation initiated by the first processor.
11. The method of claim 10 wherein the receiving data from the second processor comprises:
receiving data in response to a put operation initiated by the second processor.
12. The method of claim 1 wherein the first processor controls the first bus; and the method further comprises:
sending instructions to the second processor using a third bus, the third bus being a different bus than the first bus and the second bus.
13. A method, comprising:
receiving over a first bus at a first processor, data from a media access controller having multiple ports;
sending, from the first processor, signals over a second bus to the media access controller having multiple ports to control operation of the media access controller, the second bus being a different bus than the first bus;
sending data over the second has from the first processor to a second processor sharing the media access controller having multiple ports with the first processor, wherein the sending data from the first processor to the second processor comprises at least one selected from the group of: (1) sending data in response to a put operation initiated by the first processor and (2) sending data in response to a get operation initiated by a second processor;
receiving data at the first processor from the second processor sharing the media access controller having multiple ports, wherein the receiving data comprises at least one selected from the group of: (1) receiving data in response to a get operation initiated by the first processor, and (2) receiving data in response to a put operation initiated by the second processor.
14. The method of claim 13 wherein the put operation initiated by the first processor identifies a number of elements to send; and the method further comprises:
transferring fewer than the identified number of elements if a buffer of the second processor does not have capacity to store the identified number of elements.
15. The method of claim 14 further comprising:
receiving at the first processor from the second processor over a third bus, at least one signal identifying whether the buffer of the second processor has room to store another element, the third bus being a different bus than the first bus and the second bus.
16. The method of claim 15 wherein the get operation initiated by the first processor identifies a number of elements to receive; and the method further comprises:
receiving fewer than the identified number of elements if a buffer of the second processor does not store at least the identified number of units.
17. The method of claim 16 further comprising:
receiving at the first processor from the second processor over the third bus, at least one signal identifying whether the buffer of the second processor stores an elements to transfer.
Patent Citations (405)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3373408(A) | 1968-03-01 | Ling | Applicant |
| US3478322(A) | 1969-11-01 | Evans | Applicant |
| US3623001(A) | 1971-11-01 | Kleist et al. | Applicant |
| US3736566(A) | 1973-05-01 | Anderson et al. | Applicant |
| US3792441(A) | 1974-02-01 | Wymore et al. | Applicant |
| US3889243(A) | 1975-06-01 | Drimak | Applicant |
| US3940745(A) | 1976-02-01 | Sajeva | Applicant |
| US4016548(A) | 1977-04-01 | Law et al. | Applicant |
| US4032899(A) | 1977-06-01 | Jenny et al. | Applicant |
| US4075691(A) | 1978-02-01 | Davis et al. | Applicant |
| US4130890(A) | 1978-12-01 | Adam | Applicant |
| US4400770(A) | 1983-08-01 | Chan et al. | Applicant |
| US4514807(A) | 1985-04-01 | Nogi | Applicant |
| US4523272(A) | 1985-06-01 | Fukunaga et al. | Applicant |
| US4658351(A) | 1987-04-01 | Teng | Applicant |
| US4709347(A) | 1987-11-01 | Kirk | Applicant |
| US4745544(A) | 1988-05-01 | Renner et al. | Applicant |
| US4788640(A) | 1988-11-01 | Hansen | Applicant |
| US4831358(A) | 1989-05-01 | Ferrio et al. | Applicant |
| US4858108(A) | 1989-08-01 | Ogawa et al. | Applicant |
| US4866664(A) | 1989-09-01 | Burkhardt et al. | Applicant |
| US4890218(A) | 1989-12-01 | Bram | Applicant |
| US4890222(A) | 1989-12-01 | Kirk | Applicant |
| US4991112(A) | 1991-02-01 | Callemyn | Applicant |
| US5115507(A) | 1992-05-01 | Callemyn | Applicant |
| US5140685(A) | 1992-08-01 | Sipple et al. | Applicant |
| US5142683(A) | 1992-08-01 | Burkhardt, Jr. et al. | Applicant |
| US5155831(A) | 1992-10-01 | Emma et al. | Applicant |
| US5155854(A) | 1992-10-01 | Flynn et al. | Applicant |
| US5168555(A) | 1992-12-01 | Byers et al. | Applicant |
| US5173897(A) | 1992-12-01 | Schrodi et al. | Applicant |
| US5251205(A) | 1993-10-01 | Callon et al. | Applicant |
| US5255239(A) | 1993-10-01 | Taborn et al. | Applicant |
| US5263169(A) | 1993-11-01 | Genusov et al. | Applicant |
| US5313454(A) | 1994-05-01 | Bustini et al. | Applicant |
| US5347648(A) | 1994-09-01 | Stamm et al. | Applicant |
| US5367678(A) | 1994-11-01 | Lee et al. | Applicant |
| US5379295(A) | 1995-01-01 | Yonehara | Applicant |
| US5379432(A) | 1995-01-01 | Orton et al. | Applicant |
| US5390329(A) | 1995-02-01 | Gaertner et al. | Applicant |
| US5392391(A) | 1995-02-01 | Caulk, Jr. et al. | Applicant |
| US5392411(A) | 1995-02-01 | Ozaki | Applicant |
| US5392412(A) | 1995-02-01 | McKenna | Applicant |
| US5404464(A) | 1995-04-01 | Bennett | Applicant |
| US5404469(A) | 1995-04-01 | Chung et al. | Applicant |
| US5404482(A) | 1995-04-01 | Stamm et al. | Applicant |
| US5432918(A) | 1995-07-01 | Stamm | Applicant |
| US5448702(A) | 1995-09-01 | Garcia, Jr. et al. | Applicant |
| US5450351(A) | 1995-09-01 | Heddes | Applicant |
| US5452437(A) | 1995-09-01 | Richey et al. | Applicant |
| US5452452(A) | 1995-09-01 | Gaetner et al. | Applicant |
| US5459842(A) | 1995-10-01 | Begun et al. | Applicant |
| US5459843(A) | 1995-10-01 | Davis et al. | Applicant |
| US5463625(A) | 1995-10-01 | Yasrebi | Applicant |
| US5467452(A) | 1995-11-01 | Blum et al. | Applicant |
| US5475856(A) | 1995-12-01 | Kogge | Applicant |
| US5485455(A) | 1996-01-01 | Dobbins et al. | Applicant |
| US5515296(A) | 1996-05-01 | Agarwal | Applicant |
| US5517648(A) | 1996-05-01 | Bertone et al. | Applicant |
| US5539737(A) | 1996-07-01 | Lo et al. | Applicant |
| US5542070(A) | 1996-07-01 | LeBlanc et al. | Applicant |
| US5542088(A) | 1996-07-01 | Jennings, Jr. et al. | Applicant |
| US5544236(A) | 1996-08-01 | Andruska et al. | Applicant |
| US5550816(A) | 1996-08-01 | Hardwick et al. | Applicant |
| US5557766(A) | 1996-09-01 | Takiguchi et al. | Applicant |
| US5568476(A) | 1996-10-01 | Sherer et al. | Applicant |
| US5568617(A) | 1996-10-01 | Kametani | Applicant |
| US5574922(A) | 1996-11-01 | James | Applicant |
| US5581729(A) | 1996-12-01 | Nishtala et al. | Applicant |
| US5592622(A) | 1997-01-01 | Isfeld et al. | Applicant |
| US5613071(A) | 1997-03-01 | Rankin et al. | Applicant |
| US5613136(A) | 1997-03-01 | Casavant et al. | Applicant |
| US5617327(A) | 1997-04-01 | Duncan | Applicant |
| US5623489(A) | 1997-04-01 | Cotton et al. | Applicant |
| US5627829(A) | 1997-05-01 | Gleeson et al. | Applicant |
| US5630074(A) | 1997-05-01 | Beltran | Applicant |
| US5630130(A) | 1997-05-01 | Perotto et al. | Applicant |
| US5633865(A) | 1997-05-01 | Short | Applicant |
| US5644623(A) | 1997-07-01 | Gutledge | Applicant |
| US5649110(A) | 1997-07-01 | Ben-Nun et al. | Applicant |
| US5649157(A) | 1997-07-01 | Williams | Applicant |
| US5651002(A) | 1997-07-01 | Van Seters et al. | Applicant |
| US5659687(A) | 1997-08-01 | Kim et al. | Applicant |
| US5680641(A) | 1997-10-01 | Sidman | Applicant |
| US5689566(A) | 1997-11-01 | Nguyen | Applicant |
| US5692126(A) | 1997-11-01 | Templeton et al. | Applicant |
| US5699537(A) | 1997-12-01 | Sharangpani et al. | Applicant |
| US5701434(A) | 1997-12-01 | Nakagawa | Applicant |
| US5717898(A) | 1998-02-01 | Kagan et al. | Applicant |
| US5721870(A) | 1998-02-01 | Matsumoto | Applicant |
| US5724574(A) | 1998-03-01 | Stratigos et al. | Applicant |
| US5740402(A) | 1998-04-01 | Bratt et al. | Applicant |
| US5742587(A) | 1998-04-01 | Zornig et al. | Applicant |
| US5742782(A) | 1998-04-01 | Ito et al. | Applicant |
| US5742822(A) | 1998-04-01 | Motomura | Applicant |
| US5745913(A) | 1998-04-01 | Pattin et al. | Applicant |
| US5751987(A) | 1998-05-01 | Mahant-Shetti et al. | Applicant |
| US5754764(A) | 1998-05-01 | Davis et al. | Applicant |
| US5761507(A) | 1998-06-01 | Govett | Applicant |
| US5761522(A) | 1998-06-01 | Hisanga et al. | Applicant |
| US5764915(A) | 1998-06-01 | Heimsoth et al. | Applicant |
| US5768528(A) | 1998-06-01 | Stumm | Applicant |
| US5781551(A) | 1998-07-01 | Born | Applicant |
| US5781774(A) | 1998-07-01 | Krick | Examiner |
| US5784649(A) | 1998-07-01 | Begur et al. | Applicant |
| US5784712(A) | 1998-07-01 | Byers et al. | Applicant |
| US5796413(A) | 1998-08-01 | Shipp et al. | Applicant |
| US5797043(A) | 1998-08-01 | Lewis et al. | Applicant |
| US5805816(A) | 1998-09-01 | Picazo, Jr. et al. | Applicant |
| US5809235(A) | 1998-09-01 | Sharma et al. | Applicant |
| US5809237(A) | 1998-09-01 | Watts et al. | Applicant |
| US5809530(A) | 1998-09-01 | Samra et al. | Applicant |
| US5812868(A) | 1998-09-01 | Moyer et al. | Applicant |
| US5828746(A) | 1998-10-01 | Ardon | Applicant |
| US5828863(A) | 1998-10-01 | Barrett et al. | Applicant |
| US5828881(A) | 1998-10-01 | Wang | Applicant |
| US5828901(A) | 1998-10-01 | O'Toole et al. | Examiner |
| US5832215(A) | 1998-11-01 | Kato et al. | Applicant |
| US5835755(A) | 1998-11-01 | Stellwagen, Jr. | Applicant |
| US5838988(A) | 1998-11-01 | Panwar et al. | Applicant |
| US5850399(A) | 1998-12-01 | Ganmukhi et al. | Applicant |
| US5850530(A) | 1998-12-01 | Chen et al. | Applicant |
| US5854922(A) | 1998-12-01 | Gravenstein et al. | Applicant |
| US5860138(A) | 1999-01-01 | Engebretsen et al. | Applicant |
| US5860158(A) | 1999-01-01 | Pai et al. | Applicant |
| US5886992(A) | 1999-03-01 | Raatikaien et al. | Applicant |
| US5887134(A) | 1999-03-01 | Ebrahim | Applicant |
| US5890208(A) | 1999-03-01 | Kwon | Applicant |
| US5892979(A) | 1999-04-01 | Shiraki et al. | Applicant |
| US5898686(A) | 1999-04-01 | Virgile | Applicant |
| US5898701(A) | 1999-04-01 | Johnson | Applicant |
| US5905876(A) | 1999-05-01 | Pawlowski et al. | Applicant |
| US5905889(A) | 1999-05-01 | Wilhelm, Jr. | Applicant |
| US5915123(A) | 1999-06-01 | Mirsky et al. | Applicant |
| US5918235(A) | 1999-06-01 | Kirshenbaum et al. | Applicant |
| US5933627(A) | 1999-08-01 | Parady | Applicant |
| US5937187(A) | 1999-08-01 | Kosche et al. | Applicant |
| US5938736(A) | 1999-08-01 | Muller et al. | Applicant |
| US5940612(A) | 1999-08-01 | Brady et al. | Applicant |
| US5940866(A) | 1999-08-01 | Chisholm et al. | Applicant |
| US5946487(A) | 1999-08-01 | Dangelo | Applicant |
| US5948081(A) | 1999-09-01 | Foster | Applicant |
| US5953336(A) | 1999-09-01 | Moore et al. | Applicant |
| US5958031(A) | 1999-09-01 | Kim | Applicant |
| US5961628(A) | 1999-10-01 | Nguyen et al. | Applicant |
| US5968169(A) | 1999-10-01 | Pickett | Applicant |
| US5970013(A) | 1999-10-01 | Fischer et al. | Applicant |
| US5974518(A) | 1999-10-01 | Nogradi | Applicant |
| US5978838(A) | 1999-11-01 | Mohammed et al. | Applicant |
| US5983274(A) | 1999-11-01 | Hyder et al. | Applicant |
| US5995513(A) | 1999-11-01 | Harrand et al. | Applicant |
| US6012151(A) | 2000-01-01 | Mano | Applicant |
| US6014729(A) | 2000-01-01 | Lannan et al. | Applicant |
| US6023742(A) | 2000-02-01 | Ebeling et al. | Applicant |
| US6032190(A) | 2000-02-01 | Bremer et al. | Applicant |
| US6032218(A) | 2000-02-01 | Lewin et al. | Applicant |
| US6047002(A) | 2000-04-01 | Hartmann et al. | Applicant |
| US6049867(A) | 2000-04-01 | Eickemeyer et al. | Applicant |
| US6058168(A) | 2000-05-01 | Braband | Applicant |
| US6061710(A) | 2000-05-01 | Eickemeyer et al. | Applicant |
| US6067300(A) | 2000-05-01 | Baumert et al. | Applicant |
| US6067585(A) | 2000-05-01 | Hoang | Applicant |
| US6070231(A) | 2000-05-01 | Ottinger | Applicant |
| US6072781(A) | 2000-06-01 | Feeney et al. | Applicant |
| US6073215(A) | 2000-06-01 | Snyder | Applicant |
| US6079008(A) | 2000-06-01 | Clery, III | Applicant |
| US6085215(A) | 2000-07-01 | Ramakrishnan et al. | Applicant |
| US6085248(A) | 2000-07-01 | Sambamurthy et al. | Examiner |
| US6085294(A) | 2000-07-01 | Van Doren et al. | Applicant |
| US6092127(A) | 2000-07-01 | Tausheck | Applicant |
| US6092158(A) | 2000-07-01 | Harriman et al. | Applicant |
| US6104700(A) | 2000-08-01 | Haddock et al. | Applicant |
| US6111886(A) | 2000-08-01 | Stewart | Applicant |
| US6112016(A) | 2000-08-01 | MacWilliams et al. | Applicant |
| US6122251(A) | 2000-09-01 | Shinohara | Applicant |
| US6128669(A) | 2000-10-01 | Moriarty et al. | Applicant |
| US6134665(A) | 2000-10-01 | Klein et al. | Applicant |
| US6141677(A) | 2000-10-01 | Hanif et al. | Applicant |
| US6141689(A) | 2000-10-01 | Yasrebi | Applicant |
| US6141765(A) | 2000-10-01 | Sherman | Applicant |
| US6144669(A) | 2000-11-01 | Williams et al. | Applicant |
| US6145054(A) | 2000-11-01 | Mehrotra et al. | Applicant |
| US6157955(A) | 2000-12-01 | Narad et al. | Applicant |
| US6160562(A) | 2000-12-01 | Chin et al. | Applicant |
| US6170051(B1) | 2001-01-01 | Dowling | Applicant |
| US6182177(B1) | 2001-01-01 | Harriman | Applicant |
| US6195676(B1) | 2001-02-01 | Spix et al. | Applicant |
| US6199133(B1) | 2001-03-01 | Schnell | Applicant |
| US6201807(B1) | 2001-03-01 | Prasanna | Applicant |
| US6212542(B1) | 2001-04-01 | Kahle et al. | Applicant |
| US6212544(B1) | 2001-04-01 | Borkenhagen et al. | Applicant |
| US6212604(B1) | 2001-04-01 | Tremblay | Applicant |
| US6212611(B1) | 2001-04-01 | Nizar et al. | Applicant |
| US6216220(B1) | 2001-04-01 | Hwang | Applicant |
| US6223207(B1) | 2001-04-01 | Lucovsky et al. | Applicant |
| US6223238(B1) | 2001-04-01 | Meyer et al. | Applicant |
| US6223243(B1) | 2001-04-01 | Ueda et al. | Applicant |
| US6223274(B1) | 2001-04-01 | Catthoor et al. | Applicant |
| US6223279(B1) | 2001-04-01 | Nishimura et al. | Applicant |
| US6247025(B1) | 2001-06-01 | Bacon | Applicant |
| US6256713(B1) | 2001-07-01 | Audityan et al. | Applicant |
| US6269391(B1) | 2001-07-01 | Gillespie | Applicant |
| US6272109(B1) | 2001-08-01 | Pei et al. | Applicant |
| US6272520(B1) | 2001-08-01 | Sharangpani et al. | Applicant |
| US6272616(B1) | 2001-08-01 | Fernando et al. | Applicant |
| US6275505(B1) | 2001-08-01 | O'Loughlin et al. | Applicant |
| US6279113(B1) | 2001-08-01 | Vaidya | Applicant |
| US6282169(B1) | 2001-08-01 | Kiremidjian | Applicant |
| US6286083(B1) | 2001-09-01 | Chin et al. | Applicant |
| US6289011(B1) | 2001-09-01 | Seo et al. | Applicant |
| US6295600(B1) | 2001-09-01 | Parady | Applicant |
| US6298370(B1) | 2001-10-01 | Tang et al. | Applicant |
| US6307789(B1) | 2001-10-01 | Wolrich et al. | Applicant |
| US6311261(B1) | 2001-10-01 | Chamdani et al. | Applicant |
| US6320861(B1) | 2001-11-01 | Adam et al. | Applicant |
| US6324624(B1) | 2001-11-01 | Wolrich et al. | Applicant |
| US6338078(B1) | 2002-01-01 | Chang et al. | Applicant |
| US6345334(B1) | 2002-02-01 | Nakagawa et al. | Applicant |
| US6347344(B1) | 2002-02-01 | Baker et al. | Applicant |
| US6349331(B1) | 2002-02-01 | Andra et al. | Examiner |
| US6356962(B1) | 2002-03-01 | Kasper et al. | Applicant |
| US6359911(B1) | 2002-03-01 | Movshovich et al. | Applicant |
| US6360262(B1) | 2002-03-01 | Guenthner et al. | Applicant |
| US6360277(B1) | 2002-03-01 | Ruckley et al. | Applicant |
| US6366998(B1) | 2002-04-01 | Mohamed | Applicant |
| US6373848(B1) | 2002-04-01 | Allison et al. | Applicant |
| US6377998(B2) | 2002-04-01 | Noll et al. | Examiner |
| US6389031(B1) | 2002-05-01 | Chao et al. | Applicant |
| US6389449(B1) | 2002-05-01 | Nermirovsky et al. | Applicant |
| US6393026(B1) | 2002-05-01 | Irwin | Applicant |
| US6393483(B1) | 2002-05-01 | Latif et al. | Applicant |
| US6404737(B1) | 2002-06-01 | Novik et al. | Applicant |
| US6415338(B1) | 2002-07-01 | Habot | Applicant |
| US6418488(B1) | 2002-07-01 | Chilton et al. | Applicant |
| US6424657(B1) | 2002-07-01 | Voit et al. | Applicant |
| US6424659(B2) | 2002-07-01 | Viswanadham et al. | Applicant |
| US6426940(B1) | 2002-07-01 | Seo et al. | Applicant |
| US6426943(B1) | 2002-07-01 | Spinney et al. | Applicant |
| US6427196(B1) | 2002-07-01 | Adiletta et al. | Applicant |
| US6430626(B1) | 2002-08-01 | Witkowski et al. | Applicant |
| US6434145(B1) | 2002-08-01 | Opsasnick et al. | Applicant |
| US6438132(B1) | 2002-08-01 | Vincent et al. | Applicant |
| US6438134(B1) | 2002-08-01 | Chow et al. | Applicant |
| US6448812(B1) | 2002-09-01 | Bacigalupo | Applicant |
| US6453404(B1) | 2002-09-01 | Bereznyi et al. | Applicant |
| US6457015(B1) | 2002-09-01 | Eastham | Applicant |
| US6463035(B1) | 2002-10-01 | Moore | Applicant |
| US6463072(B1) | 2002-10-01 | Wolrich et al. | Examiner |
| US6463480(B2) | 2002-10-01 | Kikuchi et al. | Applicant |
| US6463527(B1) | 2002-10-01 | Vishkin | Applicant |
| US6466898(B1) | 2002-10-01 | Chan | Applicant |
| US6477562(B2) | 2002-11-01 | Nemirovsky et al. | Applicant |
| US6484224(B1) | 2002-11-01 | Robins et al. | Applicant |
| US6501731(B1) | 2002-12-01 | Bleszynski et al. | Applicant |
| US6507862(B1) | 2003-01-01 | Joy et al. | Applicant |
| US6522188(B1) | 2003-02-01 | Poole | Applicant |
| US6526451(B2) | 2003-02-01 | Kasper | Applicant |
| US6526452(B1) | 2003-02-01 | Petersen et al. | Examiner |
| US6529983(B1) | 2003-03-01 | Marshall et al. | Applicant |
| US6532509(B1) | 2003-03-01 | Wolrich et al. | Applicant |
| US6535878(B1) | 2003-03-01 | Guedalia et al. | Applicant |
| US6552826(B2) | 2003-04-01 | Adler et al. | Applicant |
| US6553406(B1) | 2003-04-01 | Berger et al. | Applicant |
| US6560667(B1) | 2003-05-01 | Wolrich et al. | Applicant |
| US6570850(B1) | 2003-05-01 | Gutierrez et al. | Applicant |
| US6577542(B2) | 2003-06-01 | Wolrich et al. | Applicant |
| US6584522(B1) | 2003-06-01 | Wolrich et al. | Examiner |
| US6587906(B2) | 2003-07-01 | Wolrich et al. | Applicant |
| US6604125(B1) | 2003-08-01 | Belkin | Applicant |
| US6606704(B1) | 2003-08-01 | Adiletta et al. | Applicant |
| US6625654(B1) | 2003-09-01 | Wolrich et al. | Applicant |
| US6628668(B1) | 2003-09-01 | Hutzli et al. | Applicant |
| US6629147(B1) | 2003-09-01 | Grow | Applicant |
| US6629236(B1) | 2003-09-01 | Aipperspach et al. | Applicant |
| US6631422(B1) | 2003-10-01 | Althaus et al. | Applicant |
| US6631430(B1) | 2003-10-01 | Wolrich et al. | Applicant |
| US6631462(B1) | 2003-10-01 | Wolrich et al. | Applicant |
| US6657963(B1) | 2003-12-01 | Paquette et al. | Applicant |
| US6658551(B1) | 2003-12-01 | Berenbaum et al. | Applicant |
| US6661774(B1) | 2003-12-01 | Lauffenburger et al. | Applicant |
| US6661794(B1) | 2003-12-01 | Wolrich et al. | Applicant |
| US6665699(B1) | 2003-12-01 | Hunter et al. | Applicant |
| US6665755(B2) | 2003-12-01 | Modelski et al. | Applicant |
| US6667920(B2) | 2003-12-01 | Wolrich et al. | Applicant |
| US6668317(B1) | 2003-12-01 | Bernstein et al. | Applicant |
| US6671827(B2) | 2003-12-01 | Guilford et al. | Applicant |
| US6675190(B1) | 2004-01-01 | Schabernack et al. | Applicant |
| US6675192(B2) | 2004-01-01 | Emer et al. | Applicant |
| US6678746(B1) | 2004-01-01 | Russell et al. | Applicant |
| US6680933(B1) | 2004-01-01 | Cheesman et al. | Applicant |
| US6681300(B2) | 2004-01-01 | Wolrich et al. | Applicant |
| US6684326(B1) | 2004-01-01 | Cromer et al. | Examiner |
| US6694380(B1) | 2004-02-01 | Wolrich et al. | Applicant |
| US6697379(B1) | 2004-02-01 | Jacquet et al. | Applicant |
| US6721325(B1) | 2004-04-01 | Duckering et al. | Applicant |
| US6724767(B1) | 2004-04-01 | Chong et al. | Applicant |
| US6728845(B2) | 2004-04-01 | Adiletta | Applicant |
| US6732187(B1) | 2004-05-01 | Lougheed et al. | Applicant |
| US6754211(B1) | 2004-06-01 | Brown | Applicant |
| US6754222(B1) | 2004-06-01 | Joung et al. | Applicant |
| US6768717(B1) | 2004-07-01 | Reynolds et al. | Applicant |
| US6775284(B1) | 2004-08-01 | Calvignac et al. | Applicant |
| US6792488(B2) | 2004-09-01 | Wolrich et al. | Examiner |
| US6798744(B1) | 2004-09-01 | Bradshaw et al. | Applicant |
| US6826615(B2) | 2004-11-01 | Barrall et al. | Applicant |
| US6834053(B1) | 2004-12-01 | Stacey et al. | Applicant |
| US6850521(B1) | 2005-02-01 | Kadambi et al. | Applicant |
| US6856622(B1) | 2005-02-01 | Calamvokis et al. | Applicant |
| US6873618(B1) | 2005-03-01 | Weaver | Applicant |
| US6876561(B2) | 2005-04-01 | Adiletta et al. | Applicant |
| US6895457(B2) | 2005-05-01 | Wolrich et al. | Applicant |
| US6925637(B2) | 2005-08-01 | Thomas et al. | Applicant |
| US6931641(B1) | 2005-08-01 | Davis et al. | Applicant |
| US6934780(B2) | 2005-08-01 | Modelski et al. | Applicant |
| US6934951(B2) | 2005-08-01 | Wilkinson et al. | Applicant |
| US6938147(B1) | 2005-08-01 | Joy et al. | Applicant |
| US6944850(B2) | 2005-09-01 | Hooper et al. | Applicant |
| US6947425(B1) | 2005-09-01 | Hooper et al. | Applicant |
| US6952824(B1) | 2005-10-01 | Hooper et al. | Applicant |
| US6959002(B2) | 2005-10-01 | Wynne et al. | Applicant |
| US6967963(B1) | 2005-11-01 | Houh et al. | Applicant |
| US6976095(B1) | 2005-12-01 | Wolrich et al. | Applicant |
| US6981077(B2) | 2005-12-01 | Modelski et al. | Applicant |
| US6983350(B1) | 2006-01-01 | Wheeler et al. | Applicant |
| US7006495(B2) | 2006-02-01 | Hooper | Applicant |
| US7065569(B2) | 2006-06-01 | Teraslinna | Applicant |
| US7069548(B2) | 2006-06-01 | Kushlis | Applicant |
| US7096277(B2) | 2006-08-01 | Hooper | Applicant |
| US7100102(B2) | 2006-08-01 | Hooper et al. | Applicant |
| US7111072(B1) | 2006-09-01 | Matthews et al. | Applicant |
| US7111296(B2) | 2006-09-01 | Wolrich et al. | Applicant |
| US7124196(B2) | 2006-10-01 | Hooper | Applicant |
| US7126952(B2) | 2006-10-01 | Hooper et al. | Applicant |
| US7149786(B1) | 2006-12-01 | Bohringer et al. | Examiner |
| US7181742(B2) | 2007-02-01 | Hooper | Applicant |
| US7191321(B2) | 2007-03-01 | Bernstein et al. | Applicant |
| US7206858(B2) | 2007-04-01 | Hooper et al. | Applicant |
| US7248584(B2) | 2007-07-01 | Hooper | Applicant |
| US2001/0023487(A1) | 2001-09-01 | Kawamoto | Applicant |
| US2002/0027448(A1) | 2002-03-01 | Bacigalupo | Applicant |
| US2002/0041520(A1) | 2002-04-01 | Wolrich et al. | Applicant |
| US2002/0075878(A1) | 2002-06-01 | Lee et al. | Applicant |
| US2002/0118692(A1) | 2002-08-01 | Oberman et al. | Applicant |
| US2002/0150047(A1) | 2002-10-01 | Knight et al. | Applicant |
| US2002/0181194(A1) | 2002-12-01 | Ho et al. | Applicant |
| US2003/0043803(A1) | 2003-03-01 | Hooper | Applicant |
| US2003/0067934(A1) | 2003-04-01 | Hooper et al. | Applicant |
| US2003/0086434(A1) | 2003-05-01 | Kloth | Applicant |
| US2003/0105901(A1) | 2003-06-01 | Wolrich et al. | Applicant |
| US2003/0105917(A1) | 2003-06-01 | Ostler et al. | Applicant |
| US2003/0110166(A1) | 2003-06-01 | Wolrich et al. | Applicant |
| US2003/0115347(A1) | 2003-06-01 | Wolrich et al. | Applicant |
| US2003/0115426(A1) | 2003-06-01 | Rosenbluth et al. | Applicant |
| US2003/0131198(A1) | 2003-07-01 | Wolrich et al. | Applicant |
| US2003/0140196(A1) | 2003-07-01 | Wolrich et al. | Applicant |
| US2003/0145159(A1) | 2003-07-01 | Adiletta et al. | Applicant |
| US2003/0147409(A1) | 2003-08-01 | Wolrich et al. | Applicant |
| US2003/0161303(A1) | 2003-08-01 | Mehrvar et al. | Applicant |
| US2003/0161337(A1) | 2003-08-01 | Weinman | Applicant |
| US2003/0210574(A1) | 2003-11-01 | Wolrich et al. | Applicant |
| US2003/0231635(A1) | 2003-12-01 | Kalkunte et al. | Applicant |
| US2004/0039895(A1) | 2004-02-01 | Wolrich et al. | Applicant |
| US2004/0052269(A1) | 2004-03-01 | Hooper et al. | Applicant |
| US2004/0054880(A1) | 2004-03-01 | Bernstein et al. | Applicant |
| US2004/0059828(A1) | 2004-03-01 | Hooper et al. | Applicant |
| US2004/0071152(A1) | 2004-04-01 | Wolrich et al. | Applicant |
| US2004/0073728(A1) | 2004-04-01 | Wolrich et al. | Applicant |
| US2004/0073778(A1) | 2004-04-01 | Adiletta et al. | Applicant |
| US2004/0085901(A1) | 2004-05-01 | Hooper et al. | Applicant |
| US2004/0098496(A1) | 2004-05-01 | Wolrich et al. | Applicant |
| US2004/0109369(A1) | 2004-06-01 | Wolrich et al. | Applicant |
| US2004/0148382(A1) | 2004-07-01 | Narad et al. | Applicant |
| US2004/0162933(A1) | 2004-08-01 | Adiletta et al. | Applicant |
| US2004/0252686(A1) | 2004-12-01 | Hooper et al. | Applicant |
| US2005/0033884(A1) | 2005-02-01 | Wolrich et al. | Examiner |
| US2005/0149665(A1) | 2005-07-01 | Wolrich et al. | Applicant |
| US2006/0007871(A1) | 2006-01-01 | Welin | Applicant |
| US2006/0069882(A1) | 2006-03-01 | Wheeler et al. | Applicant |
| US2006/0156303(A1) | 2006-07-01 | Hooper et al. | Applicant |
| EP379709 | 1990-08-01 | Applicant | |
| EP464715 | 1992-01-01 | Applicant | |
| EP633678 | 1995-01-01 | Applicant | |
| EP745933 | 1996-12-01 | Applicant | |
| EP773648 | 1997-05-01 | Applicant | |
| EP809180 | 1997-11-01 | Applicant | |
| EP959602 | 1999-11-01 | Applicant | |
| JP59111533 | 1984-06-01 | Applicant | |
| WO94/15287 | 1994-07-01 | Applicant | |
| WO97/38372 | 1997-10-01 | Applicant | |
| WO98/20647 | 1998-05-01 | Applicant | |
| WO/38376 | 2000-06-01 | Applicant | |
| WO/56024 | 2000-09-01 | Applicant | |
| WO1/15718 | 2001-03-01 | Applicant | |
| WO1/16718 | 2001-03-01 | Applicant | |
| WO1/16769 | 2001-03-01 | Applicant | |
| WO1/16770 | 2001-03-01 | Applicant | |
| WO1/16782 | 2001-03-01 | Applicant | |
| WO1/17179 | 2001-03-01 | Applicant | |
| WO1/31856 | 2001-05-01 | Applicant | |
| WO1/48596 | 2001-07-01 | Applicant | |
| WO1/48606 | 2001-07-01 | Applicant | |
| WO1/48619 | 2001-07-01 | Applicant | |
| WO1/50247 | 2001-07-01 | Applicant | |
| WO1/50679 | 2001-07-01 | Applicant | |
| WO3/030461 | 2003-04-01 | Applicant |
Non-Patent Literature (54)
- Notice of Allowability for U.S. Appl. No. 10/440,079—dated Jun. 1, 2004—3 pages—contains Reasons for Allowability.Examiner
- “Media Access Control”—retrieved from http://en.wikipedia.org/wiki/Media—Access—Control on Jul. 31, 2007—2 pages.Examiner
- “Quality-of-Service-Oriented Media Acess Control for Advanced Mobile Multimedia Satellite Systems”—retrieved from http://ieeexplore.ieee.org/iel5/8360/26341/01174866.pdf?tp=&arnumber=1174866&isnumber=26341 on Jul. 31, 2007—8 pages.Examiner
- “An Efficient Media Access Control Protocol for Broadband Wireless Access Systems”—retrieved from http://grouper.ieee.org/groups/802//16/tg1/mac/contrib/80216mc-99—10.pdf on Jul. 31, 2007—19 pages.Examiner
- “Improving Performance of Adaptive Media Access Control Protocols for High-density Wireless Networks”—retrieved from http://ieeexplore.ieee.org/iel5/6313/16882/00778958.pdf?tp=&arnumber=778958&isnumber=16882 on Jul. 31, 2007—6 pages.Examiner
- “A comparison of fibre channel and 802 MAC services”—abstract only—1 page—Local Computer Networks, 1993., Proceedings., 18th Conference on Local Computer Networks.Examiner
- “Nomadic Threads: A migrating multithread approach to remote memory accesses in multiprocessors”, by Jenks, S.; Gaudiot, J.L. (abstract only) Publication Date: Oct. 20-23, 1996.Applicant
- “Overview of the START (*T) multithreaded computer” by Beckeerie, M.J. (abstract only) Publication Date: Feb. 22-26, 1993.Applicant
- U.S. Appl. No. 10/726,757, filed Dec. 3, 2003, Wolrich et al.Applicant
- U.S. Appl. No. 10/684,078, filed Oct. 10, 2003, Wolrich et al.Applicant
- U.S. Appl. No. 10/664,202, filed Sep. 16, 2003, Wolrich et al.Applicant
- U.S. Appl. No. 10/644,337, filed Aug. 20, 2003, Wolrich et al.Applicant
- U.S. Appl. No. 10/643,438, filed Aug. 19, 2003, Bernstein et al.Applicant
- U.S. Appl. No. 10/615,500, filed Jul. 8, 2003, Adiletta.Applicant
- U.S. Appl. No. 10/615,280. filed Jul. 8, 2003, Wolrich et al.Applicant
- U.S. Appl. No. 10/208,264, filed Jul. 30, 2002, Adiletta et al.Applicant
- U.S. Appl. No. 09/476,303, filed Dec. 30, 1999, Wolrich et al.Applicant
- U.S. Appl. No. 09/475,614, filed Dec. 30, 1999, Wolrich et al.Applicant
- U.S. Appl. No. 09/473,571, filed Dec. 28, 1999, Wolrich et al.Applicant
- U.S. Appl. No. 09/387,109, filed Aug. 31, 1999, Adiletta et al.Applicant
- Byrd et al., “Multithread Processor Architectures,” IEEE Spectrum, vol. 32, No. 8, New York, Aug. 1, 1995, pp. 38-46.Applicant
- Doyle et al., Microsoft Press Computer Dicitionary, 2nd ed., Microsoct Press, Redmond, Washington, USA, 1994, p. 326.Applicant
- Fillo et al., “The M-Machine Multicomputer,” IEEE Proceedings of MICRO-28, 1995, pp. 146-156.Applicant
- Gomez et al., “Efficient Multithreaded User-Space Transport for Network Computing: Design and Test of the TRAP Protocol,” Journal of Parallel and Distributed Computing, Academic Press, Duluth, Minnesota, USA, vol. 40, No. 1, Jan. 10, 1997, pp. 103-117.Applicant
- Haug et al., “Reconfigurable hardware as shared resource for parallel threads,” IEEE Symposium on FPGAs for Custom Computing Machines, 1998.Applicant
- Hauser et al., “Garp: a MIPS processor with a reconfigurable coprocessor,” Proceedings of the 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, 1997.Applicant
- Hyde, R., “Overview of Memory Management,” Byte, vol. 13, No. 4, 1998, pp. 219-225.Applicant
- Litch et al., “StrongARMing Portable Communications,” IEEE Micro, 1998, pp. 48-55.Applicant
- Schmidt et al., “The Performance of Alternative Threading Architectures for Parallel Communication Subsystems,” Internet Document, Online!, Nov. 13, 1998.Applicant
- Thistle et al., “A Processor Architecture for Horizon,” IEEE, 1998, pp. 35-41.Applicant
- Tremblay et al., “A Three Dimensional Register File for Superscalar Processors,” IEEE Proceedings of the 28th Annual Hawaii International Conference on System Sciences, 1995, pp. 191-201.Applicant
- Trimberger et al., “A time-multiplexed FPGA,” Proceedings of the 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, 1998.Applicant
- Turner et al., “Design of a High Performance Active Router,” Internet Document, Online, Mar. 18, 1999.Applicant
- Vibhatavanijt et al., “Simultaneous Multithreading-Based Routers,” Proceedings of the 2000 International Conference of Parallel Processing, Toronto, Ontario, Canada, Aug. 21-24, 2000, pp. 362-359.Applicant
- Wazlowski et al., “PRSIM-II computer and architecture,” IEEE Proceedings, Workshop on FPGAs for Custom Computing Machines, 1993.Applicant
- “10-/100-Mbps Ethernet Media Access Controller (MAC) Core”, NEC, 1998, pp. 1-5.Applicant
- “Enterprise Hardware, Intel Expected to Unveil New Networking Chip,” News.Com, Aug. 26, 1999, <http://new.com.com/Intel+expected+to+unveil+new+networking+chip/2100-1001—3-230315.html> (accessed on Aug. 23, 2005), pp. 1-5.Applicant
- “The ATM Forum Technical Committee Traffic Management Specification Version 4.1”, The ATM Forum (Mar. 1999).Applicant
- Agarwal et al., “April: A Processor Architecture for Multiprocessing,” Proceedings of the 17th Annual International Symposium on Computer Architecutre, IEEE, pp. 104-114, (1990).Applicant
- Chandranmenon, G.P., et al., “Trading Packet Headers for Packet Processing”, IEEE/ACM Transactions on Networking, 4(2):141-152, Apr. 1996.Applicant
- Chappell, et al., “Simultaneous Subordinate Microthreading (SSMT)”, IEEE, pg. 186-195 (1999).Applicant
- Dictionary of Computer Words: An A to Z Guide to Today's Computers, Revised Edition, Houghton Mifflin Company: Boston, Massachusetts, pp. 220, (1995).Applicant
- Digital Semiconductor 21140A PCI Fast Ethernet LAN Controller, Hardware Reference Manual, Digital Equipment Corporation, pp. i-x, 1-1 through 1-5, 2-1 throught 2-12, 3-1 through 3-38, 4-31 through 5-2, 6-1 through 6-24, (Mar. 1998).Applicant
- Farrens, et al., “Strategies for Achieving Improved Processor Throughput”, ACM, p. 362-369 (1991).Applicant
- Frazier, Howard, “Gigabit Ethernet: From 100 to 1,000 Mbps”, IEEE Internet Computing, pp. 24-31, (1999).Applicant
- Frazier, Howard, “The 802.3z Gigabit Ethernet Standard”, IEEE Network, pp. 6-7, (1998).Applicant
- Giroux, N., et al., “Queuing and Scheduling: Quality of Service in ATM Networks, Chapter 5”, Quality of Service in ATM Networks: State-of-the-Art Traffic Management, pp. 96-121 (1998).Applicant
- Govind, et al., “Performance modeling and architecture exploration of network processors”, Quantitative Evaluation of Systems, abstract only (1 page), Sep. 2005.Applicant
- Ippoliti, A., et al., “Parallel Media Access Controller for Packet Communications at Gb/s Rates”, IEEE, pp. 991-996, (1990).Applicant
- Kaiserswerth, M., “The Parallel Protocol Engine”, IEEE/ACM Transactions on Networking, 1(6):650-663, Dec. 1993.Applicant
- Khailany, B., et al., “Imagine: Media Processing with Streams,” IEEE Micro, Mar. -Apr. 2001, pp. 35-46.Applicant
- Leon-Garcia, A., Communication Networks: Fundamental Concepts and Key Architectures, McGraw-Hill Higher Education, Copyright 2000, pp. 195-198, 215-219, & 380-385.Applicant
- Shaw, M.C., et al., UNIX Internals: A Systems Operations Handbook, Windcrest Books, pp. 30-37, 1987.Applicant
- Vuppala, V., et al., “Layer-3 switching using virtual network ports”, IEEE Proc. Computer Communications and Networks, pp. 642-648, 1999.Applicant