JP3042744B2 - Access arbitration method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention is applied to an information processing apparatus, a communication exchange, in particular, an ATM exchange, and other systems having a plurality of resources commonly connected by a bus.
Here, the resource refers to a memory device, an output device, a display device, an input device, a printing device, a functional unit, and other facilities including hardware for operating the system.

[0002] The present invention relates to arbitration of a plurality of access requests generated within a system with respect to a plurality of shared resources arranged in one system.

[0003]

2. Description of the Related Art The arbitration of access requests according to the prior art will be described with reference to a model shown in FIG. 5, which is based on a ring arbiter control method. This model includes eight access request sources R (0) to R (7) and eight resources S (1) to S (S) for receiving the access request.
(7). These are connected to the input terminal group and the output terminal group of the matrix switch means, respectively. The matrix switch means may be provided with hardware having a matrix configuration as shown in the figure, or may be a virtual one constituted by a logic circuit having a matrix function as shown and capable of transmitting an access request. The number of access request sources and the number of resources do not necessarily have to be equal.

Access request sources R (0) to R (7)
Generates access requests one after another. Since an access request is generated according to the circumstances of the source, a plurality of access requests may simultaneously compete for one resource S (m). The contention is arbitrated by a control circuit that controls the matrix switch means, and one access request source R (n) is transmitted to one request destination resource S (m). At this time, ring arbiter RA
Each of (1) to RA (8) sweeps the access request as indicated by an arrow in FIG. 5 and, when the access request is reached, the access request is reduced via the intersection C (n, m). Only one resource S (m) is transmitted to the resource S (m).
(M) receives the access request.

When one access request is accepted,
Information indicating that the request has been accepted is sent to the request source that sent the access request. By receiving one access request, another access request sent to the ring arbiter is waited, and the other access request is detected at the next timing or at the next timing. After the access request is accepted, processing such as transfer of necessary data via the matrix switch means or another bus signal line is executed.

[0006]

In such contention arbitration of access requests, it is good when the number of access request sources and the number of resources are small, but as the number increases, the number of contention arbitrations increases. N is N + ΔN, M is M
By increasing to + ΔM, the scale of the matrix switch is N × M, but becomes (N + ΔN) × (M + ΔM) = NM + ΔNM + NΔM + ΔNΔM. The increase in the size of the matrix switch directly leads to an increase in the contention arbitration operation by the ring arbiter. That is, in FIG. 5, the request source R (0) and the resource S
In order to establish the connection with (7), the ring arbiter must perform contention arbitration at eight intersections. Furthermore, as the size of the matrix switch increases,
The number of intersections that the ring arbiter has to go around increases. In addition, it is necessary to transmit and receive connection availability information for each access request. That is, the operation time becomes long, and expensive elements that can execute high-speed operation must be used.

The present invention is an improvement of the present invention, in which the logic of contention arbitration is changed to reduce the number of request sources or resources of apparent accesses to reduce the number of contention arbitrations to be executed. Aim. SUMMARY OF THE INVENTION It is an object of the present invention to provide a method capable of shortening the contention arbitration time for access request arbitration and performing the contention arbitration with a low-speed and low-power-consumption element. An object of the present invention is to provide a method capable of performing contention arbitration in consideration of priority and improving traffic throughput.

[0008]

According to the present invention, there are provided N (N is an integer of 2 or more) request sources for generating access requests;
M resources (M is an integer of 2 or more) shared by the access request sources and the N request sources are connected to the input terminal, and the M resources are connected to the output terminal. Matrix switch means having a capacity of N × M, arbitration means for executing arbitration when an access request is issued from a plurality of access request sources for one of the resources, and a result of the arbitration An access arbitration system including a control circuit including a disconnection unit that controls disconnection of an intersection of the matrix switch unit.

