Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "supercomputer" wg kryterium: Temat


Wyświetlanie 1-3 z 3
Tytuł:
Software for calculation of noise maps implemented on supercomputer
Autorzy:
Czyżewski, A.
Szczodrak, M.
Powiązania:
https://bibliotekanauki.pl/articles/1943198.pdf
Data publikacji:
2009
Wydawca:
Politechnika Gdańska
Tematy:
noise map
supercomputer
road noise
Opis:
Investigation results relevant to the implementation of algorithms for calculation of noise maps are presented in this paper. The aim of implementing the algorithms on a computer cluster is explained. Selected implementation details of the software called Noise Propagation Model are described. The software interaction with the data acquisition system is presented. Noise maps obtained using the described software are presented. A comparison between the outcomes of the implemented models and the simulation results of a commercial program is presented. An analysis of the computation efficiency is described. A discussion concerning dynamic presentation of noise maps is also presented.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2009, 13, 4; 363-377
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tryton supercomputer capabilities for analysis of massive data streams
Autorzy:
Krawczyk, H.
Nykiel, M.
Proficz, J.
Powiązania:
https://bibliotekanauki.pl/articles/259474.pdf
Data publikacji:
2015
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
supercomputer
data streams
distributed systems
radio-telescope
satellite
Opis:
The recently deployed supercomputer Tryton, located in the Academic Computer Center of Gdansk University of Technology, provides great means for massive parallel processing. Moreover, the status of the Center as one of the main network nodes in the PIONIER network enables the fast and reliable transfer of data produced by miscellaneous devices scattered in the area of the whole country. The typical examples of such data are streams containing radio-telescope and satellite observations. Their analysis, especially with real-time constraints, can be challenging and requires the usage of dedicated software components. We propose a solution for such parallel analysis using the supercomputer, supervised by the KASKADA platform, which with the conjunction with immerse 3D visualization techniques can be used to solve problems such as pulsar detection and chronometric or oil-spill simulation on the sea surface.
Źródło:
Polish Maritime Research; 2015, 3; 99-104
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Torus-connected cycles: A simple and scalable topology for interconnection networks
Autorzy:
Bossard, A.
Kaneko, K.
Powiązania:
https://bibliotekanauki.pl/articles/330544.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
algorithm
routing
Hamiltonian method
supercomputer
parallel
algorytm
metoda Hamiltonowska
superkomputer
system równoległy
Opis:
Supercomputers are today made up of hundreds of thousands of nodes. The interconnection network is responsible for connecting all these nodes to each other. Different interconnection networks have been proposed; high performance topologies have been introduced as a replacement for the conventional topologies of recent decades. A high order, a low degree and a small diameter are the usual properties aimed for by such topologies. However, this is not sufficient to lead to actual hardware implementations. Network scalability and topology simplicity are two critical parameters, and they are two of the reasons why modern supercomputers are often based on torus interconnection networks (e.g., Fujitsu K, IBM Sequoia). In this paper we first describe a new topology, torus-connected cycles (TCCs), realizing a combination of a torus and a ring, thus retaining interesting properties of torus networks in addition to those of hierarchical interconnection networks (HINs). Then, we formally establish the diameter of a TCC, and deduce a point-to-point routing algorithm. Next, we propose routing algorithms solving the Hamiltonian cycle problem, and, in a two dimensional TCC, the Hamiltonian path one. Correctness and complexities are formally proved. The proposed algorithms are time-optimal.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 4; 723-735
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies