SU750503A1 - Computing device for solving problems of planning - Google Patents

Description

(54) COMPUTATIONAL DEVICE FOR SOLVING THE PROBLEM OF NETWORK PLANNING

I

The invention relates to the field of computer technology and can be used for solving network planning tasks.

A computing device is known, consisting of a clock generator connected to a control unit connected to an input / output unit and a block of models of branches, each of which contains a time interval generator, the first two inputs of which are connected to the trigger input of the block of branch models and the output of the first clock pulses of the control unit, respectively, and the output of the time interval formers is connected to the input of the prohibition of the first clock pulses of the control unit, the automatic generation unit the logic containing the pulse distributor, the node function setting circuit and the multi-input element OR, whose output is connected to the trigger input of the branch model block, the inputs of the multi-input element OR are connected to the output of the node function setting circuit, the first input of which is connected to the interrupt output of the branch model block, the second input node function assignment schemes

connected to the corresponding output of the pulse distributor, a separate output and input of which are connected respectively to the inhibit input and the output of the second clock pulses of the control unit, and each branch model of the branch model block contains additionally address setting devices of the starting and ending network nodes, elements AND, trigger, single and zero the installation inputs of which are connected respectively to the reset output of the control unit and the prohibition input of the first clock pulses of the control unit, the first input of the first element I, the second input of which is connected to the output of the second clock pulses of the control unit and the setting input of the initial node, the output of which is connected to the first input of the second element AND, the other two inputs of which are connected respectively to the trigger input of the block of branch models and the single output of the trigger, the third

20 to the input of the time interval generator of the branch model, and the output of the first element I is connected to the input of the address of the end node, the output of which is connected to the fourth input of the time generator iiiiii npge) branches of the branch model and through the third element I, the other input of which is connected to the third clock output pulses of the control unit connected to the interrupt output of the branch model block, in addition, the node function setting circuit consists of a counter and two AND elements, the first inputs of which are connected to the second input of the function setting circuit node, and the second input of the first element I - with the first input of the node setting the function of the node, the output of which is connected by the output of the second element I, the second input of which is connected through the counter to the output of the first element I, and the driver of time intervals of the branch model contains a trigger, meters, elements And the indicator connected to the first input with a single trigger input and the third input of the imager, the second input with a single trigger output and the first input of the first And element, and the third input with the output of the second And element, cat inputs The first is connected respectively to the first and fourth inputs of the former, the second input of the first element I is connected to the second input of the former, and the output of the first element I is connected to the inputs of the counters, the output of the first of which is connected to the output of the former, and the output of the second of the counters to the zero input trigger 1 - 4.

The specified computing device allows to determine the longest way for the online schedule and work belonging to the longest way.

However, it does not allow to determine the scope of work for the current time and to find the total consumed resource at a given time. The current work front is a set of jobs that can be performed simultaneously on the network schedule. The resource consumed at a given time is understood as the sum of the resource values of those activities that belong to a given front.

The purpose of the invention is to expand the functionality of the device, namely, providing an additional opportunity to determine the scope of work at the current time and find the total consumed resource at a given time.

This goal is achieved by the fact that the computing device for solving network planning tasks contains an input / output unit whose input and output are connected respectively to the first output and input of the control unit, the second input of which is connected to the output of the pulse generator, first the input and output of which are connected, respectively, correctly to the second output and the third input of the control unit, the second input and output of the automatic topology formation unit of the connection COO, respectively, with the first The second and third, fourth, fifth, and sixth inputs of each branch module are connected to the third, fourth, fifth, sixth and seventh outputs of the control unit, the fourth input of which is connected to the second output of the branch model block, and a counter is entered. a resource calculating unit, the first inputs of which are connected to the seventh output of the control unit, the fifth and eighth outputs of which

