Výsledky vyhledávání - "Parallel algorithms in computer science"

A Domain Decomposition Solver for Large Scale Time-Harmonic Flow Acoustics Problems: A domain decomposition solver for large scale time-harmonic flow acoustics problems

Autoři: P. Marchner H. Bériot S. Le Bras a další

Přispěvatelé: P. Marchner H. Bériot S. Le Bras a další

Zdroj: SIAM Journal on Scientific Computing. 47:B333-B359

Témata: Sciences informatiques, Multigrid methods, domain decomposition for boundary value problems involving PDEs, Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation, Physique, chimie, mathématiques & sciences de la terre, pierce operator, high frequency problems, Acoustic problems, Time-harmonic, [INFO] Computer Science [cs], absorbing boundary conditions, Flow acoustics, Ingénierie, informatique & technologie, Physical, chemical, mathematical & earth Sciences, Optimized Schwarz methods, Performance computing, Pierce operator, [MATH.MATH-AP] Mathematics [math]/Analysis of PDEs [math.AP], High-performance computing, Domain decompositions, Absorbing boundary conditions, [SPI.ACOU] Engineering Sciences [physics]/Acoustics [physics.class-ph], Applied Mathematics, high-performance computing, [MATH.MATH-NA] Mathematics [math]/Numerical Analysis [math.NA], Computer science, Engineering, computing & technology, Computational Mathematics, Mathématiques, domain decomposition, Absorbing boundary condition, High frequency problems, optimized Schwarz method, Parallel algorithms in computer science, Mathematics

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: https://hdl.handle.net/2268/332678
https://doi.org/10.1137/23M1607040

Jet: Multilevel Graph Partitioning on Graphics Processing Units: Jet: multilevel graph partitioning on graphics processing units

Autoři: Michael S. Gilbert Kamesh Madduri Erik G. Boman a další

Zdroj: SIAM Journal on Scientific Computing. 46:B700-B724

Témata: FOS: Computer and information sciences, graph partitioning, GPUs, Computer Science - Distributed, Parallel, and Cluster Computing, Discrete Mathematics (cs.DM), Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), refinement, Distributed, Parallel, and Cluster Computing (cs.DC), Parallel algorithms in computer science, Computer Science - Discrete Mathematics

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/2304.13194

Relaxed Two-Step Inertial Tseng’s Extragradient Method for Nonmonotone Variational Inequalities: Relaxed two-step inertial Tseng's extragradient method for nonmonotone variational inequalities

Autoři: Duong Viet Thong Pham Ky Anh Vu Tien Dung

Zdroj: Journal of Optimization Theory and Applications. 205

Témata: nonmonotone mapping, Fixed-point theorems, Iterative procedures involving nonlinear operators, Variational and other types of inequalities involving nonlinear operators (general), two step inertial technique, Contraction-type mappings, nonexpansive mappings, \(A\)-proper mappings, etc, weak convergence, Parallel numerical computation, Parallel algorithms in computer science, Tseng's extragradient method, variational inequality, Numerical methods for variational inequalities and related problems

Popis souboru: application/xml

An efficient algorithm with double inertial steps for solving split common fixed point problems and an application to signal processing

Autoři: Duong Viet Thong Simeon Reich Xiao-Huan Li a další

Zdroj: Computational and Applied Mathematics. 44

Témata: Fixed-point theorems, split common fixed point problem, demicontractive operator, Parallel numerical computation, Parallel algorithms in computer science, signal processing, Monotone operators and generalizations, self-adaptive algorithm, Numerical methods for variational inequalities and related problems, double inertial steps

Popis souboru: application/xml

Parallel Near-Duplicate Document Detection Using General-Purpose GPU

Autoři: Peshevski, Dimitar Zdraveski, Vladimir Ristov, Sashko

Zdroj: COMPUTING AND INFORMATICS; Vol. 43 No. 3 (2024): Computing and Informatics; 583–610

Témata: parallelism, Shingling, GPU, Near-duplicate, fingerprint, document, CUDA, 68W10, 02 engineering and technology, 0202 electrical engineering, electronic engineering, information engineering, MinHash, locality-sensitive hashing, Parallel algorithms in computer science, similarity

Popis souboru: application/pdf

