Repository logo
  • English
  • ไทย
  • Log In
    New user? Click here to register. Have you forgotten your password?
external-link-logo
  • Communities & Collections
  • All of AU-IR
  1. Home
  2. Browse by Author

Browsing by Author "Veselovsky, Gennady"

  • 0-9
  • A
  • B
  • C
  • D
  • E
  • F
  • G
  • H
  • I
  • J
  • K
  • L
  • M
  • N
  • O
  • P
  • Q
  • R
  • S
  • T
  • U
  • V
  • W
  • X
  • Y
  • Z

  • ก
  • ข
  • ฃ
  • ค
  • ฅ
  • ฆ
  • ง
  • จ
  • ฉ
  • ช
  • ซ
  • ฌ
  • ญ
  • ฎ
  • ฏ
  • ฐ
  • ฑ
  • ฒ
  • ณ
  • ด
  • ต
  • ถ
  • ท
  • ธ
  • น
  • บ
  • ป
  • ผ
  • ฝ
  • พ
  • ฟ
  • ภ
  • ม
  • ย
  • ร
  • ล
  • ว
  • ศ
  • ษ
  • ส
  • ห
  • ฬ
  • อ
  • ฮ
Results Per Page
Sort Options
  • Item
    Analysis of some combinatorial properties of a 2D torus
    (Assumption University, 2008) Veselovsky, Gennady ; Assumption University. Vincent Mary School of Science and Technology
  • Item
    An approach for exploring combinatorial properties of R-path omega Interconnection networks
    (Assumption University, 2010) Veselovsky, Gennady ; Assumption University. Vincent Mary School of Science and Technology
    Multiple path multistage interconnection networks as compared to their parental one path cube-type networks provide better permutation capability and offer such important property as fault-tolerance. In this paper an approach for investigation permuting ability of R-path Omega networks is proposed. The analysis as concerned to arbitrary permutations is done with the help of number theory methods. As to BPC (bit-permute-complement) 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.
  • Item
    Decomposing BPC Permutations into Semi- Permutations for Crosstalk Avoidance in Multistage Optical Interconnection Networks
    ( 2015) Veselovsky, Gennady ; Jain, Ritu
    This paper introduces a simple O(N) algorithm that decomposes BPC (bit-permutecomplement) permutations into semi-permutations 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 crosstalk-free realization of a semi-permutation, 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
    The experimental arrangement for the control method validation in the fault-tolerant Benes network
    (Assumption University, 2004) Veselovsky, Gennady ; Karim, Mohammad H, jt. auth. ; Mahboo, Malih, jt. auth. ; Assumption University. Vincent Mary School of Science and Technology
  • Item
    On Permuting Capability of A Binary Hypercube and Its Prospects as A Noc In The Architecture Of Peta- Scale Supercomputers
    ( 2018-05-25) Veselovsky, Gennady
    In this paper necessary and sufficient conditions of blocking occurrence in a synchronous binary hypercube under order-dimension routing, which is also known as e-cube 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 e-cube routing are given. A heuristic approach for blocking avoidance, when routing those regular permutations which are not admissible to a hypercube under classical e-cube routing, is proposed. A method for increasing the fraction of admissible permutations with asynchronous mode of packet switching in a low-dimensional 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 (network-on-chip) topology in future supercomputers.
  • Item
    Some distinctive features of the engineering education in Russia compared to other countries
    (Assumption University, 2008) Veselovsky, Gennady ; Assumption University. Vincent Mary School of Science and Technology
  • Item
    A study of the permutation capability of a modified omega network
    (Bangkok : Assumption University, 2003) Phanthip Thaiyoo ; Veselovsky, Gennady

Contact Us

St. Gabriel's Library (Hua Mak Campus)
592/3 Soi Ramkhamhaeng 24, Ramkhamhaeng Rd., Hua Mak, Bang Kapi, Bangkok 10240, Thailand

(662) 3004543-62 Ext. 3403

library@au.edu

The Cathedral of Learning Library (Suvarnabhumi Campus)
88 Moo 8 Bang Na-Trad Km. 26 Bang Sao Thong, Samut Prakan 10570, Thailand

(662) 7232024

library@au.edu

Website:  www.library.au.edu