respectively, they are connected by the second inputs of the counter and the resource calculating unit, the output of which is connected to the fifth input of the control unit, the information inputs of the resource subtracting unit are connected to the output group of the branch model block, and the resource calculating unit contains a chain of sequentially connected control valves and a cell resource constraints, each of which consists of two counters, a trigger and an AND element, the first inputs of all the AND elements are connected and are the first input of the calculation block and resources, the second input of which is defining the input of the first controlled distributor, first inputs of controlled valves

 are the information inputs of the resource calculation block, the second input of each element AND is connected to the trigger output of the corresponding value-resource constraint cell, the output of each element

g And connected to the inputs of the first and second counters of its own cell, the output of the first of which is connected to the first input of the trigger of its cell, the output of the second counter of each cell of the cost-resource constraints is connected to the second input of one 5 and the variable controlled distributor, the output of each controlled distributor connected to the second input of the trigger of the same name of the value-reuse restrictions, the output of the last controllable distributor is the output of the resource calculation unit.

The drawing shows a block diagram of the proposed computing device.

The computing device consists of an I / O unit 1, a control unit 2,

S block 3 models of branches, 4 pulse generator, block 5 of automatic topology generation, block 6 of resource calculation and counter in the form of a registrar 7 of resources.

Each model 8 branches of the block 3 models of branches contains the shaper 9 time intervals, the trigger 10, the address setting devices of the initial 11 and the final 12 nodes, elements 13, 14 and 15 And they are intended to simulate the work of the network

5 Time interval imager 9 is designed to simulate a predetermined time interval and, additionally, to obtain a signal belonging to the model 8 branch to a predetermined front. The automatic topology unit 5, connected to the branch model block 3, provides for the interaction of the models of 8 branches of the network schedule according to the time principle based on the addresses of the initial and final events listed in the initial 11 and final 12 nodes of the model 8 branch. The resource block 6 consists of the same type of cells 16 of the controlled distributor and the cells 17 of the cost-resource constraints and is intended for the sequential formation of the time intervals of the resource consumed for work that lies on the front at a given point in time. Single-type cells of a controlled distributor, the number of which is equal to the number of models of network network branches, are intended for organizing a sequence of polling individual cells of 17 resource-resource constraints. Each cell 16 of the managed distributor includes triggers 18 and 19, elements 20, 21, 22, and 23 I. Each individual cell of 17 cost-resource constraints, the number of which is equal to the number of branch models, is intended to set the cost-resource constraints imposed on The work is a shaper of a time interval containing counters 24 and 25 pulses, trigger 26, element 27 I. The values of the cost of performing each work or the intensity of consumption of a uniform resource are depicted as proportional the number of pulses and 24 counters of 17 value constraints are entered into counters. In the case when the counters 24 contain values corresponding to the intensity of consumption of one of the types of resources, and in the network schedule model, the signal for determining the resolution of the current resource is in effect, the resource recorder 7 selectively summarizes the resources at a given point in time and when the network model works graphics the law of change of the total resource from time unambiguously corresponds to the graph of the intensity of resource consumption. The registrar 7 of the resource can be performed in various ways. In the simplest case, it is a pulse counter of sufficient capacitance, in which, when determining each current resource at a particular time, the GI1 pulses come from control unit 2 through plus 28, starting from the moment the signal from block 2 appears at the pole of the first cell-16 controlled distributor resource block 6 and until the signal appears in control block 2 from pole 30 of the last cell 16.1. distributor The control unit 2 is designed to organize the interconnected operation of the device units and to generate the first and second series of clock pulses (ГИ1 and ГИ2) from poles 28 and 31, respectively, to the inputs of the branch model 3 block, automatic topology generating unit 5 and resource block 6. The computing device works as follows. Initially, input data is input from I / O unit 1. At the same time, the number of pulses proportional to the duration of the simulated work is recorded in the time interval generator 9, the number of pulses proportional to the node number from which the work goes out is set to the address node master 11, the number of pulses proportional to the node number is proportional to the node number 12 which includes this work, the number of impulses proportional to the intensity of consumption of one of the types of resources is recorded in the counter 24 cells 17 of the cost-limiting resource. All device triggers are set to zero. In order to run all branch models emanating from the initial node, the control device permits the passage of GI2 pulses (pole 31) to the inputs of all setters 11 addresses of the initial nodes of all 8 branch models and to block 5 of automatic topology generation. At the same time, at the time of the overflow of the setters AND addresses of the initial nodes, one of which records the address of the initial node, from block 5 of the automatic formation of the topology (pole 35), a signal is received that all the work included in the event from which the given branch is completed. Passing the element 13 AND, the overflow signal from the setting device 11 includes, via the pole 32, the driver 9 of the time interval. The output signal of the automatic topology generation unit 5 prohibits the arrival (pole 31) of the pulses of the second series and prevents the passage of the pulses of the first series (pole 28) to the input of time interval drivers. The included shapers of 9 time intervals begin to count the arrival of GI1 pulses. After a time proportional to the duration of the work at the output of the imaging unit 9, an overflow signal appears that goes to pole 33. The signal from pole 33 prohibits a series of GI1 pulses and resolves the GI2 series, which goes to the setting devices 11 addresses of the initial nodes of all models 8 branches and adjusters of 12 addresses of end nodes only of branch models for which a time interval is formed. By counting the number of pulses equal to the number of the event, which includes this model of the 8th branch, the setting unit 12 generates an overflow signal, which through element 15 enters

