• CONTACT
  • LAST ISSUE
  • IN PROGRESS
  • EARLY VIEW
  • ACCEPTED PAPERS
GET_pdf

Volume 26 (3) 2020, 69–75

Technology of Real-World Analyzers (TAUR) and its practical application

Jung Jarosław 1, Kiełbik Rafał 2, Hałagan Krzysztof 1, Polanowski Piotr 1, Sikorski Andrzej 3*

1 Department of Molecular Physics, Lodz University of Technology
Żeromskiego 116, 90-924 Łódź, Poland
2 Department of Electronics, Lodz University of Technology
Żeromskiego 116, 90-924 Łódź, Poland
3 Department of Chemistry, University of Warsaw
Pasteura 1, 02-093 Warsaw, Poland
*E-mail: sikorski@chem.uw.edu.pl
*phone: +(48 22) 552 6366

Received:

Received: 17 August 2020; revised: 4 September 2020; accepted: 7 September 2020; published online: 22 September 2020

DOI:   10.12921/cmst.2020.0000023

Abstract:

The article describes the most important details of the project for reconfigurable construction of dedicated electronic machines intended for performing analyses of phenomena that occur in multi-component systems containing at least several million mutually interacting elements. Devices built in the presented technology can be characterized by the use of reconfigurable integrated circuits, spatial construction ensuring scalability, a redundant panel system as well as specially developed data transmission and work control systems. Machines work in a parallel manner and can solve problems in various fields of science and technology by competing with the speed of data processing with the latest supercomputing systems. As an example, we present details of the ARUZ machine containing 26,000 FPGAs, which was made using this technology.

Key words:

Field Programmable Gate Array, molecular simulations, parallel data processing, Technology of Real-World Analyzers, topology of the network connections

References:

