HIGHEFFICIENCY COMPUTING SYSTEMSAutomatic parallelization for hybrid system with dataflow accelerator Ark.V. Klimov, N.N. Levchenko, A.S. Okunev, A.L. Stempkovsky The data flow based computation model implemented as multicore coprocessor (accelerator) is considered. A method of automatic translation of sequential programs to the model’ language is presented. The resulting program being executed on the hybrid system shows large amount of parallelism. The method is feasible for affine programs and is based on building complete dataflow graph of the algorithm. Keywords: automatic parallelization, dataflow computation model, dataflow architecture, affine programs, value flow graph. Reconfigurable multipipeline computing systems for datadriven tasks of information handling and control solution I.A. Kalyaev, I.I. Levin The paper is dedicated to reconfigurable computing systems (RCS) based on the fieldprogrammable gate arrays (FPGA) construction principles. It is shown that various multipipeline computational structures providing ultimate processing rate at datadriven information handling and control tasks solution, and, as a consequence, a minor time of similar tasks solution in whole, can be constructed using such RCS. Examples of real RCS built on the FPGA basis are given, their high performance capacities are shown on specific cases. The RCS system software structure is represented, its basic organization, separate components functioning and interaction principles are depicted. Keywords: reconfigurable computing systems, fieldprogrammable gate arrays, multipipeline computational structures, software complex Localization of realtime systems computational resources A.I. Gryuntal Realtime systems with a finite (may be big) number of tasks are under consideration. A system is called resolvable if there exists a planning providing in time completion of each task. The paper deals with the localization problem: on what conditions thef in time completion problem of a system could be reduced to existence of a number of independent and local in time resolvable subsystems. Full subsystem is defined as a natural local planning object. It is proved that a system is uniquely represented as a union of a number of full subsystems and that a system is resolvable in case all full subsystems are resolvable. Keywords: real time systems, software, multitasking, planning, localization, full subsystem, resolvable systems. An Arima model for forecasting a values of network traffic Yu.A. Krukov, D.V. Chernyagin The predictability of network traffic is a significant interest in many domains such as congestion control, admission control, and network management. An accurate traffic prediction model should have the ability to capture prominent traffic characteristics, such as longrange dependence and selfsimilarity in the large time scale. In this paper the model ARIMA with minimal amount of parameters has been selected to accurate the traffic prediction. Also the procedure of the estimating of the parameters of the ARIMA model has been exhibited and compared the estimations of accurate the traffic prediction for the getting models. Keywords: traffic prediction, traffic modeling, ARIMA. DATA PROCESSINGEmpirical approach to edge detectors’ evaluation P.P. Koltsov The base of the empirical approach to edge detectors’ evaluation is the use of the special artificial images test set. A number of such image editor generated images are examined. The results of performance evaluation comparative study for the wellknown edge detectors Heitger, Canny, Rothwell, Black, Iverson, Smith are given. These results were gotten on the test images subjected to distortions. Keywords: edge detector, ground truth, sensitivity, specificity. The method of automatic generation of syntax segmentation rules using an ATN graph E.S. Manushkin, E.S. Klyshinsky The paper is devoted to description of an NLP method of automatic rules generation for syntax segmentation stage, going prior to the syntax analysis. There are sets of terminals and pair of terminals which are used for these purposes. Such terminals and pairs are starting chains inferenced from nonterminals. Keywords: syntax segmentation, rules generation, ATN. Adaptation problem of data warehouse K.V. Badmaeva A data warehouse is examined as an adaptation object. A general definition of data warehouse adaptation problem is formulated. The materialization of views is determined as a local adaptation problem. The heuristic algorithm of selection of views is proposed to be materializing in specialized data warehouse. The practical value of the algorithm is proved by the example of medicaldemographic data. Keywords: data warehouse, adaptation, view materialization. MATHEMATICAL MODELLINGApplication of simulation in control system of hot strip mill complex A.L. Genkin, I.V. Nikulina On the example of hot strip mill complex “furnasesmill” the results of simulation are resulted for development of algorithms and control system, providing the increase of the productivity of mill and reduction of energy saving on heating and rolling of metal. Keywords: Simulation, optimization, algorithms, systems, energy saving control.
