• Algorithms for the linear coloring arrangement problem 

    Sánchez Barrera, Isaac (Universitat Politècnica de Catalunya, 2015-01-28)
    Trabajo final de grado
    Acceso abierto
    [CATALÀ] El projecte emprèn la tasca de desenvolupar algorismes eficients per resoldre o aproximar el problema de l'arranjament lineal mínim d'una coloració per a graphs, variació del MinLA. Aquí, l'assignació lineal està ...
  • Graph partitioning applied to DAG scheduling to reduce NUMA effects 

    Sánchez Barrera, Isaac; Casas, Marc; Moreto Planas, Miquel; Ayguadé Parra, Eduard; Labarta Mancho, Jesús José; Valero Cortés, Mateo (Association for Computing Machinery (ACM), 2018)
    Comunicación de congreso
    Acceso abierto
    The complexity of shared memory systems is becoming more relevant as the number of memory domains increases, with different access latencies and bandwidth rates depending on the proximity between the cores and the devices ...
  • Graph partitioning for the reduction of data transfer in task-based programming models 

    Sánchez Barrera, Isaac (Universitat Politècnica de Catalunya, 2016-07)
    Projecte Final de Màster Oficial
    Acceso abierto
    Realizado en/con:  Barcelona Supercomputing Centre
    Current high performance computing architectures are composed of large shared memory NUMA nodes, among other components. Such nodes are becoming increasingly complex as they have several NUMA domains with different access ...
  • Using graph partitioning to accelerate task-based parallel applications 

    Sánchez Barrera, Isaac; Casas, Marc; Moreto Planas, Miquel; Ayguadé Parra, Eduard; Labarta Mancho, Jesús José; Valero Cortés, Mateo (Barcelona Supercomputing Center, 2015-05-05)
    Texto en actas de congreso
    Acceso abierto
    Current high performance computing architectures are composed of large shared memory NUMA nodes, among other components. Such nodes are becoming increasingly complex as they have several NUMA domains with different access ...