Exploració per tema "Algorismes paral·lels"
Ara es mostren els items 1-20 de 53
-
A block algorithm for the algebraic path problem and its execution on a systolic array
(Institute of Electrical and Electronics Engineers (IEEE), 1989)
Text en actes de congrés
Accés obertThe solution of the algebraic path problem (APP) for arbitrarily sized graphs by a fixed-size systolic array processor (SAP) is addressed. The APP is decomposed into two subproblems, and SAP is designed for each one. Both ... -
A FE2 multi-scale implementation for modeling composite materials on distributed architectures
(2019-04-01)
Article
Accés restringit per política de l'editorialThis work investigates the accuracy and performance of a FE2 multi-scale implementation used to predict the behavior of composite materials. The equations are formulated assuming the small deformations solid mechanics ... -
A highly parallel algorithm for computing the action of a matrix exponential on a vector based on a multilevel Monte Carlo method
(2020-01-01)
Article
Accés obertA novel algorithm for computing the action of a matrix exponential over a vector is proposed. The algorithm is based on a multilevel Monte Carlo method, and the vector solution is computed probabilistically generating ... -
A highly portable heterogeneous implementation of a Poisson solver for flows with one periodic direction
(2021)
Text en actes de congrés
Accés restringit per política de l'editorialThe portability of codes has become a major advantage given the continuous development of new architectures for numerical applications, as well as the progressive incorporation of accelerators in modern supercomputers. ... -
A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices
(Association for Computing Machinery (ACM), 2018-07)
Comunicació de congrés
Accés obertWe present the submatrix method, a highly parallelizable method for the approximate calculation of inverse p-th roots of large sparse symmetric matrices which are required in different scientific applications. Following ... -
A methodology for user-oriented scalability analysis
(Institute of Electrical and Electronics Engineers (IEEE), 1997)
Text en actes de congrés
Accés obertScalability analysis provides information about the effectiveness of increasing the number of resources of a parallel system. Several methods have been proposed which use different approaches to provide this information. ... -
A native tensor-vector multiplication algorithm for high performance computing
(2022-12-01)
Article
Accés obertTensor computations are important mathematical operations for applications that rely on multidimensional data. The tensor-vector multiplication (TVM) is the most memory-bound tensor contraction in this class of operations. ... -
A new generation of task-parallel algorithms for matrix inversion in many-threaded CPUs
(Association for Computing Machinery (ACM), 2021)
Text en actes de congrés
Accés obertWe take advantage of the new tasking features in OpenMP to propose advanced task-parallel algorithms for the inversion of dense matrices via Gauss-Jordan elimination. Our algorithms perform a partitioning of the matrix ... -
A parallel algorithm for the computation of invariant tori in large-scale dissipative systems
(2013-06)
Article
Accés restringit per política de l'editorialA parallelizable algorithm to compute invariant tori of high-dimensional dissipative systems, obtained upon discretization of PDEs is presented. The size of the set of equations to be solved is only a small multiple of the ... -
A systolic algorithm for the fast computation of the connected components of a graph
(Institute of Electrical and Electronics Engineers (IEEE), 1988)
Text en actes de congrés
Accés obertThe authors consider the description of a systolic algorithm to solve the connected-component problem. It is executed in a ring topology with N processors, requiring O(Nlog N) time without regard to the graph's sparsity. ... -
Approximating convex quadratic programming is P-complete
(1995)
Report de recerca
Accés obertIn this paper we show that the problem of Approximating Convex Quadratic Programming is P-complete. We also consider two approximation problems related to it, Solution Approximation and Value Approximation and show both ... -
Compiler and runtime based parallelization & optimization for GPUs
(Universitat Politècnica de Catalunya, 2018-12-13)
Tesi
Accés obertGraphics Processing Units (GPU) have been widely adopted to accelerate the execution of HPC workloads due to their vast computational throughput, ability to execute a large number of threads inside SIMD groups in parallel ... -
Distributed partitioning algorithm with application to video-surveillance
(Universitat Politècnica de Catalunya / Università degli Studi di Padova, 2014)
Treball Final de Grau
Accés obertHow many times have we wanted to control an area and the video-surveillance system does not have the appropriate properties? Nowadays, the video-surveillance has become a responsibility by the necessity to patrol a ... -
Dynamic energy-aware scheduling for parallel task-based application in cloud computing
(Elsevier, 2018-01)
Article
Accés obertGreen Computing is a recent trend in computer science, which tries to reduce the energy consumption and carbon footprint produced by computers on distributed platforms such as clusters, grids, and clouds. Traditional ... -
Efficient parallel algorithms for some tree layout problems
(1992)
Report de recerca
Accés obertThe minimum cut and minimum sum linear arrangement problems usually occur in solving wiring problems and have a lot in common with job sequencing questions. Both problems are NP-complete for general graphs and P for trees. ... -
Efficient parallel construction of suffix trees for genomes larger than main memory
(ACM, 2013)
Text en actes de congrés
Accés restringit per política de l'editorialThe construction of suffix tree for very long sequences is essential for many applications, and it plays a central role in the bioinformatic domain. With the advent of modern sequencing technologies, biological sequence ... -
Efficient parallel LAN/WAN algorithms for optimization: The mallba project
(2006-06)
Article
Accés obertThe mallba project tackles the resolution of combinatorial optimization problems using generic algorithmic skeletons implemented in C++. A skeleton in the mallba library implements an optimization method in one of the three ... -
Efficient parallel solvers for large-scale saddle-point problems
(Universitat Politècnica de Catalunya, 2019-06-14)
Treball Final de Grau
Accés restringit per decisió de l'autor -
Executing algorithms with hypercube topology on torus multicomputers
(1995-08)
Article
Accés obertMany parallel algorithms use hypercubes as the communication topology among their processes. When such algorithms are executed on hypercube multicomputers the communication cost is kept minimum since processes can be ... -
Gestión y control de contenido mediante la detección de duplicados por imagen con Apache Spark
(Universitat Politècnica de Catalunya, 2016-09)
Projecte/Treball Final de Carrera
Accés restringit per acord de confidencialitat