Přístupová URL adresa: https://www.cai.sk/ojs/index.php/cai/article/view/2024_3_583

Accurate simulation of the anisotropic dendrite crystal growth by the 3DVar data assimilation

Autoři: Fenglian Zheng Xufeng Xiao

Zdroj: Computer Physics Communications. 311:109571

Témata: three-dimensional variational data assimilation, minimization algorithm, Finite difference methods for initial value and initial-boundary value problems involving PDEs, phase-field crystal model, Parallel numerical computation, Parallel algorithms in computer science

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/8033659
https://doi.org/10.1016/j.cpc.2025.109571

SemiAutomatic Task Graph Construction for $\mathcal{H}$-Matrix Arithmetic: Semiautomatic task graph construction for \(\mathcal{H}\)-matrix arithmetic

Autoři: Steffen Börm Sven Christophersen Ronald Kriemann

Zdroj: SIAM Journal on Scientific Computing. 44:C77-C98

Témata: hierarchical matrices, Complexity and performance of numerical algorithms, task graph, Numerical linear algebra, 0202 electrical engineering, electronic engineering, information engineering, parallel algorithms, Analysis of algorithms, many-core processors, Parallel numerical computation, 02 engineering and technology, Parallel algorithms in computer science, 0101 mathematics, 01 natural sciences

Popis souboru: application/xml

Exponentially Faster Massively Parallel Maximal Matching: Exponentially faster massively parallel maximal matching

Autoři: Soheil Behnezhad Mohammadtaghi Hajiaghayi David G. Harris

Zdroj: Journal of the ACM. 70:1-18

Témata: FOS: Computer and information sciences, matching, massively parallel computing, 0102 computer and information sciences, 01 natural sciences, Approximation algorithms, MPC, Computer Science - Distributed, Parallel, and Cluster Computing, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, Analysis of algorithms, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), Parallel algorithms in computer science

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/pdf/1901.03744
http://arxiv.org/abs/1901.03744
https://dblp.uni-trier.de/db/journals/corr/corr1901.html#abs-1901-03744
http://dblp.uni-trier.de/db/journals/corr/corr1901.html#abs-1901-03744
https://ui.adsabs.harvard.edu/abs/2019arXiv190103744B/abstract

Robust and Accurate Stopping Criteria for Adaptive Randomized Sampling in Matrix-Free Hierarchically Semiseparable Construction: Robust and accurate stopping criteria for adaptive randomized sampling in matrix-free hierarchically semiseparable construction

Autoři: Théo Mary Xiaoye S. Li Gustavo Chávez a další

Zdroj: SIAM Journal on Scientific Computing. 41:S61-S85

Témata: hierarchically semiseparable matrix, randomized sampling, Numerical linear algebra, Randomized algorithms, Parallel numerical computation, Parallel algorithms in computer science, 0101 mathematics, 01 natural sciences, adaptivity

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/7124584
https://doi.org/10.1137/18m1194961
https://dblp.uni-trier.de/db/journals/siamsc/siamsc41.html#GormanCGMRL19
https://epubs.siam.org/doi/pdf/10.1137/18M1194961
https://doi.org/10.1137/18M1194961

A parallel water flow algorithm with local search for solving the quadratic assignment problem

Autoři: Trung-Hieu Tran Kien Ming Ng

Zdroj: Journal of Industrial & Management Optimization. 15:235-259

Témata: 0209 industrial biotechnology, Combinatorial optimization, Discrete location and assignment, quadratic assignment problem, parallel computing, 13. Climate action, 0211 other engineering and technologies, combinatorial optimization, 02 engineering and technology, Parallel algorithms in computer science, 15. Life on land, nature-inspired optimization, water flow algorithm

Popis souboru: application/xml

Přístupová URL adresa: https://www.aimsciences.org/article/exportPdf?id=b0478f21-a379-4ac3-8147-84f8fa3ea4bb

Randomized GPU Algorithms for the Construction of Hierarchical Matrices from Matrix-Vector Operations: Randomized GPU algorithms for the construction of hierarchical matrices from matrix-vector operations

Autoři: Wajih Boukaram George Turkiyyah David Keyes a další

Přispěvatelé: Wajih Boukaram George Turkiyyah David Keyes a další

Zdroj: SIAM Journal on Scientific Computing. 41:C339-C366

