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" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 20
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ł:
Installation and testing the lofar software on ACC Cyfronet cluster Prometheus
Autorzy:
Kuligowska, Elżbieta
Czuchry, Maciej
Chyży, Krzysztof
Kundera, Tomasz
Roskowiński, Carole
Dzielak, Marta A.
Powiązania:
https://bibliotekanauki.pl/articles/305460.pdf
Data publikacji:
2019
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
astronomy
imaging
radio astronomy
parallel calculations
LOFAR
Opis:
We present the actual status and the most important issues related to the installation of the data reduction LOFAR software on high power computer Prometheus located in ACC Cyfronet. We refer to the software itself as well its practical use cases in the context of the scientific tool and the detailed installation/testing methodology. We address most typical challenges and problems that occurred during our attempts to set up the complete and ready-to-use LOFAR environment (including not only programs, but also libraries, scripts and other additional tools) on non-standard (cluster-type) computing system. The result of these works is then briey summarized. We also discuss the is- sues related to LOFAR documentation, maintenance, distribution and further development. Finally, we propose some future improvements.
Źródło:
Computer Science; 2019, 20 (2); 165-177
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Parallel patterns for agent-based evolutionary computing
Autorzy:
Stypka, J.
Anielski, P.
Mentel, S.
Krzywicki, D.
Turek, W.
Byrski, A.
Kisiel-Dorohinicki, M.
Powiązania:
https://bibliotekanauki.pl/articles/305684.pdf
Data publikacji:
2016
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
agent-based computing
functional programming
parallel pattern
Opis:
Computing applications such as metaheuristics-based optimization can greatly benefit from multi-core architectures available on modern supercomputers. In this paper, we describe an easy and efficient way to implement certain population-based algorithms (in the discussed case, multi-agent computing system) on such runtime environments. Our solution is based on an Erlang software library which implements dedicated parallel patterns. We provide technological details on our approach and discuss experimental results.
Źródło:
Computer Science; 2016, 17 (1); 83-98
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Comparison of multi-frontal and alternating direction parallel hybrid memory iGRM direct solver for non-stationary simulations
Autorzy:
Woźniak, Maciej
Bukowska, Anna
Powiązania:
https://bibliotekanauki.pl/articles/1839249.pdf
Data publikacji:
2020
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
isogeometric finite element method
integration
shared memory
parallel
Opis:
Three-dimensional isogeometric analysis (IGA-FEM) is a modern method for simulation. The idea is to utilize B-splines or NURBS basis functions for both computational domain descriptions and engineering computations. Refined isogeometric analysis (rIGA) employs a mixture of patches of elements with B-spline basis functions and C 0 separators between them. This enables a reduction in the computational cost of direct solvers. Both IGA and rIGA come with challenging sparse matrix structures that are expensive to generate. In this paper, we show a hybrid parallelization method using hybrid-memory parallel machines. The two-level parallelization includes the partitioning of the computational mesh into sub-domains on the first level (MPI) and loop parallelization on the second level (OpenMP). We show that the hybrid parallelization of the integration reduces the contribution of this phase significantly. We compare the multi-frontal solver and alternating direction solver, including the integration and the factorization phases.
Źródło:
Computer Science; 2020, 21 (4); 419-439
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Implementing graph representation model for parallel and distributed systems using Erlang
Autorzy:
Petrov, I.
Powiązania:
https://bibliotekanauki.pl/articles/305754.pdf
Data publikacji:
2016
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
graphs representation
parallel systems
distributed systems
clusters
Erlang
Opis:
This paper describes a new model of graph representation using the Erlang actor model. Benefits of using lightweight processes instead of traditional passive data structures are given. Examples of using this model are shown. The experimental part gives two examples of using early implementations of the offered model. As a conclusion, an analysis of applicability for tasks from different branches of science is given.
Źródło:
Computer Science; 2016, 17 (1); 99-120
1508-2806
2300-7036
Pojawia się w:
Computer Science
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ł:
The comparison of parallel sorting algorithms implemented on different hardware platforms
Autorzy:
Żurek, D.
Pietroń, M.
Wielgosz, M.
Wiatr, K.
Powiązania:
https://bibliotekanauki.pl/articles/305317.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
parallel algorithms
GPU
OpenMP
CUDA
sorting networks
merge-sort
Opis:
Sorting is a common problem in computer science. There are a lot of well-known sorting algorithms created for sequential execution on a single processor. Recently, many-core and multi-core platforms have enabled the creation of wide parallel algorithms. We have standard processors that consist of multiple cores and hardware accelerators, like the GPU. Graphic cards, with their parallel architecture, provide new opportunities to speed up many algorithms. In this paper, we describe the results from the implementation of a few different parallel sorting algorithms on GPU cards and multi-core processors. Then, a hybrid algorithm will be presented, consisting of parts executed on both platforms (a standard CPU and GPU). In recent literature about the implementation of sorting algorithms in the GPU, a fair comparison between many core and multi-core platforms is lacking. In most cases, these describe the resulting time of sorting algorithm executions on the GPU platform and a single CPU core.
Źródło:
Computer Science; 2013, 14 (4); 679-691
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Novel approach for big data classification based on hybrid parallel dimensionality reduction using spark cluster
Autorzy:
Ali, Ahmed Hussein
Abdullah, Mahmood Zaki
Powiązania:
https://bibliotekanauki.pl/articles/305766.pdf
Data publikacji:
2019
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
big data
dimensionality reduction
parallel processing
Spark
PCA
LDA
Opis:
The big data concept has elicited studies on how to accurately and efficiently extract valuable information from such huge dataset. The major problem during big data mining is data dimensionality due to a large number of dimensions in such datasets. This major consequence of high data dimensionality is that it affects the accuracy of machine learning (ML) classifiers; it also results in time wastage due to the presence of several redundant features in the dataset. This problem can be possibly solved using a fast feature reduction method. Hence, this study presents a fast HP-PL which is a new hybrid parallel feature reduction framework that utilizes spark to facilitate feature reduction on shared/distributed-memory clusters. The evaluation of the proposed HP-PL on KDD99 dataset showed the algorithm to be significantly faster than the conventional feature reduction techniques. The proposed technique required >1 minute to select 4 dataset features from over 79 features and 3,000,000 samples on a 3-node cluster (total of 21 cores). For the comparative algorithm, more than 2 hours was required to achieve the same feat. In the proposed system, Hadoop’s distributed file system (HDFS) was used to achieve distributed storage while Apache Spark was used as the computing engine. The model development was based on a parallel model with full consideration of the high performance and throughput of distributed computing. Conclusively, the proposed HP-PL method can achieve good accuracy with less memory and time compared to the conventional methods of feature reduction. This tool can be publicly accessed at https://github.com/ahmed/Fast-HP-PL.
Źródło:
Computer Science; 2019, 20 (4); 411-429
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of projection-based interpolation algorithm for non-stationary problem
Autorzy:
Woźniak, M.
Paszyński, M.
Powiązania:
https://bibliotekanauki.pl/articles/305799.pdf
Data publikacji:
2016
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
L-shape
h-adaptivity
parallel
L2 projection
non-stationary
Opis:
In this paper, we present a solver for non-stationary problems using L 2 projec- tion and h -adaptations. The solver utilizes the Euler time integration scheme for time evolution mixed with projection-based interpolation techniques for solving the L 2 projection problem at every time step. The solver is tested on the model problem of a heat transfer in an L-shape domain. We show that our solver delivers linear computational cost at every time step.
Źródło:
Computer Science; 2016, 17 (3); 297-319
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Comcutejs:a Web browser based platform for large-scale computations
Autorzy:
Dębski, R.
Krupa, T.
Majewski, P
Powiązania:
https://bibliotekanauki.pl/articles/305741.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
volunteer computing
parallel computations
large-scale computations
augmented cloud computing
Opis:
The paper presents a new, cost effective,volunteer computing based platform. It utilizes volunteers’web browsers as computational nodes. The computational tasks are delegated to the browsers and executed in the background (independently of any user interface scripts) making use of the HTML5 web workers technology. The capabilities of the platform hale been proved by experiments performer in a wide range of numbers of computational nodes (1–400).
Źródło:
Computer Science; 2013, 14 (1); 143-152
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dynamic tile free scheduling for code with acyclic inter-tile dependence graphs
Autorzy:
Bielecki, W.
Skotnicki, P.
Powiązania:
https://bibliotekanauki.pl/articles/305409.pdf
Data publikacji:
2017
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
optimizing compilers
tiling
task scheduling
parallel computing
dependence graph
data locality
Opis:
Free scheduling is a task ordering technique under which instructions are executed as soon as their operands become available. Coarsening the grain of computations under the free schedule, by means of using groups of loop nest statement instances (tiles) in place of single statement instances, increases the locality of data accesses and reduces the number of synchronization events, and as a consequence improves program performance. The paper presents an approach for code generation that allows for the free schedule for tiles of arbitrarily nested affine loops at run-time. The scope of the applicability of the introduced algorithms is limited to tiled loop nests whose inter-tile dependence graphs are cycle-free. The approach is based on the polyhedral model. Results of experiments with the PolyBench benchmark suite, demonstrating significant tiled code speed-up, are discussed.
Źródło:
Computer Science; 2017, 18 (2); 195-216
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
One-dimensional fully automatic h-adaptive isogeometric finite element method package
Autorzy:
Lipski, P.
Paszyński, M
Powiązania:
https://bibliotekanauki.pl/articles/305563.pdf
Data publikacji:
2016
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
finite element method
isogeometric analysis
parallel computing
h-adaptivity
B-splines
Opis:
his paper deals with an adaptive finite element method originally developed by Prof. Leszek Demkowicz for hierarchical basis functions. In this paper, we investigate the extension of the adaptive algorithm for isogeometric analysis performed with B-spline basis functions. We restrict ourselves to h-adaptivity, since the polynomial order of approximation must be fixed in the isogeometric case. The classical variant of the adaptive FEM algorithm, as delivered by the group of Prof. Demkowicz, is based on a two-grid paradigm, with coarse and fine grids (the latter utilized as a reference solution). The problem is solved independently over a coarse mesh and a fine mesh. The fine-mesh solution is then utilized as a reference to estimate the relative error of the coarse-mesh solution and to decide which elements to refine. Prof. Demkowicz uses hierarchical basis functions, which (though locally providing Cp−1 continuity) ensure only C0 on the interfaces between elements. The CUDA C library described in this paper switches the basis to B-spline functions and proposes a one-dimensional isogeometric version of the h-adaptive FEM algorithm to achieve global Cp−1 continuity of the solution.
Źródło:
Computer Science; 2016, 17 (4); 439-459
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Using erlang in research and education in a technical university
Autorzy:
Petrov, I.
Alexeyenko, A.
Ivanova, G.
Powiązania:
https://bibliotekanauki.pl/articles/305254.pdf
Data publikacji:
2018
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
parallel programming
distributed programming
teaching
graph theory
concurrency
recursion
survey
functional programming
Opis:
This paper addresses the problem of using functional programming (FP) languages for research and educational purposes. In order to identify the problems associated with the use of FP languages such as Erlang, an experiment consisting of two surveys was performed. The first survey was anonymous and aimed at establishing whether the participants prefer object-oriented or functional coding. The second one was a survey made after the students finished an Erlang course. The results of these two surveys demonstrate that functional programming is underrated with no apparent reasons. Possible steps to address this problem are suggested.
Źródło:
Computer Science; 2018, 19 (3); 333-343
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Comparing parallel programming environments for the joint inversion of geoelectrical data
Porównanie równoległych środowisk obliczeniowych na przykładzie inwersji połączonej danych elektrycznych
Autorzy:
Pięta, A.
Bała, J.
Powiązania:
https://bibliotekanauki.pl/articles/305630.pdf
Data publikacji:
2009
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
obliczenia równoległe
zagadnienie odwrotne
metody geoelektryczne
parallel computing
inverse problem
geoelectrical methods
Opis:
The article presents the comparison of the implementation of the inverse problem in geoelectrical methods in two different parallel computational environments. Combination of Monte Carlo method and Multistart algorithm was applied in the inversion process. Parallelization was done by fine grain decomposition. Execution time, speed-up and efficiency received for parallel algorithms in both computational environments were presented and analyzed.
W artykule przedstawiono porównanie równoległej implementacji zagadnienia odwrotnego dla metod geoelektrycznych w dwóch różnych środowiskach obliczeniowych. Do rozwiązania zadania odwrotnego użyto algorytmu Monte Carlo – Multistart. W przypadku równoległej realizacji zastosowano drobnoziarnistą dekompozycję inwersji danych geoelektrycznych. Analizowano czas, przyśpieszenie i efektywność algorytmu równoległego w dwóch różnych środowiskach obliczeniowych.
Źródło:
Computer Science; 2009, 10; 85-95
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A parallel algorithm of icsym forcomplexsymmetric linear systems in quantum chemistry
Autorzy:
Zhang, Y.
Lv, Q.
Xiao, M.
Xie, G.
Breitkopf, P.
Powiązania:
https://bibliotekanauki.pl/articles/305677.pdf
Data publikacji:
2018
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
complex symmetric linear systems
parallel computing
improved conjugate gradient-type iterative algorithm (ICSYM)
Opis:
Computational effort is a common issue for solving large-scale complex symmetric linear systems, particularly in quantum chemistry applications. In order to alleviate this problem, we propose a parallel algorithm of improved conjugate gradient-type iterative (ICSYM). Using three-term recurrence relation and or- thogonal properties of residual vectors to replace the tridiagonalization process of classical CSYM, which allows to decrease the degree of the reduce-operator from two to one communication at each iteration and to reduce the amount of vector updates and vector multiplications. Several numerical examples are implemented to show that high performance of proposed improved version is obtained both in convergent rate and in parallel efficiency.
Źródło:
Computer Science; 2018, 19 (4); 385-401
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 20

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