Browsing by Subject "Parallel algorithms"
Now showing items 120 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 fixedsize 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 pth Roots of Large Sparse Matrices
(Association for Computing Machinery (ACM), 201807)
Conference lecture
Open AccessWe present the submatrix method, a highly parallelizable method for the approximate calculation of inverse pth roots of large sparse symmetric matrices which are required in different scientific applications. Following ... 
A methodology for useroriented 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 useroriented scalability analysis.
(IEEE, 19970714)
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 DSSpread 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 nonlinear problem of narrowband interference estimation and rejection in direct sequencespread ... 
A novel approach for hybrid performance modelling and prediction of largescale computing systems
(2009)
Article
Restricted access  publisher's policyWe present a novel approach for hybrid performance modeling and prediction of largescale parallel and distributed computing systems, which combines mathematical modeling and discreteevent simulation. We use mathematical ... 
A parallel algorithm for the computation of invariant tori in largescale dissipative systems
(201306)
Article
Restricted access  publisher's policyA parallelizable algorithm to compute invariant tori of highdimensional 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 nonsymmetric semidefinite programming
(199707)
External research report
Open AccessWe show that optimizing over nonsymmetrical 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 onedimensional FFT on a cdimensional 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 connectedcomponent 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
(199707)
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 LargeScale GYSELA Application
(Association for Computing Machinery, 201606)
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. ... 
Broadcastenabled massive multicore architectures: a wireless RF approach
(201509)
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 allpervasive in ... 
Crosscoupled doa trackers
(199710)
Article
Open AccessA new robust, low complexity algorithm for multiuser tracking is proposed, modifying the twostage parallel architecture of the estimatemaximize (EM) algorithm. The algorithm copes with spatially colored noise, large ... 
CUDAlign 4.0: incremental speculative traceback for exact chromosomewide alignment in GPU clusters
(20161001)
Article
Open AccessThis paper proposes and evaluates CUDAlign 4.0, a parallel strategy to obtain the optimal alignment of huge DNA sequences in multiGPU platforms, using the exact SmithWaterman (SW) algorithm. In the first phase of CUDAlign ... 
Distributed partitioning algorithm with application to videosurveillance
(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 videosurveillance system does not have the appropriate properties? Nowadays, the videosurveillance has become a responsibility by the necessity to patrol a ... 
Dynamic energyaware scheduling for parallel taskbased application in cloud computing
(Elsevier, 201801)
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
(200606)
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 largescale saddlepoint problems
(Universitat Politècnica de Catalunya, 20190614)
Bachelor thesis
Restricted access  author's decision