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-12 z 12
    Tytuł:
    Parallel anisotropic mesh refinement with dynamic load balancing for transonic flow simulations
    Autorzy:
    Gepner, S.
    Majewski, J.
    Rokicki, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/202281.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    parallel CFD
    adaptation
    dynamic load balancing
    mesh refinement
    parallel efficiency
    CFD
    dostosowanie
    dynamiczne obciążenia
    wydajność
    modele siatkowe
    Opis:
    The present paper discusses an effective adaptive methods suited for use in parallel environment. An in-house, parallel flow solver based on the residual distribution method is used for the solution of flow problems. Simulation is parallelized based on the domain decomposition approach. Adaptive changes to the mesh are achieved by two distinctive techniques. Mesh refinement is performed by dividing element edges and a subsequent application of pre defined splitting templates. Mesh regularization and derefinement is achieved through topology conserving node movement (r-adaptivity). Parallel implementations of an adaptive use the dynamic load balancing technique.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 2; 195-207
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Power system stability with parallel active filter ensuring compensation of capacitive reactive power of a resonant LC circuit
    Autorzy:
    Płatek, T.
    Powiązania:
    https://bibliotekanauki.pl/articles/201301.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    parallel active filter
    passive filter
    system stability analysis
    Opis:
    This paper presents an analysis allowing for the determination of the differential equation describing the circuit of the active filter inverter output current control with an additional measurement of input voltage. The resulting equation allows to determine the conditions that ensure stable operation of the filter with the load in form of a resonant LC circuit. Analysis results were confirmed by computer simulation and experimental studies of commercial active filter.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 2; 353-361
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    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ł:
    Parallel computations of the step response of a floor heater with the use of a graphics processing unit. Part 2: results and their evaluation
    Autorzy:
    Gołębiowski, J.
    Forenc, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/201532.pdf
    Data publikacji:
    2013
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    air floor heating
    step response computation
    parallel computations
    GPGPU
    Opis:
    Using models and algorithms presented in the first part of the article, a spatio-temporal distribution of the step response of a floor heater was determined. The results have been presented in the form of heating curves and temperature profiles of the heater in the selected time moments. The computations results were verified through comparing them with the solution obtained with the use of a commercial program - NISA. Additionally, the distribution of the average time constant of thermal processes occurring in the heater was determined. The analysis of the use of a graphics processing unit in numerical computations based on the conjugate gradient method was done. It was proved that the use of a graphics processing unit is profitable in the case of solving linear systems of equations with dense coefficient matrices. In the case of a sparse matrix, the speed-up depends on the number of its non-zero elements.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2013, 61, 4; 949-954
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    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ł:
    Parallel computations of the step response of a floor heater with the use of a graphics processing unit. Part 1: models and algorithms
    Autorzy:
    Gołębiowski, J.
    Forenc, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/200428.pdf
    Data publikacji:
    2013
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    air floor heating
    step response
    implicit finite difference method
    parallel computations
    GPGPU
    Opis:
    The article presents a method of computing the step response of an air floor heater. The method implements parallel algorithms on a graphics processing unit. In the analyzed concrete slab heating ducts are placed. Hot air is transferred through them, thanks to which the heat penetrates into the slab. Heat transfer into the environment takes place on the top surface of the floor by natural convection and radiation. The bottom surface of the slab is thermally insulated. A two-dimensional heat equation was discretized with the use of the implicit finite difference method. In order to solve the obtained system of equations, the conjugate gradient method was used. Moreover, in order to examine the possibility of shortening the computations time, the algorithm of this method was implemented on a graphics processing unit. A computer program, using the CUDA parallel computing platform and linear algebra libraries CUBLAS and CUSPARSE, was developed.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2013, 61, 4; 943-948
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    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ł:
    Asymptotic guarantee of success for multi-agent memetic systems
    Autorzy:
    Byrski, A.
    Schaefer, R.
    Smołka, M.
    Cotta, C.
    Powiązania:
    https://bibliotekanauki.pl/articles/201942.pdf
    Data publikacji:
    2013
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    computational multi-agent systems
    asymptotic analysis
    global optimization
    parallel evolutionary algorithms
    Markov chain modeling
    Opis:
    The paper introduces a stochastic model for a class of population-based global optimization meta-heuristics, that generalizes existing models in the following ways. First of all, an individual becomes an active software agent characterized by the constant genotype and the meme that may change during the optimization process. Second, the model embraces the asynchronous processing of agent’s actions. Third, we consider a vast variety of possible actions that include the conventional mixing operations (e.g. mutation, cloning, crossover) as well as migrations among demes and local optimization methods. Despite the fact that the model fits many popular algorithms and strategies (e.g. genetic algorithms with tournament selection) it is mainly devoted to study memetic algorithms. The model is composed of two parts: EMAS architecture (data structures and management strategies) allowing to define the space of states and the framework for stochastic agent actions and the stationary Markov chain described in terms of this architecture. The probability transition function has been obtained and the Markov kernels for sample actions have been computed. The obtained theoretical results are helpful for studying metaheuristics conforming to the EMAS architecture. The designed synchronization allows the safe, coarse-grained parallel implementation and its effective, sub-optimal scheduling in a distributed computer environment. The proved strong ergodicity of the finite state Markov chain results in the asymptotic stochastic guarantee of success, which in turn imposes the liveness of a studied metaheuristic. The Markov chain delivers the sampling measure at an arbitrary step of computations, which allows further asymptotic studies, e.g. on various kinds of the stochastic convergence.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2013, 61, 1; 257-278
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Research on optimization of unrelated parallel machine scheduling based on IG-TS algorithm
    Autorzy:
    Chi, Xinfu
    Liu, Shijing
    Li, Ce
    Powiązania:
    https://bibliotekanauki.pl/articles/2173693.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    warp knitting machine
    parallel machine scheduling
    iterative greedy algorithm
    tabu search
    osnowarka
    planowanie maszyn równoległych
    algorytm zachłanny iteracyjny
    przeszukiwanie tabu
    Opis:
    This issue is a typical NP-hard problem for an unrelated parallel machine scheduling problem with makespan minimization as the goal and no sequence-related preparation time. Based on the idea of tabu search (TS), this paper improves the iterative greedy algorithm (IG) and proposes an IG-TS algorithm with deconstruction, reconstruction, and neighborhood search operations as the main optimization process. This algorithm has the characteristics of the strong capability of global search and fast speed of convergence. The warp knitting workshop scheduling problem in the textile industry, which has the complex characteristics of a large scale, nonlinearity, uncertainty, and strong coupling, is a typical unrelated parallel machine scheduling problem. The IG-TS algorithm is applied to solve it, and three commonly used scheduling algorithms are set as a comparison, namely the GA-TS algorithm, ABC-TS algorithm, and PSO-TS algorithm. The outcome shows that the scheduling results of the IG-TS algorithm have the shortest manufacturing time and good robustness. In addition, the production comparison between the IG-TS algorithm scheduling scheme and the artificial experience scheduling scheme for the small-scale example problem shows that the IG-TS algorithm scheduling is slightly superior to the artificial experience scheduling in both planning and actual production. Experiments show that the IG-TS algorithm is feasible in warp knitting workshop scheduling problems, effectively realizing the reduction of energy and the increase in efficiency of a digital workshop in the textile industry.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 4; art. no. e141724
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Analytical and experimental determination of the parasitic parameters in high-frequency inductor
    Autorzy:
    Zdanowski, M.
    Barlik, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/200393.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    model of inductor circuit
    interlayer capacitance
    parallel resonance
    litz wire
    inductor winding
    skin effect
    pojemność pośrednia
    rezonans równoległy
    cewka indukcyjna
    Opis:
    The paper presents the results of calculations, simulations, and measurements of parasitic capacitance of winding in ferrite inductor suitable for cooperating with 2 kW DC-DC boost converter built using SiC JFET transistors, operating with a switching frequency of 100 kHz. The inductor winding is made of litz wire in a two-layer configuration. The lumped model of inductor winding was adopted. The results of analytical calculations have been compared with the results obtained from experimental investigations based on the resonance effect.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 1; 107-112
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical 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ł:
    Three-dimensional simulations of the airborne COVID-19 pathogens using the advection-diffusion model and alternating-directions implicit solver
    Autorzy:
    Łoś, Marcin
    Woźniak, Maciej
    Muga, Ignacio
    Paszynski, Maciej
    Powiązania:
    https://bibliotekanauki.pl/articles/2086863.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    COVID-19
    pathogen spread
    isogeometric analysis
    implicit dynamics
    advection-diffusion
    parallel alternating directions solver
    rozprzestrzenianie się patogenu
    analiza izogeometryczna
    dynamika ukryta
    adwekcja-dyfuzja
    rozwiązywanie równoległych zmiennych kierunków
    Opis:
    In times of the COVID-19, reliable tools to simulate the airborne pathogens causing the infection are extremely important to enable the testing of various preventive methods. Advection-diffusion simulations can model the propagation of pathogens in the air. We can represent the concentration of pathogens in the air by “contamination” propagating from the source, by the mechanisms of advection (representing air movement) and diffusion (representing the spontaneous propagation of pathogen particles in the air). The three-dimensional time-dependent advection-diffusion equation is difficult to simulate due to the high computational cost and instabilities of the numerical methods. In this paper, we present alternating directions implicit isogeometric analysis simulations of the three-dimensional advection-diffusion equations. We introduce three intermediate time steps, where in the differential operator, we separate the derivatives concerning particular spatial directions. We provide a mathematical analysis of the numerical stability of the method. We show well-posedness of each time step formulation, under the assumption of a particular time step size. We utilize the tensor products of one-dimensional B-spline basis functions over the three-dimensional cube shape domain for the spatial discretization. The alternating direction solver is implemented in C++ and parallelized using the GALOIS framework for multi-core processors. We run the simulations within 120 minutes on a laptop equipped with i7 6700 Q processor 2.6 GHz (8 cores with HT) and 16 GB of RAM.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 4; e137125, 1--8
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-12 z 12

      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