Témata: hierarchical matrices, Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.), matrix compression, randomized algorithms, Numerical linear algebra, Randomized algorithms, GPU, 16. Peace & justice, 01 natural sciences, 7. Clean energy, Approximation algorithms, low rank factorization, nested bases, Parallel algorithms in computer science, batched algorithms, 0101 mathematics, low rank updates, matrix-matrix multiplication

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: https://repository.kaust.edu.sa/bitstream/10754/656844/1/18m1210101.pdf
https://dblp.uni-trier.de/db/journals/siamsc/siamsc41.html#BoukaramTK19
https://epubs.siam.org/doi/abs/10.1137/18M1210101
https://doi.org/10.1137/18M1210101

An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures

Autoři: François-Henry Rouet Shengguo Li Chun Huang a další

Zdroj: Journal of Computational and Applied Mathematics. 344:512-520

Témata: Numerical computation of eigenvalues and eigenvectors of matrices, distributed parallel algorithm, FOS: Computer and information sciences, Parallel numerical computation, Numerical Analysis (math.NA), ScaLAPACK, HSS matrix, 01 natural sciences, Computer Science - Distributed, Parallel, and Cluster Computing, 0103 physical sciences, FOS: Mathematics, Computer Science - Mathematical Software, Mathematics - Numerical Analysis, Distributed, Parallel, and Cluster Computing (cs.DC), Parallel algorithms in computer science, divide-and-conquer, 0101 mathematics, Mathematical Software (cs.MS)

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/pdf/1612.07526
http://arxiv.org/abs/1612.07526
http://www.sciencedirect.com/science/article/pii/S0377042718303285
https://www.sciencedirect.com/science/article/pii/S0377042718303285
https://ui.adsabs.harvard.edu/abs/2016arXiv161207526L/abstract
https://arxiv.org/abs/1612.07526
https://dblp.uni-trier.de/db/journals/corr/corr1612.html#LiRLHGC16

On parallel Branch and Bound frameworks for Global Optimization: On parallel branch and bound frameworks for global optimization

Autoři: José Manuel Salmerón Leocadio G. Casado Juan Rodriguez Herrera a další

Zdroj: Herrera, J F R, Salmerón, J M G, Hendrix, E M T, Asenjo, R & Casado, L G 2017, ' On parallel Branch and Bound frameworks for Global Optimization ', Journal of Global Optimization, vol. 69, no. 3, pp. 547-560 . https://doi.org/10.1007/s10898-017-0508-y

Témata: Control and Optimization, Data structures, Applied Mathematics, Branch-and-Bound, Framework, load balancing, 0211 other engineering and technologies, 02 engineering and technology, Management Science and Operations Research, Nonconvex programming, global optimization, Computer Science Applications, TBB, Shared-memory, shared-memory, framework, Polyhedral combinatorics, branch-and-bound, branch-and-cut, 0202 electrical engineering, electronic engineering, information engineering, branch-and-bound, Parallel algorithms in computer science, Load balancing

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007%2Fs10898-017-0508-y.pdf
https://www.pure.ed.ac.uk/ws/files/79583141/Herrera2017_Article_OnParallelBranchAndBoundFramew.pdf
https://hdl.handle.net/20.500.11820/142670c0-ca0e-409d-8720-d1d72c184ffc

Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication: Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication

Autoři: Laura Grigori Grey Ballard Ariful Azad a další

Přispěvatelé: Laura Grigori Grey Ballard Ariful Azad a další

Zdroj: SIAM Journal on Scientific Computing, vol 38, iss 6
SIAM J. Sci. Comput., vol 38