Here, a feature of the present invention is characterized in that the arbitration means of the control circuit divides the access request generation source into a plurality of groups smaller than the number (N), and divides the resource into the plurality of groups. Means for dividing into a plurality of groups smaller than the number (M); and dividing the intersection into groups of intersections connecting each combination of the resource group and the request source group divided by the division means. Means for storing the number of access requests for each of the plurality of resource groups from the plurality of request source groups; and referring to the table means, the request generation means having a large number of access requests. Means for generating a combination of the request source group and the resource group in order from the source group; Means for notifying the combination result to the intersection group and the request source group, means for prohibiting the generation of the access request for the request source group not notified from the notification means, and Means for performing the arbitration within the group of intersections for the access request corresponding to the combination.

The table means includes auxiliary table means for storing the number of access requests from the plurality of request source groups to the plurality of resource groups for each of the request source groups and storing the total number of access requests. You can also.

[0011] The table means may include auxiliary table means for storing the number of access requests to the plurality of resource groups from the plurality of request source groups for each of the resource groups. Can also.

[0012]

In order to construct an N × M large-scale one-stage matrix switch, N request sources are divided into d1 groups, and M resources are divided into d2 groups. (N /
d1) × (M / d2) small-scale switches using d1
The small-scale switch is associated with the request source division group, and the small-scale switch performs outgoing contention control and data transfer by associating an arbitrary resource with the small-scale switch. The connection relationship with the small-scale switch is selected based on an arbitrary priority so as to take a combination.

This eliminates the necessity of passing all adjacent intersections in a two-dimensional array during data transfer.

[0014]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The configuration of a first embodiment of the present invention will be described with reference to FIG. FIG. 1 is a configuration diagram of the first embodiment of the present invention.

According to the present invention, eight request sources R (0) to R (7) for generating access requests and eight request sources R (0) to R (7) shared by the access requests are generated. Resources S (1) to S (7) and eight request sources R (0) to R (R)
(7) is connected to the input terminal ₁ 1 to 1 _8, matrix switch 3 having a capacity of eight resource S (1) to S (7) is connected to the output terminal 2 ₁ to 2 ₈ have been 8 × 8 And arbitration means for executing arbitration when access requests are generated from a plurality of access request sources R (0) to R (7) for one of resources S (1) to S (7). An access arbitration system including an arbitration unit 5 and a control circuit CTL including a matrix switch disconnection unit 6 as disconnection means for controlling disconnection of an intersection of the matrix switch means based on the arbitration result.

Here, it is a feature of the present invention that the arbitration means of the arbitration unit 5 includes access request sources R (0) to R (0).
Means for dividing R (7) into four groups, means for dividing resources S (1) to S (7) into four groups, and a group of resources divided by the means for dividing the intersection. Resource groups OG (0) to O
G (3) and a switch group SW which is a group of intersections connecting the combinations of the request source groups IG (0) to IG (3) one by one.
(0) -SW (3), and access requests from the plurality of request source groups IG (0) -IG (3) to the plurality of resource groups OG (0) -OG (3). A reference table TABL, which is a table means for storing numbers, and request source groups IG (0) to IG (3) in which the number of access requests is large with reference to the reference table TABL. 0)-IG (3) and resource group OG
Means for generating a combination with (0) to OG (3), and a switch group SW (0) to
SW (3) and request source group IG (0) to IG
(3) means for notifying, means for prohibiting the generation of the access request for the request source groups IG (0) to IG (3) not notified from the notifying means, and corresponding to the notified combination. Means for executing the arbitration in the switch groups SW (0) to SW (3) for the access request to be made.

Next, the operation of the first embodiment of the present invention will be described with reference to FIG. FIG. 2 is a diagram for explaining the operation of the first embodiment of the present invention. The request source R (0) to R (7) is divided into four, and the divided groups are respectively divided into the request source groups I
G (0) to IG (3), and resources S (1) to S
(7) is divided into four, and the divided groups are referred to as resource groups OG (0) to OG (3), respectively.

