Method of servicing requests of users of the computing system and the device for its realization (options)

 

(57) Abstract:

The invention relates to the field of computer engineering and can be used in data exchange systems. The technical result is the increased likelihood of low-priority service requests. The method consists of generating codes a maximum wait time of requests, their learning, the formation of the signals of the service requests, the organization of incoming requests queue of the second order in accordance with priorities subscribers, upon reaching the requests in the queue of the second order maximum wait time (tmi), transfer them to the queue of the first order in the sequence of the expiration of the maximum waiting time tmithe decision requests from the queue 1-th order, and in the absence of requests from the queue of the 2nd order. Each device contains N identical subscriber units, a generator of clock pulses, the divider element OR NOT, the counter element And the inverter and a multiplexer. 3 S. and 2 C.p. f-crystals, 6 ill.

The proposed technical solutions combined to form a single inventive concept relate to the field of computer engineering and can be applied in systems is on Auto. St. USSR N 1441398 "Multi-device dynamic priority" IPC G 06 F 9/46, published 30.11.88, bull. N 44, where the higher priority request is linearly at intervals of time; and Ed. St. USSR N 1562912 "Multichannel device with dynamic change priority" IPC G 06 F 9/46, published 07.05.90., Bull. N 17, where the priority boost query occurs after each service of the application on other priority areas.

However, the known methods analogs do not take into account the valid time of the request in the queue, resulting in a high probability of loss of low-priority requests as a result of their untimely service.

Interpretation of terms used in the application:

The request is to send the signal that triggers the response. Input message containing a request to the system for allocation of resources.

The priority number, the prescribed task, process, or operation that determines the order of their execution or maintenance. The smaller the number, the higher the priority level.

Service - a set of system actions while preparing a query for execution: the reading and interpretation, queues allocated is of service requests - see, e.g., Auth. St. USSR N 1441398 "Multi-device dynamic priority", IPC G 06 F 9/46, published 30.11.88., Bull. N 44; Ed. St. USSR N 1522206 "dynamic Device priority", G 06 F 9/46, published 15.11.89, bull. N 42.

Known analogues are increasing priority and units of analysis priorities. The General lack of analogues is a low probability of timely service requests of lower priority.

The closest to the technical nature of the claimed method of service requests is the method implemented in the device for service requests, see Ed. St. USSR N 1347080, IPC G 06 F 9/46 declared 04.11.85 published 23.10.87, bull. N 39.

Prototype method consists in generating codes maximum time tmi(where i=1,2,3,...,N the corresponding priority number of the i-th subscriber, and N is the total number of subscribers of the system and the total number of priorities), their memorization. The formation of the signals of the service requests, the organization of incoming requests queue of the second order in accordance with priorities subscribers. Upon reaching the requests in the queue of the second order maximum wait time (tmi) moving to the attachment request queue 1-th order, and if no requests from the queue of the 2nd order.

Prototype method takes into account the maximum time spent by the requests in the queue of the second order and provides a high probability of timely maintenance. However, the prototype method has a drawback: low probability of timely servicing high-priority requests.

This is because the requests in the queue of the first order are placed in sequence to the expiration of the maximum time-out.

Known the closest analogue (prototype) for their technical nature of the claimed device is "a Device for servicing requests" Ed.St. USSR N 1347080, IPC G 06 F 9/46 declared 04.11.85 published 23.10.87, bull. N 39.

The device prototype contains N subscriber units (channels), where N2, trigger, counter, clock generator pulses, the frequency divider, the first, second and third elements, the first, second and third elements OR block of registers, the priority encoder, the first, second and third decoders. This single trigger output is connected to the first input of the first element And whose output is connected to synchronou the first decoder and the accounts I connected to the input of the Scan corresponding to N subscriber units, query input devices are connected to the inputs of the second element, OR whose output is signal output device. The first outputs of all subscriber units connected to the corresponding inputs of the priority encoder, the outputs of which are connected to information inputs of the block of registers and information inputs of the second decoder, each output of which is connected to the second input of each subscriber unit. The output of frequency divider connected to the first input of the second element And the clock inputs of the second decoder and the register unit, the group of outputs of which are connected to the inputs of the third decoder, each output of which is connected to the fourth input of the respective subscriber units. The second outputs of subscriber units connected to the inputs of the third element OR the output of which is connected with the control input of the register unit, the signal output of which is connected to the second input of the second and to the inverted input of the third elements, And respectively. The output of the second element And is connected to the third inputs of the respective subscriber units, polling the input devices are connected to the third input of the second element And to a direct input of the third element And whose output is connected to the input of the El frequency, the output of which is connected to the clock inputs of all of the subscriber units. The signal outputs of the N subscriber units connected to N inputs of the first element OR the output of which is connected to the reset inputs of the counter and the trigger.

