Browsing by Author "Veselovsky, Gennady"
Results Per Page
Sort Options

Item

ItemAn approach for exploring combinatorial properties of Rpath omega Interconnection networks(Assumption University, 2010) Veselovsky, Gennady ; Assumption University. Vincent Mary School of Science and TechnologyMultiple path multistage interconnection networks as compared to their parental one path cubetype networks provide better permutation capability and offer such important property as faulttolerance. In this paper an approach for investigation permuting ability of Rpath Omega networks is proposed. The analysis as concerned to arbitrary permutations is done with the help of number theory methods. As to BPC (bitpermutecomplement) permutations admissibility check to the aforementioned type of networks, the modified window method is proposed. The aforementioned method reduces drastically the time complexity of admissibility check. The results of computational experiments with applying the technique to some permutations of BPC class are given.

ItemDecomposing BPC Permutations into Semi Permutations for Crosstalk Avoidance in Multistage Optical Interconnection Networks( 2015) Veselovsky, Gennady ; Jain, RituThis paper introduces a simple O(N) algorithm that decomposes BPC (bitpermutecomplement) permutations into semipermutations for avoiding crosstalk when realizing them in N × N optical multistage interconnection networks (OMINs). Crosstalk means that two optical signals, sharing an optical switch, undergo a kind of undesired coupling. A semipermutation is a partial permutation which meets the requirement for each switch in an input and output stages of the network to be used with only one optical signal at a time. It provides avoiding crosstalk in the first and the last stages of a network and creates the potential for crosstalkfree realization of a semipermutation, and finally the whole permutation in question. The algorithm is based on employment the periodicity of appearing 1’s and 0’s in columns of transition matrices for BPC permutations.

Item

ItemOn Permuting Capability of A Binary Hypercube and Its Prospects as A Noc In The Architecture Of Peta Scale Supercomputers( 20180525) Veselovsky, GennadyIn this paper necessary and sufficient conditions of blocking occurrence in a synchronous binary hypercube under orderdimension routing, which is also known as ecube routing, are expressed mathematically with the use of congruence notion from number theory. If a permutation does not cause blockings it is said to be admissible under chosen routing algorithm. Examples of applying the approach for checking some regular permutations admissibility to a hypercube under ecube routing are given. A heuristic approach for blocking avoidance, when routing those regular permutations which are not admissible to a hypercube under classical ecube routing, is proposed. A method for increasing the fraction of admissible permutations with asynchronous mode of packet switching in a lowdimensional hypercube is given. The results of analysis of a hypercube permuting capability carried out with using our methods is an added reason for choosing hypercube as a NoC (networkonchip) topology in future supercomputers.

Item

Item