Oriol Arcas-Abella

Oriol Arcas-Abella

Auto-generated profile, based on publicly available information

Oriol Arcas-Abella

Barcelona Supercomputing Center

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2014
Verified
Conference Paper
Closed access
OAOriol Arcas-Abella
Oriol Arcas-Abella
GNGeoffrey Ndu
Geoffrey Ndu
NSNehir Sonmez
Nehir Sonmez
MGMohsen Ghasempour
Mohsen Ghasempour
AAAdria Armejach
Adria Armejach
MLMikel Lujan
Mikel Lujan
High Level Synthesis (HLS) languages and tools are emerging as the most promising technique to make FPGAs more accessible to software developers. Nevertheless, picking the most suitable HLS for a certain class of algorithms depends on requirements such as area and throughput, as well as on programmer experience. In this paper, we explore the different trade-offs present when using a representative set of HLS tools in the context of Database Management Systems (DBMS) acceleration. More specifically, we conduct an empirical analysis of four representative frameworks (Bluespec SystemVerilog, Altera OpenCL, LegUp and Chisel) that we utilize to accelerate commonly-used database algorithms such as sorting, the median operator, and hash joins. Through our implementation experience and empirical results for database acceleration, we conclude that the selection of the most suitable HLS depends on a set of orthogonal characteristics, which we highlight for each HLS framework.

1 June 2017 in Microprocessors and Microsystems
Verified
Journal Article
Open access
BSBehzad Salami
Behzad Salami
GMGorker Alp Malazgirt
Gorker Alp Malazgirt
OAOriol Arcas-Abella
Oriol Arcas-Abella
AYArda Yurdakul
Arda Yurdakul
NSNehir Sonmez
Nehir Sonmez
With the rise of Big Data, providing high-performance query processing capabilities through the acceleration of the database analytic has gained significant attention. Leveraging Field Programmable Gate Array (FPGA) technology, this approach can lead to clear benefits. In this work, we present the design and implementation of AxleDB: An FPGA-based platform that enables fast query processing for database systems by melding novel database-specific accelerators with commercial-off-the-shelf (COTS) storage using modern interfaces, in a novel, unified, and a programmable environment. AxleDB can perform a large subset of SQL queries through its set of instructions that can map compute-intensive database operations, such as filter, arithmetic, aggregate, group by, table join, or sort, on to the specialized high-throughput accelerators. To minimize the amount of SSD I/O operations required, AxleDB also supports hardware MinMax indexing for databases. We evaluated AxleDB with five decision support queries from the TPC-H benchmark suite and achieved a speedup from 1.8X to 34.2X and energy efficiency from 2.8X to 62.1X, in comparison to the state-of-the-art DBMS, i.e., PostgreSQL and MonetDB.The research leading to these results has received funding from the European Union Seventh Framework Program (FP7) (under the AXLE project GA number 318633), the Ministry of Economy and Competitiveness\ud of Spain (under contract number TIN2015-65316-p), Turkish Ministry of Development TAM Project (number 2007K120610), and Bogazici University Scientific Projects (number 7060).Peer ReviewedPostprint (author's final draft

1 May 2015
Verified
Conference Paper
Closed access
BSBehzad Salami
Behzad Salami
OAOriol Arcas-Abella
Oriol Arcas-Abella
NSNehir Sonmez
Nehir Sonmez
In this paper we present HATCH, a novel hash join engine. We follow a new design point which enables us to effectively cache the hash table entries in fast BRAM resources, meanwhile supporting collision resolution in hardware. HATCH enables us to have the best of two worlds: (i) to use the full capacity of the DDR memory to store complete hash tables, and (ii) by employing a cache, to exploit the high access speed of BRAMs. We demonstrate the usefulness of our approach by running hash join operations from 5 TPC-H benchmark queries and report speedups up to 2.8× over a pipeline-optimized baseline.

21 December 2015 in Computing in Science & Engineering
Verified
Journal Article
Closed access
OAOriol Arcas-Abella
Oriol Arcas-Abella
AAAdria Armejach
Adria Armejach
THTimothy Hayes
Timothy Hayes
GMGorker Alp Malazgirt
Gorker Alp Malazgirt
OPOscar Palomar
Oscar Palomar
NSNehir Sonmez
Nehir Sonmez
Database management systems have become an indispensable tool for industry, government, and academia, and form a significant component of modern datacenters. They can be used in a multitude of scenarios, including online analytical processing, data mining, e-commerce, and scientific analysis. Given the exponential growth in new data produced each year, there is a pressure on software and hardware developers to create datacenters that can cope with increasing requirements. The authors look at the organization of a modern relational database management system and propose optimizations and redesign for the storage access, memory, and CPU.

1 September 2013
Verified
Conference Paper
Open access
MKMyron King
Myron King
AKAsif Khan
Asif Khan
AAAbhinav Agarwal
Abhinav Agarwal
OAOriol Arcas
Oriol Arcas
ARArvind
Arvind
Whether for use as the final target or simply a rapid prototyping platform, programming systems containing FPGAs is challenging. Some of the difficulty is due to the difference between the models used to program hardware and software, but great effort is also required to coordinate the simultaneous execution of the application running on the microprocessor with the accelerated kernel(s) running on the FPGA. In this paper we present a new methodology and programming model for introducing hardware-acceleration to an application running in software. The application is represented as a data-flow graph and the computation at each node in the graph is specified for execution either in software or on the FPGA using the programmer's language of choice. We have implemented an interface compiler which takes as its input the FIFO edges of the graph and generates code to connect all the different parts of the program, including those which communicate across the hardware/software boundary. Our methodology and compiler enable programmers to effectively exploit FPGA acceleration without ever leaving the application space.

29 April 2017
Verified
Book Chapter
Closed access
PDF file
BSBehzad Salami
Behzad Salami
OAOriol Arcas-Abella
Oriol Arcas-Abella
NSNehir Sonmez
Nehir Sonmez
OUOsman Unsal
Osman Unsal
AKAdrian Cristal Kestelman
Adrian Cristal Kestelman