Each subscriber unit (channel) consists of a counter, trigger, first, second and third element, And, OR. The first input of the first element And connected to the first input of the third element And with the second input of the second element And is requested by the input of the subscriber unit. The output of the second element And connected to the counting input of the counter, the output of which is connected to a clock input of the trigger and with inverted input of the second element And. the Second input of the first element is the input of the scanning of the subscriber unit, the output of this element is connected to the second input element OR is the signal output, the subscriber unit. The second and third inputs of the third element And are the third and fourth inputs of the subscriber unit, respectively. The output of the third element And connected to the first input of the OR element and is the second output of the subscriber unit. The output element OR connected to boleosoma the meter inlet and the exit of the subscriber unit. A group of informatizatciya, inverted output of the trigger and the reset input of trigger are respectively the clock input, a first output and a second input of the subscriber unit. Query inputs, the group entered Code maximum time", the outputs of the subscriber units and the clock inputs are respectively request inputs, groups of inputs "Code maximum time", and outputs the clock inputs of the device.

This scheme allows for comparison with devices with peers to enhance the likelihood of timely service requests of lower priority.

However, the device is a prototype has drawbacks: high probability of loss applications a higher priority and a relatively low reliability because of the larger number of elements.

The aim of the invention the method of servicing requests and options of the devices it is implementing the development of technical solutions to increase the probability of timely services to low-priority requests with minimal losses for requests having a higher priority.

In the proposed method the goal is achieved by the fact that in the known method of servicing requests Vici,3,...,N - the corresponding priority number of the i-th subscriber, and N is the total number of subscribers of the system and the total number of priorities, remembering, the formation of signals of the service requests, the organization of incoming requests queue of the second order in accordance with priorities subscribers. Upon reaching the requests in the queue of the second order maximum wait time of query tmitransfer them to the queue of the first order, the solution to the first request from the queue 1-th order, and in the absence of requests from the queue of the 2nd order. The request from the queue of the second order are transferred to the queue of the first order at the position corresponding to the number of its priority, and queue the first order of priority to decide the request with the lowest priority number.

A new set of essential features allows you to achieve the technical result expense transfer requests (as they achieve the maximum wait time) from the queue of the second order to first order at the position corresponding to the number of its priority, and queue the first order of priority to decide the request with the lowest priority number.

The goal in the first embodiment Astro to service requests of users of the computing system, containing N subscriber units, where N2, a counter, a counting input connected to the output element And the second input is connected to the generator output and the input of the divider, the output of which is connected to the clock inputs of the respective N subscriber units, a request inputs and inputs Code maximum time" N subscriber units are appropriate request inputs and inputs Code maximum time" device added N-shadowy the element OR NOT, the N inputs of which are connected to the relevant control outputs subscriber units, inputs "Ban" which is connected to the output of the N-Vodolaga of the element OR NOT, multiplexer, N information input of which is connected to the signal outputs of the respective N subscriber units, and its K address input connected to the corresponding K outputs of the counter and outputs are "Code of the subscriber devices, where K=]log2N[, the output of the multiplexer is connected to the input of the inverter and is directly addressable by the output device, the output of the inverter connected to the first input element And the input of the reset of the counter is polled input device, and inputs "Zeroing" N subscriber units are relevant inputs to "zero" the device.

