#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2015

2017

- This year (4)
- Last 5 years (13)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Federico Busato, Nicola Bombieri
- IEEE Transactions on Parallel and Distributed…
- 2015

Breadth-first search (BFS) is one of the most common graph traversal algorithms and the building block for a wide range of graph applications. With the advent of graphics processing units (GPUs), several works have been proposed to accelerate graph algorithms and, in particular, BFS on such many-core architectures. Nevertheless, BFS has proven to be an… (More)

- Federico Busato, Nicola Bombieri
- IEEE Transactions on Parallel and Distributed…
- 2016

Finding the shortest paths from a single source to all other vertices is a common problem in graph analysis. The Bellman-Ford's algorithm is the solution that solves such a single-source shortest path (SSSP) problem and better applies to be parallelized for many-core architectures. Nevertheless, the high degree of parallelism is guaranteed at the… (More)

- Nicola Bombieri, Federico Busato, Franco Fummi
- 2016 Design, Automation & Test in Europe…
- 2016

The increasing programmability, performance, and cost/effectiveness of GPUs have led to a widespread use of such many-core architectures to accelerate general purpose applications. Nevertheless, tuning applications to efficiently exploit the GPU potentiality is a very challenging task, especially for inexperienced programmers. This is due to the difficulty… (More)

- Federico Busato, Nicola Bombieri
- 2015 IEEE 9th International Symposium on Embedded…
- 2015

Prefix-scan is one of the most common operation and building block for a wide range of parallel applications for GPUs. It allows the GPU threads to efficiently find and access in parallel to the assigned data. Nevertheless, the workload decomposition and mapping strategies that make use of prefix-scan can have a significant impact on the overall application… (More)

- Oded Green, James Fox, +9 authors David Bader
- 2017 IEEE High Performance Extreme Computing…
- 2017

The k-truss of a graph is a subgraph such that each edge is tightly connected to the remaining elements in the k-truss. The k-truss of a graph can also represent an important community in the graph. Finding the k-truss of a graph can be done in a polynomial amount of time, in contrast finding other subgraphs such as cliques. While there are numerous… (More)

- Federico Busato, Nicola Bombieri
- IEEE Transactions on Parallel and Distributed…
- 2017

Workload partitioning and the subsequent work item-to-thread mapping are key aspects to face when implementing any efficient GPU application. Different techniques have been proposed to deal with such issues, ranging from the computationally simplest static to the most complex dynamic ones. Each of them finds the best use depending on the workload… (More)

- Vincenzo Bonnici, Federico Busato, Giovanni Micale, Nicola Bombieri, Alfredo Pulvirenti, Rosalba Giugno
- Bioinformatics
- 2016

MOTIVATION
Biological network querying is a problem requiring a considerable computational effort to be solved. Given a target and a query network, it aims to find occurrences of the query in the target by considering topological and node similarities (i.e. mismatches between nodes, edges, or node labels). Querying tools that deal with similarities are… (More)

- Federico Busato, Nicola Bombieri
- 2017 12th IEEE International Symposium on…
- 2017

Load balancing is a key aspect to face when implementing any parallel application for Graphic Processing Units (GPUs). It is particularly crucial if one considers that it strongly impacts on performance, power and energy efficiency of the whole application. Many different partitioning techniques have been proposed in the past to deal with either very… (More)

- Stefano Aldegheri, Jiri Barnat, Nicola Bombieri, Federico Busato, Milan Ceska
- Euro-Par Workshops
- 2016

- Nicola Bombieri, Federico Busato, Franco Fummi
- 2015 IEEE 9th International Symposium on Embedded…
- 2015

Parallelizing software applications through the use of existing optimized % target-oriented primitives is a common trend that mediates the complexity of manual parallelization and the use of less efficient directive-based programming models. Parallel primitive libraries allow software engineers to map any sequential code to a target many-core architecture… (More)