Порівняльний аналіз результатів HDL-моделювання квазіоптимальних і регулярних топологій мереж на кристалі
The analysis of quasi-optimal and regular topologies of networks-on-chip by their synthesis and HDL-simulation is performed. The simulation results and resource costs comparison show the effectiveness of quasi-optimal topologies in the design of networks with the number of nodes and connecting lines which cannot be achieved when using typical regular topologies.
The article gives a brief description of NoC simulator NoCTweak, based on SystemC. Mesh NoC simulation shows that the central location of "hot spots" allows up to 9% reduction in the delay of packets, up to 15.2% – in energy consumption for each packet transmission and up to 19.5% increase of the network capacity.
The comparative analysis of different approaches to modeling of networks on chip (SoC) is provided in the article. The basic directions of exploratory research topics of SoC are defined and it is shown that modeling, analysis and simulation of SoC are basical to conduct other researches.
The typical approaches to modeling of the SoC and examples of their applications, advantages and disadvantages are characterized. They are: 1) analytical modeling (obvious approach, which does not require the use of special computer-aided design, but the analysis of such models is difficult because of their complexity and non-linearity behavior of SoC); 2) high‑level simulation (applicable to most destinations of SoC research, where there is no reference to the hardware implementation and it is necessary to get the quick simulation results with sufficient accuracy); 3) low-level HDL-modeling (it has a high accuracy, model adjustability and the possibility to synthesize the SoC, but requires a lot of time for the development of models and simulation).
The use of SystemC language for modeling SoC that enables to reduce defects and combine the advantages of low-level and high-level approaches is proposed. Modeling with SystemC is a universal approach applicable to all areas of exploratory research on the SoC.
The different approaches to the optimization of network communications subsystem on a chip are considered. The mesh and pseudo-optimal topologies with 8 and 9 nodes using System Verilog library Netmaker are modelled. It is shown, that mesh topologies of rectangular form are less efficient, than square ones; pseudo-optimal topologies have a higher threshold of saturation compared to the mesh and they have no restrictions on the number of nodes. Figs: 3. Ref.: 8 titles.
The main advantages and disadvantages of classical topologies of networks on chip (NoC) are considered. The algorithm for finding optimal topologies in accordance with the restrictions on the diameter and maximum degree of optimization on the number of connections and the average distance proposed and implemented in software. The optimized topologies for the NoCs with the number of nodes between 6 and 10 synthesized. Figs: 3. Ref.: 8 titles. Tables: 1.
A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.
Generalized error-locating codes are discussed. An algorithm for calculation of the upper bound of the probability of erroneous decoding for known code parameters and the input error probability is given. Based on this algorithm, an algorithm for selection of the code parameters for a specified design and input and output error probabilities is constructed. The lower bound of the probability of erroneous decoding is given. Examples of the dependence of the probability of erroneous decoding on the input error probability are given and the behavior of the obtained curves is explained.
Event logs collected by modern information and technical systems usually contain enough data for automated process models discovery. A variety of algorithms was developed for process models discovery, conformance checking, log to model alignment, comparison of process models, etc., nevertheless a quick analysis of ad-hoc selected parts of a journal still have not get a full-fledged implementation. This paper describes an ROLAP-based method of multidimensional event logs storage for process mining. The result of the analysis of the journal is visualized as directed graph representing the union of all possible event sequences, ranked by their occurrence probability. Our implementation allows the analyst to discover process models for sublogs defined by ad-hoc selection of criteria and value of occurrence probability
The Handbook of CO₂ in Power Systems' objective is to include the state-of-the-art developments that occurred in power systems taking CO₂ emission into account. The book includes power systems operation modeling with CO₂ emissions considerations, CO₂ market mechanism modeling, CO₂ regulation policy modeling, carbon price forecasting, and carbon capture modeling. For each of the subjects, at least one article authored by a world specialist on the specific domain is included.
Let G be a semisimple algebraic group whose decomposition into the product of simple components does not contain simple groups of type A, and P⊆G be a parabolic subgroup. Extending the results of Popov , we enumerate all triples (G, P, n) such that (a) there exists an open G-orbit on the multiple flag variety G/P × G/P × . . . × G/P (n factors), (b) the number of G-orbits on the multiple flag variety is finite.
I give the explicit formula for the (set-theoretical) system of Resultants of m+1 homogeneous polynomials in n+1 variables