KONSTANTINOS NIKAS

Dr. KONSTANTINOS NIKAS

orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
1 February 2020 in Computer Networks
Verified
Journal Article
Open access
KPKonstantinos Perakis
Konstantinos Perakis
FLFenareti Lampathaki
Fenareti Lampathaki
KNKONSTANTINOS NIKAS
KONSTANTINOS NIKAS
YGYiannis Georgiou
Yiannis Georgiou
OMOskar Marko
Oskar Marko
JMJarissa Maselyne
Jarissa Maselyne

24 February 2022 in Remote Sensing
Verified
Journal Article
Open access
PDF file
PUPriti Upadhyay
Priti Upadhyay
Mikolaj CzerkawskiMikolaj Czerkawski
Mikolaj Czerkawski
CDChristopher Davison
Christopher Davison
JCJavier Cardona
Javier Cardona
MMMalcolm Macdonald
Malcolm Macdonald
Christos TachtatzisChristos Tachtatzis
Christos Tachtatzis
The rich, complementary data provided by Sentinel-1 and Sentinel-2 satellite constellations host considerable potential to transform Earth observation (EO) applications. However, a substantial amount of effort and infrastructure is still required for the generation of analysis-ready data (ARD) from the low-level products provided by the European Space Agency (ESA). Here, a flexible Python framework able to generate a range of consistent ARD aligned with the ESA-recommended processing pipeline is detailed. Sentinel-1 Synthetic Aperture Radar (SAR) data are radiometrically calibrated, speckle-filtered and terrain-corrected, and Sentinel-2 multi-spectral data resampled in order to harmonise the spatial resolution between the two streams and to allow stacking with multiple scene classification masks. The global coverage and flexibility of the framework allows users to define a specific region of interest (ROI) and time window to create geo-referenced Sentinel-1 and Sentinel-2 images, or a combination of both with closest temporal alignment. The framework can be applied to any location and is user-centric and versatile in generating multi-modal and multi-temporal ARD. Finally, the framework handles automatically the inherent challenges in processing Sentinel data, such as boundary regions with missing values within Sentinel-1 and the filtering of Sentinel-2 scenes based on ROI cloud coverage.

1 September 2017
Verified
Conference Paper
Closed access
DSDimitrios Siakavaras
Dimitrios Siakavaras
KNKONSTANTINOS NIKAS
KONSTANTINOS NIKAS
GGGeorgios Goumas
Georgios Goumas
NKNectarios Koziris
Nectarios Koziris
In this paper we introduce RCU-HTM, a technique that combines Read-Copy-Update (RCU) with Hardware Transactional Memory (HTM) to implement highly efficient concurrent Binary Search Trees (BSTs). Similarly to RCU-based algorithms, we perform the modifications of the tree structure in private copies of the affected parts of the tree rather than in-place. This allows threads that traverse the tree to proceed without any synchronization and without being affected by concurrent modifications. The novelty of RCU-HTM lies at leveraging HTM to permit multiple updating threads to execute concurrently. After appropriately modifying the private copy, we execute an HTM transaction, which atomically validates that all the affected parts of the tree have remained unchanged since they've been read and, only if this validation is successful, installs the copy in the tree structure.We apply RCU-HTM on AVL and Red-Black balanced BSTs and compare theirperformance to state-of-the-art lock-based, non-blocking, RCU- and HTM-basedBSTs. Our experimental evaluation reveals that BSTs implemented with RCU-HTMachieve high performance, not only for read-only operations, but also for update operations. More specifically, our evaluation includes a diverse range of tree sizes and operation workloads and reveals that BSTs based on RCU-HTM outperform other alternatives by more than 18%, on average, on a multi-core server with 44 hardware threads.

6 June 2022
Verified
Conference Paper
Open access
CKChristos Katsakioris
Christos Katsakioris
CAChloe Alverti
Chloe Alverti
VKVasileios Karakostas
Vasileios Karakostas
KNKONSTANTINOS NIKAS
KONSTANTINOS NIKAS
GGGeorgios Goumas
Georgios Goumas
NKNectarios Koziris
Nectarios Koziris
Although serverless computing brings major benefits to developers, the widespread adoption of Function-as-a-Service (FaaS) creates severe challenges for the cloud providers. Irregularity in function invocation patterns and the high cost of cold starts has led them to allocate precious DRAM resources to keep function instances always warm, a clearly sub-optimal and inflexible approach. To cope with this issue, both state-of-the-art and state-of-practice approaches consider snapshotting as a viable mitigation, thus directly associating cold start latency with storage performance. Prior studies consider storage to be inert, rather than the evolving hierarchy that it truly is. In this work, we evaluate cold start and warm function invocations on instances restored from snapshots residing on devices across different layers of the modern storage hierarchy. We thoroughly analyze and characterize the observed behavior of multiple workloads and identify fundamental trade-offs among the devices. We conclude by motivating and providing suggestions for the inclusion of the modern storage hierarchy as a decisive factor in serverless resource provisioning.

1 May 2017
Verified
Conference Paper
Closed access
TMTheodoros Marinakis
Theodoros Marinakis
AHAlexandros-Herodotos Haritatos
Alexandros-Herodotos Haritatos
KNKONSTANTINOS NIKAS
KONSTANTINOS NIKAS
GGGeorgios Goumas
Georgios Goumas
IAIraklis Anagnostopoulos
Iraklis Anagnostopoulos
Scheduling is a decision-making process that deals with the assignment of resources to tasks over given periods, aiming to optimize one or more objectives. Responsible for efficient distribution of the CPU time among the processes, scheduler has become an essential part of computer systems. While applications run on neighboring cores of a many-core system, they compete with each other for the shared resources (cache, memory etc.). This contention can result in great performance degradation for the applications that are concurrently executed. For this reason, treating the cores of a many-core systems as isolated and independent units is a very optimistic abstraction and can cause great problems to the objectives a scheduler tries to optimize. This paper presents a scheduler that focuses on improving the system's fairness by deciding the group of applications that will be executed together based on the progress they have performed. Results shows that the proposed scheduler achieves on average 86% fairness improvement compared to two state-of-art schedulers.

25 May 2025 in Mathematics
Verified
Journal Article
Open access
PDF file
TATheodore Andronikos
Theodore Andronikos
CBConstantinos Bitsakos
Constantinos Bitsakos
KNKONSTANTINOS NIKAS
KONSTANTINOS NIKAS
GGGeorgios Goumas
Georgios Goumas
NKNectarios Koziris
Nectarios Koziris
This paper introduces a novel quantum algorithm that is able to classify a hierarchy of classes of imbalanced Boolean functions. The fundamental characteristic of imbalanced Boolean functions is that the proportion of elements in their domain that take the value 0 is not equal to the proportion of elements that take the value 1. For every positive integer, n, the hierarchy contains a class of n-ary Boolean functions defined according to their behavioral pattern. The common trait of all the functions belonging to the same class is that they possess the same imbalance ratio. Our algorithm achieves classification in a straightforward manner as the final measurement reveals the unknown function with a probability of 1.0. Let us also note that the proposed algorithm is an optimal oracular algorithm because it can classify the aforementioned functions with just a single query to the oracle. At the same time, we explain in detail the methodology we followed to design this algorithm in the hope that it will prove general and fruitful, given that it can be easily modified and extended to address other classes of imbalanced Boolean functions that exhibit different behavioral patterns.