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


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ł:
Productivity of a low-budget computer cluster applied to overcome the n-body problem
Autorzy:
Nowicki, Tomasz
Gregosiewicz, Adam
Łagodowski, Zbigniew
Powiązania:
https://bibliotekanauki.pl/articles/1956026.pdf
Data publikacji:
2021
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
computer clusters
parallel computing
n-body problem
klastry komputerowe
obliczenia równoległe
problem n-body
Opis:
The classical n-body problem in physics addresses the prediction of individual motions of a group of celestial bodies under gravitational forces and has been studied since Isaac Newton formulated his laws. Nowadays the n-body problem has been recognized in many more fields of science and engineering. Each problem of mutual interaction between objects forming a dynamic group is called as the n-body problem. The cost of the direct algorithm for the problem is O(n2) and is not acceptable from the practical point of view. For this reason cheaper algorithms have been developed successfully reducing the cost to O(nln(n)) or even O(n). Because further improvement of the algorithms is unlikely to happen it is the hardware solutions which can still accelerate the calculations. The obvious answer here is a computer cluster that can preform the calculations in parallel. This paper focuses on the performance of a low-budget computer cluster created on ad hoc basis applied to n-body problem calculation. In order to maintain engineering valuable results a real technical issue was selected to study. It was Discrete Vortex Method that is used for simulating air flows. The pre-sented research included writing original computer code, building a computer cluster, preforming simulations and comparing the results.
Źródło:
Applied Computer Science; 2021, 17, 4; 100-109
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Robust simulation method of complex technical transport systems
Autorzy:
Szpytko, Janusz
Salgado Duarte, Yorlandys
Powiązania:
https://bibliotekanauki.pl/articles/2098142.pdf
Data publikacji:
2021
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
overhead cranes
Monte Carlo simulation
variance reduction
parallel computing
suwnice
symulacja Monte Carlo
redukcja wariancji
obliczenia równoległe
Opis:
In the optimization of technical systems focused on a specific functional purpose (reliability, safety, and availability) with the use of simulation methods, an important parameter is the digital simulation time of the research subject. With the complexity of the issue, the digital simulation time increases. The aim of the article is to present a method (combination of parallel computing and variance reduction techniques) of reducing the computer simulation time of the research technical object. An example of the application of the developed method was presented as a result of an experiment conducted for decision making and control processes aimed at optimizing the process of operating overhead cranes in critical conditions. In this paper, selecting parallel batch jobs computation and stratified sampling, we exponentially decreased the simulation time, finding fast and practical solutions and eliminating the time constraint in the search of solutions.
Źródło:
Transport Problems; 2021, 16, 2; 101--112
1896-0596
2300-861X
Pojawia się w:
Transport Problems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Improving the TSAB algorithm through parallel computing
Autorzy:
Rudy, Jarosław
Pempera, Jaroslaw
Smutnicki, Czesław
Powiązania:
https://bibliotekanauki.pl/articles/229535.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
job shop scheduling
parallel computing
operations research
taboo search
TSAB algorithm
coarse-grained parallelization
Opis:
In this paper, a parallel multi-path variant of the well-known TSAB algorithm for the job shop scheduling problem is proposed. Coarse-grained parallelization method is employed, which allows for great scalability of the algorithm with accordance to Gustafon’s law. The resulting P-TSAB algorithm is tested using 162 well-known literature benchmarks. Results indicate that P-TSAB algorithm with a running time of one minute on a modern PC provides solutions comparable to the ones provided by the newest literature approaches to the job shop scheduling problem. Moreover, on average P-TSAB achieves two times smaller percentage relative deviation from the best known solutions than the standard variant of TSAB. The use of parallelization also relieves the user from having to fine-tune the algorithm. The P-TSAB algorithm can thus beused as module in real-life production planning systems or as a local search procedure in other algorithms. It can also provide the upper bound of minimal cycle time for certain problems of cyclic scheduling.
Źródło:
Archives of Control Sciences; 2020, 30, 3; 411-435
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficiency analysis of parallel computing applied to auto-tuning of state feedback speed controller for PMSM drive
Autorzy:
Szczepański, Rafał
Tarczewski, Tomasz
Grzesiak, Lech M.
Powiązania:
https://bibliotekanauki.pl/articles/376463.pdf
Data publikacji:
2019
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
parallel computing
Artificial Bee Colony
PMSM
state feedback
controller
MATLAB/Simulink
Opis:
Nowadays the simulation is inseparable part of researcher's work. Its computation time may significantly exceed the experiment time. On the other hand, multi-core processors are common in personal computers. These processors can be used to reduce computation time by using parallel computing on multiple cores. The most popular software applied to simulate behavior of the plant is MATLAB/Simulink. A single simulation of Simulink model cannot be computed by multiple cores, but there are many engineering problems, that require a multiple simulation of the same model with different parameters. In these problems, the parallel computing can be employed to decrease the overall simulation time. In this paper the parallel computing is used to speed-up the auto-tuning process of state feedback speed controller for PMSM drive. In order to obtain the optimal coefficients of the controller, an Artificial Bee Colony optimization algorithm is employed.
Źródło:
Poznan University of Technology Academic Journals. Electrical Engineering; 2019, 100; 145-156
1897-0737
Pojawia się w:
Poznan University of Technology Academic Journals. Electrical Engineering
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ł
Tytuł:
An efficient approach for view selection for data warehouse using tree mining and evolutionary computation
Autorzy:
Thakare, A.
Deshpande, P.
Powiązania:
https://bibliotekanauki.pl/articles/305413.pdf
Data publikacji:
2018
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
database management systems
data warehousing and data mining
query optimization
graph mining
algorithms for parallel computing
evolutionary computations
genetic algorithms
Opis:
The selection of a proper set of views to materialize plays an important role in database performance. There are many methods of view selection that use different techniques and frameworks to select an efficient set of views for materialization. In this paper, we present a new efficient scalable method for view selection under the given storage constraints using a tree mining approach and evolutionary optimization. The tree mining algorithm is designed to determine the exact frequency of (sub)queries in the historical SQL dataset. The Query Cost model achieves the objective of maximizing the performance benefits from the final view set that is derived from the frequent view set given by the tree mining algorithm. The performance benefit of a query is defined as a function of query frequency, query creation cost, and query maintenance cost. The experimental results show that the proposed method is successful in recommending a solution that is fairly close to an optimal solution.
Źródło:
Computer Science; 2018, 19 (4); 431-455
1508-2806
2300-7036
Pojawia się w:
Computer Science
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ł:
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ł:
Równoległa realizacja przykładowego algorytmu genetycznego z wykorzystaniem akceleratorów GPU
Autorzy:
Ratuszniak, P.
Stasiak, A.
Łańcucki, R.
Powiązania:
https://bibliotekanauki.pl/articles/118416.pdf
Data publikacji:
2018
Wydawca:
Politechnika Koszalińska. Wydawnictwo Uczelniane
Tematy:
algorytm genetyczny
programowanie równoległe
akceleracja obliczeń
akceleratory GPU
CUDA
problem komiwojażera
genetic algorithm
parallel programming
computing acceleration
GPU
travelling salesman problem
Opis:
W artykule zaprezentowano praktyczną implementację aplikacji rozwiązującej przykładowy algorytm genetyczny z wykorzystaniem akceleratorów GPU. W tym przypadku zdecydowano się na rozwiązanie za pomocą algorytmu genetycznego typowego problemu optymalizacyjnego, jakim jest problem komiwojażera. Dodatkowo w celu wykorzystania mocy karty graficznej w tworzonej aplikacji wykorzystano technologię programowania na karcie graficznej – technologię Nvidia CUDA.
The paper presents a practical implementation of a local desktop application that solves exemplary genetic algorithm with the use of GPU accelerators. In this case decided with the use of genetic algorithm to solve typical optimization problem which is travelling salesman problem. Additionally used Nvidia CUDA programming technology in order to use power of GPU in created application.
Źródło:
Zeszyty Naukowe Wydziału Elektroniki i Informatyki Politechniki Koszalińskiej; 2018, 13; 63-78
1897-7421
Pojawia się w:
Zeszyty Naukowe Wydziału Elektroniki i Informatyki Politechniki Koszalińskiej
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ł:
Fuzzy method and neural network model parallel implementation of multi-layer neural network based on cloud computing for real time data transmission in large offshore platform
Autorzy:
Zhang, H..
Qin, W.
Powiązania:
https://bibliotekanauki.pl/articles/259083.pdf
Data publikacji:
2017
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
parallel implementation
multi-layer neural network
cloud computing
Opis:
With the rapid development of electronic technology, network technology and cloud computing technology, the current data is increasing in the way of mass, has entered the era of big data. Based on cloud computing clusters, this paper proposes a novel method of parallel implementation of multilayered neural networks based on Map-Reduce. Namely in order to meet the requirements of big data processing, this paper presents an efficient mapping scheme for a fully connected multi-layered neural network, which is trained by using error back propagation (BP) algorithm based on Map-Reduce on cloud computing clusters (MRBP). The batch-training (or epoch-training) regimes are used by effective segmentation of samples on the clusters, and are adopted in the separated training method, weight summary to achieve convergence by iterating. For a parallel BP algorithm on the clusters and a serial BP algorithm on uniprocessor, the required time for implementing the algorithms is derived. The performance parameters, such as speed-up, optimal number and minimum of data nodes are evaluated for the parallel BP algorithm on the clusters. Experiment results demonstrate that the proposed parallel BP algorithm in this paper has better speed-up, faster convergence rate, less iterations than that of the existed algorithms.
Źródło:
Polish Maritime Research; 2017, S 2; 39-44
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Interpretable decision-tree induction in a big data parallel framework
Autorzy:
Weinberg, A. I.
Last, M.
Powiązania:
https://bibliotekanauki.pl/articles/330635.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
big data
parallel computing
mapreduce
decision trees
editing distance
tree similarity
zbiór danych
obliczenia równoległe
drzewa decyzyjne
odległość edycji
Opis:
When running data-mining algorithms on big data platforms, a parallel, distributed framework, such as MAPREDUCE, may be used. However, in a parallel framework, each individual model fits the data allocated to its own computing node without necessarily fitting the entire dataset. In order to induce a single consistent model, ensemble algorithms such as majority voting, aggregate the local models, rather than analyzing the entire dataset directly. Our goal is to develop an efficient algorithm for choosing one representative model from multiple, locally induced decision-tree models. The proposed SySM (syntactic similarity method) algorithm computes the similarity between the models produced by parallel nodes and chooses the model which is most similar to others as the best representative of the entire dataset. In 18.75% of 48 experiments on four big datasets, SySM accuracy is significantly higher than that of the ensemble; in about 43.75% of the experiments, SySM accuracy is significantly lower; in one case, the results are identical; and in the remaining 35.41% of cases the difference is not statistically significant. Compared with ensemble methods, the representative tree models selected by the proposed methodology are more compact and interpretable, their induction consumes less memory, and, as confirmed by the empirical results, they allow faster classification of new records.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 4; 737-748
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and 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ł:
The modular principles of parallel pipeline information processing
Modularne zasady równoległe potokowego przetwarzania informacji
Autorzy:
Selianinau, M.
Powiązania:
https://bibliotekanauki.pl/articles/103613.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
Tematy:
modular number system
modular arithmetic
modular computing structures
parallel data processing
pipeline mode
modularne systemy liczbowe
arytmetyka modularna
modularne struktury obliczeniowe
równoległe przetwarzanie informacji
tryb potokowy
Opis:
In the present paper, we deal with the methodology of implementation of the modular arithmetic algorithms using the parallel-pipeline residues summation blocks with respect to the bases of modular number system. These summation blocks are the main structural elements of high-speed modular operating devices, they provide high throughput performance of input data sets and are oriented to the wide application of VLSI chips.
W niniejszym artykule omówiono metodologię implementacji algorytmów arytmetyki modularnej przy wykorzystaniu równolegle potokowych bloków sumowania reszt w odniesieniu do podstaw modularnego systemu liczbowego. Te bloki sumujące są głównymi elementami strukturalnymi wysokowydajnych modularnych urządzeń obliczeniowych, one również zapewniają wysoką wydajność przepustowości zestawów danych wejściowych i są zorientowane na szerokie zastosowanie układów scalonych VLSI.
Źródło:
Prace Naukowe Akademii im. Jana Długosza w Częstochowie. Technika, Informatyka, Inżynieria Bezpieczeństwa; 2017, T. 5; 147-153
2300-5343
Pojawia się w:
Prace Naukowe Akademii im. Jana Długosza w Częstochowie. Technika, Informatyka, Inżynieria Bezpieczeństwa
Dostawca treści:
Biblioteka Nauki
Artykuł

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