A small switch having a 2 × 2 intersection and performing competitive control of two inputs to two outputs is referred to as a switch group S.
W (0) to SW (3). Among them, in one outgoing line conflict control, the switch groups SW (0) to SW (3) in which the conflict arbitration is actually performed have one switch for one request source group IG (0) to IG (3). One can decide.
Selecting a combination of the request source groups IG (0) to IG (3) and the resource groups OG (0) to OG (3),
The control circuit CTL includes the switch groups SW (0) to SW
(3) is made to correspond to the resource groups OG (0) to OG (3).

Request source groups IG (0) to IG
The data lines IL (0) to IL (7) that receive data and control data from (3) and return control results are coupled to the input lines of the switch groups SW (0) to SW (3). Data line OL (1) of resources S (1) to S (7)
OL (7) are coupled to output lines of any switch groups SW (0) to SW (3) based on the method described below.

In the first embodiment of the present invention, outgoing line contention control and data transfer are performed by an arbitrary request source group IG (0).
IG (3) and arbitrary resource groups OG (0) to OG
(3) Performed only during the period. The types of the connection exist in a one-to-one correspondence between the request source groups IG (0) to IG (3) and the resource groups OG (0) to OG (3).
The number is 24 types. Among them, FIG. 1 shows that IG (0) ⇔OG (0), IG (1) ⇔OG (1),
The connections IG (2) @OG (2) and IG (3) @OG (3) are combined. Here, a priority is given from the control circuit CTL, and the combination is IG (0) ⇔OG (2), IG (1) ⇔OG (0),
When IG (2) ⇔OG (3) and IG (3) ⇔OG (1), the switch groups SW (0) to SW (3) are made to correspond as indicated by arrows in FIG. Here, the combination of the request source groups IG (0) to IG (3) and the resource groups OG (0) to OG (3), that is, the resource groups OG (0) to OG (3) and the switch group SW ( 0) to SW (3).

In the first embodiment of the present invention, a request source group IG having an access request having a variation in priority is set.
(0) to IG (3) and resource groups OG (0) to O
Since an optimal combination with G (3) can be obtained, the traffic throughput can be improved. Control circuit CT
As a method of giving the priority of L, (1) the number of generated requests is the maximum, (2) the number of requests for connection abandonment due to non-permission is minimized, and (3) the waiting time for connection requests is minimized. It is configured to give in consideration of that.

Next, the request source groups IG (0) -I
A combination setting procedure of G (3) and resource groups OG (0) to OG (3) will be described. Lookup table TABL
Is 4 × corresponding to the request source groups IG (0) to IG (3) and the resource groups OG (0) to OG (3).
It is a logical data table consisting of four. Item LST
(0,0) to LST (3,3) include request source groups IG (0) to IG (3) and resource group OG
For the combination with (0) to OG (3), the resource group OG generated by all the request sources R (0) to R (7) in the request source groups IG (0) to IG (3)
The sum of access requests for resources S (1) to S (7) in (0) to OG (3) is stored. Control circuit CTL
Refers to the contents of the reference table TABL, and requests request source groups IG (0) to IG (3) and resource group OG
The combination with (0) to OG (3) is selected and notified to the request source groups IG (0) to IG (3) and the switch groups SW (0) to SW (3).

