Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "parallel computing" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 66
Tytuł:
Parallel computing in a network of workstations
Autorzy:
Ogrodowczyk, R.
Murawski, K.
Powiązania:
https://bibliotekanauki.pl/articles/1954092.pdf
Data publikacji:
2004
Wydawca:
Politechnika Gdańska
Tematy:
parallel computing
clusters
parallel-processing systems
Opis:
In this paper we describe a few architectures and software for parallel-processing computers. We have tested a cluster constructed with the use of MPI. All tests have been performed for one- and two-dimensional magneto-hydrodynamic plasma. We have concluded from the results of these tests that a simple problem should be run in a sequential node, as its execution time does not essentially decrease with the number of processors used. At the same time, the execution time of a complex problem decreases significantly with the number of processors. In the case of two-dimensional plasma the acceleration factor has reached the value of 3.7 with the use of 10 processors.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2004, 8, 3; 327-332
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A mobile robot navigation with use of CUDA parallel architecture
Autorzy:
Siemiątkowska, B.
Szklarski, J.
Gnatowski, M.
Borkowski, A.
Węclewski, P.
Powiązania:
https://bibliotekanauki.pl/articles/384808.pdf
Data publikacji:
2011
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
navigation
neural network
parallel computing
Opis:
In this article we present a navigation system of a mobile robot based on parallel calculations. It is assumed that the robot is equipped with a 3D laser range scanner. The system is essentially based on a dual grid-object, where labels are attached to detected objects (such maps can be used in navigation based on semantic information). We use a classical SMPA (Sense - Model - Plan - Act) architecture for navigation, however, some steps concerning object detection, planning and localization are parallelized in order to speed up the entire process. The CUDA (Compute Unified Device Architecture) technology allows us to execute our algorithms on many processing units with use of a inexpensive graphics card which makes it possible to apply the proposed navigation system in a real time.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2011, 5, 3; 79-84
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
FPGA-based multi-core processor
Autorzy:
Wójcik, W.
Długopolski, J.
Powiązania:
https://bibliotekanauki.pl/articles/305333.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
microprocessor
FPGA
parallel computing
block cipher
Opis:
The paper presents the results of investigations concerning the possibility of using programm able logic devices (FPGA) to build virtual multi-core processors dedicated specifically towards particular applications.The paper shows the designed architecture of amulti-core processor specialized to perform a particular task, and it discusses its computational efficiency depending on the number of cores used.An evaluation of the results is also discussed.
Źródło:
Computer Science; 2013, 14 (3); 459-474
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Obliczenia równoległe w MATLAB-ie
Parallel computing with MATLAB
Autorzy:
Mrozek, B.
Powiązania:
https://bibliotekanauki.pl/articles/276902.pdf
Data publikacji:
2011
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
Matlab
obliczenia równoległe
MATLAB
parallel computing
Opis:
MATLAB jest językiem wysokiego poziomu do obliczeń technicznych oraz interaktywnym środowiskiem przeznaczonym do projektowania algorytmów, analizy i wizualizacji danych oraz obliczeń numerycznych. Do MATLAB-a wbudowano operacje na wektorach, macierzach i tablicach, które tworzą matematyczną podstawę do obliczeń naukowych i technicznych. Pozwala to na szybsze tworzenie i wykorzystywanie algorytmów obliczeniowych - niż przy użyciu tradycyjnych języków (C, Fortran), gdyż przy realizacji zadań na niskim poziomie nie ma potrzeby deklarowania zmiennych, ich typów i adresów. Obliczenia równoległe pozwalają realizować na komputerach wielordzeniowych, wieloprocesorowych i klastrach, zadania intensywne numerycznie i z dużą ilością danych. W artykule opisano możliwości wykonywania obliczeń równoległych w środowisku MATLAB v. 7.11 (R2010b) z wykorzystaniem jego bibliotek Parallel Computing Toolbox v.5.0 oraz MATLAB Distributed Computing Server v.5.0.
MATLAB is a high-level technical computing language and interactive environment for algorithm development, data visualization, data analysis, and numeric computation. The MATLAB language supports the vector and matrix operations that are fundamental to engineering and scientific problems. It enables faster development and execution of algorithms than with traditional languages (C, FORTRAN) because it do not needs to perform low-level administrative tasks, such as declaring variables, specifying data types, and allocating memory. Parallel computing lets solve computationally and data-intensive problems using multicore processors, GPUs, and computer clusters. In this paper, the application of the parallel computing in MATLAB v. 7.11 (R2010b) environments has been described with using Parallel Computing Toolbox v.5.0 and MATLAB Distributed Computing Server Version 5.0.
Źródło:
Pomiary Automatyka Robotyka; 2011, 15, 2; 285-294
1427-9126
Pojawia się w:
Pomiary Automatyka Robotyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Design and performance evaluation of a Linux HPC cluster
Autorzy:
Pera, Donato
Powiązania:
https://bibliotekanauki.pl/articles/1955283.pdf
Data publikacji:
2018
Wydawca:
Politechnika Gdańska
Tematy:
high performance computing
parallel computing
cluster design
HPL
Opis:
In this paper after a short theoretical introduction about modern techniques used inparallel computing, we report a case study related to the design and development of the Caliban Linux High Performance Computing cluster, carried out by the author in the High Performance Computing Laboratory of the University of L’Aquila. Finally we report some performance evaluation tests related to the Caliban cluster performed using HPL (High-Performance Linpack) benchmarks.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2018, 22, 2; 113-123
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Java profiler based on byte code analysis and instrumentation for many-core hardware accelerators
Autorzy:
Pietroń, M.
Karwatowski, M.
Wiatr, K.
Powiązania:
https://bibliotekanauki.pl/articles/114614.pdf
Data publikacji:
2015
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
virtual machine
CUDA
GPU
profiling
parallel computing
Opis:
One of the most challenging issues in the case of many and multi-core architectures is how to exploit their potential computing power in legacy systems without a deep knowledge of their architecture. The analysis of static dependence and dynamic data dependences of a program run, can help to identify independent paths that could have been computed by individual parallel threads. The statistics of reusing the data and its size is also crucial in adapting the application in GPU many-core hardware architecture because of specific memory hierarchies. The proposed profiling system accomplishes static data analysis and computes dynamic dependencies for Java programs as well as recommends parts of source code with the highest potential for parallelization in GPU. Such an analysis can also provide starting point for automatic parallelization.
Źródło:
Measurement Automation Monitoring; 2015, 61, 7; 385-387
2450-2855
Pojawia się w:
Measurement Automation Monitoring
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heterogeneous GPU&CPU cluster for High Performance Computing in cryptography
Autorzy:
Marks, M.
Jantura, J.
Niewiadomska-Szynkiewicz, E.
Strzelczyk, P.
Góźdź, K.
Powiązania:
https://bibliotekanauki.pl/articles/305288.pdf
Data publikacji:
2012
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
parallel computing
HPC
clusters
GPU computing
OpenCL
cryptography
cryptanalysis
Opis:
This paper addresses issues associated with distributed computing systems and the application of mixed GPU&CPU technology to data encryption and decryption algorithms. We describe a heterogenous cluster HGCC formed by two types of nodes: Intel processor with NVIDIA graphics processing unit and AMD processor with AMD graphics processing unit (formerly ATI), and a novel software framework that hides the heterogeneity of our cluster and provides tools for solving complex scientific and engineering problems. Finally, we present the results of numerical experiments. The considered case study is concerned with parallel implementations of selected cryptanalysis algorithms. The main goal of the paper is to show the wide applicability of the GPU&CPU technology to large scale computation and data processing.
Źródło:
Computer Science; 2012, 13 (2); 63-79
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Development of LiDAR Data Classification Algorithms based on Parallel Computing using nVidia CUDA Technology
Autorzy:
Bratuś, R.
Musialik, P.
Prochaska, M.
Rzonca, A.
Powiązania:
https://bibliotekanauki.pl/articles/114693.pdf
Data publikacji:
2016
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
point cloud classification
parallel computing
normal vectors
Opis:
The paper presents an innovative data classification approach based on parallel computing performed on a GPGPU (General-Purpose Graphics Processing Unit). The results shown in this paper were obtained in the course of a European Commission-funded project: “Research on large-scale storage, sharing and processing of spatial laser data”, which concentrated on LIDAR data storage and sharing via databases and the application of parallel computing using nVidia CUDA technology. The paper describes the general requirements of nVidia CUDA technology application in massive LiDAR data processing. The studied point cloud data structure fulfills these requirements in most potential cases. A unique organization of the processing procedure is necessary. An innovative approach based on rapid parallel computing and analysis of each point’s normal vector to examine point cloud geometry within a classification process is described in this paper. The presented algorithm called LiMON classifies points into basic classes defined in LAS format: ground, buildings, vegetation, low points. The specific stages of the classification process are presented. The efficiency and correctness of LiMON were compared with popular program called Terrascan. The correctness of the results was tested in quantitive and qualitative ways. The test of quality was executed on specific objects, that are usually difficult for classification algorithms. The quantitive test used various environment types: forest, agricultural area, village, town. Reference clouds were obtained via two different methods: (1) automatic classification using Terrascan, (2) manually corrected clouds classified by Terrascan. The following coefficients for quantitive testing of classification correctness were calculated: Type 1 Error, Type 2 Error, Kappa, Total Error. The results shown in the paper present the use of parallel computing on a GPGPU as an attractive route for point cloud data processing.
Źródło:
Measurement Automation Monitoring; 2016, 62, 11; 387-393
2450-2855
Pojawia się w:
Measurement Automation Monitoring
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Graph centers used for stabilization of matrix factorizations
Autorzy:
Kabelíková, Pavla
Powiązania:
https://bibliotekanauki.pl/articles/744290.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
FETI
parallel computing
generalised inverse
graph center
Opis:
Systems of consistent linear equations with symmetric positive semidefinite matrices arise naturally while solving many scientific and engineering problems. In case of a "floating" static structure, the boundary conditions are not sufficient to prevent its rigid body motions.
Traditional solvers based on Cholesky decomposition can be adapted to these systems by recognition of zero rows or columns and also by setting up a well conditioned regular submatrix of the problem that is used for implementation of a generalised inverse. Conditioning such a submatrix seems to be related with detection of so called fixing nodes such that the related boundary conditions make the structure as stiff as possible. We can consider the matrix of the problem as an unweighted non-oriented graph. Now we search for nodes that stabilize the solution well-fixing nodes (such nodes are sufficiently far away from each other and are not placed near any straight line). The set of such nodes corresponds to one type of graph center.
Źródło:
Discussiones Mathematicae Graph Theory; 2010, 30, 2; 249-259
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Parallel solution of thermomechanical inverse problems for laser dieless drawing of ultra-thin wire
Autorzy:
Milenin, Andrij
Powiązania:
https://bibliotekanauki.pl/articles/38435900.pdf
Data publikacji:
2022
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
FEM
parallel computing
dieless drawing
thin wire
Opis:
The paper discusses the solving of inverse thermomechanical problems requiring a large number of FEM tasks with various boundary conditions. The study examined the case when all tasks have the same number of nodes, finite elements, and nodal connections. In this study, the speedup of the solution of the inverse problem is achieved in two ways: 1. The solution of all FEM tasks in parallel mode. 2. The use by all FEM tasks a common matrix with addresses of nonzero elements in the stiffness matrices. These algorithms are implemented in the own FEM code, designed to solve inverse problems of the hot metal forming. The calculations showed that developed code in parallel mode is effective for the number of tasks late than 0,7-0,9 of the number of available processors. Thus, at some point, it becomes effective to use a sequential solution to all tasks and to use a common matrix of addresses of nonzero elements in the stiffness matrix. The achieved acceleration at the optimal choice of the algorithm is 2–10 times compared with the classical multivariate calculations in the FEM. The paper provides an example of the practical application of the developed code for calculating the allowable processing maps for laser dieless drawing of ultra-thin wire from copper alloy by solving the thermomechanical inverse problem. The achieved acceleration made it possible to use the developed parallel code in the control software of the laboratory setup for laser dieless drawing.
Źródło:
Applied Computer Science; 2022, 18, 3; 42-53
1895-3735
2353-6977
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Mobile Cloud for Parallel and Distributed Green Computing
Autorzy:
Siwik, L.
Kala, D.
Godzik, M.
Turek, W.
Byrski, A.
Kisiel-Dorohinicki, M.
Powiązania:
https://bibliotekanauki.pl/articles/308894.pdf
Data publikacji:
2017
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
distributed computing
green computing
mobile cloud
mobile computing
parallel computing
pervasive computing
Opis:
Mobile Computing and Mobile Cloud Computing are the areas where intensive research is observed. The “mobility” landscape (devices, technologies, apps, etc.) evolves so fast that definitions and taxonomies do not catch up with so dynamic changes and there is still an ambiguity in definitions and common understanding of basic ideas and models. This research focuses on Mobile Cloud understood as parallel and distributed system consisting of a collection of interconnected (and virtualized) mobile devices dynamically provisioned and presented as one unified computing resource. This paper focuses on the mobile green computing cloud applied for parallel and distributed computations and consisting of outdated, abandoned or no longer needed smartphones being able to set up a powerful computing cluster. Besides showing the general idea and background, an actual computing cluster is constructed and its scalability and efficiency is checked versus the results obtained from the virtualized set of smartphones. All the experiments are performed using a dedicated software framework constructed in order to leverage the nolonger-needed smartphones, creating a computing cloud.
Źródło:
Journal of Telecommunications and Information Technology; 2017, 4; 60-70
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Processing optimization with parallel computing for the J-PET scanner
Autorzy:
Krzemień, W.
Bała, M.
Bednarski, T.
Białas, P.
Czerwiński, E.
Gajos, A.
Gorgol, M.
Jasińska, B.
Kamińska, D.
Kapłon, Ł.
Korcyl, G.
Kowalski, P.
Kozik, T.
Kubicz, E.
Niedźwiecki, S.
Pałka, M.
Raczyński, L.
Rudy, Z.
Rundel, O.
Sharma, N. G.
Silarski, M.
Słomski, A.
Stola, K.
Strzelecki, A.
Trybek, D.
Wieczorek, A.
Wiślicki, W.
Zieliński, M.
Zgardzińska, B.
Moskal, P.
Powiązania:
https://bibliotekanauki.pl/articles/148285.pdf
Data publikacji:
2015
Wydawca:
Instytut Chemii i Techniki Jądrowej
Tematy:
data aquisition system (DAQ)
parallel computing
TOF-PET
Opis:
The Jagiellonian Positron Emission Tomograph (J-PET) collaboration is developing a prototype time of flight (TOF)-positron emission tomograph (PET) detector based on long polymer scintillators. This novel approach exploits the excellent time properties of the plastic scintillators, which permit very precise time measurements. The very fast fi eld programmable gate array (FPGA)-based front-end electronics and the data acquisition system, as well as low- and high-level reconstruction algorithms were specially developed to be used with the J-PET scanner. The TOF-PET data processing and reconstruction are time and resource demanding operations, especially in the case of a large acceptance detector that works in triggerless data acquisition mode. In this article, we discuss the parallel computing methods applied to optimize the data processing for the J-PET detector. We begin with general concepts of parallel computing and then we discuss several applications of those techniques in the J-PET data processing.
Źródło:
Nukleonika; 2015, 60, No. 4, part 1; 745-748
0029-5922
1508-5791
Pojawia się w:
Nukleonika
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of Machine Learning Process Using Parallel Computing
Autorzy:
Grzeszczyk, Michał K.
Powiązania:
https://bibliotekanauki.pl/articles/102525.pdf
Data publikacji:
2018
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
parallel computing
machine learning
perceptron
neural networks
OpenMP
Opis:
The aim of this paper is to discuss the use of parallel computing in the supervised machine learning processes in order to reduce the computation time. This way of computing has gained popularity because sequential computing is often insufficient for large scale problems like complex simulations or real time tasks. After presenting the foundations of machine learning and neural network algorithms as well as three types of parallel models, the author briefly characterized the development of the experiments carried out and the results obtained. The experiments on image recognition, ran on five sets of empirical data, prove a significant reduction in calculation time compared to classical algorithms. At the end, possible directions of further research concerning parallel optimization of calculation time in the supervised perceptron learning processes were shortly outlined.
Źródło:
Advances in Science and Technology. Research Journal; 2018, 12, 4; 81-87
2299-8624
Pojawia się w:
Advances in Science and Technology. Research Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wybrane zagadnienia przetwarzania równoległego i rozproszonego oraz klastrów komputerowych
Autorzy:
Chaładyniak, D.
Powiązania:
https://bibliotekanauki.pl/articles/91258.pdf
Data publikacji:
2010
Wydawca:
Warszawska Wyższa Szkoła Informatyki
Tematy:
klastry komputerowe
przetwarzanie równoległe
przetwarzanie rozproszone
cluster computing
parallel computing
telecommunications networks
Opis:
W artykule przedstawiono wprowadzenie do zagadnień przetwarzania równoległego. Wyjaśniono jego ideę oraz zaprezentowano najpopularniejsze klasyfikacje. Przybliżono pojęcie przetwarzania rozproszonego we współczesnych sieciach teleinformatycznych. Przedstawiono wybrane implementacje klastrów komputerowych.
The article presents the introduction to parallel computing. It explains the idea and presents the most popular classifications. It also explains the concept of distributed processing in today’s telecommunications networks. It presents selected cluster computing implementations.
Źródło:
Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki; 2010, 4, 4; 41-53
1896-396X
2082-8349
Pojawia się w:
Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Parallel Graded-Mesh FDTD Algorithm for Human–Antenna Interaction Problems
Autorzy:
Catarinucci, L.
Tarricone, L.
Powiązania:
https://bibliotekanauki.pl/articles/89960.pdf
Data publikacji:
2009
Wydawca:
Centralny Instytut Ochrony Pracy
Tematy:
numerical dosimetry
FDTD
graded mesh
human–antenna exposure
parallel computing
Opis:
The finite difference time domain method (FDTD) is frequently used for the numerical solution of a wide variety of electromagnetic (EM) problems and, among them, those concerning human exposure to EM fields. In many practical cases related to the assessment of occupational EM exposure, large simulation domains are modeled and high space resolution adopted, so that strong memory and central processing unit power requirements have to be satisfied. To better afford the computational effort, the use of parallel computing is a winning approach; alternatively, subgridding techniques are often implemented. However, the simultaneous use of subgridding schemes and parallel algorithms is very new. In this paper, an easy-to-implement and highly-efficient parallel graded-mesh (GM) FDTD scheme is proposed and applied to human–antenna interaction problems, demonstrating its appropriateness in dealing with complex occupational tasks and showing its capability to guarantee the advantages of a traditional subgridding technique without affecting the parallel FDTD performance.
Źródło:
International Journal of Occupational Safety and Ergonomics; 2009, 15, 1; 45-52
1080-3548
Pojawia się w:
International Journal of Occupational Safety and Ergonomics
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 66

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