Browsing by Subject "Parallel algorithms"
Now showing items 1-20 of 48
-
A block algorithm for the algebraic path problem and its execution on a systolic array
(Institute of Electrical and Electronics Engineers (IEEE), 1989)
Conference report
Open AccessThe 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 Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices
(Association for Computing Machinery (ACM), 2018-07)
Conference lecture
Open AccessWe 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)
Conference report
Open AccessScalability 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 methodology for user-oriented scalability analysis.
(IEEE, 1997-07-14)
Conference report
Open AccessScalability 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. ... -
An adaptative fuzzy logic enhancer for rejection of narrowband interference in DS-Spread Spectrum
(1998)
Conference report
Open AccessThis work develops a novel adaptive fuzzy line enhancer that, based on a fuzzy basis function expansion, successfully solves the non-linear problem of narrowband interference estimation and rejection in direct sequence-spread ... -
A novel approach for hybrid performance modelling and prediction of large-scale computing systems
(2009)
Article
Restricted access - publisher's policyWe present a novel approach for hybrid performance modeling and prediction of large-scale parallel and distributed computing systems, which combines mathematical modeling and discrete-event simulation. We use mathematical ... -
A parallel algorithm for the computation of invariant tori in large-scale dissipative systems
(2013-06)
Article
Restricted access - publisher's policyA 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 Short note on non-symmetric semidefinite programming
(1997-07)
External research report
Open AccessWe show that optimizing over non-symmetrical matrices is not polynomial solvable unless P=NP. This is in contrast to the symmetric case for which several polynomials time algorithms are known. -
A study of the communication cost of the FFT on torus multicomputers
(Institute of Electrical and Electronics Engineers (IEEE), 1995)
Conference report
Open AccessThe computation of a one-dimensional FFT on a c-dimensional torus multicomputer is analyzed. Different approaches are proposed which differ in the way they use the interconnection network. The first approach is based on ... -
A systolic algorithm for the fast computation of the connected components of a graph
(Institute of Electrical and Electronics Engineers (IEEE), 1988)
Conference report
Open AccessThe 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. ... -
A Unified approach to concurrent and parallel algorithms on balanced data structures
(1997-07)
External research report
Open AccessConcurrent and parallel algorithms are different. However, in the case of dictionaries, both kinds of algorithms share many common points. We present a unified approach emphasizing these points. It is based on a careful ... -
Benefits of SMT and of Parallel Transpose Algorithm for the Large-Scale GYSELA Application
(Association for Computing Machinery, 2016-06)
Conference report
Open AccessThis article describes how we manage to increase performance and to extend features of a large parallel application through the use of simultaneous multithreading (SMT) and by designing a robust parallel transpose algorithm. ... -
Broadcast-enabled massive multicore architectures: a wireless RF approach
(2015-09)
Article
Open AccessBroadcast traditionally has been regarded as a prohibitive communication transaction in multiprocessor environments. Nowadays, such a constraint largely drives the design of architectures and algorithms all-pervasive in ... -
Cross-coupled doa trackers
(1997-10)
Article
Open AccessA new robust, low complexity algorithm for multiuser tracking is proposed, modifying the two-stage parallel architecture of the estimate-maximize (EM) algorithm. The algorithm copes with spatially colored noise, large ... -
CUDAlign 4.0: incremental speculative traceback for exact chromosome-wide alignment in GPU clusters
(2016-10-01)
Article
Open AccessThis paper proposes and evaluates CUDAlign 4.0, a parallel strategy to obtain the optimal alignment of huge DNA sequences in multi-GPU platforms, using the exact Smith-Waterman (SW) algorithm. In the first phase of CUDAlign ... -
Distributed partitioning algorithm with application to video-surveillance
(Universitat Politècnica de Catalunya / Università degli Studi di Padova, 2014)
Bachelor thesis
Open AccessHow 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
Open AccessGreen 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 construction of suffix trees for genomes larger than main memory
(ACM, 2013)
Conference report
Restricted access - publisher's policyThe 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
Open AccessThe 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)
Bachelor thesis
Restricted access - author's decision
