Vaidas Gasiunas

dblp:53/4182 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Operating systems · 76% Programming languages and type systems · 24%
Databases, data mining, and information retrieval
1 paper
Database system architecture and tuning · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Database system architecture and tuning › parallel database system
shared-nothing architecture
0.312017
Fiber-based architecture for NFV cloud databases · Proc. VLDB Endow. 2017
Operating systems › resource management › process management
user-level threads
0.312017
Fiber-based architecture for NFV cloud databases · Proc. VLDB Endow. 2017
Cloud and datacenter computing › virtualization › network virtualization
network function virtualization
0.112017
Fiber-based architecture for NFV cloud databases · Proc. VLDB Endow. 2017
Programming languages and type systems › object-oriented programming
virtual classes
0.112007
Dependent classes · OOPSLA 2007
Programming languages and type systems › type systems
type soundness
0.012007
Dependent classes · OOPSLA 2007

Methods — techniques the papers use, named apart from their topics

shared-nothing partitioning · 0.9fibers · 0.9machine-checked proof · 0.1formal semantics · 0.1
YearPublicationVenuePosition
2017 Fiber-based architecture for NFV cloud databases
abstract
The telco industry is gradually shifting from using monolithic software packages deployed on custom hardware to using modular virtualized software functions deployed on cloudified data centers using commodity hardware. This transformation is referred to as Network Function Virtualization (NFV). The scalability of the databases (DBs) underlying the virtual network functions is the cornerstone for reaping the benefits from the NFV transformation. This paper presents an industrial experience of applying shared-nothing techniques in order to achieve the scalability of a DB in an NFV setup. The special combination of requirements in NFV DBs are not easily met with conventional execution models. Therefore, we designed a special shared-nothing architecture that is based on cooperative multi-tasking using user-level threads (fibers). We further show that the fiber-based approach outperforms the approach built using conventional multi-threading and meets the variable deployment needs of the NFV transformation. Furthermore, fibers yield a simpler-to-maintain software and enable controlling a trade-off between long-duration computations and real-time requests.
Vaidas Gasiunas, David Dominguez-Sal, Ralph Acker, Aharon Avitzur, Ilan Bronshtein, Eli Ginot, Norbert Martínez-Bazan, Alexander Nozdrin, Weijie Ou, Nir Pachter, Dima Sivov, Eliezer Levy
Proc. VLDB Endow.1
2016 Assessing Idioms for a Flexible Feature Binding Time
abstract
In software product lines development, it is sometimes important to provide a flexible binding time for features such that developers can choose between static or dynamic feature activation. For example, software products designed for devices with constrained resources may use a static binding time to avoid the performance overhead introduced by dynamic binding time activation. However, other devices can exploit binding time flexibility to support products with a dynamic binding time for some of their features. To implement this kind of flexibility in a modular way, we can define AspectJ-based idioms. Researchers have proposed Edicts, an idiom based on AspectJ and design patterns. In this article, we argue that this idiom leads to an increase in code duplication, scattering, tangling and size, which can hamper code reuse, maintenance and understanding. To mitigate such issues, this paper proposes three idioms based on aspect-oriented programming to implement flexible feature binding. We apply our three idioms, along with Edicts, to implement a flexible binding time for features in four different applications. By doing so, we were able to assess the resulting implementations by using software metrics that judge code-quality factors. Our evaluation suggests that our idioms reduce the above-mentioned problems when implementing flexible feature binding for the selected features.
Rodrigo Andrade, Márcio Ribeiro 0001, Henrique Rebêlo, Paulo Borba, Vaidas Gasiunas, Lucas Satabin
Comput. J.5
2007 Dependent classes
abstract
Virtual classes allow nested classes to be refined in subclasses. In this way nested classes can be seen as dependent abstractions of the objects of the enclosing classes. Expressing dependency via nesting, however, has two limitations: Abstractions that depend on more than one object cannot be modeled and a class must know all classes that depend on its objects. This paper presents dependent classes, a generalization of virtual classes that expresses similar semantics by parameterization rather than by nesting. This increases expressivity of class variations as well as the flexibility of their modularization. Besides, dependent classes complement multimethods in scenarios where multi-dispatched abstractions rather than multi-dispatched methods are needed. They can also be used to express more precise signatures of multimethods and even extend their dispatch semantics. We present a formal semantics of dependent classes and a machine-checked type soundness proof in Isabelle/HOL [29], the first of this kind for a language with virtual classes and path-dependent types.
Vaidas Gasiunas, Mira Mezini, Klaus Ostermann
OOPSLA1