US20050080968A1 - Method and apparatus of allocating minimum and maximum bandwidths on a bus-based communication system - Google Patents
Method and apparatus of allocating minimum and maximum bandwidths on a bus-based communication system Download PDFInfo
- Publication number
- US20050080968A1 US20050080968A1 US10/669,192 US66919203A US2005080968A1 US 20050080968 A1 US20050080968 A1 US 20050080968A1 US 66919203 A US66919203 A US 66919203A US 2005080968 A1 US2005080968 A1 US 2005080968A1
- Authority
- US
- United States
- Prior art keywords
- legs
- bus
- insulation stripping
- inner legs
- stripping connector
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F13/14—Handling requests for interconnection or transfer
- G06F13/36—Handling requests for interconnection or transfer for access to common bus or bus system
- G06F13/362—Handling requests for interconnection or transfer for access to common bus or bus system with centralised access control
- G06F13/3625—Handling requests for interconnection or transfer for access to common bus or bus system with centralised access control using a time dependent access
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Bus Control (AREA)
Abstract
Description
- 1. Field of the Invention
- The present invention relates to a method and apparatus of allocating bandwidth on a bus-based communication system and, more particularly, to a method and apparatus of allocating minimum and maximum bandwidths on a bus-based communication system.
- 2. Description of the Related Art
- A bus-based communication system is a system that allows a number of communication circuits to exchange signals with each other over a group of shared electrical pathways. For example, the communication circuits on service cards, such as xDSL and other line cards, can be connected to, and communicate over, a bus.
-
FIG. 1 shows a block diagram that illustrates a conventional bus-basedcommunications system 100. As shown inFIG. 1 ,system 100 includes acell bus 110 that has a first bus BUS-A and a pair of first-bus control lines SEL-A0 and SEL-A1. In addition,cell bus 110 also includes a second bus BUS-B, and a pair of second-bus control lines SEL-B0 and SEL-B1. First bus BUS-A utilizes a first group of electrical pathways, such as eight electrical pathways that represent eight bits, while second bus BUS-B utilizes a second group of electrical pathways, such as eight electrical pathways that represent eight bits. - As further shown in the
FIG. 1 example,system 100 also includes a number ofservice cards 112 that are connected tocell bus 110. Eachservice card 112 is also connected to a number ofnetwork devices 114 to receive a number of streams of data cells DS. The data cells DS can have different priority levels such that a data cell DS from onenetwork device 114 is preferred over the data cell DS from anothernetwork device 114. - Each
service card 112 includes acommunication circuit 116 that has atransmit circuit 120 that transmits data cells ontocell bus 110, and areceive circuit 122 that receives data cells fromcell bus 110.Communication circuit 116 also includes alogic block 124 that processes the data cells DS. - In operation, when a number of
communication circuits 116 are connected tocell bus 110, one of thecommunication circuits 116 assumes the role of bus master, while theremaining communication circuits 116 assume the roles of bus slaves and communicate over the bus as allowed by the bus master. - The bus master controls the timing of the bus along with access to the bus. For example, the bus master can define transmission periods on bus BUS-A and bus BUS-B, and determine the
communication circuit 116 that has permission to use each of the transmission periods on the buses. -
FIG. 2 shows a state diagram that illustrates a priorart state machine 200 operating as a bus master.State machine 200 is executed by thelogic block 124 of thecommunication circuit 116 that is the bus master. As shown inFIG. 2 ,state machine 200 begins atstate 210 by determining whether any requests to use bus BUS-B were received during a first request period. - Requests to use bus BUS-B are received during request periods where each
communication circuit 116 that wishes to transmit a data cell overbus 110 outputs a request. The requests are output over select lines SEL-A0, SEL-A1, SEL-B0, and SEL-B1 to the bus master. Each request period can be, for example, 12 clock cycles long to support 24communication circuits 116. - For example, a 1st communication circuit can request bus BUS-B during a first-request clock cycle of a request period on select line SEL-A0 and SEL-A1, while a 13th communication circuit can request bus BUS-B during the first-request clock cycle on select lines SEL-B0 and SEL-B1. In addition, a 2nd communication circuit can request bus BUS-B during a second-request clock cycle on select line SEL-A0 and SEL-A1, while a 14th communication circuit can request bus BUS-B during the second-request clock cycle on select lines SEL-B0 and SEL-B1. Thus, in this example, after 12 clock cycles, each of 24 communications circuits has had a one clock cycle opportunity to request control of bus BUS-B over select lines SEL-A0, SEL-A1, SEL-B0, and SEL-B1.
- Each
communication circuit 116 outputs a logic value onto the select lines SEL during its assigned clock cycle to indicate whether a request is being made and, if so, the priority level of the request. For example, a logic value of 0-0 can represent a high priority level, while a logic value of 0-1 can represent a medium priority level. In addition, a logic value of 1-0 can represent a low priority level, while a logic value of 1-1 can represent no request. - When requests are received during the first request period,
state machine 200 moves tostate 212 to define a group of requesting circuits that include thecommunication circuits 116 that submitted a bus control request during the first request period. For example,state machine 200 can define a group that includes only thecommunication circuits 116 that requested control of bus BUS-B during the first request period. - Following this,
state machine 200 moves to state 214 to grant access to one of the group of requesting communication circuits to transmit in the next transmission period on bus BUS-B. Access is granted by outputting a grant to the requestingcommunication circuit 116 over the control lines SEL-B0 and SEL-B1.States 212 and 214 can be, for example, eight clock periods long. In addition, an error correction code can be transmitted at the same time on the select lines SEL-A0 and SEL-A1 that are not carrying the grant. Once the grant has been output,state machine 200 moves to state 216 to wait for a predefined period of time. The total time required to complete states 210-216 can be, for example, 26 clock cycles. - After the predefined time has expired,
state machine 200 moves tostate 218 to determine whether any requests to use bus BUS-A were received during a second request period. In the present example, one clock cycle beforestate machine 200 moves tostate 218, thecommunication circuit 116 that received control over bus BUS-B, begins transmitting a data cell on bus BUS-B. - As with bus BUS-B, requests to use bus BUS-A are also received during a request period where each
communication circuit 116 that wishes to transmit a data cell overbus 110 can output a request. The requests are again output over select lines SEL-A0, SEL-A1, SEL-B0, and SEL-B1 to the bus master, and the request period can also be 12 clock cycles long to support 24communication circuits 116. - For example, a 1st communication circuit can request bus BUS-A during a first-request clock cycle of a next request period on select lines SEL-B0 and SEL-B1, while a 13th communication circuit can request bus BUS-A during the first-request clock cycle on select lines SEL-A0 and SEL-A1. In addition, a 2nd communication circuit can request bus BUS-A during the second-request clock cycle on select lines SEL-B0 and SEL-B1, while a 14th communication circuit can request bus BUS-A during the second-request clock cycle on select lines SEL-A0 and SEL-A1. Thus, in this example, 12 clock cycles after the request period for bus BUS-A began, each of 24 communications circuits has had a one clock cycle opportunity to request control of bus BUS-A over select lines SEL-A0, SEL-A1, SEL-B0, and SEL-B1.
- When requests for bus BUS-A are received during the second request period,
state machine 200 moves tostate 220 to define a group of requesting circuits that include thecommunication circuits 116 that submitted a bus control request during the second request period. For example,state machine 200 can define a group that includes only thecommunication circuits 116 that requested control of bus BUS-A during the second request period. - Following this,
state machine 200 moves tostate 222 to grant access to one of the group of requesting communication circuits to transmit a data cell in the next transmission period on bus BUS-A. As above, access is granted by outputting a grant to the requestingcommunication circuit 116 over the control lines SEL-AO and SEL-Al.States - Once the grant has been output,
state machine 200 moves to state 224 to wait for a predefined period of time. The total time required to complete states 218-224 can be, for example, 26 clock cycles. After the predefined time has expired,state machine 200 returns tostate 210 to repeat the process. In addition, if no requests are received during the first request period,state machine 200 waits until the end of the 26 clock cycle, and then moves fromstate 210 tostate 218. Similarly, if no requests are received during the second request period,state machine 200 waits until the end of the 26 clock cycle, and then moves fromstate 218 tostate 210. - Thus,
state machine 200 moves through states 210-216, which define a first arbitration period, to determine and grant permission to transmit a data cell during the next transmission period on bus BUS-B, and then through states 218-224, which define a second arbitration period, to determine and grant permission to transmit a data cell during the next transmission period on bus BUS-A. As a result,state machine 200 provides an alternating series of arbitration periods where control over bus BUS-B is determined, and then control over bus BUS-A is determined. -
FIG. 3 shows a graphical representation that further illustrates priorart state machine 200. As shown inFIG. 3 ,state machine 200 defines an alternating series of BUS-B and BUS-A arbitration periods B arbitration period 310 can be implemented with, for example, states 210-216, while the BUS-Aarbitration period 312 can be implemented with, for example, states 218-224. - In the
FIG. 3 example, following a BUS-B arbitration period 310, thecommunication circuit 116 that received the grant begins transmitting a data cell on bus BUS-B one clock cycle before the next BUS-Aarbitration period 312, and continues transmitting the data cell for a transmit period. The transmit period can be, for example, 52 clock cycles long. - Similarly, following a BUS-A
arbitration period 312, thecommunication circuit 116 that received the grant begins transmitting a data cell on bus BUS-A one clock cycle before the next BUS-B arbitration period 310, and continues transmitting the data cell for the transmit period. - Thus, as shown in
FIG. 3 , when acommunication circuit 116 receives control over one of the two buses, such as BUS-A, thecircuit 116 transmits the data cell over the bus during the next two arbitration periods. By utilizing two 26-cycle arbitration periods and one 52-cycle transmit period, a single 52 byte ATM cell can be transmitted. -
FIG. 4 shows a flow chart that illustrates aprior art method 400 of granting access to a bus to one of a number of requesting communication circuits. In the present case, each of the requesting communication circuits submitted a bus control request to the bus master during the same request period. - As shown in
FIG. 4 ,method 400, which can be used to implementsteps 214 and 222, begins atstep 410 by identifying the requestingcommunication circuits 116 that wish to transmit a high priority data cell. Priority can be divided into different levels, such as high, medium, and low, and assigned to different data cells DS so that a data cell DS with a high priority is preferred over a data cell DS with a medium or low priority, while a data cell DS with a medium priority is preferred over a data cell DS with a low priority. - If no communication circuits with a high priority data cell requested control,
method 400 moves to step 412 to identify the requestingcommunication circuits 116 that wish to transmit a medium priority data cell. If no communication circuits with a medium priority data cell requested control,method 400 moves to step 414 to identify the requesting communication circuits that wish to transmit a low priority data cell. - Once the requesting communication circuits within a priority level have been identified,
method 400 moves from eitherstep 410,step 412, or step 414 to step 416 to determine which of the communication circuits within the priority level will receive the grant (permission to transmit during the next transmission period). - When several requesting
communication circuits 116 have the same priority level, the requestingcommunication circuit 116 to receive the grant can be defined by an arbitration, such as a declining round robin. In a declining round robin, the requestingcommunication circuits 116 circulate within a hierarchical ranking. - The requesting communication circuit at the top of the ranking is assigned the grant and, after receiving the grant, moves to the bottom of the ranking. The ranking of a
communication circuit 116 increases each time the circuit is denied a grant, i.e., control of the bus. - One drawback with
method 400 is that if the requestingcommunication circuits 116 with high priority data streams are over subscribed,method 400 can always or nearly always move fromstep 410 to step 416. As a result, the higher priority data cells DS can consume all of the available bandwidth, thereby preventing the lower priority data cells DS from being transmitted onto the bus. Thus, there is a need for a method and apparatus that grants access to a bus that insures that lower priority data streams are able to transmit information across the bus. - The present invention provides a method and an apparatus that grant access to a bus to one of a plurality of requesting communication circuits that each submitted a bus control request during a request period of an arbitration period. The method includes the step of determining a stored identity associated with the arbitration period, and determining whether any requesting communication circuit has an identity that matches the stored identity. The stored identity identifies a communication circuit.
- The present invention also includes a communication circuit that includes a transmit circuit that transmits information onto a cell bus, and a receive circuit that receives information from the cell bus. The communication circuit also includes a memory that stores priority information regarding a plurality of arbitration periods. The priority information for each arbitration period includes a stored identity that identifies a communication circuit.
- The communication circuit additionally includes a logic circuit that is connected to the transmit circuit, the receive circuit, and the memory, and determines whether any communication circuits requested control of a bus during an arbitration period. The logic circuit reads a stored identity associated with the arbitration period, and determines whether any requesting communication circuit has an identity that matches the stored identity. The stored identity identifies a communication circuit.
- A better understanding of the features and advantages of the present invention will be obtained by reference to the following detailed description and accompanying drawings that set forth an illustrative embodiment in which the principles of the invention are utilized.
-
FIG. 1 is a block diagram illustrating a conventional bus-basedcommunications system 100. -
FIG. 2 is a state diagram illustrating a priorart state machine 200 operating as a bus master. -
FIG. 3 is a graphical representation further illustrating priorart state machine 200. -
FIG. 4 is a flow chart illustrating aprior art method 400 of granting access to a bus to one of a number of requesting communication circuits. -
FIG. 5 is a block diagram illustrating an example of a bus-basedcommunications system 500 in accordance with the present invention. -
FIG. 6 is a state diagram illustrating an example of astate machine 600 that grants access to a bus to one of a number of requesting communication circuits in accordance with the present invention. -
FIG. 5 shows a block diagram that illustrates an example of a bus-basedcommunications system 500 in accordance with the present invention.System 500 is similar tosystem 100 and, therefore, utilizes the same reference numerals to designate the structures which are common to both systems. - As shown in
FIG. 5 ,system 500 differs fromsystem 100 in thatsystem 500 includes amemory 510 that stores grant information that is associated with each of a number of arbitration periods. The grant information, which can be organized as a Priority Table, can be stored in a number of memory devices, including registers and non-volatile memory cells. - An example of a Priority Table is shown below. The Priory Table includes a number of rows of data where each row corresponds with an arbitration period. (As described above, an arbitration period can be a 26 clock cycle period where requests are received during a request period and a grant is output.) Thus, a Priority Table that is 512 rows long represents 512 consecutive arbitration periods.
Priority Table Arbitration Valid Stored Stored Period Status Priority Identity 1 X XX XXXXX 2 X XX XXXXX 3 X XX XXXXX . . . . . . . . . . . . 512 X XX XXXXX - In addition, each row includes a valid status, a stored identity, and a stored priority. The valid status indicates whether the row of data associated with the arbitration period is valid. The stored identity identifies a
communication circuit 116, while the stored priority indicates a priority level of a data cell to be transmitted by the communication circuit. - For example, each row of data can include five bits [bits 4:0] of stored identity that identify a
communication circuit 116, two bits [bits 6:5] of stored priority that identify one of four priority levels, and one bit [bit 7] of valid status that indicates whether the data in the row associated with the arbitration period is valid. - The four priority levels include a high priority level represented by, for example, a 0-0, and a medium priority level represented by, for example, a 0-1. In addition, the four priority levels also include a low priority level represented by, for example, a 1-0, and an all priority level represented by, for example, a 1-1.
- As further shown in
FIG. 5 ,system 500 also differs fromsystem 100 in thatsystem 500 includes alogic circuit 512 and ahigh priority register 514 that indicates whether the high priority data received by acommunication circuit 116 is arbitration, such as round robin, enabled.System 500 also includes amedium priority register 516 that indicates whether the medium priority data received by thecommunication circuit 116 is arbitration enabled, and alow priority register 518 that indicates whether the low priority data received by thecommunication circuit 116 is arbitration enabled. -
System 500 can operate the same asstate machine 200 in determining a group of requesting circuits, as illustrated instates FIG. 2 .FIG. 6 shows a state diagram that illustrates an example of astate machine 600 that grants access to a bus to one of a number of requesting communication circuits in accordance with the present invention.State machine 600 can be used to implementstates 214 and 222 shown inFIG. 2 . - In the present example, the
logic circuit 512 of the bus master has determined the requesting communication circuits that submitted a bus control request to the bus master during the same request period of an arbitration period, such as instates Method 600 can be executed by thememory 510 andlogic circuit 512 of thecommunication circuit 116 that is the bus master insystem 500. - A shown in
FIG. 6 ,state machine 600 begins at state 610 by determining if the grant information that is associated with the arbitration period, such as the information stored in the row of the Priority Table that corresponds with the arbitration period, is valid, such as by checking the valid bit in the row of the Priority Table. The row of the Priority Table is selected to correspond with the arbitration period. For example, the first row of the table can correspond with the first arbitration period, and the 513th arbitration period when a 512 row Priority Table is used. - When the valid bit indicates that the information is valid,
state machine 600 moves tostate 612 to determine the stored identity that is associated with the arbitration period, such as by checking the identity bits in the row of the Priority Table that corresponds with the arbitration period. In addition,state machine 600 also determines instate 612 whether any requesting communication circuit has an identity that matches the stored identity. - When a requesting communication circuit has an identity that matches the stored identity,
state machine 600 moves tostate 614 to identify the requesting communication circuit as a matching communication circuit, and determine the stored priority that is associated with the arbitration period, such as by checking the priority bits in the row of the Priority Table that corresponds with the arbitration period. In addition,state machine 600 also determines instate 614 whether the priority of the data cell of the matching communication circuit matches the stored priority read from the row of the Priority Table. - When the priority of the data cell of the matching communication circuit matches the stored priority,
state machine 600 moves tostate 616 to output a grant to the matching communication circuit. The grant gives thematching communication circuit 116 permission to transmit during the next transmission period on a bus. - In state 610 when the grant information is invalid, in
state 612 when a requesting communication circuit does not have an identity that matches the stored identity, and instate 614 when the matching communication circuit does not have a priority that matches the stored priority,state machine 600 moves tostate 620 to determine whether any of the requestingcommunication circuits 116 wishes to transmit a high priority data cell. In addition,state machine 600 also determines instate 620 which of the high priority communications circuits are also arbitration enabled, such as by checking the high priority registers 514 on thecommunication circuits 116. - When an arbitration-enabled requesting communication circuit has a high priority data cell,
state machine 600 moves tostate 622 to determine which of the arbitration enabled communication circuits within the priority level will receive the grant (permission to transmit during the next transmission period). - When several requesting
communication circuits 116 have the same priority level, the requestingcommunication circuit 116 to receive the grant can be defined by an arbitration, such as a declining round robin. As noted above, in a declining round robin, the requestingcommunication circuits 116 circulate within a hierarchical ranking. - After
state machine 600 has selected a communication circuit from the arbitration,state machine 600 moves tostate 616 to send a grant to the selected communication circuit. The grant gives the selectedcommunication circuit 116 permission to transmit during the next transmission period on the bus. - If no communication circuits with a high priority data cell requested control,
state machine 600 moves tostate 624 to identify the requestingcommunication circuits 116 that wish to transmit a medium priority data cell. In addition,state machine 600 also determines instate 624 which of the medium priority communications circuits are also arbitration enabled, such as by checking the medium priority registers 516 on thecommunication circuits 116. - When an arbitration-enabled requesting communication circuit has a medium priority data cell,
state machine 600 moves tostate 622 to determine which of the communication circuits within the priority level will receive the grant (permission to transmit during the next transmission period). As above, the requestingcommunication circuit 116 to receive the grant can be defined by an arbitration, such as a declining round robin. - If no communication circuits with a medium priority data cell requested control,
state machine 600 moves tostate 626 to identify the requesting communication circuits that wish to transmit a low priority data cell. In addition,state machine 600 also determines instate 626 which of the low priority communications circuits are also arbitration enabled, such as by checking the low priority registers 518 on thecommunication circuits 116. - When an arbitration-enabled requesting communication circuit has a low priority data cell,
state machine 600 moves tostate 622 to determine which of the communication circuits within the priority level will receive the grant (permission to transmit during the next transmission period). As above, the requestingcommunication circuit 116 to receive the grant can be defined by an arbitration, such as a declining round robin. (State machine 600 can alternately be implemented in software.) - One of the advantages of the present invention is that the present invention insures that communication circuits with low priority data streams receive a minimum level of service. For example, to insure that a
communication circuit 116 with a low priority data cell is able to transmit at least once every 512 arbitration cycles, where the Priority Table has 512 rows, thecommunication circuit 116 can be listed in one row with a low priority level type. - If a low priority data cell of the
communication circuit 116 is to receive only one grant every 512 arbitration periods, then thelow priority register 518 on thecommunication circuit 116 is set to prevent arbitration. If the low priority data cell of thecommunication circuit 116 is to receive at least one grant, but maybe more than one grant, every 512 arbitration periods, then thelow priority register 516 is set to allow arbitration. - Another advantage is that the present invention can insure that communication circuits with a high priority data stream receive a known level of service. For example, to insure that a
communication circuit 116 with a high priority data stream is able to transmit 150 times every 512 arbitration cycles, where the Priority Table has 512 rows, thecommunication circuit 116 can be listed in 150 rows with a high priority level type, and arbitration register 514 set to prevent arbitration. - Thus, not only does the present invention limit the bandwidth that a high priority user can have, thereby allowing low priority users to transmit on the bus, the present invention also guarantees the high priority user a predetermined bandwidth that is free from competition from other high priority users. Other levels of service can also be provided by varying the priority level and the enable status.
- It should be understood that the above descriptions are examples of the present invention, and that various alternatives of the invention described herein may be employed in practicing the invention. Thus, it is intended that the following claims define the scope of the invention and that structures and methods within the scope of these claims and their equivalents be covered thereby.
Claims (27)
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/669,192 US7065594B2 (en) | 2003-09-23 | 2003-09-23 | Method and apparatus of allocating minimum and maximum bandwidths on a bus-based communication system |
EP04784429A EP1668457A4 (en) | 2003-09-23 | 2004-09-16 | System for allocating minimum and maximum bandwidths |
PCT/US2004/030565 WO2005031506A2 (en) | 2003-09-23 | 2004-09-16 | System for allocating minimum and maximum bandwidths |
CA002527428A CA2527428A1 (en) | 2003-09-23 | 2004-09-16 | System for allocating minimum and maximum bandwidths |
US11/414,687 US7437495B2 (en) | 2003-09-23 | 2006-04-27 | Method and apparatus for assigning bus grant requests |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/669,192 US7065594B2 (en) | 2003-09-23 | 2003-09-23 | Method and apparatus of allocating minimum and maximum bandwidths on a bus-based communication system |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/414,687 Continuation US7437495B2 (en) | 2003-09-23 | 2006-04-27 | Method and apparatus for assigning bus grant requests |
Publications (3)
Publication Number | Publication Date |
---|---|
US20050080968A1 true US20050080968A1 (en) | 2005-04-14 |
US20050268015A9 US20050268015A9 (en) | 2005-12-01 |
US7065594B2 US7065594B2 (en) | 2006-06-20 |
Family
ID=34393427
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/669,192 Active 2024-07-26 US7065594B2 (en) | 2003-09-23 | 2003-09-23 | Method and apparatus of allocating minimum and maximum bandwidths on a bus-based communication system |
US11/414,687 Expired - Lifetime US7437495B2 (en) | 2003-09-23 | 2006-04-27 | Method and apparatus for assigning bus grant requests |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/414,687 Expired - Lifetime US7437495B2 (en) | 2003-09-23 | 2006-04-27 | Method and apparatus for assigning bus grant requests |
Country Status (4)
Country | Link |
---|---|
US (2) | US7065594B2 (en) |
EP (1) | EP1668457A4 (en) |
CA (1) | CA2527428A1 (en) |
WO (1) | WO2005031506A2 (en) |
Families Citing this family (19)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8103832B2 (en) * | 2007-06-26 | 2012-01-24 | International Business Machines Corporation | Method and apparatus of prefetching streams of varying prefetch depth |
US8140925B2 (en) | 2007-06-26 | 2012-03-20 | International Business Machines Corporation | Method and apparatus to debug an integrated circuit chip via synchronous clock stop and scan |
US7827391B2 (en) | 2007-06-26 | 2010-11-02 | International Business Machines Corporation | Method and apparatus for single-stepping coherence events in a multiprocessor system under software control |
US8010875B2 (en) | 2007-06-26 | 2011-08-30 | International Business Machines Corporation | Error correcting code with chip kill capability and power saving enhancement |
US8458282B2 (en) | 2007-06-26 | 2013-06-04 | International Business Machines Corporation | Extended write combining using a write continuation hint flag |
US8230433B2 (en) | 2007-06-26 | 2012-07-24 | International Business Machines Corporation | Shared performance monitor in a multiprocessor system |
US7886084B2 (en) | 2007-06-26 | 2011-02-08 | International Business Machines Corporation | Optimized collectives using a DMA on a parallel computer |
US8032892B2 (en) * | 2007-06-26 | 2011-10-04 | International Business Machines Corporation | Message passing with a limited number of DMA byte counters |
US7793038B2 (en) | 2007-06-26 | 2010-09-07 | International Business Machines Corporation | System and method for programmable bank selection for banked memory subsystems |
US8108738B2 (en) | 2007-06-26 | 2012-01-31 | International Business Machines Corporation | Data eye monitor method and apparatus |
US8509255B2 (en) | 2007-06-26 | 2013-08-13 | International Business Machines Corporation | Hardware packet pacing using a DMA in a parallel computer |
US7877551B2 (en) * | 2007-06-26 | 2011-01-25 | International Business Machines Corporation | Programmable partitioning for high-performance coherence domains in a multiprocessor system |
US7680971B2 (en) * | 2007-06-26 | 2010-03-16 | International Business Machines Corporation | Method and apparatus for granting processors access to a resource |
US7802025B2 (en) | 2007-06-26 | 2010-09-21 | International Business Machines Corporation | DMA engine for repeating communication patterns |
US8468416B2 (en) | 2007-06-26 | 2013-06-18 | International Business Machines Corporation | Combined group ECC protection and subgroup parity protection |
US7984448B2 (en) * | 2007-06-26 | 2011-07-19 | International Business Machines Corporation | Mechanism to support generic collective communication across a variety of programming models |
US8756350B2 (en) | 2007-06-26 | 2014-06-17 | International Business Machines Corporation | Method and apparatus for efficiently tracking queue entries relative to a timestamp |
US9367500B2 (en) | 2011-11-09 | 2016-06-14 | Intel Corporation | Apparatus for multiple bus master engines to share the same request channel to a pipelined backbone |
US8706938B2 (en) | 2012-06-20 | 2014-04-22 | International Business Machines Corporation | Bandwidth limiting on generated PCIE packets from debug source |
Citations (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5867670A (en) * | 1996-11-26 | 1999-02-02 | Electronics And Telecommunications Research Institute | Self-control type bus arbitration circuit and arbitration method therefor |
US6035361A (en) * | 1997-11-28 | 2000-03-07 | Electronics And Telecommunications Research Institute | Cell bus arbitration device and method arbitrating the same |
US6185647B1 (en) * | 1997-12-18 | 2001-02-06 | Fujitsu Limited | Dynamic bus control apparatus for optimized device connection |
US6286083B1 (en) * | 1998-07-08 | 2001-09-04 | Compaq Computer Corporation | Computer system with adaptive memory arbitration scheme |
US6311244B1 (en) * | 1997-05-27 | 2001-10-30 | Fusion Micromedia Corporation | Priority allocation in a bus interconnected discrete and/or integrated digital multi-module system |
US20020112106A1 (en) * | 2000-12-15 | 2002-08-15 | Henehan Burke S. | Backplane physical layer controller with an internal bus reset |
US6512769B1 (en) * | 1998-06-03 | 2003-01-28 | Cisco Technology, Inc. | Method and apparatus for rate-based cell traffic arbitration in a switch |
US6636915B1 (en) * | 1999-05-19 | 2003-10-21 | Eci Telecom Ltd. | Cell bus distributed arbitration system and method |
US20040064615A1 (en) * | 2002-10-01 | 2004-04-01 | Lsi Logic Corporation | Arbitration within a multiport AMBA slave |
US6718422B1 (en) * | 1999-07-29 | 2004-04-06 | International Business Machines Corporation | Enhanced bus arbiter utilizing variable priority and fairness |
US6768745B1 (en) * | 1998-04-29 | 2004-07-27 | Zhone Technologies, Inc. | Flexible SONET access and transmission system |
US20040267991A1 (en) * | 2003-06-30 | 2004-12-30 | Delaney William P. | Transparent switch |
US20050066092A1 (en) * | 2003-09-23 | 2005-03-24 | Ripy Paul B. | Method and apparatus of allocating minimum and maximum bandwidths on a bus-based communication system with redundant communication circuits |
US6907491B2 (en) * | 2002-06-05 | 2005-06-14 | Lsi Logic Corporation | Methods and structure for state preservation to improve fairness in bus arbitration |
Family Cites Families (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3851104A (en) | 1973-04-11 | 1974-11-26 | Mitre Corp | Digital communications system |
US4814974A (en) * | 1982-07-02 | 1989-03-21 | American Telephone And Telegraph Company, At&T Bell Laboratories | Programmable memory-based arbitration system for implementing fixed and flexible priority arrangements |
US4586175A (en) | 1984-04-30 | 1986-04-29 | Northern Telecom Limited | Method for operating a packet bus for transmission of asynchronous and pseudo-synchronous signals |
DE3424866C2 (en) | 1984-07-06 | 1986-04-30 | Messerschmitt-Bölkow-Blohm GmbH, 8012 Ottobrunn | Method and arrangement for the transmission of data, in particular in an aircraft |
US4891805A (en) | 1988-06-13 | 1990-01-02 | Racal Data Communications Inc. | Multiplexer with dynamic bandwidth allocation |
US4969120A (en) * | 1989-02-13 | 1990-11-06 | International Business Machines Corporation | Data processing system for time shared access to a time slotted bus |
US4928273A (en) | 1989-02-21 | 1990-05-22 | Unisys Corporation | Time division multiplexer/demultiplexer with deterministic time slot assignment |
CA2115731C (en) | 1993-05-17 | 2000-01-25 | Mikiel Loyal Larson | Dynamically programmable bus arbiter with provisions for historical feedback and error detection and correction |
US6119214A (en) | 1994-04-25 | 2000-09-12 | Apple Computer, Inc. | Method for allocation of address space in a virtual memory system |
US5771358A (en) * | 1996-07-15 | 1998-06-23 | Micron Electronics, Inc. | Method and system for apportioning computer bus bandwidth |
US6034960A (en) | 1997-12-04 | 2000-03-07 | Nortel Networks Corporation | ATM service scheduler using reverse-binary scattering and time-space mapping |
SE513221C2 (en) | 1998-04-17 | 2000-07-31 | Net Insight Ab | Method and apparatus for allocating time slots to a channel in a circuit-switched time multiplexed network |
US6654833B1 (en) * | 1999-07-29 | 2003-11-25 | Micron Technology, Inc. | Bus arbitration |
US6467002B1 (en) * | 1999-10-19 | 2002-10-15 | 3Com Corporation | Single cycle modified round-robin arbitration with embedded priority |
EP1464144A4 (en) | 2001-11-09 | 2010-09-22 | Vitesse Semiconductor Corp | A means and a method for switching data packets or frames |
US7486693B2 (en) | 2001-12-14 | 2009-02-03 | General Electric Company | Time slot protocol |
-
2003
- 2003-09-23 US US10/669,192 patent/US7065594B2/en active Active
-
2004
- 2004-09-16 EP EP04784429A patent/EP1668457A4/en not_active Withdrawn
- 2004-09-16 CA CA002527428A patent/CA2527428A1/en not_active Abandoned
- 2004-09-16 WO PCT/US2004/030565 patent/WO2005031506A2/en active Application Filing
-
2006
- 2006-04-27 US US11/414,687 patent/US7437495B2/en not_active Expired - Lifetime
Patent Citations (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5867670A (en) * | 1996-11-26 | 1999-02-02 | Electronics And Telecommunications Research Institute | Self-control type bus arbitration circuit and arbitration method therefor |
US6311244B1 (en) * | 1997-05-27 | 2001-10-30 | Fusion Micromedia Corporation | Priority allocation in a bus interconnected discrete and/or integrated digital multi-module system |
US6035361A (en) * | 1997-11-28 | 2000-03-07 | Electronics And Telecommunications Research Institute | Cell bus arbitration device and method arbitrating the same |
US6185647B1 (en) * | 1997-12-18 | 2001-02-06 | Fujitsu Limited | Dynamic bus control apparatus for optimized device connection |
US6768745B1 (en) * | 1998-04-29 | 2004-07-27 | Zhone Technologies, Inc. | Flexible SONET access and transmission system |
US6512769B1 (en) * | 1998-06-03 | 2003-01-28 | Cisco Technology, Inc. | Method and apparatus for rate-based cell traffic arbitration in a switch |
US6286083B1 (en) * | 1998-07-08 | 2001-09-04 | Compaq Computer Corporation | Computer system with adaptive memory arbitration scheme |
US6636915B1 (en) * | 1999-05-19 | 2003-10-21 | Eci Telecom Ltd. | Cell bus distributed arbitration system and method |
US6718422B1 (en) * | 1999-07-29 | 2004-04-06 | International Business Machines Corporation | Enhanced bus arbiter utilizing variable priority and fairness |
US20020112106A1 (en) * | 2000-12-15 | 2002-08-15 | Henehan Burke S. | Backplane physical layer controller with an internal bus reset |
US6907491B2 (en) * | 2002-06-05 | 2005-06-14 | Lsi Logic Corporation | Methods and structure for state preservation to improve fairness in bus arbitration |
US20040064615A1 (en) * | 2002-10-01 | 2004-04-01 | Lsi Logic Corporation | Arbitration within a multiport AMBA slave |
US20040267991A1 (en) * | 2003-06-30 | 2004-12-30 | Delaney William P. | Transparent switch |
US20050066092A1 (en) * | 2003-09-23 | 2005-03-24 | Ripy Paul B. | Method and apparatus of allocating minimum and maximum bandwidths on a bus-based communication system with redundant communication circuits |
Also Published As
Publication number | Publication date |
---|---|
CA2527428A1 (en) | 2005-04-07 |
US7065594B2 (en) | 2006-06-20 |
WO2005031506A3 (en) | 2006-03-09 |
EP1668457A4 (en) | 2008-01-23 |
US20050268015A9 (en) | 2005-12-01 |
EP1668457A2 (en) | 2006-06-14 |
US7437495B2 (en) | 2008-10-14 |
US20060195641A1 (en) | 2006-08-31 |
WO2005031506A2 (en) | 2005-04-07 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7437495B2 (en) | Method and apparatus for assigning bus grant requests | |
US4560985A (en) | Dual-count, round-robin distributed arbitration technique for serial buses | |
CA1218467A (en) | Arbitration mechanism for assigning control of a communications path in a digital computer system | |
US4500989A (en) | Digital communication system | |
US5301283A (en) | Dynamic arbitration for system bus control in multiprocessor data processing system | |
CA2503597C (en) | Method and apparatus for unique address assignment, node self-identification and topology mapping for a directed acyclic graph | |
US4785394A (en) | Fair arbitration technique for a split transaction bus in a multiprocessor computer system | |
US4449202A (en) | Full duplex integrated circuit communication controller | |
CA1217280A (en) | Retry mechanism for releasing control of a communications path in a digital computer system | |
KR100644596B1 (en) | Bus system and bus arbitration method thereof | |
US6501765B1 (en) | Distributed method and apparatus for allocating a communication medium | |
US7054970B2 (en) | Bus arbiter for integrated circuit systems | |
US7003609B2 (en) | Method and apparatus of allocating minimum and maximum bandwidths on a bus-based communication system with redundant communication circuits | |
US7995607B2 (en) | Arbiter for a serial bus system | |
US6618376B2 (en) | ATM utopia bus snooper switch | |
US7200732B2 (en) | Method and apparatus of adding grant information to a memory | |
EP0060535A2 (en) | Multiprocessor network | |
US6865630B2 (en) | Apparatus and method of preventing congestion in message transmission system | |
EP1459191B1 (en) | Communication bus system | |
JPH08125670A (en) | Bus contention control system | |
JPH07105124A (en) | Interruption controller | |
JPH05120213A (en) | Common bus conflict arbitration system | |
KR19990060655A (en) | Frame Signal Control Method in Cell Bus Structure | |
JPH03101586A (en) | Common data bus control system | |
KR20070065988A (en) | A cell bus system having cell bus arbitration function per inserted board and the method thereof |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: ADVANCED FIBRE COMMUNICATIONS, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:RIPY, PAUL B.;CHUNG, KEITH Q.;GEERDES, GARY J.;AND OTHERS;REEL/FRAME:014563/0480;SIGNING DATES FROM 20030917 TO 20030919 Owner name: ADVANCED FIBRE COMMUNICATIONS, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:RIPY, PAUL B.;CHUNG, KEITH Q.;GEERDES, GARY J.;AND OTHERS;SIGNING DATES FROM 20030917 TO 20030919;REEL/FRAME:014563/0480 |
|
AS | Assignment |
Owner name: TELLABS PETALUMA, INC., CALIFORNIA Free format text: CHANGE OF NAME;ASSIGNOR:ADVANCED FIBRE COMMUNICATIONS, INC.;REEL/FRAME:016483/0740 Effective date: 20041208 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
CC | Certificate of correction | ||
FPAY | Fee payment |
Year of fee payment: 4 |
|
FPAY | Fee payment |
Year of fee payment: 8 |
|
FEPP | Fee payment procedure |
Free format text: PAYER NUMBER DE-ASSIGNED (ORIGINAL EVENT CODE: RMPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
AS | Assignment |
Owner name: BANK OF AMERICA, N.A., AS ADMINISTRATIVE AGENT, TE Free format text: SECURITY INTEREST;ASSIGNOR:TELLABS BROADBAND LLC (F/K/A/ TELLABS PETALUMA, INC.);REEL/FRAME:040827/0810 Effective date: 20161230 |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553) Year of fee payment: 12 |