Request source groups IG (0) to IG
Combinations of (3) and resource groups OG (0) to OG (3) need to correspond one-to-one. FIG.
LST (0,3) of lookup table TABL in
Is the resource S (6) of the resource group OG (3) among the access requests of the request source R (0) or R (1) of the request source group IG (0) at the present time. Or, it indicates the number of access requests for S (7). That is, the request source groups IG (0) to IG (3) and the resource groups OG (0) to OG (3) are referred to by referring to the items LST (0,0) to LST (3,3) of the reference table TABL. ) Can be grasped. To explain the procedure further, all items LS in the table TABL
With reference to T (0,0) to LST (3,3), the one with the largest number of access requests is selected. In FIG. 2, since the 15 requests of the item LST (2, 2) are the largest, this is selected. This means that a combination of the request source group IG (2) and the resource group OG (2) is selected. Next, a combination of the request source group IG (2) and the resource group OG (2) (Item LST
Other than (2, 2)), the one with the largest number of access requests is selected. Here, items LST (1, 1) and LS
Number of requests for T (0,3) and LST (3,2) "10"
There are many. Among them, the item LST (3, 2) is rejected because the resource group OG (2) has been selected from the result. The items LST (1,1) and LST (0,3) are
Since no collision occurs between the request source group IG (1) and the resource group OG (1) and the request source group IG (0) and the resource group IG (3), they can be selected as they are. Since there is only IG (3) and resource group OG (0), this combination is set unconditionally. Here, even if the number of access requests is the same, the request source group IG
(1), IG (0) and resource groups OG (1), O
Although the collision with G (3) did not occur, the situation in which the collision occurs is 1; the same request source R (0) to R (0) for one resource S (1) to S (7). 7) There are the same number of requests in 2); One request source R (0) to R
This is the case of (2) where the same number of requests are made for a plurality of resources S (1) to S (7) from (7). In either case, the corresponding group is not selected, and in such a case, in the first embodiment of the present invention, the control circuit CTL performs the contention arbitration control so as to randomly set the combination. , A combination is set cyclically. Collision control is performed between the request source groups IG (0) to IG (3) or the resource groups OG (0) to OG (3),
A configuration for performing control such as selecting one of the combinations may also be employed. Groups that are not further selected at this stage will be sent to the next time.

According to such a procedure, the request sources R (0) to R (7) having a variation in the number of access requests can be optimally combined with the corresponding resources S (1) to S (7) with priority. As a result, traffic throughput is improved.

Further, in the first embodiment of the present invention, as a control for determining a group in the descending order of the number of requests, the search is performed in the descending order of the number of requests until all the combinations are determined. Prioritize only the most. It is conceivable to give priority to the number up to the k-th one. In this case, a combination is set at random for a non-determined combination. Set combinations cyclically. Request source group IG (0) to IG (3) or resource group O
It is also possible to adopt a configuration in which collision control is performed between G (0) to OG (3), and any one of the combinations is selected.

Next, a second embodiment of the present invention will be described with reference to FIG. FIG. 3 is a diagram for explaining the operation of the second embodiment of the present invention. The second embodiment of the present invention has a configuration in which an auxiliary table TABLH is provided in the reference table TABL of the first embodiment of the present invention. The auxiliary table TABLH holds the total number of access requests for each of the request source groups IG (0) to IG (3). The control circuit CTL includes a reference table TAB
The combination of the request source groups IG (0) to IG (3) and the resource groups OG (0) to OG (3) is selected with reference to L and the auxiliary table TABLH, and the result is referred to as the request source group IG. (0) to IG (3) and switch groups SW (0) to SW (3).

