Vito Giovanni Castellana

Vito Giovanni Castellana

Auto-generated profile, based on publicly available information

Vito Giovanni Castellana

Pacific Northwest National Laboratory, Richland, Washington, USA

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 March 2015 in Computer
Verified
Journal Article
Closed access
VCVito Giovanni Castellana
Vito Giovanni Castellana
AMAlessandro Morari
Alessandro Morari
JWJesse Weaver
Jesse Weaver
ATAntonino Tumeo
Antonino Tumeo
DHDavid Haglin
David Haglin
JFJohn Feo
John Feo
A software stack relies primarily on graph-based methods to implement scalable resource description framework databases on top of commodity clusters, providing an inexpensive way to extract meaning from volumes of heterogeneous data.

1 May 2018
Verified
Conference Paper
Closed access
VCVito Giovanni Castellana
Vito Giovanni Castellana
MMMarco Minutoli
Marco Minutoli
The unprecedented amount of data that needs to be processed in emerging data analytics applications poses novel challenges to industry and academia. Scalability and high performance become more than a desirable feature because, due to the scale and the nature of the problems, they draw the line between what is achievable and what is unfeasible. In this paper, we propose SHAD, the Scalable High-performance Algorithms and Data-structures library. SHAD adopts a modular design that confines low level details and promotes reuse. SHAD's core is built on an Abstract Runtime Interface which enhances portability and identifies the minimal set of features of the underlying system required by the framework. The core library includes common data-structures such as: Array, Vector, Map and Set. These are designed to accommodate significant amount of data which can be accessed in massively parallel environments, and used as building blocks for SHAD extensions, i.e. higher level software libraries. We have validated and evaluated our design with a performance and scalability study of the core components of the library. We have validated the design flexibility by proposing a Graph Library as an example of SHAD extension, which implements two different graph data-structures; we evaluate their performance with a set of graph applications. Experimental results show that the approach is promising in terms of both performance and scalability. On a distributed system with 320 cores, SHAD Arrays are able to sustain a throughput of 65 billion operations per second, while SHAD Maps sustain 1 billion of operations per second. Algorithms implemented using the Graph Library exhibit performance and scalability comparable to a custom solution, but with smaller development effort.

1 June 2011
Verified
Conference Paper
Closed access
Christian PilatoChristian Pilato
Christian Pilato
VCVito Giovanni Castellana
Vito Giovanni Castellana
SLSilvia Lovergine
Silvia Lovergine
FFFabrizio Ferrandi
Fabrizio Ferrandi
Nowadays, the design of hardware cores has to necessarily deal with unpredictable components, due to process variation or to the interaction with external modules (e.g., memories, sensors, IP cores). Adaptive systems are, thus, one of the most important solutions to substitute traditional approaches, based on analysis at design time, especially in critical environments. In this paper, we present an innovative lightweight controller architecture able to automatically adjust its behavior at run-time. It interacts with the surrounding environment by means of a simple token-based communication schema. We examine the capabilities of the proposed architectural model to adapt its behavior during the execution, compared to classical ones, such as the finite state machine.

9 April 2014 in IEEE Micro
Verified
Journal Article
Closed access
AMAlessandro Morari
Alessandro Morari
VCVito Giovanni Castellana
Vito Giovanni Castellana
OVOreste Villa
Oreste Villa
ATAntonino Tumeo
Antonino Tumeo
JWJesse Weaver
Jesse Weaver
JFJohn Feo
John Feo
GEMS is a full software system that implements a large-scale, semantic graph database on commodity clusters. Its framework comprises a SPARQL-to-C++ compiler, a library of distributed data structures, and a custom multithreaded runtime library. The authors evaluated their software stack on the Berlin SPARQL benchmark with datasets of up to 10 billion graph edges, demonstrating scaling in dataset size and performance as they added cluster nodes.

1 September 2015
Verified
Conference Paper
Closed access
MMMarco Minutoli
Marco Minutoli
VCVito Giovanni Castellana
Vito Giovanni Castellana
ATAntonino Tumeo
Antonino Tumeo
FFFabrizio Ferrandi
Fabrizio Ferrandi
Modular design is becoming increasingly important in High Level Synthesis (HLS) flows. Current HLS flows generate hierarchical and modular designs that mimic the structure and call graph of the input specification by translating functions into modules. Function calls are translated by instantiating the callee module in the data-path of its caller, allowing for resource sharing when the same function is called multiple times. However, if two different callers invoke the same function, current HLS flows cannot share the instance of the module between the two callers, even if they invoke the function in a mutually exclusive way. In this paper, we propose a methodology that enables sharing of (sub)modules across modules boundaries. Sharing is obtained through function proxies, which act as forwarders of function calls in the original specification to shared modules without reducing performance. Building on the concept of function proxies, we propose a methodology and the related components to perform HLS of function calls through function pointers, without requiring complete static knowledge of the alias set (point-to set). We show that module sharing through function proxies provides valuable area savings and no significant impacts on the execution delays, and that our synthesis approach for function pointers enables dynamic polymorphism.

1 May 2016
Verified
Conference Paper
Closed access
DCDaniel Chavarria-Miranda
Daniel Chavarria-Miranda
VCVito Giovanni Castellana
Vito Giovanni Castellana
AMAlessandro Morari
Alessandro Morari
DHDavid Haglin
David Haglin
JFJohn Feo
John Feo
Graph databases are becoming a critical tool for the analysis of graph-structured data in the context of multiple scientific and technical domains, including cybersecurity and computational biology. In particular, the storage, analysis and querying of attributed graphs is a very important capability. Attributed graphs contain properties attached to the vertices and edges of the graph structure. Queries over attributed graphs do not only include structural pattern matching, but also conditions over the values of the attributes. In this work, we present GraQL, a query language designed for high-performance attributed graph databases hosted on a high memory capacity cluster. GraQL is designed to be the front-end language for the attributed graph data model for the GEMS database system.