The automatic topology generation unit 5 is recorded there as the end node number of the selected model 8 of the branch. The signal from the output of block 5 of automatic formation of the topology again blocked the issuance of impulses of the second series and allowed the flow of the first series to block 3 models of branches. In doing so, new branch models are included in the solution, and the process described above is repeated until the last event is completed. Thus, the time delay, counted by the pulses of the first series from the moment the decision began to its end, is proportional to the length of the longest path.

In each model, 8 branches in the process of solving there are signals on the beginning and end of its implementation, which allows to determine the branch through pole 34 at one of the inputs of element 20 when determining the scope of work and determining the cost-resource limitations. And the corresponding logic distributor cell 16 has the following logical signals:

the sign of the affiliation of the work in question to the work front at the current time;

The sign of the affiliation of the work in question to a multitude of outstanding work

A controlled distributor consisting of IGi cells of the same type, the number of which is equal to the number of models 8 network network branches, is designed to organize a sequence of polling individual cells 17 of the cost-resource constraints when determining the total resource of only branch models that contain the specified attribute that passes without time-consuming branch models that do not have this feature.

It happens as follows. Pre-triggers 18 and 19 are set to zero. When the signal of the presence of signs from the imager 9 of the time interval of the model 8 branch, through the pole 34, the inputs of the elements 20 and the corresponding cells 16 are given permitting signals, which, having passed them, set the triggers 18 in one state such that at their zero outputs connected to the inputs of the elements 21 AND, the forbidden potentials appear, and on the single outputs connected to the inputs of the e.peats 22 AND, the resolving potentials. In this case, the control unit 2 generates a signal arriving at the pole 29 of the first cell 16- (controllable distributor. This signal, passed through element 22I, sets the trigger 29 of the resource restriction cell 17 and the trigger IGi 19 of the controllable distributor in a single state ( if the trigger 18 of this cell is in a single state), then caMiiiM removes the resolving potential C) of the input of chlomeite 20 I and supplying the section ii; ii (;; iiiH .u .ua, i to e, segment 23 I.

To determine the current resource, the control unit 2 prohibits the arrival of pulses of the second series, which stops the formation of the topology and allows the arrival of the impulse GI1 to the resource recorder 7 and to the cells 17 of the cost-resource restrictions. A single pulse of control unit 2 from pole 36 enters the shapers of 9 time intervals of models of 3 branches, if the branch belongs to the front, then it appears at the output of the 34L pole through element 20 I and sets the trigger 18 of the corresponding distributor cell 61 to the single state. The signal received from control unit 2 from pole 29 permits the sequential formation of time slots I7L of cost-resource constraints.

Thus, the counter 24 of the cell 17i, which is connected to the cell 161, counts the value of the intensity of the consumption of the resource.

After the appearance at the output of the counter 24, the overflow pulse through the element 23 and sets the trigger 19 to the zero state, allowing the signal from the input of the cell 16 to its output through the element 21 I.

Signal from the pole 29 of the first cell 16i

controlled distributor is transmitted

from cell to cell, passes those cells,

to the input elements 20 And which were not

0 enabled resolution pulses from 8 branch models. This, in turn, corresponds to the transfer to the resource recorder 7 of the total 17i value and resource constraints of those branch models that belong to the front of the work performed.

When a signal appears at the output of the controlled distributor (the pole of the EO element 21 and the distributor cells 16fu), which corresponds to the survey of all branch models belonging to the front, the control unit 2 stops the flow of pulses to the resource recorder 7 and to the 7i value-resource constraints cells. As a result, the resource recorder 7 contains a number of pulses proportional to the total intensity of resource consumption at a given point in time.

This intensity is maintained until any work is completed. Therefore, when determining the resource consumption schedule, after changing the state of any branch model (either completed or just started), the process of determining the total intensity of the consumed resource in the device repeats in the same way as described above.

Claims (4)

From block 2 of the control to all the blocks of the machine, the stop is provided with the necessary signals: 1 of the controllers and the HJKM control unit. KOTDPI-IC drawing e 1C); azap1:;. The proposed device, discrete in principle of operation, allows, in addition to temporary network planning and control tasks, to solve the problem of determining the scope of work for the current time and the problem of determining the total resource consumption at a given point in time. In addition, it also makes it possible to easily automate the process of collecting this information and transmitting it to a digital computer, since the work of a specialized device is possible in conjunction with a digital machine. Claim 1. Computing device for solving network scheduling tasks comprising an input / output unit, the input and output of which are connected respectively to the first output and input of the control unit, the second input of which is connected to the output of the pulse generator, the automatic topology generation unit, the first input and output which are connected respectively to the second output and the third input of the control unit, the second input and output of the automatic topology generation unit are connected respectively to the first output and in The branch model block stroke, the second, third, fourth, fifth and sixth inputs of which are connected to the third, fourth, fifth, sixth and seventh outputs of the control unit, the fourth input of which is connected to the second output of the branch model block, characterized in that in order to extend the functionality by determining the total resource consumption at a given time, a counter and a resource calculation block are entered into it, the first inputs of which are connected to the seventh output of the control unit, the fifth and eighth th outputs of which are connected respectively to the second inputs of the counter and resources calculating unit, the output of which is connected to said fifth input of the control unit, data inputs of unit resources calculating unit connected to the group output branches models. 2. The device according to claim 1, wherein the resource calculating unit comprises a chain of sequentially connected controlled valves and a value-resource constraint cell, each of which consists of two counters, a trigger and an And element, the first inputs of all And elements are connected and are the first input of the resource calculator, the second input of which is the driver input of the first control valve, the first inputs of the controlled valve are the information inputs of the resource calculation block, The input of each element I is connected to the output of the trigger of the corresponding cell of the cost-resource constraints, the output of each element I is connected to the inputs of the first and second counters of its cell, the output of the first of which is connected to the first input of the trigger of its cell, the output of the second counter of each cell of the value-resource the restriction of the connection to the second input of the same controlled distributor, the output of each controlled distributor is connected to the second input of the trigger of the same name value-resource cell boundedness, output of the last control e.mogo distributor is output .bloka computation resources. Sources of information taken into account in the examination 1. USSR author's certificate for application No. 2579790 / 18-24, cl. G 06 F 7/38, 1978. 2. USSR author's certificate for application No. 2581765 / 18-24, cl. G 06 F 7/06, 1978. 3. USSR author's certificate for application No. 2383712 / 18-24, cl. G 06 F 15/20, 1976. 4. USSR author's certificate number 473455, cl. G 06 G 7/122, 1975 (prototype).