Device for servicing different priority requests from clients of computing system

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

 

The invention relates to the field of computer engineering and can be used in communication systems and local area networks (LAN).

Known multi-channel device with a dynamic change of priority, as the USSR №1562912, G 06 F 9/46, 1990, bull. No. 17, containing N≥2 subscriber units, a counter element And a generator of clock pulses, the divider unit of analysis priorities and unit capacity priority.

The disadvantage of this device is relatively large service time of the customer computing system with low priority.

A device service requests users of a computer system containing N≥2 subscriber units, count, item, clock, divider, N-shadowy the element OR NOT, the multiplexer and inverter (see A.S. USSR №2140666, G 06 F 9/46, 1999, bull. No. 30).

However, this device has a relatively low reliability and long service time of complex queries, due to the large number of interconnected elements, included in its composition.

The closest to the technical nature of the claimed device (prototype) is a device service differently prioritised customer computing system (see RF patent №2186420, G 06 F 9/46, 2002, bul. No. 21), containing N≥2 subscriber of the components is, clock generator pulses, the first and second N-input elements AND IS NOT, first and second priority encoders, the element OR the element AND-NOT and the selector is a multiplexer. When the generator output clock pulses is connected to the clock inputs of each of the N subscriber units. Query inputs and K-bit input Code maximum wait time" of each of the N subscriber units, where≥2 - bit code maximum wait time of service requests that are appropriate request inputs and K-bit input Code, the maximum time-out" device. Inputs "Zeroing" of each of the N subscriber units are relevant inputs to "zero" the device. Each of the N inputs of the first and second N-vchodove elements AND IS NOT connected to the corresponding N inverted inputs respectively of the first and second priority encoders. Inverted outputs of the first and second N-vchodove elements AND IS NOT connected respectively to the second and first inputs of the OR element. Each n, n=1, 2,..., N, an inverse input of the first and second priority encoders are connected respectively to the first and second signal output ((N+1)-n)-th subscriber unit. The output element OR is connected to the second input element AND the first input of which is polling the input device and the output element AND IS NOT connected to the inv is red allows the input of the selector is a multiplexer and is directly addressable by the output device. The control input of the selector-multiplexer connected to the second input of the OR element. Each of J, where J=]log2N[, inverted outputs of the first and second priority encoders connected to the corresponding J primary inputs and corresponding J secondary inputs of the selector-multiplexer, and the J-bit output of the selector-multiplexer is a J-bit access Code subject to the service subscriber devices.

In the prototype is implemented the ability to reduce service time of complex queries and increase reliability by reducing the number of elements included in the device service differently prioritised customer computing system.

However, the prototype has the disadvantage of relatively low probability of timely customer service in the conditions of continuous dynamics of transitions differently prioritised requests and taking into account influencing factors. This is due to the fact that the device is a prototype does not allow to dynamically adjust the maximum waiting time for service requests, different priority, and dynamically changing requirements to timely provision of services under the requests of different priority. This device is a prototype allows you to serve differently prioritised customer computer system with time and is always preset values (boundaries) maximum waiting time of service for each request, while a large number of requests from subscribers real - multifunctional, complex, and managed computing systems, may in the dynamics of functioning to change its state (can dynamically change the requirements for the quality and timely delivery of specific services within the requests of different priority, for example, the current requirements to the maximum time-out of service for a specific request) under the effect of control actions on the computing system based on the current requirements of the subscribers or under the influence of external factors. This eliminates the use of the prototype for the timely and dynamic customer service in real conditions, when the dynamics of the operation of the managed computing system objectively change over time not only the properties of the system and the environment, but also the requirements to the quality and timeliness of service [1-5].

Under "service" means the totality of the actions of a computing system that includes a sample request from the queue, the resource allocation, as well as carrying out the finishing operations. The request is to send the signal that triggers the response. Input message containing a request to the system for the allocation of the resource.

Under "priority" refers to the number of prescribed tasks is, the process or operation that determines the order of their execution or maintenance. The smaller the number, the higher the priority level.

Under the "state differently prioritised requests" refers to the set of parameter values characterizing these requests (priority, and maximum waiting time of service for each request) at a specific point in time.

Under the "maximum waiting time" service request is the maximum time a request is in the queue at the service of the second or of the first order. Code maximum waiting time service request TOJ nfrom a specific caller (where n=1, 2,..., N the corresponding priority number of the n-th subscriber, and N is the total number of subscribers), memorized, then a signal is generated query and from such signals queries formed part of the second order in accordance with priorities subscribers. Requests from the queue of the second order, which reached a maximum wait time, transfer to the queue of the first order at the position corresponding to the numbers of their priorities.

The purpose of the claimed technical solution is the creation of a device service differently prioritised customer requests waslittle system, providing increased likelihood of service users in the conditions inherent in the real% is piss functioning of a computer system - in conditions of continuous dynamics of transitions differently prioritised requests and taking into account influencing factors, device, able to provide users with a resource of the computing system, taking into account how the dynamics of control actions or external factors and time-varying current demands of subscribers, based on the dynamically adjusted values (limits) maximum waiting time of service for each request.

This goal is achieved by the fact that in the known device service differently prioritised customer computing system containing N≥2 subscriber units, a generator of clock pulses, the first and second N-input elements AND IS NOT, first and second priority encoders, the element OR the element AND-NOT and the selector is a multiplexer, J-bit, where J=]log2N[whose output is J-bit access Code subject to the service subscriber devices, the generator output clock pulses is connected to the clock inputs of each of the N subscriber units, a request inputs and K-bit input Code maximum wait time" of each of the N subscriber units, where≥2 - bit code maximum wait time of service requests that are appropriate N of query inputs and N K-bit input Code maximum time and standby devices, inputs "Zeroing" of each of the N subscriber units are relevant inputs to "zero" the device, each of the N inputs of the first and second N-vchodove elements AND IS NOT connected to the corresponding N inverted inputs respectively of the first and second priority encoders, inverted outputs of the first and second N-vchodove elements AND IS NOT connected respectively to the second and first inputs of the OR element, the output of which is connected to the second input element AND the first input of which is polled input device, the output element AND IS NOT connected to the inverse allows the input of the selector is a multiplexer and is allow output device, the control input of the selector-multiplexer connected to the second input element OR each of the J inverted outputs of the first and second priority encoders connected to the corresponding J primary inputs and corresponding J secondary inputs of the selector-multiplexer optionally included N≥1 identical subscriber controllers time intended for decryption, an additional comparison and control K-bit code, determining a new value for the maximum time waiting for service for each request to a specific subscriber, and the main controller time-out, designed for dynamic correction values Maxim is inogo time waiting for service for each request any of the N subscribers of the computing system. In this case n-th, where n=1, 2,..., N, the inverse input of the first priority encoder connected to the first signal output ((N+1)-n)-th subscriber controller time, the n-th inverted input of the second priority encoder connected to the second signal output ((N+1)-n)-th subscriber controller time. The first and second signal outputs of the n-th subscriber unit connected respectively to the first and second signal inputs of the n-th subscriber unit connected respectively to the first and second signal inputs of the n-th subscriber controller time. Moreover, the K-bit correction input of the n-th subscriber unit is connected to the K-bit test input of the n-th subscriber controller time and connected to the n-th, where n=1, 2,..., N, K-bit output of the main controller timeout, N K-bit inputs which are the corresponding N K-bit inputs Adjust the maximum time-out" device.

Subscriber controller time (AKW) consists of a decoder corrected code maximum wait time and register comparison-correction maximum wait time. K-bit input decoder corrected code maximum wait time is a K-bit test input subscriber controller time. Primary and secondary test outputs desirat the RA corrected code maximum wait time connected respectively to the primary and secondary test inputs register comparison-correction maximum wait time, the first and second signal inputs of which are respectively the first and second signal inputs of the subscriber controller time. The first and second signal outputs of the register comparison-correction maximum wait time are respectively the first and second signal outputs subscriber controller time.

The main controller time-out consists of the recording element time-out and storage element of the new timeout value. This N-bit inputs of the recording element time-out are the corresponding N K-bit inputs of the main controller time-out. And N K-bit outputs of the recording element time-out is connected to the corresponding N K-bit inputs of the storage element of the new time-out value, N K-bit outputs which are the corresponding N-bit output of the main controller timeout.

The subscriber unit comprises a meter, inverter, Tregubova element And correction of the register. When this inverted enable input of the account counter is a challenge entry subscriber unit and connected to the second input Tregubova element And to the input of the inverter. Moreover, the K-bit primary input adjustment register is a K-bit input "the od maximum wait time" subscriber unit, K-bit secondary input adjustment register is a K-bit correction input of the subscriber unit, and To output the correction register is connected to the corresponding To the information inputs of the counter. The reset input of the counter is input to "zero" the subscriber unit. Inverted output of the counter is connected to the first input Tregubova element And is the first signal output, the subscriber unit. The third entrance Tregubova element is a clock input of the subscriber unit, and the output Tregubova element And connected to the counting input of the counter. The output of the inverter is the second signal output, the subscriber unit.

Thanks to a new set of essential features, by introducing N≥2 identical subscriber controllers time and the main controller time-out, providing, respectively, the decoding and dynamic correction values (limits) maximum waiting time of service for each request, the claimed device is achieved the possibility of providing users of the resource of the computing system, taking into account how the dynamics of control actions or external factors and time-varying current demands of subscribers, contributing to the increased likelihood of service users in y is s, inherent in the real process of functioning of a computer system in terms of continuous dynamics of transitions differently prioritised requests and taking into account influencing factors.

The analysis of the level of technology has allowed to establish that the analogues, characterized by a set of characteristics is identical for all features of the claimed technical solution is available, which indicates compliance of the device to the condition of patentability "novelty".

Search results known solutions in this and related areas of technology in order to identify characteristics that match the distinctive features of the prototype of the features of the declared object, showed that they do not follow explicitly from the prior art. The prior art also revealed no known effect provided the essential features of the claimed invention transformations on the achievement of the technical result. Therefore, the claimed invention meets the condition of patentability "inventive step".

The claimed device is illustrated by drawings, on which:

figure 1 - structural diagram of the device service differently prioritised customer computing system,

figure 2 - structural diagram of the n-th (subscriber controller time is Yeni;

figure 3 - structural diagram of the main controller timeout;

figure 4 - structural diagram of the n-th (subscriber unit;

figure 5 - structure of the computing system;

figure 6 - placement of signal requests in the queue of the second order;

7 - procedure for transfer requests from the queue of the second order in the queue of the first order.

The maintenance unit differently prioritised customer computing system, depicted in figure 1, consists of N≥2 identical subscriber units 11-1N(AB), clock 2, N≥2 identical subscriber controllers time 31-3Nelement OR 4-element AND 5, the selector-multiplexer 6, the first 7 and the second 10 N-vchodove elements AND IS NOT, the first 8 and second 9 encoders priorities, the main controller timeout 11. While J-bit, where J=]log2N[, exit 65 of selector-multiplexer 6 is a J-bit access Code subject to the service subscriber devices, the output 21 of clock 2 is connected to the clock inputs 0141-014Neach of the N subscriber units 11-1N, inquiring inputs 0111-011Nand K-bit input Code maximum wait time" 0121-012Neach of the N subscriber units 11-1Nwhere#x02265; 2 - bit code maximum wait time of service requests that are appropriate N of query inputs and N K-bit input Code, the maximum time-out" device. Inputs "Zeroing" 0131-013Neach of the N subscriber units 11-1Nare the corresponding N inputs to "zero" the device. Each of the N inputs of the first 7 and the second 10 N-vchodove elements AND NOT (respectively 711-71Nand 1011-101N) connected to the corresponding N inverted inputs (811-81Nand 911-91Nrespectively of the first 8 and second 9 encoders priorities. Inverted outputs of the first 7 and the second 10 N-vchodove elements AND NOT (respectively 72 and 102) are connected respectively to the second 42 41 and the first inputs of the OR element 4, the output 43 which is connected to the second input 52 of the element AND NOT 5, the first input 51 which is polling the input devices. The output 53 of the element AND NOT 5 is connected to the inverse allows the input 61 of the selector-multiplexer 6 and is directly addressable by the output device. The control input 64 of the selector-multiplexer 6 is connected to the second input 42 of the element OR 4. Each of J inverted outputs (respectively 821-82J921-92Jthe first 8 and second 9 priority encoders connected to the corresponding J primary inputs 621-62 Jand the corresponding J secondary inputs 631-63Jselector-multiplexer 6. In this case n-th, where n=1, 2,..., N, an inverse input 81nthe first priority encoder 8 is connected to the first signal output 34(N+1)-n((N+1)-n)- th subscriber controller time 3(N+1)-nn-th inverse input 91nthe second priority encoder 9 is connected to the second signal output 35(N+1)-n((N+1)-n)-th subscriber controller time 3(N+1)-n. First 015nand second 016nthe signal outputs of the n-th subscriber unit 1nconnected respectively to the first 31nand second 32nsignal inputs of the n-th subscriber controller time 3n. Moreover, the K-bit correction input 017nthe n-th subscriber unit 1nconnected with K-bit test input 33nthe n-th subscriber controller time 3nand connected to the n-th, where n=1, 2,..., N, K-bit output 112nthe main controller timeout 11, N K-bit inputs 1111-111Nwhich are the corresponding N K-bit inputs Adjust the maximum time-out" device.

The number N (N≥2)" (subscription blocks, inputs, outputs, and so on) is determined in accordance with a possible number of subscribers of the computing system and typically ranges from 2 (two) to 50 (fifty). The Number Is K, (It≥2)" shows the bit code maximum wait time of service requests of subscribers and typically ranges from 2 (two) to 10 (ten).

Subscriber controllers time 31-3Nidentical and are intended for decryption, an additional comparison and control new, introduced in the dynamics of process control services differently prioritised customer computing system, the K-bit code, determining a new value (boundary) maximum waiting time of service for each request to a specific subscriber.

Subscriber controller time (for example, n-th water) 3nwhere n=1, 2,..., N, (figure 2), consists of a decoder corrected code maximum timeout 3.1ncase comparison-correction maximum wait time 3.2n. When this K-bit input 3.1n-1 decoder corrected code maximum timeout 3.1nis a K-bit test input 33nsubscriber controller time 3n. Primary 3.1n-2 and secondary 3.1n-3 test the outputs of the decoder corrected code maximum timeout 3.1nconnected respectively to the primary 3.2n-6 and secondary 3.2n-3 test inputs register comparison-correction maximum lying is no standby 3.2 nthe first 3.2n-1 and the second 3.2n-2 signal inputs of which are respectively the first 31nand second 32nsignal inputs the subscriber controller time 3n. The first 3.2n4 and the second 3.2n-5 signal outputs of the register comparison-correction maximum wait time 3.2nare respectively the first 34nand the second 35nthe signal outputs of the subscriber controller time 3n.

The decoder corrected code maximum timeout 3.1nsubscriber controller time 3ndesigned to convert the K-bit code, causing a new input in the management process, the value of the (border) maximum waiting time of service for each request specific n-th subscriber in binary code. The decoder corrected code maximum timeout 3.1ncan be technically implemented as a commercially available decoder described in the book [Bogdanovich M.I., Grell I.N., Prokhorenko, VA and other Digital integrated circuits: a Handbook. - Minsk: Belarus, 1991. S-436, RIS].

Case comparison-correction maximum wait time 3.2nsubscriber controller time 3nintended for additional verification (comparison) set request with SNAC is determined as being and re-enter the maximum time waiting for service to the queue of the first or of the second order for each request specific n-th subscriber and correction (formation according to the results of the comparison on the first 34 nand the second 35nthe signal outputs of water 3nsignals low or high level, characterizing the identity of this request respectively to the first queue or the second order with the new timeout. Case comparison-correction maximum wait time 3.2ncan be technically implemented on the basis of commercially available node comparison (digital comparator, as shown in [Gusev V.V., Lebedev O., Sidorov A. M. fundamentals of pulse and digital techniques. - SPb.: SUVIUS, 1995. S-152, RIS].

The main controller timeout 11 is designed for dynamic correction values (limits) maximum waiting time of service for each request of any one of the N subscribers of the computing system.

The main controller timeout 11 (figure 3) consists of the recording element timeout 11.1 and storage element of the new timeout value 11.2. Thus N K-bit inputs 11.1-11-11.1-1Nthe recording element timeout 11.1 are the corresponding N K-bit inputs 1111-111Nthe main controller timeout 11. And N K-bit outputs 11.1-21-11.1-2Nthe recording element timeout 11.1 connected to the corresponding N K-bit inputs 11.2-11-11.2-1Nstorage element of the new EIT is possible timeout 11.2, N K-bit outputs 11.2-21-11.2-2Nwhich are the corresponding N K-bit outputs 1121-112Nthe main controller timeout 11.

The recording element timeout 11.1 main controller timeout 11 is designed to control and registration in K-bit code, new, introduced in the dynamics of process control services differently prioritised customer computing system, the maximum waiting time of service for each request to a specific subscriber. The recording element timeout 11.1 can be technically implemented in the form of commercially available multi-bit shift register to shift to the left as shown in the literature [Gusev V.V., Lebedev O., Sidorov A. M. fundamentals of pulse and digital techniques. - SPb.: SUVIUS, 1995. S-160, RIS(b)].

The storage element of the new timeout value 11.2 main controller timeout 11 is designed for recording and storing the K-bit code, new, introduced in the dynamics of the process control service, the maximum waiting time. The storage element of the new timeout value 11.2 can be technically implemented as a normal storage device based on a typical multiple-bit shift register with serial input and output of the m information described in [Bystrov Y.A., Welikson AM, Wagman E, and other electronics: Reference book/Ed. by Bystrov Y.A - SPb.: Energoatomizdat, 1996. S-292, RIS].

Subscriber units (AB) 11-1Nidentical and are designed to control the receipt of signals of requests that control the remaining waiting time, and generate control signals upon expiration of the original or newly introduced in the dynamics of control timeout for each request.

Subscriber unit (e.g., n-th AB) 1nwhere n=1, 2,..., N, (4), consists of a counter 1.1n, inverter 1.2n, Tregubova element And 1.3nand corrective register 1.4n. When this inverted enable input accountcounter 1.1nis a challenge entry 011nsubscriber unit 1nand connected to the second input 1.3n-2 Tregubova element And 1.3nand to the input of 1.2n-1 inverter 1.2n. Moreover, the K-bit primary input 1.4n-1 corrective register 1.4nis a K-bit input 012nCode maximum wait time" subscriber unit 1n, K-bit secondary entrance 1.4n-2 corrective register 1.4nis a K-bit correction entrance 017nsubscriber unit 1nand To output 1.4n-31-1.4n-3sub> Kcorrective register 1.4nconnected to the corresponding To informationm inputs D1-DKcounter 1.1n. The reset input R of counter 1.1nand is the entrance 013n"Zeroing" the subscriber unit 1n. Inverted outputcounter 1.1nconnected to the first input 1.3n-1 Tregubova element And 1.3nand is the first signal output 015nsubscriber unit 1n. The third entrance 1.3n-3 Tregubova element And 1.3nis a clock input 014nsubscriber unit 1nand output 1.3n-4 Tregubova element And 1.3nconnected to the counting input Z counter 1.1n. Output 1.2n-2 inverter 1.2nis the second signal output 016nsubscriber unit 1n.

Counter 1.1nsubscriber unit 1ndesigned to account arriving at its input pulses (the pulses), the generation of the control signal defined by the code of the initial fill to the inputs D1-DKand the repetition period of the clock pulses, there is a configurable timer. Job description and diagram of this counter is known and described, for example, in [Maltsev P.P., Dolidze NS and other Digital integrated circuits: a Handbook. - M.: Radio and communication, 1994, P.64-65].

The inverter 1.2nabonentskogo block 1 ndesigned to convert a signal of high level is supplied to the inquiring input 011nsubscriber unit 1nin the low level signals, the combination of which second signal outputs 0161-016Nsubscriber units 11-1Nforms a part of the second order. The inverter 1.2ncan be technically implemented in the form of the element is NOT in accordance with the description, privedennym in [Gusev V.V., Lebedev O., Sidorov A. M. fundamentals of pulse and digital techniques. - SPb.: SUVIUS, 1995. P.14, RIS].

Trekhgolovy element And 1.3nsubscriber unit 1ndesigned for registration of service requests, as well as switching clock input 014nsubscriber unit 1nand inverted outputcounter 1.1nin the interests of control timeout for each request, or installed the original or newly introduced in the dynamics of service management. Trekhgolovy element And 1.3ncan be implemented on the basis of a commercially available item And is described in [Gusev V.V., Lebedev O., Sidorov A. M. fundamentals of pulse and digital techniques. - SPb.: SUVIUS, 1995. S-14, fig.1.2].

Corrective register 1.4nsubscriber unit 1ndesigned for registration and preliminary comparison of the original and t see you a again is introduced in the dynamics-control-bit code, and correction (formation according to the results of comparison) To their outputs 1.4n-31-1.4n-3Kinformation signals characterizing a preliminary decision about the maximum waiting time of service for each request specific n-th subscriber. Corrective register 1.4ncan be implemented on the basis of commercially available site compare multi-digit numbers, as described in [Gusev V.V., Lebedev O., Sidorov A. M. fundamentals of pulse and digital techniques. - SPb.: SUVIUS, 1995. S-152, RIS].

Clock 2, part of the General structural scheme is intended to provide a synchronizing pulse. Technical implementation of the clock 2 is possible on the basis of mass-produced clock pulses, described in [awl V.L. Popular digital circuits. The Handbook. - M.: Radio and communication, 1987. P.50-53].

Element OR 4, part of the General structural scheme is designed to combine the output signals of a particular logic level, outputs of the first 7 and the second 10 N-vchodove elements. Element OR 4 can be technically implemented on the basis of mass-produced item OR described in detail in [Gusev V.V., Lebedev O., Sidorov A. M. fundamentals of pulse and digital techniques. - SPb. SUVIUS, 1995. P.24-26, figure 1.7].

Element AND-NOT 5 included in the overall structural scheme is designed to generate signals either low or high logic level and, accordingly, permit or prohibit the broadcast data selector-multiplexer 6. Element AND 5 can be implemented on the basis of a commercially available item AND IS NOT, as shown in [Gusev V.V., Lebedev O., Sidorov A. M. fundamentals of pulse and digital techniques. - SPb.: SUVIUS, 1995. P.26-28, RIS(a)].

The selector is a multiplexer 6, which is a General block diagram is intended for switching or J primary 621-62Jor J secondary 631-63Jinput selector-multiplexer 6 on his J-bit output 65. A special case of the technical implementation of the selector-multiplexer 6 is described in [Maltsev P.P., Dolidze NS and other Digital integrated circuits: a Handbook. - M.: Radio and communication, 1994. P.34-35].

The first 7 and the second 10 N-input elements AND IS NOT included in the overall structural scheme, similar in structure and operating principle, are intended to establish a high level output signal when the presence of the queue (respectively the first and second order) at least one request signal. The first 7 and the second 10 N-input elements AND may NOT be technically implemented using commercially available multi-input element AND NOT, as shown in [Si is s VV, Lebedev, O., Sidorov A. M. fundamentals of pulse and digital techniques. - SPb.: SUVIUS, 1995. P.26-28, RIS(b)].

The first 8 and second 9 encoders priorities included in the overall structural scheme, similar in structure and operating principle, designed to convert low-level signal on one of their inputs in binary code at the output, and conversion is carried out taking into account the priorities of the signals corresponding to the numbers of inputs. The first 8 and second 9 encoders priorities can be technically implemented on the basis of commercially available encoders, as shown in [awl V.L. Popular digital circuits. The Handbook. - M.: Radio and communication, 1987. S-148].

The maintenance unit differently prioritised customer computing system operates as follows.

It is known [1-5]that from the point of view of increasing the likelihood of service users in the conditions inherent in the real process of functioning of a computer system in terms of continuous dynamics of transitions differently prioritised requests and taking into account influencing factors, there is the possibility to vary the time of customer service. This feature is implemented on the basis of the principle of dynamic correction values (limits) maximum waiting time of service for each request.

It is obvious that when education is ode differently prioritised requests objectively change over time not only control actions on the system or external factors, but the current requirements of the subscribers to the quality and timeliness of service provision the computing system. In these conditions hampered timely service users, which depends on the dynamics of the time variation of the parameters, modes and methods of service, from the dynamics of the internal and external influences on the computing system, and the dynamics of the changing needs, goals and objectives of the service, due to the specific situation.

Analysis of papers [1-5], is devoted to the algorithms and principles of service differently prioritised customer requests within local area networks and other complex technical systems, allows to make a conclusion about the possibility of implementing procedures increase the likelihood of service users on the basis of the technical implementation of the principle of dynamic correction values (limits) maximum waiting time of service for each request in the continuous dynamics of transitions differently prioritised requests and taking into account influencing factors.

The construction of the device service differently prioritised customer computing system based on the proposed principle allows to gain an advantage over the prototype, providing the increased likelihood of providing the user the kind of resource within the real computer system, when the customer requests in the dynamics of the functioning of this system can modify the thresholds of their condition under the influence of control actions (current requirements) subscribers or external factors.

Technical implementation of the principle of dynamic correction values (limits) maximum waiting time of service in the claimed device is carried out by introducing external dynamic control waiting time (in the claimed device is a K-bit inputs maximum Correction time-out" device) and the introduction of the registration, control and dynamic correction of a maximum wait time of service for each request (in the inventive device are implemented in the framework of the subscriber units 11-1N, subscriber controllers time 31-3Nand the main controller timeout 11).

With this in mind, in the inventive device is controlled formation of queues on the service differently prioritised requests and implementation of time-varying needs of the customer computing resource, contributing to the increased likelihood of service users. Before you begin the device with its K-bit input Code, the maximum time-out" through the K-bit inputs 0121-012N/sub> subscriber units 11-1Non the K-bit primary inputs 1.41-1-1 .4N-1 corrective registers 1.41-1.4Nenter value code that sets the initial maximum waiting time of service requests for each of the n-th (the subscriber.

If the customer service there is no external dynamic control timeout for all requests for all N subscribers, on the K-bit correction inputs 0171-017Nsubscriber units 11-1Nand hence on K-bit secondary inputs 1.41-2-1 .4N-2 corrective registers 1.41-1.4Nthe code signals are not available.

In this case, the correction registers 1.41-1.4Nsubscriber units 11-1N(see figure 4) act as transit nodes, identify the initial codes timeout as uncorrected and broadcast (overwrite) them through To their outputs (1.41-31-1.41-3K)-(1.4N-31-1.4N-3K) corresponding To the information inputs (D1-DKrespective counters 1.11-1.1Nsubscriber units 11-1N.

If the customer service initiated by external dynamic control waiting time for any request of any of the n-th ( the subscriber (for example, if you have changed the requirements for timely maintenance of all or a specific query of all, more of N or specific subscribers in terms of objective time-varying goals and objectives of the service and taking into account influencing factors), from an external device in a K-bit code (either by a human operator, or by using a special control device), via N K-bit inputs Adjust the maximum time-out" devices on N-bit inputs 1111-111Nthe main controller time-out 11 new, additional input in the dynamics of the management service, the maximum waiting time for specific requests of the relevant subscribers.

The main controller timeout 11 may be implemented in accordance with the scheme shown in figure 3. Dynamic correction values (limits) maximum waiting time of service for each request all multiple of N or a specific subscribers computing system implemented in the main controller time-out 11 as follows.

New, additional input in the dynamics of the management service, the maximum waiting time for specific requests of the relevant subscribers, K-bit code is supplied through the N K-bit is the breaking of the inputs 111 1-111Nthe main controller timeout 11 N K-bit inputs 11.1-11-11.1-1Nthe recording element timeout 11.1 for control and registration. With N K-bit outputs 11.1-21-11.1-1Nthe recording element timeout 11.1 new value for the maximum waiting time is coming to corresponding N K-bit inputs 11.2-11-11.2-1Nstorage element of the new timeout value 11.2, which records and stores K-bit code these values until the introduction of the next control action, as well as from their N K-bit outputs 11.2-21-11.2-2Nthrough the appropriate N-bit outputs 1121-112Nthe main controller timeout 11, transmits the new value for the maximum waiting time for corrective inputs 0171-017Nthe respective subscriber units 11-1Nand on a test inputs 331-33Nthe respective subscriber controllers time 31-3N.

At K-bit correction inputs 0171-017Nsubscriber units 11-1Nand hence on K-bit secondary inputs 1.41-2-1 .4N-2 corrective registers 1.41-1.4Nare K-bit code signals. Corrective registers 1.41-1.4Nabonents the blocks 1 1-1Nregister the original code (received from the K-bit inputs 0121-012Nsubscriber units 11-1Non their K-bit primary inputs 1.41-1-1 .4N-1) and pre-compare it with the newly dynamics control K-bit code, which enters through the corrective inputs 0171-017Nsubscriber units 11-1Non the K-bit secondary inputs 1.41-2-1 .4N-2 corrective registers 1.41-1.4N.

And correction (forming a preliminary comparison) To the outputs 1.4n-31-1.4n-3Kcorrective register 1.4nthe n-th (subscriber unit 1ncode characterizing a preliminary decision about the maximum waiting time of service for each request specific n-th subscriber is carried out as follows. If the K-bit second input 1.4n-2 corrective register 1.4nthere are K-bit signal, determining a new input in the dynamics of management maximum standby time, this signal is identified as a priority, and it is he To outputs 1.4n-31-1.4n-3Kcorrective register 1.4nenters the appropriate information inputs (D1-DK) counter 11 nthe n-th (subscriber unit 1n. If the K-bit second input 1.4n-2 corrective register 1.4nno K-bit signal, causing new, introduced in dynamics control the maximum wait time, then the priority is recognised values of code that sets the initial maximum waiting time service request n-th (the subscriber and the incoming K-bit primary input 1.4n-1 corrective register 1.4nthrough the K-bit input 012nsubscriber unit 1nwith the corresponding n-th K-bit input Code, the maximum time-out" device.

Thus, To output 1.4n-31-1.4n-3Kcorrective register 1.4nenters the appropriate information inputs (D1-DK) counter 1.1nthe n-th (subscriber unit 1neither initially introduced, or a new input in the dynamics of service management, the code value that specifies the maximum waiting time service request.

This ensures that the initialization of the counters 1.11-1.1NAB 11-1N. The least waiting time corresponds to the greatest code, which is in addition to the maximum number, the representatives of the CSOs in the K-bit code.

In the initial period, when service requests are not available, for all N request from the input device and the corresponding query inputs 0111-011Nsubscriber units 11-1Nset at a low logic levels. Trehochkovye elements And 1.31-1.3Nall AB closed, the clock pulses from the oscillator clock pulses 2 through trehochkovye elements And 1.31-1.3Non counting input Z counter 1.11-1.1NAB 11-1N't do that. By computing resources (computers, LAN, there is no signal on the release of the resource (polling the input device is set to low logic level). On the second 0161-016Nand the first 0151-015Nthe signal outputs AB 11-1Nset high logic levels. Accordingly, the output 72 of the first N-Vodolaga element AND-NOT 7 and the output 102 of the second N-Vodolaga item AND NOT 10 is set at a low logic levels. While J-bit output 65 of the selector-multiplexer 6 is open, because its inverse permissive input 61 (through the element OR 4-element AND-NOT 5 is set to high logic level. The device is ready to work and waiting for the pings generated by subscribers of a computer system (see figure 5).

When there is need to calculate enom resource subscriber computing system the signals are generated queries, which with the corresponding original or vvedenim under control) maximum waiting time, received by the device service requests and placed in the queue of the second order. The request signal from the subscriber is considered to be a high signal, is installed on any one of the request inputs 0111-011Nthe corresponding AB 11-1N. This second signal outputs 0161-016Nthese AB through inverters 1.21-1.2Npre-set low level signals. The pre-set low level signals on the second signal outputs 0161-016NAB forms a preliminary stage of the second order. The position request signal in the preliminary stage of the second order is determined by its initial priority request signal received from the subscriber with the lowest number has the highest priority (see Fig.6). On counting input Z counter 1.11-1.1NAB 11-1Ncontaining signals of requests, receives pulses from the output 21 of the generator of clock pulses 2 through the circuit: clock inputs 0141-014NAB 11-1Nopen Trehochkovye elements And 1.31-1.3NAB 11-1N. Counters 1.11-1.1Neach AB options perform the Yu timers, which control the expiration of the allowable time (original or introduced under the control location requests in the queue of the second order by summing arriving on their counting input Z clock pulses and generate an overflow signal on the inverted outputscounter 1.11-1.1Nafter a preset time interval, defined codes seeding counters and the frequency of the clock pulses.

Signals with a second signal outputs 0161-016NAB 11-1Ngo through the second signal input 321-32Nsubscriber controllers time 31-3N(see figure 2) on the second signal inputs 3.2.1-2-3 .2N-2 registers comparison-correction maximum wait time 3.21-3.2Non the secondary test inputs 3.21-3-3 .2N-3 are transmitted in binary code with the secondary test outputs 3.11-3-3 .1N-3 decoders corrected code maximum timeout 3.11-3.1Nsignals characterizing a new input in the management process, the value of the (border) maximum waiting time of service for a specific request for a specific subscriber. While the decoders corrected code maximum timeout 3.11-3.1Nconvert the K-bit code, driving new input in the process control values (bounds) maximum waiting time of service for each subscriber request in binary code and transmit the code to check the validity of the assignment requests place in the queue of the first or second order in the registers of the comparison-correction maximum wait time 3.21-3.2N.

Registers comparison-correction maximum wait time 3.21-3.2Ncarry out additional checks (comparison) facilities request with original and newly commissioned maximum wait time service to the queue of the second order and form on their second signal outputs 3.21-5-3 .2N-5 and second signal outputs 351-35Nsubscriber controllers time 31-3Nthe low level signals, the combination of which finally forms a part of the second order. The position request signal in the final stage of the second order, as in the prior turn, is determined by its initial priority request signal received from the subscriber with the lowest number has the highest priority (see Fig.6).

Thus, the second signal outputs 351-35Nsubscriber controllers time 31-3Nare the pings to the queue of the second poradek is, based on a dynamic correction of a maximum wait time of service.

The pings to the queue of the second order based on a dynamic correction of a maximum wait time of service, with a second signal outputs 351-35Nsubscriber controllers time 31-3Ncome on inverted inputs 911-91Nthe second priority encoder 9, which provides signal conversion queries in the J-bit code corresponding to the number of AB with regard to its priority and dynamic correction of a maximum wait time. When this signal with the second signal output 351the first subscriber controller time 31is supplied to the N-th inverse input 91Nthe second priority encoder 9, the signal from the second signal output 352the second subscriber controller time 32comes to (N-1)-th inverse input 91N-1the second priority encoder 9, the signal from the second signal output 35nthe n-th subscriber controller time 3ngoes on ((N+1)-n)-th inverse input 91(N+1)-nthe second priority encoder 9, the signal from the second signal output 35NThe N-th subscriber controller time 3Ngoes to the first inverted input 911the second priority encoder 9.

The method by which the second switching signal outputs 35 1-35Nsubscriber controllers time 31-3Ndue to the fact that the outputs 921-92Jthe second priority encoder 9 inverse. This leads to the fact that to obtain at the output of the second priority encoder 9 code corresponding to a particular n-th subscriber controller time (3n) with the lowest number of those battery 31-3Non second signal outputs 351-35Nwhich has a low logic levels (pings), you should connect the second signal outputs 351-35Nsubscriber controllers time 31-3Nto the second inputs of the priority encoder 9 in reverse order. If the queue of the second order at least one request signal to account for dynamic correction of a maximum wait time, or without it, the output 102 of the second N-Vodolaga element AND-NOT 10 will set the high level.

With the release of the computing resource (resource computers, LAN) produces a high signal, which goes to poll the input device, and further, to the first input 51 of the element AND NOT 5. When there is at least one request in the queue of the second order, adjusted for the dynamic correction of a maximum wait time, or without it, at the output 53 of the element AND NOT 5 is set low signal UB is nya, which will allow the transmission data selector-multiplexer 6. On the selective input 61 (S) selector-multiplexer 6 is set to low level (on the first signal outputs 0151-015Nall AB and the first signal output 341-34Nall water - high level), hence J-bit, where J=]log2N[, exit 65 of selector-multiplexer 6 and the J-bit output Code is subject to the service subscriber devices will be connected code received at J primary inputs 621-62N(inputs A1-AJ) selector-multiplexer 6 and the corresponding smallest number of AB and water containing the request signal from the queue of the second order, generated either with regard to dynamic correction maximum wait time, or without correction.

After satisfying the needs of the computing resource, the n-th subscriber removes the request signal from the corresponding n-th request information input device, a request input 011nthe corresponding AB (1n), and resets the counter 1.1nthe corresponding AB 1nn-th input "Reset" input "Reset" 013nthe corresponding AB 1n. At the first and second signal outputs 015nand 016nthe corresponding AB 1nand on the first and second signal outputs 34nI nthe corresponding water 3nwill be the levels.

If one or more queries in the current queue has reached the maximum waiting time or the maximum wait time has decreased as a result of the dynamic correction (control), overflow occurs counters 1.11-1.1Nthe corresponding AB 11-1N, forming on their inverted outputs overflowand , consequently, the formation of the first signal outputs 0151-015Nthe corresponding AB 11-1Nlow level signals, which corresponds to the procedure of the dynamic queue management - transfer requests in the queue of the first order in place, appropriate to their priorities (see Fig.7), in order to further their extraordinary, with respect to the queue of the second order, service.

While locked relevant trehochkovye elements And 1.31-1.3N(figure 4), prohibiting the flow of clock pulses to the counting input Z of respective counters 1.11-1.1NAB 11-1N. The combination of low level signals on the first signal outputs 0151-015Nthe corresponding AB 11-1Nforming a preliminary first order. Service requests from the preliminary queue of the first order is sudestada given their initial priorities and a dynamic correction of the maximum waiting time for each request from the queue of the first order.

The signals from the first signal outputs 0151-015NAB 11-1Ncome to the first signal input 311-31Nappropriate water 31-3N. In water 31-3Nis the decryption procedure, additional comparison and control new, introduced in the dynamics of process control services differently prioritised customer computing system, the K-bit code, determining a new value (boundary) maximum waiting time of service for each request to a specific subscriber in priority queues of the first order. Similarly, the decryption procedure and correction time waiting for requests from the queue of the second order, registers comparison-correction maximum wait time 3.21-3.2NWater 31-3Ncarry out additional checks (comparison) facilities request with original and newly commissioned maximum wait time service to the queue of the first order and form on its first signal outputs 3.21-4-3 .2N4 and the first signal output 341-34Nsubscriber controllers time 31-3Nthe low level signals, the combination of which finally forms a queue of the first order. As in the case of all of the second order, the position request signal in OK is nachalnoy queue of the first order is determined by its initial priority request signal, received from the subscriber with the lowest number has the highest priority (see Fig.6).

Thus, the first signal output 341-34Nsubscriber controllers time 31-3Nare the pings to the queue of the first order, based on a dynamic correction of a maximum wait time of service.

The pings to the queue of the first order, based on a dynamic correction of a maximum wait time of service, from the first signal outputs 341-34Nsubscriber controllers time 31-3Ncome on inverted inputs 811-81Nthe first priority encoder 8. While generating code corresponding to the lowest number of AB and water containing the request signal from the queue of the first order, is the first priority encoder 8 in the same way as for the queue of the second order. At the request in the queue of the first order their extraordinary, in relation to the request queue of the second order, the service is provided by a high signal at the output 72 of the first N-Vodolaga element AND-NOT 7, which, acting on the selective entrance 64 (log S) selector-multiplexer 6, commutes with J-bit output 65 of the selector-multiplexer 6 and the J-bit output Code subject to Cust service is NTA" device code, submitted to J secondary inputs 631-63N(inputs B1-BJ) selector-multiplexer 6 and the corresponding smallest number of AB and water containing the request signal from the queue of the first order. The high signal at the output 72 of the first N-Vodolaga element AND-NOT 7 will be up until the turn of the first order there is at least one request.

After the liberation of the resource allocated in the interests of another subscriber request from the queue of the first order (beyond the initial waiting time, or with expired reduced during the correction of standby time), every n-th subscriber removes the request signal from the request input 011nthe corresponding AB (1n) and resets counter 1.1nthe corresponding AB 1nn-th input "Reset" input "Reset" 013nAB 1n. This presupposes the establishment of a high level at the outputcounter 1.1nthe corresponding AB 1nthat, in turn, causes the installation on the first and second signal outputs 015nand 016nthis AB 1nand on the first and second signal outputs 34nand 35nthe corresponding water 3nhigh levels. This allows the device after execution of all requests that have expired (corrected or not corrected) time is waiting to eat go to service incoming, or waiting requests in the order determined by the logic device.

Thus, in the framework of the service differently prioritised customer requests real - multifunctional, complex, and managed computing systems operating under conditions of continuous dynamics of transitions differently prioritised requests and other influencing factors, the ongoing N≥2 identical subscriber controllers time 31-3Nand the main controller timeout 11 decryption and dynamic correction values (limits) maximum waiting time of service for each request, is the increased likelihood of service users. This result is due to receive the first 341-34Nand second 351-35Nthe signal outputs of the subscriber controllers time 31-3Nsignals of requests in the queue, respectively, the first, or second order, adjusted as of the dynamics of control actions or external factors and time-varying current requirements of the subscribers.

Analysis of the principle of operation of the claimed device shows the obvious fact that along with stored and described in the prototype opportunities to reduce service time of complex queries and povyshayushchego, the device is able to provide users with the resource system in the conditions inherent in the real process of functioning of computer systems - when in the dynamics of the operation of the managed computing system objectively change over time not only the properties of the system and the environment, but also the requirements to the quality and timeliness of service.

This device provides the increased likelihood of service users in the conditions inherent in the real process of functioning of a computer system in terms of continuous dynamics of transitions differently prioritised requests and taking into account influencing factors that significantly extends the application of the device, extends the functionality of the subsystems mass service in the framework of data exchange systems and local area networks, where the claimed device service differently prioritised customer computing system will be used.

SOURCES of INFORMATION

1. Olifer VG, olifer N.A. Computer network. Principles, technologies and protocols. - SPb.: Peter, 1999. - 672 S.

2. Wilson E. Monitoring and network analysis. - M.: LORI, 2002. - 350 S.

3. Blognow L.L., Ignatenkov VG, V.E. Kuznetsov and other networks: architecture, technology, standardization, Ed. Say the and. - M.: Radio and communication, 2004. - 208 S.

4. Kurnosov VI, Likhachev A. M. the Methodology of design research and quality management of complex technical systems telecommunication. - SPb.: TIREX, 1998. - 496 S.

5. Evlanov L.G. Control of dynamic systems. - M.: Nauka, 1979. - 432 S.

1. The maintenance unit differently prioritised customer computing system containing N≥2 subscriber units, a generator of clock pulses, the element OR the element AND-NOT, the selector is a multiplexer, the first and second N-input elements AND IS NOT, first and second priority encoders, and J-bit, where J=]log2N[, output selector-multiplexer is a J-bit access Code subject to the service subscriber devices, the generator output clock pulses is connected to the clock inputs of each of the N subscriber units, a request inputs and K-bit input Code maximum wait time" of each of the N subscriber units, where≥2 - bit code maximum wait time of service requests that are appropriate N of query inputs and N K-bit input Code, the maximum time-out" device, the inputs of the "Zeroing" of each of the N subscriber units are the corresponding N inputs to "zero" the device, each of the N inputs of the first and second N-vchodove elements AND IS NOT connected to the N inverted inputs respectively of the first and second priority encoders, inverted outputs of the first and second N-vchodove elements AND IS NOT connected respectively to the second and first inputs of the OR element, the output of which is connected to the second input element AND the first input of which is polled input device, the output element AND IS NOT connected to the inverse allows the input of the selector is a multiplexer and is directly addressable by the output device, the control input of the selector-multiplexer connected to the second input element OR each of the J inverted outputs of the first and second priority encoders connected to the corresponding J primary inputs and corresponding J secondary inputs of the selector-multiplexer, characterized in that what additional introduced N≥2 identical subscriber controllers time intended for decryption, an additional comparison and control K-bit code, determining a new value for the maximum time waiting for service for each request to a specific subscriber, and the main controller time-out, designed for dynamic correction values maximum wait time of service for each request of any one of the N subscribers computing system, and the n-th, where n=1, 2,..., N, the inverse input of the first priority encoder connected to the first signal output ((N+1)-n)th subscriber controller time, n is the inverse input of the second priority encoder connected to the second signal output ((N+1)n)-th subscriber controller time the first and second signal outputs of the n-th subscriber unit connected respectively to the first and second signal inputs of the n-th subscriber controller time-bit correction input of the n-th subscriber unit is connected to the K-bit test input of the n-th subscriber controller time and connected to the n-th K-bit output of the main controller timeout, N K-bit inputs which are the corresponding N-bit inputs Adjust the maximum time-out" device.

2. The device according to claim 1, characterized in that the subscriber controller time consists of a decoder corrected code maximum wait time and register comparison-correction maximum wait time, and the K-bit input decoder corrected code maximum wait time is a K-bit test input subscriber controller of time, the primary and secondary test outputs of the decoder corrected code maximum wait time connected respectively to the primary and secondary test inputs register comparison-correction maximum wait time, the first and second signal inputs of which are respectively the first and second signal inputs of the subscriber controller time, the first and second signals is performance communications outputs case comparison-correction maximum wait time are respectively the first and second signal outputs subscriber controller time.

3. The device according to claim 1, characterized in that the main controller time-out consists of the recording element time-out and storage element of the new time-out value, and N K-bit inputs of the recording element time-out are the corresponding N-bit inputs of the main controller timeout, N K-bit outputs of the recording element time-out is connected to the corresponding N-bit inputs of the storage element of the new time-out value, N K-bit outputs which are the corresponding N-bit output of the main controller timeout.

4. The device according to claim 1, wherein the subscriber unit comprises a meter, inverter, Tregubova element And correction of the register, and the inverted enable input of the account counter is a challenge entry subscriber unit and connected to the second input Tregubova element And to the input of the inverter, the K-bit primary input adjustment register is a K-bit input Code maximum wait time" subscriber unit, the K-bit secondary input adjustment register is a K-bit correction input of the subscriber unit, To output the correction register is connected to the corresponding To the information inputs of accounts is Chica, the reset input of the counter is input to "zero" the subscriber unit, the inverted output of the counter is connected to the first input Tregubova element And is the first signal output of the subscriber unit, the third input Tregubova element is a clock input of the subscriber unit, the output Tregubova element And connected to the counting input of the counter, the output of the inverter is the second signal output, the subscriber unit.



 

Same patents:

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: 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: 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: 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

The invention relates to computing and is used in automatic control systems of technological processes

The invention relates to computing, and in particular to a device priority, and can be used to control access to multiple subscribers to the shared resource

The invention relates to the field of computer technology, in particular to a device priority service requests

The invention relates to systems and methods for displaying information on remote computers

The invention relates to the field of computer technology, in particular to a device priority service requests

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!