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

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 39
Tytuł:
A fine-grained parallel algorithm for the cyclic flexible job shop problem
Autorzy:
Bożejko, W.
Pempera, J.
Wodecki, M.
Powiązania:
https://bibliotekanauki.pl/articles/229531.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
job shop
cyclic scheduling
parallel algorithm
Opis:
In this paper there is considered a flexible job shop problem of operations scheduling. The new, very fast method of determination of cycle time is presented. In the design of heuristic algorithm there was the neighborhood inspired by the game of golf applied. Lower bound of the criterion function was used in the search of the neighborhood.
Źródło:
Archives of Control Sciences; 2017, 27, 2; 169-181
1230-2384
Pojawia się w:
Archives of Control Sciences
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ł:
A parallel block Lanczos algorithm and its implementation for the evaluation of some eigenvalues of large sparse symmetric matrices on multicomputers
Autorzy:
Guarracino, M. R.
Perla, F.
Zanetti, P.
Powiązania:
https://bibliotekanauki.pl/articles/908413.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
cluster architecture
symmetric block Lanczos algorithm
sparse matrices
parallel eigensolver
algorytm Lanczosa
macierze rzadkie
architektura klastrowa
Opis:
In the present work we describe HPEC (High Performance Eigenvalues Computation), a parallel software package for the evaluation of some eigenvalues of a large sparse symmetric matrix. It implements an efficient and portable Block Lanczos algorithm for distributed memory multicomputers. HPEC is based on basic linear algebra operations for sparse and dense matrices, some of which have been derived by ScaLAPACK library modules. Numerical experiments have been carried out to evaluate HPEC performance on a cluster of workstations with test matrices from Matrix Market and Higham’s collections. A comparison with a PARPACKroutine is also detailed. Finally, parallel performance is evaluated on random matrices, using standard parameters.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2006, 16, 2; 241-249
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A parallel decomposition algorithm for shortest path problem in large-size mesh networks
Równoległy algorytm dekompozycyjny dla problemu dróg najkrótszych w sieciach dużych rozmiarów typu krata
Autorzy:
Tarapata, Z.
Powiązania:
https://bibliotekanauki.pl/articles/210048.pdf
Data publikacji:
2010
Wydawca:
Wojskowa Akademia Techniczna im. Jarosława Dąbrowskiego
Tematy:
dekompozycyjny algorytm dróg najkrótszych
równoległy algorytm dróg najkrótszych
planowanie tras wielorozdzielczych
decomposition shortest paths algorithm
parallel shortest paths algorithm
multiresolution path planning
Opis:
The paper presents parallel approach for shortest path problem and it extends some decomposition shortest path algorithm (DSP). It is based on rectangular mesh graph of large size which may represent, e.g., network of streets in the city, network of squares of terrain (as a model of a battlefield). A method of parallelization DSP algorithm is proposed. The main advantage of the method is negligible communication between processors. Acceleration and effectiveness of the PDSP algorithm in a case of parallelization and without parallelization of some internal steps of the algorithm are defined and simulation results of these functions for two types of structure of parallel computation systems (hypercube and mesh) are shown. Moreover, some suggestions for further improvements in the PDSP algorithm are proposed.
W artykule opisano metodę zrównoleglenia pewnego algorytmu dekompozycyjnego wyznaczania dróg najkrótszych (DSP). Bazuje on na sieciach dużych rozmiarów o strukturze typu krata, które mogą reprezentować sieć dróg w mieście, sieć kwadratów podziału terenu w grach komputerowych. Zaproponowano metodę (PDSP) zrównoleglenia algorytmu DSP. Podstawową cechą proponowanej metody jest minimalizacja konieczności komunikacji między procesorami wykonującymi obliczenia równoległe. Oszacowano przyspieszenie i efektywność algorytmu równoległego w przypadku zrównoleglenia i niezrównoleglenia niektórych wewnętrznych kroków algorytmu, jako funkcję liczby procesorów równoległych oraz podano wyniki symulacji przebiegu wartości tych funkcji dla różnych wielkości sieci i dwóch typów struktur systemu obliczeń równoległych (hipersześcian i krata). Ponadto podano pewne sugestie, co do zwiększenia efektywności proponowanego algorytmu.
Źródło:
Biuletyn Wojskowej Akademii Technicznej; 2010, 59, 3; 295-306
1234-5865
Pojawia się w:
Biuletyn Wojskowej Akademii Technicznej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Adaptive threads co-operation schemes in a parallel heuristic algorithm for the vehicle routing problem with time windows
Adaptacyjne schematy kooperacji wątków w równoległym heurystycznym algorytmie dla problemu trasowania pojazdów z oknami czasowymi
Autorzy:
Nalepa, J.
Czech, Z. J.
Powiązania:
https://bibliotekanauki.pl/articles/375685.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
VRPTW
parallel algorithm
co-operation frequency
OpenMP interface
Opis:
The influence of the co-operation frequency of threads in a parallel heuristic algorithm to solve the vehicle routing problem with time windows on the accuracy of solutions is investigated. The accuracy of solutions is defined as their proximity to the best known solutions of Gehring and Homberger's benchmarking tests. Two adaptive co-operation schemes are proposed and experimentally evaluated.
Wyznaczanie tras dla pojazdów z oknami czasowymi (ang. vehicle routing problem with time windows) jest problemem optymalizacji dyskretnej należącym do klasy problemów NP-trudnych. Istnieją metody heurystyczne rozwiązywania problemu, pozwalające wyznaczyć w rozsądnym czasie rozwiązania nieoptymalne o koszcie bliskim kosztowi rozwiązania optymalnego, takie jak symulowane wyżarzanie, przeszukiwanie tabu, algorytmy genetyczne czy algorytmy memetyczne. Wprzypadku algorytmów dwustopniowych, w pierwszej fazie minimalizowana jest liczba tras, a w fazie drugiej całkowita przebyta odległość. Flota składa się z pojazdów o jednakowej, zdefiniowanej pojemności, która nie może zostać przekroczona, a obsługa klientów musi rozpocząć się w czasie trwania ich okien czasowych.
Źródło:
Theoretical and Applied Informatics; 2012, 24, 3; 191-203
1896-5334
Pojawia się w:
Theoretical and Applied Informatics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorithms of parallel calculations in task of tolerance ellipsoidal estimation of interval model parameters
Autorzy:
Dyvak, M.
Stakhiv, P.
Pukas, A.
Powiązania:
https://bibliotekanauki.pl/articles/201054.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
interval model
parameters identification
tolerance ellipsoidal estimation
parallel algorithm
Opis:
The methods of the tolerance ellipsoidal estimation for the tasks of synthesis of the tolerances to parameters of radio-electronic circuits and possibility of its parallelization are considered. These methods are the result of the task of estimation the solutions of an interval system of linear algebraic equations (ISLAE) which is built according to given criteria of optimality. The numerical algorithm is proposed for solving the tolerance ellipsoidal estimation tasks with a possibility of parallelization.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 1; 159-164
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Accurate and Robust Genetic Algorithm to Minimize the Total Tardiness in Parallel Machine Scheduling Problems
Autorzy:
Ramadan, Saleem Zeyad
Almasarwah, Najat
Abdelall, Esraa S.
Suer, Gursel A.
Albashabsheh, Nibal T.
Powiązania:
https://bibliotekanauki.pl/articles/27324201.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
identical parallel machines
accurate generic algorithm
robust generic algorithm
immigration
surrogate fitness function
vegetative reproduction
Opis:
This paper uses a Genetic Algorithm (GA) to reduce total tardiness in an identical parallel machine scheduling problem. The proposed GA is a crossover-free (vegetative reproduction) GA but used for four types of mutations (Two Genes Exchange mutation, Number of Jobs mutation, Flip Ends mutation, and Flip Middle mutation) to make the required balance between the exploration and exploitation functions of the crossover and mutation operators. The results showed that use of these strategies positively affects the accuracy and robustness of the proposed GA in minimizing the total tardiness. The results of the proposed GA are compared to the mathematical model in terms of the time required to tackle the proposed problem. The findings illustrate the ability of the propounded GA to acquire the results in a short time compared to the mathematical model. On the other hand, increasing the number of machines degraded the performance of the proposed GA.
Źródło:
Management and Production Engineering Review; 2023, 14, 4; 28--40
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Blocks for two-machines total weighted tardiness flow shop scheduling problem
Autorzy:
Bożejko, W.
Uchroński, M.
Wodecki, M.
Powiązania:
https://bibliotekanauki.pl/articles/202179.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
flow shop
two machine
due date
minimal costs
blocks of tasks
parallel algorithm
Opis:
The paper discusses a two-machine flow shop problem with minimization of the sum of tardiness costs, being a a generalization of the popular NP-hard single-machine problem with this criterion. We propose the introduction of new elimination block properties allowing for accelerating the operation of approximate algorithms of local searches, solving this problem and improving the quality of solutions determined by them.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2020, 68, 1; 31-41
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Control Strategy of Parallel Systems with Efficiency Optimisation in Switched Reluctance Generators
Autorzy:
Zan, Xiaoshu
Lin, Hang
Xu, Guanqun
Zhao, Tiejun
Gong, Yi
Powiązania:
https://bibliotekanauki.pl/articles/1956008.pdf
Data publikacji:
2021
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
switched reluctance generator
parallel system
efficiency optimization
differential evolution algorithm
Opis:
To solve motor heating and life shortening of parallel switched reluctance generator (SRG) induced by uneven output currents due to different external characteristics, we generally adopt current sharing control (CSC) to make each parallel generator undertake large load currents on average to improve the reliability of parallel power generation system. However, the method usually causes additional loss of power because it does not consider the efficiency characteristics of each parallel generator. Therefore, with the efficiency expression for the parallel system of SRG established and analysed, the control strategy based on differential evolution (DE) algorithm is proposed as a mechanism by which to enhance generating capacity and reliability of multi-machine power generation from the perspective of efficiency optimisation. We re-adjust the reference current of each parallel generator to transform the working point of each generator and implement the efficiency optimisation of parallel system. The performance of the proposed control method is evaluated in detail by the simulation and experiment, and comparison with traditional CSC is carried out as well.
Źródło:
Power Electronics and Drives; 2021, 6, 41; 61-74
2451-0262
2543-4292
Pojawia się w:
Power Electronics and Drives
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Flexible job shop problem - parallel tabu search algorithm for multi-GPU
Autorzy:
Bożejko, W.
Uchroński, M.
Wodecki, M.
Powiązania:
https://bibliotekanauki.pl/articles/229502.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
jobs scheduling
flexible manufacturing
parallel algorithm
discrete optimization
Opis:
In the paper we propose a new framework for the distributed tabu search algorithm designed to be executed with the use of a multi-GPU cluster, in which cluster of nodes are equipped with multicore GPU computing units. The proposed methodology is designed specially to solve difficult discrete optimization problems, such as a flexible job shop scheduling problem, which we introduce as a case study used to analyze the efficiency of the designed synchronous algorithm.
Źródło:
Archives of Control Sciences; 2012, 22, 4; 389-397
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
FPGA implementation of logarithmic versions of Baum-Welch and Viterbi algorithms for reduced precision hidden Markov models
Autorzy:
Pietras, M.
Klęsk, P.
Powiązania:
https://bibliotekanauki.pl/articles/201874.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
hidden Markov models
numerical stability
Viterbi algorithm
parallel architecture
field-programmable gate array
ukryte modele Markowa
stabilność numeryczna
Algorytm Viterbiego
architektura równoległa
Opis:
This paper presents a programmable system-on-chip implementation to be used for acceleration of computations within hidden Markov models. The high level synthesis (HLS) and “divide-and-conquer” approaches are presented for parallelization of Baum-Welch and Viterbi algorithms. To avoid arithmetic underflows, all computations are performed within the logarithmic space. Additionally, in order to carry out computations efficiently – i.e. directly in an FPGA system or a processor cache – we postulate to reduce the floating-point representations of HMMs. We state and prove a lemma about the length of numerically unsafe sequences for such reduced precision models. Finally, special attention is devoted to the design of a multiple logarithm and exponent approximation unit (MLEAU). Using associative mapping, this unit allows for simultaneous conversions of multiple values and thereby compensates for computational efforts of logarithmic-space operations. Design evaluation reveals absolute stall delay occurring by multiple hardware conversions to logarithms and to exponents, and furthermore the experiments evaluation reveals HMMs computation boundaries related to their probabilities and floating-point representation. The performance differences at each stage of computation are summarized in performance comparison between hardware acceleration using MLEAU and typical software implementation on an ARM or Intel processor.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 6; 935-946
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
GPU implementation of atomic fluid MD simulation.
Autorzy:
Dawid, Aleksander
Powiązania:
https://bibliotekanauki.pl/articles/2197547.pdf
Data publikacji:
2022
Wydawca:
Politechnika Gdańska
Tematy:
MD simulabon
GPU
atomic fluid
MD parallel algorithm
Opis:
A computer simulation of an atomic fluid on a GPU was implemented using the CUDA architecture. It was shown that the programming model for efficient numerical computing applications was changing with the development of the CUDA architecture. The introduction of the L2 cache decreased the latency between the global GPU memory and the registers. The performed MD simulation using the global memory and registers showed that the average acceleration relative to the CPU reached 80 times for single-precision calculations. Usually, the shared block memory gives much better results for this kind of calculation. We have found that using the shared memory gives acceleration over 116 times in comparison to the CPU. It is about 49% faster than using the global memory and registers. It is shown here that the performance of generally available graphics cards for double-precision calculations is significantly lower than for single-precision calculations. The recorded double-precision acceleration relative to the CPU in our experiment averaged 6 and 7 times for the global and shared memory, respectively. We performed these calculations on two different CUDA enable device systems.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2022, 26, 1; 25-37
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
GPU-based parallel algorithm of interaction induced light scatering simulation in fluids
Autorzy:
Dawid, Aleksander
Powiązania:
https://bibliotekanauki.pl/articles/1954464.pdf
Data publikacji:
2019
Wydawca:
Politechnika Gdańska
Tematy:
GPGPU
CUDA
interaction induced phenomena
many body correlation function
parallel algorithm
Opis:
We parallelized the sequential algorithm of the four-body correlation function if eachcombination of two pairs(i, j)and(k, l) was averaged over the time in a separate calculation thread. The generator of pairs used as the input for this algorithm was also parallelized and connected with the 4-body correlation function calculations. We used our algorithm to accelerate extremely intensive calculations of the 4-body polarizability anisotropy correlation functions,which were very important to estimate the interaction induced light scattering spectrum. The resulting C code was used to test our algorithm on Graphics Processing Units (GPUs) with the Compute Unified Device Architecture (CUDA) technology from NVIDIA®Corporation. Asa result, we achieved 12 times the acceleration of the 4-body correlation function calculations in comparison to the Central Processing Unit (CPU) core. The peak performance of the GPU calculations was registered at the level of 19 times faster than the CPU core. We also found thatacceleration depended on the memory consumption. In the single precision mode, the relative error between the CPU and GPU calculations was found to be within 0.1%
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2019, 23, 1; 5-17
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
GPU-based tuning of quantum-inspired genetic algorithm for a combinatorial optimization problem
Autorzy:
Nowotniak, R.
Kucharski, J.
Powiązania:
https://bibliotekanauki.pl/articles/201268.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
quantum-inspired genetic algorithm
evolutionary computing
meta-optimization
parallel algorithms
GPGPU
Opis:
This paper concerns efficient parameters tuning (meta-optimization) of a state-of-the-art metaheuristic, Quantum-Inspired Genetic Algorithm (QIGA), in a GPU-based massively parallel computing environment (NVidia CUDATMtechnology). A novel approach to parallel implementation of the algorithm has been presented. In a block of threads, each thread transforms a separate quantum individual or different quantum gene; In each block, a separate experiment with different population is conducted. The computations have been distributed to eight GPU devices, and over 400× speedup has been gained in comparison to Intel Core i7 2.93GHz CPU. This approach allows efficient meta-optimization of the algorithm parameters. Two criteria for the meta-optimization of the rotation angles in quantum genes state space have been considered. Performance comparison has been performed on combinatorial optimization (knapsack problem), and it has been presented that the tuned algorithm is superior to Simple Genetic Algorithm and to original QIGA algorithm.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 2; 323-330
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Identification of local elastic parameters in heterogeneous materials using a parallelized femu method
Autorzy:
Petureau, L.
Doumalin, P.
Bremand, F.
Powiązania:
https://bibliotekanauki.pl/articles/265841.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
elastyczność
algorytm genetyczny
obliczenia równoległe
identification
elasticity
heterogeneous materials
genetic algorithm
parallel computation
Opis:
In this work, we explore the possibilities of the widespread Finite Element Model Updating method (FEMU) in order to identify the local elastic mechanical properties in heterogeneous materials. The objective function is defined as a quadratic error of the discrepancy between measured fields and simulated ones. We compare two different formulations of the function, one based on the displacement fields and one based on the strain fields. We use a genetic algorithm in order to minimize these functions. We prove that the strain functional associated with the genetic algorithm is the best combination. We then improve the implementation of the method by parallelizing the algorithm in order to reduce the computation cost. We validate the approach with simulated cases in 2D.
Źródło:
International Journal of Applied Mechanics and Engineering; 2019, 24, 4; 140-156
1734-4492
2353-9003
Pojawia się w:
International Journal of Applied Mechanics and Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 39

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