RUS  ENG
Full version
PEOPLE

Podlazov Viktor Sergeevich

Publications in Math-Net.Ru

  1. Group computing in non-blocking system area networks

    Program Systems: Theory and Applications, 16:5 (2025),  3–42
  2. Performance and fault tolerance of the ideal system network via additional parallelity

    Program Systems: Theory and Applications, 16:3 (2025),  41–68
  3. Distributed ALUs based on photonic switches

    Program Systems: Theory and Applications, 15:2 (2024),  3–19
  4. Multichannel non-blocking system area network with direct channels

    Program Systems: Theory and Applications, 14:3 (2023),  115–138
  5. Multichannel non-blocking system area network with direct channels

    Program Systems: Theory and Applications, 13:4 (2022),  47–76
  6. Non-blocking fault-tolerant dual photon switches with high scalability

    Probl. Upr., 2021, no. 5,  70–87
  7. Non-blocking fault-tolerant two-stage dual photon switches

    Probl. Upr., 2021, no. 4,  82–92
  8. Two-stage dual photon switches in an extended scheme basis

    Probl. Upr., 2021, no. 1,  69–81
  9. Optimum multidimensional tori based on low-port routers and hubs

    Probl. Upr., 2020, no. 5,  56–64
  10. Fault-tolerant non-blocking three-dimensional sparse hypercube

    Probl. Upr., 2020, no. 3,  59–69
  11. Expanding the capabilities of the Angara system area network

    Probl. Upr., 2020, no. 2,  47–56
  12. Conflict-free self-routing for a three-dimensional complete multiring

    Probl. Upr., 2018, no. 4,  54–60
  13. Conflict-free self-routing for three-dimensional generalized hypercube

    Probl. Upr., 2018, no. 3,  26–32
  14. Extended multiring with incremented diameter

    Probl. Upr., 2017, no. 4,  54–58
  15. Internal parallelism of system-area networks with incremental diameter

    Probl. Upr., 2017, no. 3,  43–48
  16. A Comparison of System Area Networks: Generalized Extended Multiring vs Flattened Butterfly

    Probl. Upr., 2016, no. 3,  65–71
  17. Topological reserves of flattened networks

    Vestn. YuUrGU. Ser. Vych. Matem. Inform., 5:2 (2016),  84–94
  18. Extended multiring of diameter 2

    Probl. Upr., 2015, no. 4,  35–40
  19. Small-diametr system area network composed from small-port routers

    UBS, 56 (2015),  201–210
  20. A new form of an unblockable network

    Avtomat. i Telemekh., 2014, no. 10,  139–152
  21. Boosting performance of multidimentional rings

    UBS, 51 (2014),  60–81
  22. System area networks latent reserves of supercomputers Blue Waters (IBM) and Gemini (CRAY)

    Program Systems: Theory and Applications, 4:3 (2013),  53–70
  23. Extended generaized hypercube as fail-safe system network for multiprocessor systems

    UBS, 45 (2013),  344–371
  24. Topological reserve of supercomputer interconnect

    UBS, 41 (2013),  395–423
  25. Parallel multipoint transfer “all-to-all” in the full distributed switch

    Probl. Upr., 2012, no. 6,  40–44
  26. Expanded block-diagrams for “ideal” system area networks

    Probl. Upr., 2012, no. 4,  45–51
  27. Distributed full switch as ideal system area network for multiprocessor computers

    UBS, 34 (2011),  92–116
  28. An invariant extension method for system area networks of multicore computational systems. An ideal system network

    Avtomat. i Telemekh., 2010, no. 12,  166–177
  29. Generalized Clos networks

    Avtomat. i Telemekh., 2009, no. 10,  158–171
  30. Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)

    Avtomat. i Telemekh., 2009, no. 2,  153–170
  31. Fault-tolerant expansion of system area networks in multiprocessor computer systems

    Avtomat. i Telemekh., 2008, no. 1,  162–170
  32. Generalized crossed rings – multirings with a decreased degree of node

    Avtomat. i Telemekh., 2007, no. 1,  175–186
  33. The method for homogeneous expansion of system area networks in multiprocessor computing systems

    Probl. Upr., 2007, no. 2,  22–27
  34. High dimensionality single-stage switches for multiprocessor and multimachine systems

    Probl. Upr., 2006, no. 6,  19–24
  35. Scalable multiring fixed plants for multi-processor computation systems

    Probl. Upr., 2006, no. 2,  50–57
  36. Regular flat networks for supercomputers

    Probl. Upr., 2006, no. 1,  26–31
  37. Crossed rings—small-diameter multiring switches and their 1-1-rearrangeability

    Avtomat. i Telemekh., 2004, no. 4,  153–165
  38. Nonblockability of Switches with the Cayley Graph Structure for Serial Transfer of Data Blocks. Generalized Hypercubes and Multidimensional Grids

    Avtomat. i Telemekh., 2003, no. 4,  153–166
  39. Arbitrary Group Permutations on Hypercube and Nonblocability of Cube-connected Cycles

    Avtomat. i Telemekh., 2002, no. 9,  153–163
  40. Nonblockability of Arbitrary Permutations on the Switch Structured as Multidimensional Grid

    Avtomat. i Telemekh., 2002, no. 8,  178–188
  41. The $p$–$p$ Rearrangement and Failure-Tolerance of Double $p$-ary Multirings and Generalized Hypercubes

    Avtomat. i Telemekh., 2002, no. 7,  138–148
  42. Nonlockability in Multirings and Hypercubes at Serial Transmission of Data Blocks

    Avtomat. i Telemekh., 2002, no. 6,  120–130
  43. Nonlocking Conditions for Multi-ring Switches and Generalized Hypercubes on Arbitrary Permutations. I. Generalized Hypercubes. Internodal Switching

    Avtomat. i Telemekh., 2001, no. 9,  114–124
  44. Nonlocking Conditions for Multi-ring Switches and Generalized Hypercubes on Arbitrary Permutations. I. Inter-nodal Switching. Multi-rings

    Avtomat. i Telemekh., 2001, no. 8,  118–126
  45. Queuing systems - Decentralized static conflict-free routing for ring switches and hypercubes

    Avtomat. i Telemekh., 1999, no. 4,  79–89
  46. Capacity of a Set of Ring Channels. II. Ring switches

    Avtomat. i Telemekh., 1996, no. 4,  162–172
  47. Capacity of a Set of Ring Channels. I. The Class of Ring Sets

    Avtomat. i Telemekh., 1996, no. 3,  135–144
  48. Analysis of methods for priority accessing of a local network with contrained message delivery time

    Avtomat. i Telemekh., 1989, no. 10,  175–186
  49. Data Credibility Estimation in Small Local Computing Networks

    Avtomat. i Telemekh., 1986, no. 12,  133–138
  50. Solution of computing problems in a common channel

    Avtomat. i Telemekh., 1984, no. 5,  144–153
  51. An accelerated algorithm of decentralized priority control of access to a common channel

    Avtomat. i Telemekh., 1980, no. 10,  162–170
  52. New algorithms of decentralized priority control of exchange data

    Avtomat. i Telemekh., 1979, no. 8,  161–171
  53. Decentralized priority-oriented control of periodic messages

    Avtomat. i Telemekh., 1977, no. 1,  137–145
  54. Extension of Control Functions in a Running Wave Data Exchange System

    Avtomat. i Telemekh., 1975, no. 8,  183–185

  55. The fifth international conference “Parallel computing and control problems”

    Probl. Upr., 2011, no. 1,  78–80
  56. Nonblocking ring switches. Redundancy and speed

    Avtomat. i Telemekh., 1999, no. 10,  153–163

© Steklov Math. Inst. of RAS, 2026