SU1416999A1 - Multichannel arrangement for priority handling of requests - Google Patents

Abstract

Inventive is related to computing and can be used in multiprocessor systems to control the access of processors to a group of data channels. The aim of the invention is to expand the field of application of the device due to the possibility of distributing free resources among the subscribers making requests. The device contains rpjmny elements of AND-NOT 1 and cipher torus 2. The device allows a parallel algorithm to be implemented with the access of multiple subscribers to multiple resources. 1 il. .

Description

(L

but

CD

with so

The invention relates to computing technology, namely, devices for controlling the access of a subscriber group (e.g., multiprocessor processors) to a set of shared resources (e.g., a parallel data channel group), and can be used by Io in high-speed multiprocessor computers and information -computational systems.

The purpose of the invention is to expand the field of application of the device by distributing free resources among subscribers by making requests.

The drawing shows a block diagram of the device.

The device contains the elements AND-NOT 1, encoders 2, the request inputs 3 devices, the signal inputs 4 devices and outputs 5 devices.

On: Inputs 4 are given signals of logical units if the corresponding resources are free, or logical zeros, if they are occupied.

At the device outputs 5, the binary code of the corresponding resource number is generated. Submitted to priority request.

The device works as follows.

Let in the initial state on all inputs 3 and 4 be zero signals (no service requests and no free resources). In this state, all the elements of the NAND device J are closed and the single signals from their outputs go to the inputs of the encoder 2. The encoders 2 are filled in such a way that if there are single signals on all their inputs, 5 codes are generated at the outputs of the device 5.

If in the absence of requests for inputs 3, inputs 4 receive single signals indicating the availability of free resources, then all AND-NE 1 elements remain closed, and zero outputs remain at outputs 5

Suppose that in the presence of logical units on some inputs 4, i.e. in the presence of free resources, some request inputs 3 are sent to individual request signals. Then, those AND-1 elements that are connected to inputs 4, on which there are single signals of free resources, and to inputs 3, on which

five

0

five

0

five

0

five

0

There are query signals. Among the opened elements AND-NOT 1, in the open state, there remains an element that is associated with an input having a request signal with a minimum number, and with an input 4 having a signal of a free resource with a minimum number. At the output of this element there is a logical zero signal, which closes all the other elements AND-NOT 1 of its channel and the same-named elements AND-NOT 1 channels with large numbers.

As a result, at the corresponding input of the decoder 2 of this channel there is a zero signal. On the remaining inputs of this encoder - logical units. In this case, a binary code of the resource number represented by the priority request is generated at the corresponding device outputs 5.

Let unserved requests remain at inputs 3, and signals of free resources at inputs 4. Then, from the remaining unhandled requests, the device makes the following request. According to the priority of the request, and similarly to the described one, it represents a free resource with the next number in the order of increasing.

Similarly, there is a seizure of free resources by other subscribers.

After the completion of the described resource allocation procedure, the subscribers who received the resources withdraw their requests from the corresponding inputs 3 and at the same time set the zero inputs of the captured resources at the corresponding inputs 4.

When a resource is released, the subscriber who owned it exposes a single signal to the corresponding device input 4, and therefore the released resource can be captured by the subscriber who requested the service and has the highest priority.

Claims (1)

Claims. A multichannel device for priority service of requests, containing in each channel a group of NAND elements, characterized in that, in order to expand the field of application of the device by distributing free resources among subscribers who have made requests, it contains in each channel an encoder, a group of encoder inputs for each channel connected to the outputs of the elements of the IS-group of the channel, each request input device is connected to the first inputs of the elements of the IS-group of the channel of the same name, each signal input of the device connected to the second inputs of the elements of the same name and NOT the groups of all channels, the output of each element of the IS-group of the group is connected to the corresponding inputs of the same-named elements of the IS-NOT group of the following channels and with the corresponding inputs of the following elements of the IS-NOT group of its channel, the output group of the encoder of each channel is the corresponding group of device outputs.