Now showing items 1-20 of 33

  • A block algorithm for the algebraic path problem and its execution on a systolic array 

    Núñez, Fernando J.; Valero Cortés, Mateo (Institute of Electrical and Electronics Engineers (IEEE), 1989)
    Conference report
    Open Access
    The 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 

    Lass, Michael; Mohr, Stephan; Wiebeler, Hendrik; Kühne, Thomas D.; Plessl, Christian (Association for Computing Machinery (ACM), 2018-07)
    Conference lecture
    Open Access
    We 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 

    Royo Vallés, María Dolores; Valero García, Miguel; González Colás, Antonio María; Marí, Carme (Institute of Electrical and Electronics Engineers (IEEE), 1997)
    Conference report
    Open Access
    Scalability 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 parallel algorithm for the computation of invariant tori in large-scale dissipative systems 

    Sánchez Umbría, Juan; Net Marcé, Marta (2013-06)
    Article
    Restricted access - publisher's policy
    A 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 

    Núñez, Fernando J.; Valero Cortés, Mateo (Institute of Electrical and Electronics Engineers (IEEE), 1988)
    Conference report
    Open Access
    The 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. ...
  • Distributed partitioning algorithm with application to video-surveillance 

    Paloma Garcia, Inés; Saiz, Carlos (Universitat Politècnica de Catalunya / Università degli Studi di Padova, 2014)
    Bachelor thesis
    Open Access
    How 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 

    Juarez, Fredy; Ejarque, Jorge; Badia, Rosa M. (Elsevier, 2018-01)
    Article
    Open Access
    Green 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 

    Comin, Matteo; Farreras Esclusa, Montserrat (ACM, 2013)
    Conference report
    Restricted access - publisher's policy
    The 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 

    Alba, E.; Almeida, F.; Blesa Aguilera, Maria Josep; Cotta Porras, Carlos; Díaz, M.; Dorta, Isabel; Gabarró Vallès, Joaquim; León Hernández, Coromoto; Luque, G.; Petit Silvestre, Jordi; Rodríguez, C.; Rojas, A.; Xhafa Xhafa, Fatos (2006-06)
    Article
    Open Access
    The 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 

    Lustman, Arthur (Universitat Politècnica de Catalunya, 2019-06-14)
    Bachelor thesis
    Restricted access - author's decision
  • Executing algorithms with hypercube topology on torus multicomputers 

    González Colás, Antonio María; Valero García, Miguel; Díaz de Cerio Ripalda, Luis Manuel (1995-08)
    Article
    Open Access
    Many 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 

    Calvo Martínez, Javier (Universitat Politècnica de Catalunya, 2016-09)
    Master thesis (pre-Bologna period)
    Restricted access - confidentiality agreement
  • Large-scale retrospective event detection from tweets through a DBSCAN-like algorithm in Apache Spark 

    Pericacho Sánchez, Gonzalo (Universitat Politècnica de Catalunya, 2016-10-26)
    Master thesis
    Open Access
    Covenantee:  Barcelona Supercomputing Centre
    Messages posted on Location-Based Social Networks (LBSNs) such as Twitter have been reporting everything from daily life stories to the latest local and global news. Monitoring and analyzing this rich and continuous ...
  • Loop parallelization: revisiting framework of unimodular transformations 

    Torres Viñals, Jordi; Ayguadé Parra, Eduard; Labarta Mancho, Jesús José; Valero Cortés, Mateo (Institute of Electrical and Electronics Engineers (IEEE), 1996)
    Conference report
    Open Access
    The paper extends the framework of linear loop transformations adding a new nonlinear step at the transformation process. The current framework of linear loop transformation cannot identify a significant fraction of ...
  • Matrix inversion speed up with CUDA 

    Soriano Pinedo, Jorge (Universitat Politècnica de Catalunya, 2011-09-28)
    Master thesis (pre-Bologna period)
    Open Access
    Covenantee:  Illinois Institute of Technology
    English: In this project several mathematic algorithms are developed to obtain a matrix inversion method - that combines CUDA's parallel architecture and MATLAB which is actually faster than MATLAB's built in inverse ...
  • Near real time fraud detection with Apache Spark 

    Martín Hernández, Sergi (Universitat Politècnica de Catalunya, 2015-10-29)
    Master thesis (pre-Bologna period)
    Open Access
    Covenantee:  Université libre de Bruxelles
    Project that aims to put in practice the Big Data program Spark in a Bank fraud detection in real time scenario.
  • On the proper intervalization of colored caterpillar trees 

    Álvarez Faura, M. del Carme; Serna Iglesias, María José (2009)
    Article
    Restricted access - publisher's policy
    This paper studies the computational complexity of the proper interval colored graph problem (picg), when the input graph is a colored caterpillar, parameterized by hair length. In order prove our result we establish a ...
  • Optimización y paralelización de un algoritmo para evaluar la fiabilidad "all-terminal" de una red 

    Pascual Martínez, Maria Silvia (Universitat Politècnica de Catalunya, 2012-07-05)
    Master thesis (pre-Bologna period)
    Open Access
    [ANGLÈS] One of the most important parameters of any network-based system is its reliability. The allterminal reliability of a network is defined as the probability that the network can provide flow exchange among all the ...
  • Optimization of a parallel Monte Carlo method for linear algebra problems 

    Dávila Foyo, Diego (Universitat Politècnica de Catalunya, 2016-07-04)
    Master thesis
    Open Access
    Many problems in science and engineering can be represented by Systems of Linear Algebraic Equations (SLAEs). Numerical methods such as direct or iterative ones are used to solve these kind of systems. Depending on the ...
  • Parallelization of finite difference methods: Nodal and mimetic solutions of the wave equation 

    Moya Arrayás, Ferran (Universitat Politècnica de Catalunya, 2016)
    Master thesis (pre-Bologna period)
    Open Access
    In the present work we analyze two finite difference methods for the propagation of acoustic waves proposed by Córdova et al. to optimize its performance. The computational domain is rectangular. The first of these methods ...