Témata: graph algorithms, FOS: Computer and information sciences, SpGEMM, cs.DC, math.NA, Numerical & Computational Mathematics, [INFO] Computer Science [cs], 01 natural sciences, 3D algorithms, Computational methods for sparse matrices, multi threading, Graph algorithms (graph-theoretic aspects), numerical linear algebra, FOS: Mathematics, Mathematics - Numerical Analysis, 0101 mathematics, 2D decomposition, cs.NA, 2.5D algorithms, Numerical and Computational Mathematics, sparse matrix-matrix multiplication, parallel computing, Applied Mathematics, Computation Theory and Mathematics, Numerical Analysis (math.NA), Computer Science - Distributed, Parallel, and Cluster Computing, 13. Climate action, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Distributed, Parallel, and Cluster Computing (cs.DC), Parallel algorithms in computer science, multithreading

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://arxiv.org/pdf/1510.00844
http://arxiv.org/abs/1510.00844
https://zbmath.org/6654697
https://doi.org/10.1137/15m104253x
https://inria.hal.science/hal-01426294v1
https://doi.org/10.1137/15m104253x
https://arxiv.org/abs/1510.00844
https://arxiv.org/pdf/1510.00844v1
https://dblp.uni-trier.de/db/journals/siamsc/siamsc38.html#AzadBBDGSTW16
https://www.arxiv-vanity.com/papers/1510.00844/
https://escholarship.org/uc/item/9x19n6cd.pdf
https://epubs.siam.org/doi/10.1137/15M104253X
https://arxiv.org/abs/1510.00844
https://arxiv.org/pdf/1510.00844.pdf
http://ui.adsabs.harvard.edu/abs/2015arXiv151000844A/abstract
https://escholarship.org/uc/item/9x19n6cd
https://escholarship.org/uc/item/8db1h2z8

Multicore-Optimized Wavefront Diamond Blocking for Optimizing Stencil Updates: Multicore-optimized wavefront diamond blocking for optimizing stencil updates

Autoři: Malas, Tareq Majed Yasin Hager, G. Ltaief, Hatem a další

Přispěvatelé: Malas, Tareq Majed Yasin Hager, G. Ltaief, Hatem a další

Zdroj: SIAM Journal on Scientific Computing. 37:C439-C464

Témata: wavefront parallelization, FOS: Computer and information sciences, temporal blocking, Analysis of algorithms and problem complexity, multicore, stencil computations, Parallel numerical computation, 02 engineering and technology, diamond tiling, Distributed systems, Computer Science - Distributed, Parallel, and Cluster Computing, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, Distributed, Parallel, and Cluster Computing (cs.DC), Parallel algorithms in computer science, energy-efficient algorithms, Performance evaluation, queueing, and scheduling in the context of computer systems

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://arxiv.org/pdf/1410.3060
http://arxiv.org/abs/1410.3060
https://arxiv.org/abs/1410.3060
https://arxiv.org/pdf/1410.3060.pdf
http://export.arxiv.org/pdf/1410.3060

Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems: Convergence properties of the gravitational algorithm in asynchronous robot systems

Autoři: Reuven Cohen David Peleg

Zdroj: Lecture Notes in Computer Science ISBN: 9783540230250

Témata: autonomous mobile robots, robot swarms, convergence, Artificial intelligence for robotics, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Parallel algorithms in computer science, Kinematics of mechanisms and robots, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/2205905
https://doi.org/10.1137/s0097539704446475
https://link.springer.com/10.1007/978-3-540-30140-0_22
https://core.ac.uk/display/20710446
https://dblp.uni-trier.de/db/conf/esa/esa2004.html#CohenP04
https://link.springer.com/chapter/10.1007%2F978-3-540-30140-0_22
https://rd.springer.com/chapter/10.1007/978-3-540-30140-0_22
https://dl.acm.org/doi/10.1137/S0097539704446475
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp34.html#CohenP05
https://doi.org/10.1137/S0097539704446475
http://u.math.biu.ac.il/~reuven/publications/converge.pdf
https://u.math.biu.ac.il/~reuven/publications/converge.pdf
https://epubs.siam.org/doi/10.1137/S0097539704446475

Deadlock prevention by acyclic orientations

Autoři: Bermond, Jean-Claude Ianni, Miriam Di Flammini, Michele a další

Přispěvatelé: Bermond, Jean-Claude Ianni, Miriam Di Flammini, Michele a další

Zdroj: Discrete Applied Mathematics. 129:31-47