[1] P. Polanowski, J. Jung, R. Kiełbik, Special purpose parallel computer for modelling supramolecular systems based on the Dynamic Lattice Liquid model, Comput. Methods Sci. Technol. 16, 147–153 (2010).
[2] P. Polanowski, J. Jung, R. Kiełbik, A. Napieralski, K. Lichy, Od algorytmu dynamicznej cieczy sieciowej do dedykowanego komputera równoległego, Przegląd Elektrotechniczny 84, 69–73 (2008).
[3] J. Jung, R. Kiełbik, K. Rudnicki, P. Polanowski, Od algorytmu dynamicznej cieczy sieciowej do dedykowanego komputera równoległego II – maszyna mDLL, Przegląd Elektrotechniczny 93, 162–170 (2017).
[4] J. Jung, P. Polanowski, R. Kiełbik, K. Hałagan, W. Zatorski, J. Ułański, A. Napieralski, T. Pakuła, (a) RP Patent No. 223795 (30 September 2013), (b) EP Patent No. EP3079071-A (10 April 2015), (c) RP Patent No. 227250 (30 September 2013), (d) RP Patent No. 227249 (30 September 2013), (e) EP Patent No. EP3079066 (10 April 2015), (f) EP Patent App. No. 151630795, (g) EP Patent App. EP15163078.7, (h) RP Patent App. No. P.411913.
[5] J. Jung, R. Kiełbik, K. Rudnicki, K. Hałagan, P. Polanowski, A. Sikorski, From the Dynamic Lattice Liquid algorithm to the dedicated parallel computer – the mDLL Machine, Comput. Methods Sci. Technol. 24, 235–247 (2018).
[6] P. Polanowski, Implementacja sieciowych modeli cieczy i polimerów w symulacjach opartych na obliczeniach równoległych, PhD thesis, Lodz University of Technology (2002).
[7] T. Pakula, Simulations on the completely occupied lattice, [In:] Simulation Methods for Polymers, ed. by M. Kotelyanskii, D.N. Theodorou, Marcel Dekker, New York-Basel, 147–176 (2004).
[8] R. Kiełbik, K. Hałagan, W. Zatorski, J. Jung, J. Ułański, A. Napieralski, K. Rudnicki, P. Amrozik, G. Jabłoński, D. Stożek, P. Polanowski, Z. Mudza, J. Kupis, P. Panek, ARUZ – Large-scale, massively parallel FPGA-based Analyzer of Real Complex Systems, Comput. Phys. Commun. 232, 22–34 (2018).
[9] P. Polanowski, K. Hałagan, J. Pietrasik, J.K. Jeszka, K. Matyjaszewski, Growth of polymer brushes by “grafting from” via ATRP – Monte Carlo simulations, Polymer 130, 267–279 (2017).
[10] K. Hałagan, M. Banaszak, J. Jung, P. Polanowski, A. Sikorski, Polymer double brushes studied by Dynamic Lattice Liquid model driven by high-performance computing, submitted to Macromolecules.

  • JOURNAL MENU

    • AIMS AND SCOPE
    • EDITORS
    • EDITORIAL BOARD
    • NOTES FOR AUTHORS
    • CONTACT
    • IAN SNOOK PRIZES 2015
    • IAN SNOOK PRIZES 2016
    • IAN SNOOK PRIZES 2017
    • IAN SNOOK PRIZES 2018
    • IAN SNOOK PRIZES 2019
    • IAN SNOOK PRIZES 2020
    • IAN SNOOK PRIZES 2021
    • IAN SNOOK PRIZES 2024
  • GALLERY

    CMST_vol_30_1-2_2024_okladka_
  • LAST ISSUE

  • MANUSCRIPT SUBMISSION

    • SUBMIT A MANUSCRIPT
  • FUTURE ISSUES

    • ACCEPTED PAPERS
    • EARLY VIEW
    • Volume 31 (1) – in progress
  • ALL ISSUES

    • 2024
      • Volume 30 (3–4)
      • Volume 30 (1–2)
    • 2023
      • Volume 29 (1–4)
    • 2022
      • Volume 28 (4)
      • Volume 28 (3)
      • Volume 28 (2)
      • Volume 28 (1)
    • 2021
      • Volume 27 (4)
      • Volume 27 (3)
      • Volume 27 (2)
      • Volume 27 (1)
    • 2020
      • Volume 26 (4)
      • Volume 26 (3)
      • Volume 26 (2)
      • Volume 26 (1)
    • 2019
      • Volume 25 (4)
      • Volume 25 (3)
      • Volume 25 (2)
      • Volume 25 (1)
    • 2018
      • Volume 24 (4)
      • Volume 24 (3)
      • Volume 24 (2)
      • Volume 24 (1)
    • 2017
      • Volume 23 (4)
      • Volume 23 (3)
      • Volume 23 (2)
      • Volume 23 (1)
    • 2016
      • Volume 22 (4)
      • Volume 22 (3)
      • Volume 22 (2)
      • Volume 22 (1)
    • 2015
      • Volume 21 (4)
      • Volume 21 (3)
      • Volume 21 (2)
      • Volume 21 (1)
    • 2014
      • Volume 20 (4)
      • Volume 20 (3)
      • Volume 20 (2)
      • Volume 20 (1)
    • 2013
      • Volume 19 (4)
      • Volume 19 (3)
      • Volume 19 (2)
      • Volume 19 (1)
    • 2012
      • Volume 18 (2)
      • Volume 18 (1)
    • 2011
      • Volume 17 (1-2)
    • 2010
      • Volume SI (2)
      • Volume SI (1)
      • Volume 16 (2)
      • Volume 16 (1)
    • 2009
      • Volume 15 (2)
      • Volume 15 (1)
    • 2008
      • Volume 14 (2)
      • Volume 14 (1)
    • 2007
      • Volume 13 (2)
      • Volume 13 (1)
    • 2006
      • Volume SI (1)
      • Volume 12 (2)
      • Volume 12 (1)
    • 2005
      • Volume 11 (2)
      • Volume 11 (1)
    • 2004
      • Volume 10 (2)
      • Volume 10 (1)
    • 2003
      • Volume 9 (1)
    • 2002
      • Volume 8 (2)
      • Volume 8 (1)
    • 2001
      • Volume 7 (2)
      • Volume 7 (1)
    • 2000
      • Volume 6 (1)
    • 1999
      • Volume 5 (1)
    • 1998
      • Volume 4 (1)
    • 1997
      • Volume 3 (1)
    • 1996
      • Volume 2 (1)
      • Volume 1 (1)
  • DATABASES

    • AUTHORS BASE
  • CONTACT
  • LAST ISSUE
  • IN PROGRESS
  • EARLY VIEW
  • ACCEPTED PAPERS

© 2025 CMST