Request source group IG (0) to IG
A procedure for selecting a combination of (3) and resource groups OG (0) to OG (3) will be described. Request source group IG
(0) to IG (3) and resource groups OG (0) to O
Combinations with G (3) need to correspond one-to-one. In FIG. 3, the item LS of the reference table TABL
The number “10” of T (0,3) indicates that the request source group O among the request sources R (0) or R (1) of the request source group IG (0) at the present time.
It indicates the number of access requests for the resource S (6) or S (7) of G (3). Also, the auxiliary item LST
H (0) to LSTH (3) are items LST (0,0) to
LST (3,0) + LST (0,1) to LST (3,3)
1) + LST (0,2) to LST (3,2) + LST
Since (0,3) to LST (3,3), the auxiliary item L
STH (0) becomes “20”. That is, items LST (0,0) to LST (3,3) of the reference table TABL
And auxiliary items LSTH (0) to of the auxiliary table TABLH
By referring to the LSTH (3) in combination, the generation distribution of access requests for each of the request source groups IG (0) to IG (3) can be grasped. To explain this procedure further, all the auxiliary items LS in the auxiliary table TABLH
With reference to TH (0) to LSTH (3), the selection priority is given in descending order of the number of access requests. Here, the auxiliary item LSTH (3) with the number of access requests “30” is first, the auxiliary item LSTH (2) with the number of access requests “27” is second, and the auxiliary item LSTH (20) with the number of access requests “20”. 0)
And LSTH (1) have the third priority. In the reference table TABL, the items LST (3,0), LST from the fourth line having the highest priority
When the item having the largest number of access requests is selected from (3, 1), LST (3, 2), and LST (3, 3), “10” of the item LST (3, 2) is the largest here. So select this. This is because, in the request source group IG (3) having the largest number of access requests, the resource group OG (2) having the highest concentration of access requests is selected.
It means that they were combined. Items LST (2,0), LST (2,1), LST (2,
2) Select the LST (2, 3) with the largest number of access requests. Here, the item LST (2, 2)
Although the request of “15” is the largest, it is rejected because the resource group OG (2) has already been selected. Next, the number of access requests is large in item LST (2, 1).
Since this is "8", this is selected. This is because, in the request source group IG (2) having the second largest number of access requests, the result of the request source group IG (2) having the second highest concentration of access requests is taken into account. Then, it means that the resource group OG (1) in which access requests are concentrated secondly is selected and combined. Similarly to the above, the next highest priority is the first and second columns, and cannot be selected only by the auxiliary table TABLH. Here, while excluding the combination selected by and, the number of access requests is “10” and the item LST (0,3) having the largest number of access requests
Take steps to select. This is because, in the request source group IG (0) having the third largest number of access requests, the resource group OG (3) in which the access requests are concentrated first is selected in consideration of the results and the combination. Since the remaining combinations are only the request source group IG (1) and the resource group OG (0), this combination is set unconditionally.

Here, the request generation sources R (0) to R (7)
Priority of the number of waiting requests in the resource S (1)
With the two-stage control of determining the combination according to the number of requests to S (7), there is an advantage that the bias of request generation in the request generation sources R (0) to R (7) can be eliminated. Alternatively, a configuration may be adopted in which combinations are first set preferentially from the maximum number of reference tables TABL, and data in the auxiliary table TABLH is referred to when the values of the reference tables TABL become equal.

Also, in the above, since the total number of access requests or the number of request source groups IG (0) to IG (3) and the number of requests between the resource groups OG (0) to OG (3) are different, priority is simply given. Although the order was determined, the situation in which a collision occurs is 1; one resource S (1) to S
For (7), the same request source R (0) to R (7)
There are the same number of requests in 2; one request source R
From (0) to R (7), a plurality of resources S (1) to S
This is the case of (7) with the same number of requests. Therefore, when the number of access requests is the same, in the second embodiment of the present invention, the control circuit CTL performs contention arbitration control so as to randomly set a combination. Set. It is also possible to adopt a configuration in which collision control is performed by the request source groups IG (0) to IG (3) on each access request side, and control is performed such that one of the combinations is selected. Further, even when the selected request source groups IG (0) to IG (3) have the same maximum request number, the combination can be selected by such a method.

Next, a third embodiment of the present invention will be described with reference to FIG. FIG. 4 is a diagram for explaining the operation of the third embodiment of the present invention. In the third embodiment of the present invention, while the auxiliary table TABLH of the second embodiment of the present invention is provided in units of rows,
This is a configuration in which the auxiliary table TABLV is provided for each column.
The auxiliary table TABLV stores the resource group OG.
It holds the total number of access requests for each of (0) to OG (3). The control circuit CTL includes a reference table TAB
The combination of the request source groups IG (0) to IG (3) and the resource groups OG (0) to OG (3) is selected while referring to the L and the auxiliary table TABLV, and the result is referred to as the request source group IG (0) to IG (3) and switch groups SW (0) to SW (3).

