Ara es mostren els items 1-10 de 10

  • CATA: Criticality aware task acceleration for multicore processors 

    Castillo, Emilio; Moreto Planas, Miquel; Casas, Marc; Álvarez Martí, Lluc; Vallejo, Enrique; Chronaki, Kallia; Badia Sala, Rosa Maria; Bosque Orero, José Luis; Beivide Palacio, Julio Ramón; Ayguadé Parra, Eduard; Labarta Mancho, Jesús José; Valero Cortés, Mateo (Institute of Electrical and Electronics Engineers (IEEE), 2016)
    Text en actes de congrés
    Accés obert
    Managing criticality in task-based programming models opens a wide range of performance and power optimization opportunities in future manycore systems. Criticality aware task schedulers can benefit from these opportunities ...
  • Contention-based nonminimal adaptive routing in high-radix networks 

    Fuentes Sáez, Pablo; Vallejo, Enrique; García, Marina; Beivide Palacio, Julio Ramón; Rodríguez, Germán; Minkenberg, Cyriel; Valero Cortés, Mateo (Institute of Electrical and Electronics Engineers (IEEE), 2015)
    Text en actes de congrés
    Accés obert
    Adaptive routing is an efficient congestion avoidance mechanism for modern Datacenter and HPC networks. Congestion detection traditionally relies on the occupancy of the router queues. However, this approach can hinder ...
  • Efficient routing mechanisms for Dragonfly networks 

    García, Marina; Vallejo, Enrique; Beivide Palacio, Julio Ramón; Odriozola, Miguel; Valero Cortés, Mateo (Institute of Electrical and Electronics Engineers (IEEE), 2013)
    Comunicació de congrés
    Accés obert
    High-radix hierarchical networks are cost-effective topologies for large scale computers. In such networks, routers are organized in super nodes, with local and global interconnections. These networks, known as Dragonflies, ...
  • Global misrouting policies in two-level hierarchical networks 

    Garcia, Marina; Vallejo, Enrique; Beivide Palacio, Julio Ramón; Odriozola, Miguel; Camarero Coterillo, Cristobal; Valero Cortés, Mateo; Labarta Mancho, Jesús José; Rodríguez, Germán (2013)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    Dragonfly networks are composed of interconnected groups of routers. Adaptive routing allows packets to be forwarded minimally or non-minimally adapting to the traffic conditions in the network. While minimal routing sends ...
  • Hybrid transactional memory with pessimistic concurrency control 

    Vallejo, Enrique; Sanyal, Sutirtha; Harris, Tim; Vallejo, Fernando; Beivide, Ramón; Unsal, Osman Sabri; Cristal Kestelman, Adrián; Valero Cortés, Mateo (2011-06)
    Article
    Accés restringit per política de l'editorial
    Transactional Memory (TM) intends to simplify the design and implementation of the shared-memory data structures used in parallel software. Many Software TM systems are based on writer-locks to protect the data being ...
  • Network unfairness in dragonfly topologies 

    Fuentes, Pablo; Vallejo, Enrique; Camarero, Cristóbal; Beivide Palacio, Ramon; Valero Cortés, Mateo (2016-12)
    Article
    Accés restringit per política de l'editorial
    Dragonfly networks arrange network routers in a two-level hierarchy, providing a competitive cost-performance solution for large systems. Non-minimal adaptive routing (adaptive misrouting) is employed to fully exploit the ...
  • OFAR-CM: Efficient Dragonfly networks with simple congestion management 

    García, Marina; Vallejo, Enrique; Beivide Palacio, Ramon; Valero Cortés, Mateo; Rodríguez, Germán (Institute of Electrical and Electronics Engineers (IEEE), 2013)
    Text en actes de congrés
    Accés obert
    Dragonfly networks are appealing topologies for large-scale Data center and HPC networks, that provide high throughput with low diameter and moderate cost. However, they are prone to congestion under certain frequent traffic ...
  • On-the-fly adaptive routing for dragonfly interconnection networks 

    García, Marina; Vallejo, Enrique; Beivide Palacio, Julio Ramón; Camarero Coterillo, Cristobal; Valero Cortés, Mateo; Rodríguez Herrera, Germán; Minkenberg, Cyriel (2015-03-01)
    Article
    Accés restringit per política de l'editorial
    Adaptive deadlock-free routing mechanisms are required to handle variable traffic patterns in dragonfly networks. However, distance-based deadlock avoidance mechanisms typically employed in Dragonflies increase the router ...
  • Task mapping in rectangular twisted tori 

    Camarero Coterillo, Cristobal; Vallejo, Enrique; Martínez Fernández, Maria del Carmen; Moreto Planas, Miquel; Beivide Palacio, Julio Ramón (Association for Computing Machinery (ACM), 2013)
    Text en actes de congrés
    Accés obert
    Twisted torus topologies have been proposed as an alternative to toroidal rectangular networks, improving distance parameters and providing network symmetry. However, twisting is apparently less amenable to task mapping ...
  • Throughput unfairness in Dragonfly networks under realistic traffic patterns 

    Fuentes, Pablo; Vallejo, Enrique; Camarero, Cristóbal; Beivide Palacio, Ramon; Valero Cortés, Mateo (Institute of Electrical and Electronics Engineers (IEEE), 2015)
    Text en actes de congrés
    Accés obert
    Dragonfly networks have a two-level hierarchical arrangement of the network routers, and allow for a competitive cost-performance solution in large systems. Non-minimal adaptive routing is employed to fully exploit the ...