Ara es mostren els items 1-20 de 53

    • 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)
      Text en actes de congrés
      Accés obert
      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 FE2 multi-scale implementation for modeling composite materials on distributed architectures 

      Giuntoli, Guido; Aguilar Mena, Jimmy; Vázquez, Mariano; Oller Martínez, Sergio Horacio; Houzeaux, Guillaume (2019-04-01)
      Article
      Accés restringit per política de l'editorial
      This 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 

      Acebrón de Torres, Juan A.; Herrero Zaragoza, José Ramón; Monteiro, José (2020-01-01)
      Article
      Accés obert
      A 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 

      Alsalti Baldellou, Àdel; Trias Miquel, Francesc Xavier; Álvarez Farré, Xavier; Oliva Llena, Asensio (2021)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      The 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 

      Lass, Michael; Mohr, Stephan; Wiebeler, Hendrik; Kühne, Thomas D.; Plessl, Christian (Association for Computing Machinery (ACM), 2018-07)
      Comunicació de congrés
      Accés obert
      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)
      Text en actes de congrés
      Accés obert
      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 native tensor-vector multiplication algorithm for high performance computing 

      Martínez Ferrer, Pedro José; Yzelman, Albert-Jan Nicholas; Beltran Querol, Vicenç (2022-12-01)
      Article
      Accés obert
      Tensor 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 

      Catalán Pallarés, Sandra; Igual Peña, Francisco D.; Rodríguez Sánchez, Rafael; Herrero Zaragoza, José Ramón; Quintana Ortí, Enrique Salvador (Association for Computing Machinery (ACM), 2021)
      Text en actes de congrés
      Accés obert
      We 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 

      Sánchez Umbría, Juan; Net Marcé, Marta (2013-06)
      Article
      Accés restringit per política de l'editorial
      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)
      Text en actes de congrés
      Accés obert
      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. ...
    • Approximating convex quadratic programming is P-complete 

      Serna Iglesias, María José; Xhafa Xhafa, Fatos (1995)
      Report de recerca
      Accés obert
      In 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 

      Ozen, Guray (Universitat Politècnica de Catalunya, 2018-12-13)
      Tesi
      Accés obert
      Graphics 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 

      Paloma Garcia, Inés; Saiz, Carlos (Universitat Politècnica de Catalunya / Università degli Studi di Padova, 2014)
      Treball Final de Grau
      Accés obert
      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 Pérez, Fredy; Ejarque, Jorge; Badia Sala, Rosa Maria (Elsevier, 2018-01)
      Article
      Accés obert
      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 algorithms for some tree layout problems 

      Díaz Cort, Josep; Gibbons, Alan M.; Pantziou, Grammati; Serna Iglesias, María José; Spirakis, Paul George; Torán Romero, Jacobo (1992)
      Report de recerca
      Accés obert
      The 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 

      Comin, Matteo; Farreras Esclusa, Montserrat (ACM, 2013)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      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
      Accés obert
      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)
      Treball Final de Grau
      Accés restringit per decisió de l'autor
    • 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
      Accés obert
      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)
      Projecte/Treball Final de Carrera
      Accés restringit per acord de confidencialitat