Request source groups IG (0) to IG
A procedure for selecting a combination of (3) and resource groups OG (0) to OG (3) will be described. Request source group IG
(0) to IG (3) and resource groups OG (0) to O
Combinations with G (3) need to correspond one-to-one. In FIG. 4, the item LS of the reference table TABL
The number “10” of T (0,3) indicates that the request source group O among the request sources R (0) or R (1) of the request source group IG (0) at the present time.
It indicates the number of access requests for the resource S (6) or S (7) of G (3). Also, the auxiliary item LST
V (0) to LSTV (3) are items LST (0,0) to
LST (0,3) + LST (1,0) to LST (1,
3) + LST (2,0) to LST (2,3) + LST
Since (3, 0) to LST (3, 3), the auxiliary item L
STV (0) becomes “16”. That is, items LST (0,0) to LST (3,3) of the reference table TABL
And auxiliary items LSTV (0) to of auxiliary table TABLV
By referring to the LSTV (3) in a combined manner, the generation distribution of access requests for each of the request source groups IG (0) to IG (3) can be grasped. To explain this procedure further, all the auxiliary items LS in the auxiliary table TALVV
With reference to TV (0) to LSTV (3), selection priority is given in descending order of the number of access requests. Here, the auxiliary items LSTV (2) and LST
V (1) has the first priority, and the auxiliary items LSTV (3) and LSTV (0) having the number of access requests "16" have the second priority. In the reference table TABL, the first priority has become higher. From the second column, items LST (0, 1), LST
(1,1), LST (2,1), LST (3,1),
LST (0, 2), LST (1, 2), LST in the third column
If (2, 2) and LST (3, 2) are selected with the largest number of access requests, here, item LST
Since (15) of (2, 2) is the largest, this is selected. This means that the request source group IG (2) having the largest number of access requests is selected and combined in the resource group OG (3) having the largest number of access requests. The items LST (0,
1), LST (1,1), LST (2,1), LST
(3, 1) is selected as the group with the next highest priority, and the group with the largest number of access requests is selected from these. Here, the request of item “11” of the item LST (1, 1) is the largest, and does not include the element of the combination selected in. If the combination includes the combination, the next combination with the largest number of access requests is selected. Next, the resource group OG (1) having the largest number of access requests is selected, and the request source group IG (1) having the largest access request is selected and combined in consideration of the result of the resource group OG (1). In, the combination selected by and in the first column auxiliary item LSTV (0) and the fourth column auxiliary item LSTV (3) which obtained the second priority in the auxiliary table TABLV was excluded. Among them, the item LST (0, 3) having the number of requests “10” has the largest number of requests, so the item LST (0, 3) is selected. This means that in the resource group OG (3) having the third largest number of access requests, the request source group IG (0) having the first largest access request is selected and combined in consideration of the results of the above. means. Since the remaining combinations are only the request source group IG (3) and the resource group OG (0), this combination is set unconditionally.

Here, the resource S for accepting the request
The two-step control of giving priority to the number of waiting requests for (1) to S (7) first and determining the combination in accordance with the number of requests from the request sources R (0) to R (7) provides There is an advantage that it is possible to eliminate a bias in generation of requests to S (1) to S (7). In addition, first, the reference table TABL
Are set with priority from the maximum number of reference tables, and when the values of the reference table TABL become equal, the auxiliary table T
A configuration in which the data of the ABLV is referred to can also be adopted.

Further, in the above, the total number of access requests or the number of requests between the request source groups IG (0) to IG (3) and the resource groups OG (0) to OG (3) are different, so that priority is simply given. Although the order was determined, the situation in which a collision occurs is 1; one resource S (1) to S
For (7), the same request source R (0) to R (7)
There are the same number of requests in 2; one request source R
From (0) to R (7), a plurality of resources S (1) to S
This is the case of (7) with the same number of requests. Therefore, when the number of access requests is the same, in the third embodiment of the present invention, the control circuit CTL performs the contention arbitration control so as to randomly set the combination. In addition, the control circuit CTL sets the combination cyclically. . It is also possible to adopt a configuration in which collision control is performed by the request source groups IG (0) to IG (3) on each access request side, and control is performed such that one of the combinations is selected. Further, even when the selected resource groups OG (0) to IG (3) have the same maximum request number, the combination can be selected by such a method.

