US6810455B2 - Bus arbitration system and method for carrying out a centralized arbitration with independent bus request and grant lines - Google Patents

Bus arbitration system and method for carrying out a centralized arbitration with independent bus request and grant lines Download PDF

Info

Publication number
US6810455B2
US6810455B2 US09/968,097 US96809701A US6810455B2 US 6810455 B2 US6810455 B2 US 6810455B2 US 96809701 A US96809701 A US 96809701A US 6810455 B2 US6810455 B2 US 6810455B2
Authority
US
United States
Prior art keywords
bus
master
clock cycles
request
centralized
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.)
Expired - Lifetime, expires
Application number
US09/968,097
Other versions
US20030065849A1 (en
Inventor
David C. Wyland
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Cradle IP LLC
Original Assignee
Cradle Tech Inc
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Cradle Tech Inc filed Critical Cradle Tech Inc
Priority to US09/968,097 priority Critical patent/US6810455B2/en
Assigned to CRADLE TECHNOLOGIES reassignment CRADLE TECHNOLOGIES ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: WYLAND, DAVID C.
Publication of US20030065849A1 publication Critical patent/US20030065849A1/en
Application granted granted Critical
Publication of US6810455B2 publication Critical patent/US6810455B2/en
Assigned to CRADLE IP, LLC reassignment CRADLE IP, LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: CRADLE TECHNOLOGIES
Adjusted expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

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/364—Handling requests for interconnection or transfer for access to common bus or bus system with centralised access control using independent requests or grants, e.g. using separated request and grant lines

Definitions

  • the present invention relates to bus arbitration systems, and more particularly to a bus arbitration system using dedicated bus request and bus grant lines for bus masters.
  • a medium is employed whereby these modules can transfer data among each other.
  • the medium employed is a physical data channel known as a bus.
  • the bus is connected to a communications port on each module.
  • Each module is a potential bus master that needs the bus to communicate with other modules. It is possible that more than one potential bus master may request to use the bus simultaneously; therefore, there must be a bus arbiter to choose a winning bus master for bus grant. When the winning bus master finishes using the bus, the bus arbiter chooses the next winner, and so on.
  • bus allocation arbitration
  • Each potential bus master 105 has an independent bus request line 115 connected to a centralized bus arbiter 100 and an independent bus grant line 120 coming from centralized bus arbiter 100 .
  • a bus busy line 130 is shared by all potential bus masters 105 .
  • All bus masters 105 have interfaces with a bus 110 .
  • Bus busy line 130 is active indicating bus 110 is busy, i.e., being used by a bus master 105 .
  • Master i keeps activating its dedicated bus request line BR i until it is granted access to bus 110 . This can be done by pulling low bus request line BR i if bus request signal on bus request line BR i is active low.
  • bus busy line 130 is passive, i.e., no master is using bus 110
  • centralized bus arbiter 100 immediately allocates bus 110 to Master i by activating Master i 's dedicated grant line BG i 120 .
  • Master i then deactivates its request line BR i and activates bus busy line 130 .
  • Master i finishes using bus 110
  • Master i deactivates bus busy line 130 so that centralized bus arbiter 100 knows that it can select another winning bus master 105 for bus grant.
  • centralized bus arbiter 100 When bus busy line 130 is active, centralized bus arbiter 100 does not accept any bus requests. When several request lines are active when bus busy line 130 becomes passive, centralized bus arbiter 100 can use any of the bus allocation policies mentioned above to choose a winner among the requesting bus masters 105 .
  • the centralized bus arbiter with independent bus request and bus grant lines in FIG. 1 has faster arbitration time compared with daisy-chained arbiters, it requires a large number of bus arbitration lines (bus request lines, bus grant lines, bus busy lines). Therefore, it is an object of the present invention to propose a bus arbitration system and method that require fewer bus arbitration lines to implement the centralized bus arbiter with independent bus request and bus grant lines.
  • the bus arbitration system and method of the present invention achieve the stated object by assuming that each operation using the bus takes from one to five bus clock cycles.
  • Each potential bus master has its dedicated bus request line and a dedicated bus grant line, both of which are connected to a centralized bus arbiter in the bus arbitration system of the present invention.
  • the potential bus master activates its dedicated bus request line for the same number of bus clock cycles as it would need of bus use (i.e. three bus clock cycles).
  • This three clock wide bus request pulse is recorded in a bus request recording circuit in the centralized bus arbiter. Access to the bus can be granted by the centralized bus arbiter to a winning bus master under any bus arbitration policy.
  • the centralized bus arbiter activates the winning bus master's dedicated bus grant line for the same number of bus clock cycles as requested by the bus master, i.e. for three bus clock cycles. So, the bus master will have sufficient use of the bus for its desired operation. After that, the arbiter chooses the next winning bus master and activates its dedicated grant line in the same manner as described above, and so on. No bus busy line is needed in the bus arbitration system of the present invention.
  • FIG. 1 is the block diagram of a typical bus arbitration system as known in the prior art having a centralized bus arbiter with independent bus request and bus grant lines for each potential bus master.
  • FIG. 2 is the block diagram of a bus arbitration system of the present invention.
  • FIG. 3 is a timing diagram of bus request and bus grant pulses in the bus arbitration system of FIG. 2 according to a first preferred embodiment of the present invention.
  • FIG. 4 is another timing diagram of bus request and bus grant pulses in the bus arbitration system of FIG. 2 according to the first preferred embodiment of the present invention.
  • FIG. 5 is a timing diagram of bus request and bus grant pulses in the bus arbitration system of FIG. 2 according to a second preferred embodiment of the present invention.
  • the bus arbitration system 200 of the present invention comprises a centralized bus arbiter 260 which has a bus request recording circuit 220 and an arbitration circuit 240 .
  • Bus request recording circuit 220 and arbitration circuit 240 are coupled together via a connection 230 .
  • Arbitration circuit 240 of centralized bus arbiter 260 has a plurality of bus grant lines 280 connecting to a plurality of potential bus masters 270 .
  • Each bus grant line 280 is dedicated to a potential bus master 270 .
  • Arbitration circuit 240 uses bus grant lines 280 to send bus grant signals one at a time to bus masters 270 .
  • Bus request recording circuit 220 of centralized bus arbiter 260 has a plurality of bus request lines 290 coming from potential bus masters 270 . Each bus request line 290 is dedicated to a potential bus master 270 . Centralized bus arbiter 260 uses bus request lines 290 to receive bus request signals from potential bus masters 270 .
  • Bus 300 is used for communication and data transfer between bus masters 270 .
  • Bus arbitration system 200 works as follows. Bus masters 270 , if need be, send their bus requests to bus request recording circuit 220 via bus request lines 290 .
  • each bus request is a pulse whose width is equal to the number of bus clock cycles needed by the bus master 270 which made the bus request. For example, if a bus master 270 needs to use bus 300 for three bus clock cycles, it sends a pulse which is three bus clock cycles wide to bus request recording circuit 220 via its own bus request line 290 .
  • BusReq i 290 can pull its own bus request line BusReq i 290 low for three bus clock cycles as shown in FIG. 3 .
  • character # indicates that bus request signal BusReq i # is active low.
  • the function of bus arbitration system 200 is based on the assumption that each bus operation takes from one to five bus clock cycles. However, any other number other than five can be used in the assumption above.
  • Bus request recording circuit 220 receives all the incoming bus requests from requesting bus masters 270 and records these bus requests along with their desired bus use in terms of the number of bus clock cycles requested.
  • bus request recording circuit 220 has counters 222 and memory 224 to record the numbers of requested bus clock cycles of the incoming bus requests from the bus masters 270 . If BUS MASTER i 270 activates bus request line BusReq i 290 , a counter 222 assigned to bus request line BusReq i 290 counts until BUS MASTER i 270 deactivates bus request line BusReq i 290 . The count value representing the number of bus clock cycles requested is stored in some memory 224 in bus request recording circuit 220 for later use by arbitration circuit 240 in selecting a winning bus master 270 and granting bus access to that winning bus master 270 .
  • arbitration circuit 240 selects a winning bus master 270 among bus masters 270 that have unfulfilled bus requests and grant it bus access.
  • the selection can be under any arbitration policies: fixed priority, rotating priority, round robin, least recently used policy, first come first served scheme, etc.
  • Arbitration circuit 240 makes the bus grant by sending a bus grant signal to the winning bus masters 270 via the bus grant line 280 of that winning bus master 270 .
  • the bus grant signal to the winning bus masters 270 is a pulse having the same width as the bus request signal previously made by that winning bus master 270 .
  • the bus grant signal should be a pulse three bus clock cycles wide. In other words, if BUS MASTER i is the winning bus master, arbitration circuit 240 activates the bus grant line BusGr i of BUS MASTER i for three bus clock cycles.
  • arbitration circuit 240 can pull low the bus grant line BusGr i of the winning BUS MASTER i for three bus clock cycles as shown in FIG. 3 .
  • character # indicates that bus grant signal BusGr i # is active low.
  • arbitration circuit 240 selects the next winning bus master 270 among bus masters 270 that have unfulfilled bus requests and grant it bus access in the same manner described above.
  • a bus request signal BusReq i # is the signal transmitted on bus request line BusReq i .
  • the character # indicates that bus request signal BusReq i # is active low.
  • bus grant signal BusGr i # is the signal transmitted on bus grant line BusGr i and is active low.
  • BusReq i # is low for three bus clock cycles (i.e. a pulse three bus clock cycles wide). This means that the BUS MASTER i 270 which sends this bus request signal BusReq i # is requesting three bus clock cycles of bus use. Assuming that BUS MASTER i 270 is chosen by arbitration circuit 240 (FIG.
  • arbitration circuit 240 activates bus grant line BusGr i of BUS MASTER i 270 by pulling bus grant line BusGr i low for the same number of bus clock cycles as previously requested by BUS MASTER i 270 , i.e. three bus clock cycles.
  • BUS MASTER 1 270 wants to use bus 300 for three bus clock cycles and sends a bus request to bus request recording circuit 220 by pulling down its bus request line BusReq 1 for three bus clock cycles.
  • BusReq 1 # on bus request line BusReq 1 goes low at t0, stays low for three bus clock cycles, and goes high at t2.
  • BUS MASTER 2 270 wants to use bus 300 for five bus clock cycles and sends a bus request to bus request recording circuit 220 by pulling down its bus request line BusReq 2 for five bus clock cycles.
  • BusReq 2 # on bus request line BusReq 2 goes low at t0, stays low for five bus clock cycles, and goes high at t3.
  • Centralized bus arbiter 260 (FIG. 2) recognizes these bus request signals BusReq 1 # and BusReq 2 # right away and arbitration is carried out. Assuming that BUS MASTER 2 has higher priority. At t1 (i.e. a delay of one bus clock cycle) centralized bus arbiter 260 sends a bus grant signal BusGr 2 # on bus grant line BusGr 2 of BUS MASTER 2 .
  • the bus grant signal BusGr 2 # is a pulse which is five bus clock cycles wide from t1 to t4.
  • bus request signal BusReq 1 # on bus request line BusReq 1 is recorded by bus request recording circuit 220 and later at the end of the five bus clock cycles of bus use granted to BUS MASTER 2 , i.e., at time t4, centralized bus arbiter 260 sends a bus grant signal BusGr 1 # on the bus grant line BusGr 1 of BUS MASTER 1 .
  • the bus grant signal BusGr 1 # is a pulse which is three bus clock cycles wide from t4 to t5.
  • bus arbitration system 200 of the present invention there is no need for a bus busy line. Moreover, there is no need for a quota system because each bus operation never exceeds five bus clock cycles of bus use. Therefore, no bus cycles is wasted on switching between processes which happens in prior art bus arbitration systems when a process exceeds its bus time quota.
  • each bus request may be a series of pulses according to a second preferred embodiment.
  • the number of pulses in the series specifies the number of bus clock cycles of bus use requested by the requesting bus master 270 .
  • Each pulse in the series corresponds to one bus clock cycle.
  • BUS MASTER i wants three bus clock cycles of bus use and sends a bus request to centralized bus arbiter 260 (FIG. 2) by sending a series of three consecutive pulses from time t0 to t2.
  • Centralized bus arbiter 260 records this number of pulses and responds by sending a bus grant signal BusGri# on the bus grant line BusGr i of BUS MASTER i .
  • Bus grant signal BusGr i # is a pulse which is three bus clock cycles wide from t1 to t4.
  • Bus request recording circuit 220 should have counters 222 for counting the pulses of the incoming bus requests and some memory 224 for recording these counter values for later use by arbitration circuit 240 in selecting a winning bus master 270 and granting bus access to that winning bus master 270 .

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

Disclosed is a bus arbitration system and method which assume that each operation using the bus requires from one to five bus clock cycles. Each potential bus master has a dedicated bus request line and a dedicated bus grant line, both of which are connected to a centralized bus arbiter in the bus arbitration system of the present invention. When a potential bus master wants to use the bus for, for instance, three bus clock cycles, the bus master activates its dedicated bus request line for the same number of bus clock cycles as it would need of bus use (i.e. three bus clock cycles). This three clock wide bus request pulse is recorded in a bus request recording circuit in the centralized bus arbiter. Access to the bus can be granted by the centralized bus arbiter to a winning bus master under any bus arbitration policies. If a potential bus master is chosen to be the winning bus master, the centralized bus arbiter activates the winning bus master's dedicated bus grant line for the same number of bus clock cycles as requested by the bus master, i.e. for three bus clock cycles. So, the bus master will have sufficient use of the bus for its desired operation. After that, the arbiter chooses the next winning bus master and activates its dedicated grant line in the same manner described above, and so on.

Description

TECHNICAL FIELD
The present invention relates to bus arbitration systems, and more particularly to a bus arbitration system using dedicated bus request and bus grant lines for bus masters.
BACKGROUND ART
In digital computer systems having a plurality of modules, such as processor modules, controller modules, communications interface or relay modules, etc., a medium is employed whereby these modules can transfer data among each other. Typically, the medium employed is a physical data channel known as a bus. The bus is connected to a communications port on each module. Each module is a potential bus master that needs the bus to communicate with other modules. It is possible that more than one potential bus master may request to use the bus simultaneously; therefore, there must be a bus arbiter to choose a winning bus master for bus grant. When the winning bus master finishes using the bus, the bus arbiter chooses the next winner, and so on. There are several well known bus allocation (arbitration) policies: fixed priority, rotating priority, round robin, least recently used policy, and first come first served scheme.
One of the most well known bus arbitration systems is the typical centralized bus arbiter with independent (dedicated) bus request and bus grant lines as shown in FIG. 1. Each potential bus master 105 has an independent bus request line 115 connected to a centralized bus arbiter 100 and an independent bus grant line 120 coming from centralized bus arbiter 100. A bus busy line 130 is shared by all potential bus masters 105. All bus masters 105 have interfaces with a bus 110. The protocol of allocating bus 110 is as follows: Masteri 105 (i=1,2, . . . , or n) requests access to bus 110 by activating its dedicated bus request line BR i 115. If bus busy line 130 is active indicating bus 110 is busy, i.e., being used by a bus master 105, Masteri keeps activating its dedicated bus request line BRi until it is granted access to bus 110. This can be done by pulling low bus request line BRi if bus request signal on bus request line BRi is active low.
If bus busy line 130 is passive, i.e., no master is using bus 110, centralized bus arbiter 100 immediately allocates bus 110 to Masteri by activating Masteri's dedicated grant line BGi 120. Masteri then deactivates its request line BRi and activates bus busy line 130. When Masteri finishes using bus 110, Masteri deactivates bus busy line 130 so that centralized bus arbiter 100 knows that it can select another winning bus master 105 for bus grant.
When bus busy line 130 is active, centralized bus arbiter 100 does not accept any bus requests. When several request lines are active when bus busy line 130 becomes passive, centralized bus arbiter 100 can use any of the bus allocation policies mentioned above to choose a winner among the requesting bus masters 105.
Although the centralized bus arbiter with independent bus request and bus grant lines in FIG. 1 has faster arbitration time compared with daisy-chained arbiters, it requires a large number of bus arbitration lines (bus request lines, bus grant lines, bus busy lines). Therefore, it is an object of the present invention to propose a bus arbitration system and method that require fewer bus arbitration lines to implement the centralized bus arbiter with independent bus request and bus grant lines.
SUMMARY OF THE INVENTION
The bus arbitration system and method of the present invention achieve the stated object by assuming that each operation using the bus takes from one to five bus clock cycles. Each potential bus master has its dedicated bus request line and a dedicated bus grant line, both of which are connected to a centralized bus arbiter in the bus arbitration system of the present invention. When a potential bus master wants to use the bus for, for instance, three bus clock cycles, the potential bus master activates its dedicated bus request line for the same number of bus clock cycles as it would need of bus use (i.e. three bus clock cycles). This three clock wide bus request pulse is recorded in a bus request recording circuit in the centralized bus arbiter. Access to the bus can be granted by the centralized bus arbiter to a winning bus master under any bus arbitration policy. If a potential bus master is chosen to be the winning bus master, the centralized bus arbiter activates the winning bus master's dedicated bus grant line for the same number of bus clock cycles as requested by the bus master, i.e. for three bus clock cycles. So, the bus master will have sufficient use of the bus for its desired operation. After that, the arbiter chooses the next winning bus master and activates its dedicated grant line in the same manner as described above, and so on. No bus busy line is needed in the bus arbitration system of the present invention.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is the block diagram of a typical bus arbitration system as known in the prior art having a centralized bus arbiter with independent bus request and bus grant lines for each potential bus master.
FIG. 2 is the block diagram of a bus arbitration system of the present invention.
FIG. 3 is a timing diagram of bus request and bus grant pulses in the bus arbitration system of FIG. 2 according to a first preferred embodiment of the present invention.
FIG. 4 is another timing diagram of bus request and bus grant pulses in the bus arbitration system of FIG. 2 according to the first preferred embodiment of the present invention.
FIG. 5 is a timing diagram of bus request and bus grant pulses in the bus arbitration system of FIG. 2 according to a second preferred embodiment of the present invention.
BEST MODE FOR CARRYING OUT THE INVENTION
With reference to FIG. 2, the bus arbitration system 200 of the present invention comprises a centralized bus arbiter 260 which has a bus request recording circuit 220 and an arbitration circuit 240. Bus request recording circuit 220 and arbitration circuit 240 are coupled together via a connection 230.
Arbitration circuit 240 of centralized bus arbiter 260 has a plurality of bus grant lines 280 connecting to a plurality of potential bus masters 270. Each bus grant line 280 is dedicated to a potential bus master 270. Arbitration circuit 240 uses bus grant lines 280 to send bus grant signals one at a time to bus masters 270.
Bus request recording circuit 220 of centralized bus arbiter 260 has a plurality of bus request lines 290 coming from potential bus masters 270. Each bus request line 290 is dedicated to a potential bus master 270. Centralized bus arbiter 260 uses bus request lines 290 to receive bus request signals from potential bus masters 270.
Each bus master 270 connects to a shared bus 300. Bus 300 is used for communication and data transfer between bus masters 270.
Bus arbitration system 200 works as follows. Bus masters 270, if need be, send their bus requests to bus request recording circuit 220 via bus request lines 290. In a first preferred embodiment of the present invention, each bus request is a pulse whose width is equal to the number of bus clock cycles needed by the bus master 270 which made the bus request. For example, if a bus master 270 needs to use bus 300 for three bus clock cycles, it sends a pulse which is three bus clock cycles wide to bus request recording circuit 220 via its own bus request line 290. In other words, BUS MASTERi 270 (i=1 to n) activates its bus request line BusReqi 290 for three bus clock cycles. If the bus request signals are active low, for instance, BUS MASTERi 270 can pull its own bus request line BusReqi 290 low for three bus clock cycles as shown in FIG. 3. In FIG. 3, character # indicates that bus request signal BusReqi# is active low.
In the first preferred embodiment of the present invention, the function of bus arbitration system 200 is based on the assumption that each bus operation takes from one to five bus clock cycles. However, any other number other than five can be used in the assumption above.
Bus request recording circuit 220 receives all the incoming bus requests from requesting bus masters 270 and records these bus requests along with their desired bus use in terms of the number of bus clock cycles requested. In the first preferred embodiment, bus request recording circuit 220 has counters 222 and memory 224 to record the numbers of requested bus clock cycles of the incoming bus requests from the bus masters 270. If BUS MASTERi 270 activates bus request line BusReqi 290, a counter 222 assigned to bus request line BusReqi 290 counts until BUS MASTERi 270 deactivates bus request line BusReqi 290. The count value representing the number of bus clock cycles requested is stored in some memory 224 in bus request recording circuit 220 for later use by arbitration circuit 240 in selecting a winning bus master 270 and granting bus access to that winning bus master 270.
Accessing the information stored in bus request recording circuit 220 via connection 230, arbitration circuit 240 selects a winning bus master 270 among bus masters 270 that have unfulfilled bus requests and grant it bus access. The selection can be under any arbitration policies: fixed priority, rotating priority, round robin, least recently used policy, first come first served scheme, etc.
Arbitration circuit 240 makes the bus grant by sending a bus grant signal to the winning bus masters 270 via the bus grant line 280 of that winning bus master 270. In the first preferred embodiment, the bus grant signal to the winning bus masters 270 is a pulse having the same width as the bus request signal previously made by that winning bus master 270. In the example above, the bus grant signal should be a pulse three bus clock cycles wide. In other words, if BUS MASTERi is the winning bus master, arbitration circuit 240 activates the bus grant line BusGri of BUS MASTERi for three bus clock cycles. If the bus grant signals are active low, for instance, arbitration circuit 240 can pull low the bus grant line BusGri of the winning BUS MASTERi for three bus clock cycles as shown in FIG. 3. In FIG. 3, character # indicates that bus grant signal BusGri# is active low.
At the end of the three bus clock cycles of bus use granted to the current winning bus master, using the information stored in bus request recording circuit 220, arbitration circuit 240 selects the next winning bus master 270 among bus masters 270 that have unfulfilled bus requests and grant it bus access in the same manner described above.
With reference to FIG. 3, a bus request signal BusReqi# is the signal transmitted on bus request line BusReqi. The character # indicates that bus request signal BusReqi# is active low. Similarly, bus grant signal BusGri# is the signal transmitted on bus grant line BusGri and is active low. In FIG. 3, BusReqi# is low for three bus clock cycles (i.e. a pulse three bus clock cycles wide). This means that the BUS MASTER i 270 which sends this bus request signal BusReqi# is requesting three bus clock cycles of bus use. Assuming that BUS MASTER i 270 is chosen by arbitration circuit 240 (FIG. 2) for bus access, arbitration circuit 240 activates bus grant line BusGri of BUS MASTER i 270 by pulling bus grant line BusGri low for the same number of bus clock cycles as previously requested by BUS MASTER i 270, i.e. three bus clock cycles.
With reference again to FIG. 3, there is a delay of one bus clock cycle between the time BUS MASTERi starts sending bus request signal BusReqi# to bus request recording circuit 220 and the time arbitration circuit 240 starts sending bus grant signal BusGri# to BUS MASTERi. This is the case when there is only one bus master (BUS MASTERi) requesting access to bus 300. Arbitration circuit 240 recognizes this bus request signal right away via connection 230 and responds by activating bus grant line BusGr i 280 of BUS MASTER i 270 by pulling bus grant line BusGri low. When BUS MASTERi deactivates (pulling up) its bus grant line BusGri, arbitration circuit 240 recognizes this deactivation right away via connection 230 and responds by deactivating bus grant line BusGr i 280 of BUS MASTER i 270 by pulling bus grant line BusGri high. If more than one bus master 270 requests access to bus 300, some bus master 270 must wait for a while for its turn to use bus 300. Bus grant signals BusGri# (i=1−n) can be used as chip select signal or transfer enable signal for BUS MASTERi 270 (i=1−n).
With reference to FIG. 4, at time t0 (at reset), BUS MASTER 1 270 wants to use bus 300 for three bus clock cycles and sends a bus request to bus request recording circuit 220 by pulling down its bus request line BusReq1 for three bus clock cycles. As the result, the bus request signal BusReq1# on bus request line BusReq1 goes low at t0, stays low for three bus clock cycles, and goes high at t2.
Supposing at t0, BUS MASTER 2 270 wants to use bus 300 for five bus clock cycles and sends a bus request to bus request recording circuit 220 by pulling down its bus request line BusReq2 for five bus clock cycles. As the result, the bus request signal BusReq2# on bus request line BusReq2 goes low at t0, stays low for five bus clock cycles, and goes high at t3.
Centralized bus arbiter 260 (FIG. 2) recognizes these bus request signals BusReq1# and BusReq2# right away and arbitration is carried out. Assuming that BUS MASTER2 has higher priority. At t1 (i.e. a delay of one bus clock cycle) centralized bus arbiter 260 sends a bus grant signal BusGr2# on bus grant line BusGr2 of BUS MASTER2. The bus grant signal BusGr2# is a pulse which is five bus clock cycles wide from t1 to t4.
In the mean time, the bus request signal BusReq1# on bus request line BusReq1 is recorded by bus request recording circuit 220 and later at the end of the five bus clock cycles of bus use granted to BUS MASTER2, i.e., at time t4, centralized bus arbiter 260 sends a bus grant signal BusGr1# on the bus grant line BusGr1 of BUS MASTER1. The bus grant signal BusGr1# is a pulse which is three bus clock cycles wide from t4 to t5.
With the bus arbitration system 200 of the present invention in FIG. 2, there is no need for a bus busy line. Moreover, there is no need for a quota system because each bus operation never exceeds five bus clock cycles of bus use. Therefore, no bus cycles is wasted on switching between processes which happens in prior art bus arbitration systems when a process exceeds its bus time quota.
With reference to FIG. 5, instead of being a pulse as in the first preferred embodiment, each bus request may be a series of pulses according to a second preferred embodiment. The number of pulses in the series specifies the number of bus clock cycles of bus use requested by the requesting bus master 270. Each pulse in the series corresponds to one bus clock cycle. As shown in FIG. 5, assuming BUS MASTERi wants three bus clock cycles of bus use and sends a bus request to centralized bus arbiter 260 (FIG. 2) by sending a series of three consecutive pulses from time t0 to t2. Centralized bus arbiter 260 records this number of pulses and responds by sending a bus grant signal BusGri# on the bus grant line BusGri of BUS MASTERi. The bus grant signal BusGri# is a pulse which is three bus clock cycles wide from t1 to t4. Bus request recording circuit 220 should have counters 222 for counting the pulses of the incoming bus requests and some memory 224 for recording these counter values for later use by arbitration circuit 240 in selecting a winning bus master 270 and granting bus access to that winning bus master 270.

Claims (14)

What is claimed is:
1. A bus arbitration system comprising:
a bus;
a plurality of bus masters, each said bus master being connected to said bus; and
a centralized bus arbiter having:
a plurality of bus request lines for receiving bus requests from said bus masters, each bus request by a requesting bus master specifying a number of bus clock cycles of bus use requested by said requesting bus master; and
a plurality of bus grant lines for sending bus grants to said bus masters, each of said bus grant lines being dedicated to each of said bus masters,
wherein a bus request by a requesting bus master is a pulse whose width is equal to the number of bus clock cycles of bus use requested by said requesting bus master.
2. The bus arbitration system of claim 1 wherein each bus grant by said centralized bus arbiter to a winning bus master specifies the number of bus clock cycles of bus use requested by said winning bus master.
3. The bus arbitration system of claim 2 wherein each bus grant by said centralized bus arbiter to said winning bus master is a pulse whose width is equal to the number of bus clock cycles of bus use requested by said winning bus master.
4. The bus arbitration system of claim 1 wherein said centralized bus arbiter further comprises:
a bus request recording circuit for recording bus requests from said bus masters;
an arbitration circuit; and
an interface coupling said bus request recording circuit and said arbitration circuit, said arbitration circuit accessing bus requests recorded in said bus request recording circuit via said interface, choosing a winning bus master among said bus masters that have unfulfilled bus requests for access to said bus, and sending out a bus grant to said winning bus master.
5. The bus arbitration system of claim 4 wherein said bus request recording circuit comprises counters and memories for recording the bus requests from said bus masters.
6. The bus arbitration system of claim 1 wherein the bus request by the bus requesting bus master is a series of consecutive pulses, a number of pulses in said series being equal to the number of bus clock cycles of bus use requested by said requesting bus master.
7. A bus request and bus grant method comprising the steps of:
providing a bus arbitration system including a bus, a centralized bus arbiter, a plurality of bus masters sharing said bus, a plurality of bus request lines and a plurality of bus grant lines, each of said bus masters having a dedicated bus request line and a dedicated bus grant line connected to said centralized bus arbiter;
sending bus requests on said bus request lines from said bus masters to said centralized bus arbiter and specifying a number of bus clock cycles of bus use requested by each of said bus masters by activating the bus request line of said bus master for a number of bus clock cycles related to the number of bus clock cycles of bus use requested by said bus master, the activation of the bus request line lasting for a number of bus clock cycles equal to the number of bus clock cycles of bus use requested by said bus master, each of said bus masters sending its own bus request on its own bus request line to said centralized bus arbiter;
using said centralized bus arbiter to receive bus requests;
using said centralized bus arbiter to choose a winning bus master among said bus masters that have unfulfilled bus requests; and
using said centralized bus arbiter to send a bus grant to said winning bus master on the bus grant line of said winning bus master.
8. The method of claim 7 wherein said specifying the number of bus clock cycles of bus use requested by each of said bus masters comprises the step of sending on the bus request line of said bus master a series of consecutive pulses, the number of pulses in said series being related to the number of bus clock cycles of bus use requested by said bus master.
9. The method of claim 8 wherein the number of pulses in said series is equal to the number of bus clock cycles of bus use requested by said bus master.
10. The method of claim 9 wherein using said centralized bus arbiter to receive bus requests comprises the step of using a bus request recording circuit to record the number of bus clock cycles of bus use requested by each of said bus masters.
11. The method of claim 10 wherein said using the bus request recording circuit to record comprises the steps of:
using counters to count the number of bus clock cycles of bus use requested each of said bus masters; and
using memories to store the contents of said counters for later use by an arbitration circuit in said centralized bus arbiter.
12. The method of claim 10 wherein using said centralized bus arbiter to choose a winning bus master among said bus masters that have unfulfilled bus requests follows a first come first served policy.
13. The method of claim 12 wherein using said centralized bus arbiter to send the bus grant to said winning bus master comprises the step of activating the bus grant line of said winning bus master for a number of bus clock cycles related to the number of bus clock cycles of bus use requested by said winning bus master.
14. The method of claim 13 wherein activating bus grant line of said winning bus master lasts for a number of bus clock cycles equal to the number of bus clock cycles of bus use requested by said winning bus master.
US09/968,097 2001-09-28 2001-09-28 Bus arbitration system and method for carrying out a centralized arbitration with independent bus request and grant lines Expired - Lifetime US6810455B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US09/968,097 US6810455B2 (en) 2001-09-28 2001-09-28 Bus arbitration system and method for carrying out a centralized arbitration with independent bus request and grant lines

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US09/968,097 US6810455B2 (en) 2001-09-28 2001-09-28 Bus arbitration system and method for carrying out a centralized arbitration with independent bus request and grant lines

Publications (2)

Publication Number Publication Date
US20030065849A1 US20030065849A1 (en) 2003-04-03
US6810455B2 true US6810455B2 (en) 2004-10-26

Family

ID=25513729

Family Applications (1)

Application Number Title Priority Date Filing Date
US09/968,097 Expired - Lifetime US6810455B2 (en) 2001-09-28 2001-09-28 Bus arbitration system and method for carrying out a centralized arbitration with independent bus request and grant lines

Country Status (1)

Country Link
US (1) US6810455B2 (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040081158A1 (en) * 2002-05-15 2004-04-29 Broadcom Corporation Centralized switching fabric scheduler supporting simultaneous updates
US20050188138A1 (en) * 2004-01-30 2005-08-25 Chang-Dae Park Arrangement, device and method for controlling bus request signal generation
US7062582B1 (en) * 2003-03-14 2006-06-13 Marvell International Ltd. Method and apparatus for bus arbitration dynamic priority based on waiting period
US20080256279A1 (en) * 2007-04-16 2008-10-16 Nvidia Corporation Resource arbiter
US20090157934A1 (en) * 2004-06-01 2009-06-18 Ssd Company Limited Data Processing Unit and Bus Arbitration Unit
US8270322B1 (en) * 2004-12-30 2012-09-18 Emc Corporation Method and system for arbitrating data transmissions

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7818316B2 (en) * 2006-12-18 2010-10-19 International Business Machines Corporation Variable density query engine

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5111424A (en) 1987-05-01 1992-05-05 Digital Equipment Corporation Lookahead bus arbitration system with override of conditional access grants by bus cycle extensions for multicycle data transfer
US5276887A (en) * 1991-06-06 1994-01-04 Commodore Electronics Limited Bus arbitration system for granting bus access to devices following two-wire bus arbitration protocol and devices following three-wire bus arbitration protocol
US5426740A (en) 1994-01-14 1995-06-20 Ast Research, Inc. Signaling protocol for concurrent bus access in a multiprocessor system
US5440698A (en) * 1990-11-30 1995-08-08 Xerox Corporation Arbitration of packet switched busses, including busses for shared memory multiprocessors
US5473762A (en) * 1994-01-25 1995-12-05 Apple Computer Inc. Method and system for pipelining bus requests
US5528764A (en) 1992-12-24 1996-06-18 Ncr Corporation Bus system with cache snooping signals having a turnaround time between agents driving the bus for keeping the bus from floating for an extended period
US5611058A (en) 1993-01-29 1997-03-11 International Business Machines Corporation System and method for transferring information between multiple buses
US5774455A (en) * 1995-06-21 1998-06-30 Fuji Xerox Co., Ltd. Data transmission apparatus and method and data communication system conducting variable bit-rate data transmission
US5898694A (en) 1996-12-30 1999-04-27 Cabletron Systems, Inc. Method of round robin bus arbitration
US6425032B1 (en) * 1999-04-15 2002-07-23 Lucent Technologies Inc. Bus controller handling a dynamically changing mix of multiple nonpre-emptable periodic and aperiodic devices

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5111424A (en) 1987-05-01 1992-05-05 Digital Equipment Corporation Lookahead bus arbitration system with override of conditional access grants by bus cycle extensions for multicycle data transfer
US5440698A (en) * 1990-11-30 1995-08-08 Xerox Corporation Arbitration of packet switched busses, including busses for shared memory multiprocessors
US5276887A (en) * 1991-06-06 1994-01-04 Commodore Electronics Limited Bus arbitration system for granting bus access to devices following two-wire bus arbitration protocol and devices following three-wire bus arbitration protocol
US5528764A (en) 1992-12-24 1996-06-18 Ncr Corporation Bus system with cache snooping signals having a turnaround time between agents driving the bus for keeping the bus from floating for an extended period
US5611058A (en) 1993-01-29 1997-03-11 International Business Machines Corporation System and method for transferring information between multiple buses
US5426740A (en) 1994-01-14 1995-06-20 Ast Research, Inc. Signaling protocol for concurrent bus access in a multiprocessor system
US5473762A (en) * 1994-01-25 1995-12-05 Apple Computer Inc. Method and system for pipelining bus requests
US5774455A (en) * 1995-06-21 1998-06-30 Fuji Xerox Co., Ltd. Data transmission apparatus and method and data communication system conducting variable bit-rate data transmission
US5898694A (en) 1996-12-30 1999-04-27 Cabletron Systems, Inc. Method of round robin bus arbitration
US6425032B1 (en) * 1999-04-15 2002-07-23 Lucent Technologies Inc. Bus controller handling a dynamically changing mix of multiple nonpre-emptable periodic and aperiodic devices

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7272151B2 (en) * 2002-05-15 2007-09-18 Broadcom Corporation Centralized switching fabric scheduler supporting simultaneous updates
US20040081158A1 (en) * 2002-05-15 2004-04-29 Broadcom Corporation Centralized switching fabric scheduler supporting simultaneous updates
US8041870B1 (en) 2003-03-14 2011-10-18 Marvell International Ltd. Method and apparatus for dynamically granting access of a shared resource among a plurality of requestors
US7062582B1 (en) * 2003-03-14 2006-06-13 Marvell International Ltd. Method and apparatus for bus arbitration dynamic priority based on waiting period
US9037767B1 (en) 2003-03-14 2015-05-19 Marvell International Ltd. Method and apparatus for dynamically granting access of a shared resource among a plurality of requestors
US7698486B1 (en) 2003-03-14 2010-04-13 Marvell International Ltd. Method and apparatus for bus arbitration dynamic priority based on waiting period
US8307139B1 (en) 2003-03-14 2012-11-06 Marvell International Ltd. Method and apparatus for dynamically granting access of a shared resource among a plurality of requestors
US20050188138A1 (en) * 2004-01-30 2005-08-25 Chang-Dae Park Arrangement, device and method for controlling bus request signal generation
US7444447B2 (en) * 2004-01-30 2008-10-28 Samsung Electronics Co., Ltd. Arrangement, device and method for controlling bus request signal generation
US20090157934A1 (en) * 2004-06-01 2009-06-18 Ssd Company Limited Data Processing Unit and Bus Arbitration Unit
US7908416B2 (en) * 2004-06-01 2011-03-15 Ssd Company Limited Data processing unit and bus arbitration unit
US8270322B1 (en) * 2004-12-30 2012-09-18 Emc Corporation Method and system for arbitrating data transmissions
US7814253B2 (en) * 2007-04-16 2010-10-12 Nvidia Corporation Resource arbiter
US20080256279A1 (en) * 2007-04-16 2008-10-16 Nvidia Corporation Resource arbiter

Also Published As

Publication number Publication date
US20030065849A1 (en) 2003-04-03

Similar Documents

Publication Publication Date Title
US5515523A (en) Method and apparatus for arbitrating conflicts by monitoring number of access requests per unit of time in multiport memory systems
US4972313A (en) Bus access control for a multi-host system using successively decremented arbitration delay periods to allocate bus access among the hosts
US7095752B2 (en) On-chip inter-subsystem communication including concurrent data traffic routing
US7437495B2 (en) Method and apparatus for assigning bus grant requests
US6178475B1 (en) Multimedia system employing timers to properly allocate bus access
US5327538A (en) Method of utilizing common buses in a multiprocessor system
US4374413A (en) Arbitration controller providing for access of a common resource by a plurality of central processing units
US4611275A (en) Time sharing device for access to a main memory through to a single bus connected between a central computer and a plurality of peripheral computers
CA2114374C (en) Bus coupling information processing system for multiple access to system bus
US6810455B2 (en) Bus arbitration system and method for carrying out a centralized arbitration with independent bus request and grant lines
US5644733A (en) Dual coupled partitionable networks providing arbitration logic for managed access to commonly shared busses
US6532507B1 (en) Digital signal processor and method for prioritized access by multiple core processors to shared device
US6571306B1 (en) Bus request mechanism for bus master which is parked on a shared bus
US7698485B2 (en) Round-robin bus protocol
US6012117A (en) Methods and apparatus for arbitrating and controlling arbitration for access to a serial bus
US4376975A (en) Arbitration controller providing for access of a common resource by a plurality of central processing units
US5682485A (en) Deadlock avoidance for switched interconnect bus systems
US6138197A (en) Apparatus and method for limit-based arbitration scheme
US7433989B2 (en) Arbitration method of a bus bridge
JPH1125036A (en) Arbitration system and method for arbitorating access
JP2000276437A (en) Dma controller
CA1119274A (en) Communications processor
JPS6155704B2 (en)
EP1459191B1 (en) Communication bus system
JPH0337339B2 (en)

Legal Events

Date Code Title Description
AS Assignment

Owner name: CRADLE TECHNOLOGIES, CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:WYLAND, DAVID C.;REEL/FRAME:012258/0706

Effective date: 20010925

STCF Information on status: patent grant

Free format text: PATENTED CASE

FPAY Fee payment

Year of fee payment: 4

AS Assignment

Owner name: CRADLE IP, LLC, CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:CRADLE TECHNOLOGIES;REEL/FRAME:027210/0764

Effective date: 20111110

FPAY Fee payment

Year of fee payment: 8

REMI Maintenance fee reminder mailed
FPAY Fee payment

Year of fee payment: 12

SULP Surcharge for late payment

Year of fee payment: 11