The goal in the second variant of the device service requests users of a computer system is achieved by the fact that in the known device service requests users of a computer system containing N subscriber units, where N2, N-shadowy element OR to the input of which is connected to the signal outputs of the respective N ebony blocks, the counter K outputs of which, where K=]log2N[, connected to the corresponding K inputs of the decoder element And whose output is connected to the counting input of the counter and its second input connected to the generator output and the input of the divider, the output of which is connected to the clock inputs of the N subscriber units, and query inputs and inputs Code maximum time subscriber units are appropriate request inputs and inputs Code maximum time" device added N-shadowy the element OR NOT, the input of which is connected to the control outputs of the respective N subscriber units, and its output - to "Ban" all subscriber units, inverter, whose input is connected to the output of the OR element and is directly addressable by the output device, and its output connected to the first input element And K outputs of the counter are K outputs the Code of the subscriber devices, and Abdoulaye input of the counter is polled input device, and inputs "Zeroing" N subscriber units are relevant inputs to "zero" the device.

In turn, the subscriber unit comprises a first element And element OR the second element And, inverter, meter, Tregubova element And. the First input p is apronym entrance subscriber unit. The output of the counter is connected to the first input Tregubova element And to the input of the inverter, the output of which is connected with the second input of the OR element and is managing access subscriber unit. The second input of the first element And an entry "Ban" subscriber unit, and the output of this element is connected to the first input member OR the output of which is connected to the first input of the second element And the second input and its output are the respective input "Scan" and the signal output of the subscriber unit, the third input Tregubova element is a clock input of the subscriber unit. Output Tregubova element And is connected to the counting input of the counter inputs "Code maximum time" and "zero" the subscriber unit are respectively the group of information inputs and the input of the reset of the counter.

Conducted by the applicant's analysis of the level of technology has allowed to establish that the analogs are characterized by the sets of characteristics is identical for all features of the claimed method and device (options) service requests of users of the computing system, no. Therefore, each of the claimed invention meets the condition of patentability "No signs, match the distinctive features of prototypes signs of each of the claimed invention have shown that they do not follow explicitly from the prior art. Of certain of applicant's prior art there have been no known impact provided the essential features of each of the claimed inventions to the achievement of the technical result. Therefore, each of the claimed invention meets the condition of patentability "Inventive step".

The stated objects of the invention are illustrated by the drawings, in which:

in Fig. 1 - structure of the computing system;

in Fig. 2 - turn of the second order;

in Fig. 3 - Queuing of the first order;

in Fig. 4 - simulation results;

in Fig. 5 - device service requests (first version);

in Fig. 6 - device service requests (the second option).

The implementation of the inventive method consists in the following. For each subscriber (or group of subscribers) are formed binary codes that specify a maximum time of their requests in the queue of the second order. The code generation is performed according to the following rule:

tmi=tadditional i-tZap.i,
UB> - allowable time request the i-th subscriber computing system, after which the request expires, or the subscriber has certain losses;

tZap.i- a certain amount of time defined cost of service.

Time tadditional ifor each request is known and determined by the normative documents. Amount of time tZap.iis determined based on the statistical evaluation of the characteristics of the given computing system.

Generated for each subscriber computing system codes maximum time filled (stored). Then the system is ready for operation and receives signals from the requests made by subscribers of a computer system (see Fig. 1). They arrive at the device service requests, where is the queue of the second order according to the initial priorities (the first subscriber has the highest priority and N-th subscriber is the lowest), see Fig. 2. As well as counting the time spent by the requests in this queue. The device service requests determines the request with the lowest priority number (that is, having a higher priority) and puts on the exit code of the subscriber, establishing what its subscriber removes from the input device query request signal. Further, the service process proceeds in the order determined by the priority of incoming requests.

When the request of any subscriber reaches a maximum wait time in queue of the second order, in the device service requests organized the first order of the requests that exceed the maximum waiting time), see Fig. 3. Moreover, requests from the queue of the second order are transferred to the queue of the first order at the position corresponding to the numbers of their priorities. The device service requests specifies the queue of the first order request with the lowest priority number and issue code of the subscriber to resolve this query. Further, the service process proceeds in the order determined by the priority of the existing requests in the queue of the first order. And in the absence of query selection is carried out from the queue of the second order.