Témata: [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], Parallel algorithms, [INFO.INFO-SI] Computer Science [cs]/Social and Information Networks [cs.SI], Applied Mathematics, 05 social sciences, parallel algorithms, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 01 natural sciences, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], 0508 media and communications, routing and communication in interconnection networks, Discrete Mathematics and Combinatorics, Computational and structural complexity, Parallel algorithms in computer science, computational and structural complexity, Routing and communication in interconnection networks

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: https://zbmath.org/1956684
https://doi.org/10.1016/s0166-218x(02)00232-9
https://inria.hal.science/hal-03764730v1/document
https://inria.hal.science/hal-03764730v1
https://doi.org/10.1016/s0166-218x(02)00232-9
https://hal.science/hal-03832690v1
https://www.sciencedirect.com/science/article/pii/S0166218X02002329
http://www.sciencedirect.com/science/article/pii/S0166218X02002329
https://dblp.uni-trier.de/db/journals/dam/dam129.html#BermondIFP03
https://hdl.handle.net/11697/23347
https://doi.org/10.1016/S0166-218X(02)00232-9

DIANA and selected applications

Autoři: Fleischer, Jochem Tentyukov, M Tarasov, OV

Zdroj: Nuclear Physics B - Proceedings Supplements. 116:348-352

Témata: parallel processing, \(2\)-body potential quantum scattering theory, graphics, FOS: Physical sciences, Computational methods for problems pertaining to quantum theory, 01 natural sciences, Simulation and numerical modelling (quantum field theory), High Energy Physics - Phenomenology, High Energy Physics - Phenomenology (hep-ph), Feynamn diagram analyzer, 0103 physical sciences, Parallel algorithms in computer science, 0101 mathematics, Feynman diagrams

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/pdf/hep-ph/0211209
http://arxiv.org/abs/hep-ph/0211209
https://zbmath.org/1921939
https://doi.org/10.1016/s0920-5632(03)80197-4
https://arxiv.org/pdf/hep-ph/0211209v1
https://arxiv.org/abs/hep-ph/0211209v1
https://www.sciencedirect.com/science/article/pii/S0920563203801974
http://ui.adsabs.harvard.edu/abs/2003NuPhS.116..348F/abstract
http://www.sciencedirect.com/science/article/pii/S0920563203801974

A Compressed Diagonals Remapping Technique for Dynamic Data Redistribution on Banded Sparse Matrix: A compressed diagonals remapping technique for dynamic data redistribution on banded sparse matrix

Autoři: Ching-Hsien Hsu Kun-Ming Yu

Zdroj: Lecture Notes in Computer Science ISBN: 9783540405238

Témata: sparse matrix, banded matrix, parallel algorithm, runtime support, 0202 electrical engineering, electronic engineering, information engineering, Compressed diagonals remapping, data redistribution, 02 engineering and technology, Parallel algorithms in computer science, 0101 mathematics, Distributed systems, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: http://parallel.iis.sinica.edu.tw/cthpc2003/papers/CTHPC2003-09.pdf
https://zbmath.org/2129717
https://doi.org/10.1023/b:supe.0000026846.74050.18
https://dblp.uni-trier.de/db/journals/tjs/tjs29.html#HsuY04
https://doi.org/10.1023/B:SUPE.0000026846.74050.18
https://link.springer.com/article/10.1023/B:SUPE.0000026846.74050.18
https://link.springer.com/chapter/10.1007%2F3-540-37619-4_8
https://rd.springer.com/chapter/10.1007/3-540-37619-4_8
https://dl.acm.org/doi/10.5555/1761566.1761577
https://dblp.uni-trier.de/db/conf/ispa/ispa2003.html#HsuY03
http://parallel.iis.sinica.edu.tw/cthpc2003/papers/CTHPC2003-09.pdf
http://pdlab.csie.chu.edu.tw/K.M.Yu/Download/Chapters/16.2003-ISPA.pdf

Space Efficient Hash Tables with Worst Case Constant Access Time: Space efficient hash tables with worst case constant access time

Autoři: Fotakis, D. Pagh, R. Sanders, P. a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783540006237

Témata: ddc:004, Data structures, hash table data structure, DATA processing & computer science, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Parallel algorithms in computer science, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_1329080
https://dblp.uni-trier.de/db/journals/mst/mst38.html#FotakisPSS05
http://pubman.mpdl.mpg.de/pubman/item/escidoc:1329080
https://rd.springer.com/article/10.1007%2Fs00224-004-1195-x
https://link.springer.com/content/pdf/10.1007%2Fs00224-004-1195-x.pdf
https://publikationen.bibliothek.kit.edu/1000009460