In the third embodiment of the present invention, the resource S (1)
S (7) to reduce the variation in the total number of accessed requests, and request source R (0) having the highest number of accessed requests among corresponding resources S (1) to S (7) preferentially.
Since the optimum combination with R (7) can be obtained, the traffic throughput is improved.

In the first to third embodiments of the present invention, the number of request sources R (0) to R (7) is 8, the resources S (1) to S (S).
(8), (8), (4) the number of divided request sources, (2) the number of divided request sources, and (4) the number of divided resources, the number of divided resources is 2. However, these numbers are not limited and are set independently. it can. For example, the number of divisions of the request sources R (0) to R (7) and the resources S (1) to S (7) need not be equal, and the size of each switch group SW (i) may be arbitrary.

[0036]

As described above, according to the present invention, the number of contention arbitrations to be executed can be reduced by changing the logic of contention arbitration and apparently reducing the number of access request sources or the number of resources. . According to the present invention, the contention arbitration time for access request arbitration can be shortened, and the contention arbitration can be performed by a low-speed and low-power-consumption element.
In addition, by performing competitive arbitration considering priority,
Traffic throughput is improved.

[Brief description of the drawings]

FIG. 1 is a configuration diagram of a first embodiment of the present invention.

FIG. 2 is a diagram for explaining the operation of the first embodiment of the present invention.

FIG. 3 is a diagram for explaining the operation of the second embodiment of the present invention.

FIG. 4 is a diagram for explaining the operation of the third embodiment of the present invention.

FIG. 5 is a configuration diagram of a conventional example.

[Explanation of symbols]

3 Matrix switch 5 Arbitration unit 6 Matrix switch disconnection unit C Intersection CTL control circuit IG (0) to IG (3) Request source group OG (0) to OG (3) Resource group OL (1) to OL (7) , IL (0) to IL (7) Data line R (0) to R (7) Request source RA (1) to RA (8) Ring arbiter S (1) to S (7) Resource SW (0) to SW (3) Switch group TABL Reference table TABLH, TABLV auxiliary table

────────────────────────────────────────────────── ─── Continuation of the front page (56) References JP-A-6-205019 (JP, A) JP-A-6-90232 (JP, A) 1992 Autumn Meeting of the Institute of Electronics, Information and Communication Engineers B-357 (58) Field (Int.Cl. ⁷ , DB name) H04L 12/28 G06F 13/37 H04L 12/56 H04Q 3/54 H04Q 11/04

Claims (3)

(57) [Claims] 1. N (N is an integer of 2 or more) request sources that generate access requests, M (M is an integer of 2 or more) resources shared by the request sources of the access, Matrix switch means having an N × M capacity in which the N request sources are connected to an input terminal and the M resources are connected to an output terminal; and the access request source for one of the resources. Arbitration means for executing arbitration when an access request is issued from a plurality of the control means, and a control circuit including disconnection means for controlling disconnection of an intersection of the matrix switch means based on the arbitration result. In the arbitration method, the arbitration means of the control circuit includes: means for dividing the access request source into a plurality of groups smaller than the number (N); and dividing the resources by the number (M). Means for dividing the intersection into a plurality of small groups; means for dividing the intersection into a group of intersections connecting each combination of the resource group and the request source group divided by the division means; Table means for respectively storing the number of access requests from the plurality of request source groups for the plurality of resource groups; and referring to the table means, the request source groups having the larger number of the access requests are arranged in order from the request source group. Means for generating a combination of the group of request sources and the group of resources; means for notifying the generated combination result to the group of intersections and the group of request sources; and Means for prohibiting the generation of the access request for a group of request sources without notification Means for executing the arbitration within the group of intersections for an access request corresponding to the notified combination. 2. The table means includes auxiliary table means for summing the number of access requests from the plurality of request source groups to the plurality of resource groups for each of the request source groups and storing the sum. Claim 1
The access arbitration method described. 3. The table means includes auxiliary table means for summing the number of access requests for the plurality of resource groups from the plurality of request source groups for each of the resource groups and storing the total number of access requests. 1. The access arbitration method according to 1.