The claimed method of service requests provides a high probability of timely services to low-priority requests by taking into account the maximum time of requests in the queue of the second order; high probability of timely service requests of higher priority (sravnenie order in the queue of the first order.

The validity of theoretical assumptions were tested using a simulation model of a computer system with a uniform and exponential distribution laws of receipt of service requests. The test results are given in tabular form in Fig. 4 where:

Ave. number of priority requests (for simplicity taken three priority);

tcf.(C) - the average time required for the solution of a computer;

P(ttsupplementary) is the probability of timely maintenance requests.

From the presented data it follows that the probability of timely servicing high-priority requests is increased to 9% (depending on the distribution of requests) with constant probability of timely servicing requests a low priority, which indicates the possibility of achieving this technical result.

The first version of the device service requests of users of the computing system shown in Fig. 5, consists of the same N subscriber units 11-1N, clock 2 divider 3, the element OR NOT 4, count 5, item And 6, the inverter 7 and the multiplexer 8.

The generator output clock them all 12 N subscriber units. Control outputs 15 all N subscriber units connected to N inputs of the element OR NOT 4, and its output connected to the inputs of the "Ban" 13 all N subscriber units. The output element And 6 connected to the counting input C of the counter 5, and its Abdoulaye input R is polling the input device 16. The group of outputs of the counter 5 is connected to the K to the address inputs of the multiplexer 8 is the exit Code of the caller device 18. N information inputs D of the multiplexer 8 is connected to the signal outputs of the respective N subscriber units. And its output connected to the input of the inverter 7 and is directly addressable by the output device 17. The output of the inverter 7 is connected to the first input element And 16.

Clock 2 is designed to generate a synchronizing pulse and can be built by any known scheme. Cm. for example, C. L. Shyla Popular chip TTL", M: "ARGUS", 1993, S. 18.

The divider 3 is designed to increase the repetition period arriving at its input sequence of pulses. The specific value of the required division depends on the selected clock frequency clock pulse devices, as well as from a specified range of time delay tmi. Scheme realizes, N. With. Dolidze and other Reference "Digital integrated circuits", M.: Radio and communication, 1994, S. 62 - 74. When the input divider is the counting input of the counter, and the output of the divider is one of the outputs of the counter.

Counter (5) is designed to account arriving at its counting input pulses and output the number in binary code. See, for example, p. P. Maltsev, N. With. Dolidze and other Reference "Digital integrated circuits", M.: Radio and communication, 1994, S. 62 - 74.

The multiplexer 8 is used to alternately switching signal outputs 14 of the subscriber units to the input of the inverter 7 and enables the output device 17. Diagram of the multiplexer known, described, for example, in the book: C. C. of Tutnikov in. A. Lopatin and other "Electronic devices information-measuring engineering: a tutorial", - L.: LPI them. Kalinina, 1980, S. 70 - 72.

Subscriber units 11-1Ndesigned for inspection of incoming requests and generate control signals to increase their priority for a certain period of time for each request.

The subscriber unit may be implemented in various ways. In particular, his scheme shown in Fig. 5, contains the element And 1.1, item, OR 1.2, the inverter 1.3, counter 1.4, trewhela the stock item And 1.5 and is requested by the input 9 of the subscriber unit. Exit (overflow ) counter connected to the first input Tregubova element And with the input of the inverter 1.3, the output of which is connected to the second input element OR 1.2 and is the managing output 15 of the subscriber unit. The second input element And 1.1 is the entrance Deny subscriber unit and its output connected to the first input element OR whose output is the signal output 14 of the subscriber unit. The third entrance Tregubova element is a clock input of the subscriber unit and its output connected to the counting input C of the counter, a group of information inputs of the D counter is the input Code maximum time subscriber unit. Abdoulaye input of the counter R is the entrance to "zero" the subscriber unit.

Counter 1.4 is designed to generate the control signal in a time interval defined by the code of the initial fill to the inputs D and the repetition period of the clock pulses. There is a configurable timer. Job description and diagram of this counter is shown, for example, in the book: p. P. Maltsev, N. C. Dolidze and others, "Digital integrated circuits: a Handbook ". M.: Radio and communication, 1994, S. 64 - 65.

The second variant of the device service requests users of the clock pulse 2, divider 3, N-Vodolaga of the element OR NOT 4, N-Vodolaga item OR 5, a decoder 6, a counter 7, item And 8 and the inverter 9.

To the inputs of the N-Vodolaga item OR 5 connected to the signal outputs 15 of the respective N subscriber units, the N outputs of the decoder 6 is connected to the inputs of the "Scanning" 17 corresponding to N subscriber units. K outputs of the counter 7, where K=]log2N[, connected to the corresponding K inputs of the decoder. The output element And 8 connected to the counting input C of the counter and its second input connected to the generator output and the input of the divider, the output of which is connected to the clock inputs 13 N subscriber units. Inputs N-Vodolaga of the element OR NOT 4 connected to the control outputs 16 of the respective N subscriber units, and its output to the inputs of the "Ban" 14 all subscriber units. The input of the inverter 9 is connected to the output element OR 5 and is directly addressable by the output device 20. Its output is connected to the first input element And 8. K outputs of the counter are K outputs the Code of the caller device 18. Abdoulaye input R of the counter 7 is polling the input device 19.

Moreover, the subscriber unit comprises a first element And 1.1, item, OR 1.2, of the second element And 1.3, inverter 1.4, 1.5 meter, Tregubova cell battery (included) the th element And 1.6 and is requested by the input 10 of the subscriber unit. Exit (overflow ) counter connected to the first input Tregubova element And to the input of the inverter 1.4, the output of which is connected with the second input element OR 1.2 and is control the output 16 of the subscriber unit. The second input of the first element And 1.1 is the entry "Ban" 14 subscriber unit. Its output is connected to the first input element OR 1.2, the output of which is connected to the first input of the second element And 1.3, a second input and its output are the corresponding inputs "Scan" 17 and the signal output 15 of the subscriber unit. The third entrance Tregubova element is a clock input 13 of the subscriber unit. Output Tregubova element And is connected to the counting input C of the counter. Inputs Code maximum time" 12 and "Zeroing" 11 subscriber unit are respectively the group of information inputs D and the input reset R counter.

The claimed device service requests of users of the computing system (first version) works as follows. Before you begin the device according to the group of inputs "Code maximum time 10 information on the D inputs of counters 1.4-N. 4 subscriber units receive codes that specifies the maximum waiting time at the service C is a high number, which can be written to the counter.

In the initial period of service, when service requests are not being received at all desirable inputs 9 subscriber units low logic levels. The pulses from the clock pulse 2 is transmitted through the opened item And 6 at the counting input of the counter 5, the outputs of which edge of each clock pulse sequentially shift code combinations (number of subscriber units in binary form). Code combination from the output of the counter arrives at the address K inputs of the multiplexer 8. Thus, the output of the multiplexer alternately poluchautsa signals from the signal outputs 14 of the subscriber units in sequence (top to bottom).

When receiving a request to query the input 9 of the subscriber unit is set to high level. While at the signal output 14 of the block will be high level (through the open item 1.1 and item OR 1.2). At the counting input C of the counter 1.4 receives pulses from the clock 2 chain: the divider 3, the clock input 12 of the subscriber unit, an outdoor element And 1.5. The counter acts as a timer that is triggered at a set interval of time.

As the release of sny input device 16. This is counter 5. Next, the scanning signal outputs subscriber units in order of priority (i.e. top-down). Upon detection of the first counter is high level, the inverter 7 switches and its output is set to low level, which prohibits the receipt of clock pulses to the input C of the counter 5 through the element And 6. Scanning will stop. At permissive output device 17 is set to a high level, and outputs the Code of the caller - ID of the current subscriber unit (subscriber). The computer produces a solution of the given subscriber.

After service on request from the input 9 of the subscriber unit is set to the low level and the counter 1.4 short reset pulse at the input "Reset" 11. On polling the input 16 of the device is the impetus and process service requests continues.

If one or more queries in the current queue has reached the maximum waiting time is their priority service. When the maximum waiting time at the output of the counter overflow 1.4 set low level, which locks the element And 1.5, prohibiting postopia high level. The high level control output 15 of this subscriber unit switches the element OR NOT 4 and inputs a "Ban" all subscriber units is set to the low level. Therefore, a high level on the signal outputs will only requests that have reached the maximum wait time. As a result of scanning signal outputs will be identified and resolved the request with the highest priority.

The claimed device service requests of users of the computing system (the second option) works as follows.

Before working device in the group of inputs "Code maximum time" 12 information on the D inputs of counters 1.5-N. 5 subscriber units receive codes that specifies the maximum waiting time to service requests. The smallest waiting time corresponds to the highest code that is in addition to the maximum number that can be written to the counter.

In the initial period of service, when the service requests do not at all require the input of subscriber units low logic levels. The pulses from the clock pulse 2 is transmitted through the opened item And 8 at the counting input of the counter 7, Nai (non subscriber units in binary form). Code combination from the output of the counter arrives at the inputs of the decoder 6. Thus, the output of the decoder 6 according to the input codes sequentially from top to bottom appear high levels (scanning signals), which are fed to the inputs "Scan" all N subscriber units.

When the request is received at the output of the element OR 1.2 subscriber unit is set to high level. At the counting input C of the counter 1.5 receives pulses from the clock 2 chain: the divider 3, the clock input 13 of the subscriber unit, an outdoor element And 1.6. The counter acts as a timer that is triggered at a set interval of time.

With the release of the computing resource, the computer generates a pulse of positive polarity, which goes to poll the input device 19. If this is the zeroing of the counter 7. Next, the scanning signal outputs subscriber units in order of priority (i.e. top-down). The scan pulses are received from the decoder 6 to the inputs of the "Scanning" of the subscriber units. Upon detection of a request of a subscriber unit opens the item And 1.3 and the high level is supplied to the element, OR 5. He switches on his you is via element And 8. Scanning will stop. At permissive output device 20 is set to a high level, and outputs a Code subscriber" 18 - code of the current subscriber unit (subscriber). The computer produces a solution of the given subscriber.

After service on request from the input 10 of the subscriber unit is set to the low level and resets the counter 1.5 short pulse on input "Reset" 11. On polling the input 19 of the device is the impetus and process service requests continues.

If one or more requests in the wait has reached the maximum time is their priority service. When the maximum waiting time at the output (counter overflow 1.5 set low level, which locks the element And 1.6, prohibiting the admission to the counting input C of the counter clock pulses. Switches the inverter 1.4 and its output level is set to high. The high level control output 16 of the subscriber unit switches the element OR NOT 4 and inputs a "Ban" all subscriber units is set to the low level. Therefore, the high level outputs of the elements 1.2 subscriber units will be tolt identified and resolved query, with the highest priority.

1. Method of servicing requests of users of the computing system, which consists in generating codes a maximum wait time of query tmiwhere i = 1, 2, 3, ..., N the corresponding priority number of the i-th subscriber, and N is the total number of subscribers, their learning, the formation of pings, the organization of incoming requests queue of the second order in accordance with priorities of subscribers, the migration of all first-order request queue of the second order on the achievement of waiting time in the queue of the second order, is equal to tmithe decision of the first request from the queue of the first order, and in the absence of requests from the queue of the second order, wherein the request from the queue of the second order are transferred to the queue of the first order, to the position corresponding to the number of its priority, and queue the first order of priority to decide the request with the lowest priority number.

2. The device service requests users of a computer system containing N subscriber units, where N2, a counter, a counting input connected to the output element And the second input is connected to the output gene is prosnoe inputs and inputs Code maximum time" N subscriber units are appropriate request inputs and inputs Code maximum time devices, characterized in that additionally introduced N-shadowy the element OR NOT, the N inputs of which are connected to the relevant control outputs subscriber units, the inputs "Ban" which is connected to the output of the N-Vodolaga of the element OR NOT, multiplexer, N information input of which is connected to the signal outputs of the N subscriber units, and its address inputs connected to the outputs of the counter and outputs are "Code of the subscriber devices, where - ] log2N[, the output of the multiplexer is connected to the input of the inverter and is directly addressable by the output device, the output of the inverter connected to the first input element And the input of the reset of the counter is polled input device, and inputs "Zeroing" N subscriber units are corresponding inputs "Reset" of the device.

3. The device according to p. 2, characterized in that the subscriber unit consists of element And element OR, inverter, meter and Tregubova element And the first input element And is connected to the input of the Write counter and a second input Tregubova element And is requested by the input of the subscriber unit, the output of the counter is connected to the first input Tregubova element And with the input of the inverter whose output connection which is input Deny subscriber unit, and its output connected to the first input element OR whose output is the signal output of the subscriber unit, the third input Tregubova element is a clock input of the subscriber unit and its output connected to the counting input of the counter, a group of information inputs of the counter is the input Code maximum time subscriber unit, and Abdoulaye input of the counter is input to "zero" the subscriber unit.

4. The device service requests users of a computer system containing N subscriber units, where N2, N-shadowy element OR to the input of which is connected to the signal outputs of the respective N subscriber units, the decoder, the N outputs of which are connected to the inputs of the Scan corresponding to N subscriber units, the counter, the outputs of which, where K = ] log2N [connected to corresponding To the inputs of the decoder element And whose output is connected to the counting input of the counter and its second input connected to the generator output and the input of the divider, the output of which is connected to the clock inputs of the N subscriber units, and query inputs and inputs Code maximum time subscriber units are appropriate request inputs and inputs Code Maxim is, which is connected to the control outputs of the respective N subscriber units, and its output - to "Ban" all subscriber units, inverter, whose input is connected to the output of the OR element and is directly addressable by the output device, and its output connected to the first input element And To the outputs of the counter are output Code of the subscriber devices, and service entrance meter is polled input device, and abdulaye inputs N subscriber units are appropriate alnoaimi inputs of the device.

5. The device according to p. 4, wherein the subscriber unit comprises a first element And element OR the second element And, inverter, meter, Tregubova element And the first input of the first element And is connected to the input of the Write counter and a second input Tregubova element And is requested by the input of the subscriber unit, the output of the counter is connected to the first input Tregubova element And to the input of the inverter, the output of which is connected with the second input of the OR element and is managing access subscriber unit, the second input of the first element And an entry "Ban" subscriber unit, and its output connected to the first input member OR the output of which is connected to the first input of the second element And the second input and its output avlo element is a clock input of the subscriber unit, output Tregubova element And is connected to the counting input of the counter inputs "Code maximum time" and "zero" the subscriber unit are respectively the group of information inputs and the input of the reset of the counter.

 

Same patents:

The invention relates to a method of congestion control messages elementary program in the electronic switching system

The invention relates to computer technology and is intended for use in a local area network with bus topology to control the transmission of data packets through a common channel

The invention relates to computing and can be used to provide machine-to-machine exchange in distributed computer systems and computer networks

The invention relates to computer technology and can be used for accessing a shared resource

The invention relates to automation and computing, and more specifically to the priority data processing, and is intended for use in multiprocessor systems, local area networks and distributed control systems

The invention relates to computer technology and can be used in distributed information processing systems for the organization of exchange between the Central computer and subscribers of the system on a shared line

The invention relates to computer technology, automatic control and can be used in devices interrupt programs, control data flows and the formation of an Executive address data banks in logical processors

The invention relates to computing and can be used in devices that need to poll consistently sources of information, ready to transmit data to pull their device with low latency

The invention relates to computer technology and can be used in multiprocessor systems with shared multi-module memory to extend the functionality by changing the addresses of the main memory address of the backup upon failure of the main module

FIELD: computer science.

SUBSTANCE: device has n-byte query register, query limits location systems, each of which consists of counting timer and OR element, OR element, AND element, keys cascade.

EFFECT: higher reliability and speed of operation.

1 dwg

FIELD: method and device for processing data for preserving recurrent status in data processing device.

SUBSTANCE: device has data processing block, having multiple functioning modes, for each of which special memory stack is present. Method describes operation of this device. Data carrier contains program, configuring data processing device for performing stages of method.

EFFECT: decreased size of code and decreased interruption processing delay.

3 cl, 16 dwg

FIELD: engineering of information processing systems.

SUBSTANCE: system contains master-system for processing information, interface, central communication device, client system for processing information, object model. In accordance to method each master system sends to central communication device elements of its data array determined in appropriate master-representation, while in master-representation of connected master system elements of data array are contained, for which system has data priority.

EFFECT: simplified specification and development of interfaces between technical applications.

2 cl, 6 dwg

FIELD: engineering of interrupt processing mechanisms in computer systems.

SUBSTANCE: system contains processor with multiple contexts for execution of commands stored in memory. In response to common interrupt logical processors of processor with multiple contexts compete for receiving access to jointly utilized register. First logical processor gaining access to aforementioned jointly utilized register processes common interrupt. Remaining logical processors return from interrupt.

EFFECT: increased productiveness of system.

4 cl, 5 dwg

FIELD: computer engineering, possible use in data exchange systems and local computing networks.

SUBSTANCE: device contains N≥2 client blocks, clock impulse generator, N client time controllers, OR element, AND-NOT element, selector-multiplexer, two N-input AND-NOT elements, two priority encoders, main wait time controller.

EFFECT: increased probability of timely servicing of clients under conditions of real functioning process of data exchange systems, with continuous dynamics of change of modes of different priority requests from clients.

4 cl, 7 dwg

FIELD: engineering of computers for controlling memory, in particular, external memory controllers.

SUBSTANCE: memory control device for operation in memory controller network contains memory controller being an owner unit, capable of controlling the blocking of certain data area during execution of input-output outputs, and component for exchanging messages, providing for transmission of at least one message with blocking request, permission of blocking, blocking removal request and blocking removal signal, and also input-output component, while any image of aforementioned data area, received by instant copying thereof, is maintained as coherent relatively to data area itself, and input-output component may position previous direct confirmation, that this data area remains coherent to any such image, to cash-memory, and may perform input-output operations on basis of aforementioned previous direct confirmation. Method describes operation of aforementioned device. Software product for computer is realized on machine-readable carrier and contains a program recorded thereon, realizing operations of aforementioned method.

EFFECT: expanded functional capabilities.

3 cl, 3 dwg

FIELD: engineering of means for pausing execution of a stream until certain memory access occurs.

SUBSTANCE: in one variant of realization, processor contains a set of executive devices, capable of executing a set of streams. First stream includes a command, which determines the address being tracked. Logical pausing means pause execution of first stream, and monitor causes renewal of first flow as reaction to access of given address being tracked.

EFFECT: increased processor productiveness.

5 cl, 14 dwg

FIELD: methods for automatic execution of a program, connected to data file, when data file and program being executed are positioned on different computer units.

SUBSTANCE: in methods, program being executed is accessed through graphic image of data file type, realized in the network, which includes client system and a set of server systems. Client system receives the scheme, which determines connection between the set of programs being executed and corresponding set of data file types. Graphic image of data files is displayed, information about selection of graphic image of data file is received from server system, on basis of it program to be executed is selected and executed.

EFFECT: increased productivity of system due to distributed execution of programs.

9 cl, 19 dwg, 3 tbl

FIELD: method and system for providing user interface information to client.

SUBSTANCE: in accordance to the invention, access system contains registration mechanism. Client environment for automatic processing of user interface receives registration information from the client and transmits user interface information after receipt. Server for automatic processing of user interface receives registration information from client environment for automatic processing of user interface and notifies processor of user interface about registration, and also receives user interface information from user interface processor. The server contains filtration device for filtering out information of no interest to client, and notification device for notifying the client about information which is of interest to the client.

EFFECT: ensured capacity for filtration and coordination of excessive and disorienting notifications.

2 cl, 11 dwg

FIELD: telecommunications.

SUBSTANCE: device contains a set of central processor units, which are assigned a common external up address in telecommunication network which allows packet data. IP messages, addressed to a network element, are received, and received IP messages which contain first messages are identified. First value is identified in first message and first message is transmitted to central processor unit on basis of identified first value, if identified first value is not equal to zero.

EFFECT: ensured load balancing for central processor when using several types of traffic.

3 cl, 3 dwg

Up!