Georgios Goumas

Dr. Georgios Goumas

School of Electrical and Computer Engineering, National Technical University of Athens, 157-73 Athens, Greece

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
18 September 2009 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
MMManolis Maragkakis
Manolis Maragkakis
Panagiotis AlexiouPanagiotis Alexiou
Panagiotis Alexiou
GPGiorgio L Papadopoulos
Giorgio L Papadopoulos
MRMartin Reczko
Martin Reczko
TDTheodore Dalamagas
Theodore Dalamagas
AHArtemis G Hatzigeorgiou
Artemis G Hatzigeorgiou
MicroRNAs are small endogenously expressed non-coding RNA molecules that regulate target gene expression through translation repression or messenger RNA degradation. MicroRNA regulation is performed through pairing of the microRNA to sites in the messenger RNA of protein coding genes. Since experimental identification of miRNA target genes poses difficulties, computational microRNA target prediction is one of the key means in deciphering the role of microRNAs in development and disease. DIANA-microT 3.0 is an algorithm for microRNA target prediction which is based on several parameters calculated individually for each microRNA and combines conserved and non-conserved microRNA recognition elements into a final prediction score, which correlates with protein production fold change. Specifically, for each predicted interaction the program reports a signal to noise ratio and a precision score which can be used as an indication of the false positive rate of the prediction. Recently, several computational target prediction programs were benchmarked based on a set of microRNA target genes identified by the pSILAC method. In this assessment DIANA-microT 3.0 was found to achieve the highest precision among the most widely used microRNA target prediction programs reaching approximately 66%. The DIANA-microT 3.0 prediction results are available online in a user friendly web server at http://www.microrna.gr/microT

25 November 2008 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
GGGeorgios Goumas
Georgios Goumas
KKKornilios Kourtis
Kornilios Kourtis
NANikos Anastopoulos
Nikos Anastopoulos
VKVasileios Karakasis
Vasileios Karakasis
NKNectarios Koziris
Nectarios Koziris

16 January 2016 in SpringerPlus
Verified
Journal Article
Open access
PDF file
GFG. Fylaktopoulos
G. Fylaktopoulos
GGGeorgios Goumas
Georgios Goumas
MSM. Skolarikis
M. Skolarikis
ASA. Sotiropoulos
A. Sotiropoulos
Ilias MaglogiannisIlias Maglogiannis
Ilias Maglogiannis
This paper provides an overview of the state of the art technologies for software development in cloud environments. The surveyed systems cover the whole spectrum of cloud-based development including integrated programming environments, code repositories, software modeling, composition and documentation tools, and application management and orchestration. In this work we evaluate the existing cloud development ecosystem based on a wide number of characteristics like applicability (e.g. programming and database technologies supported), productivity enhancement (e.g. editor capabilities, debugging tools), support for collaboration (e.g. repository functionality, version control) and post-development application hosting and we compare the surveyed systems. The conducted survey proves that software engineering in the cloud era has made its initial steps showing potential to provide concrete implementation and execution environments for cloud-based applications. However, a number of important challenges need to be addressed for this approach to be viable. These challenges are discussed in the article, while a conclusion is drawn that although several steps have been made, a compact and reliable solution does not yet exist.

27 February 2023 in Proceedings of the ACM on Measurement and Analysis of Computing Systems
Verified
Journal Article
Open access
CGChristina Giannoula
Christina Giannoula
KHKailong Huang
Kailong Huang
JTJonathan Tang
Jonathan Tang
NKNectarios Koziris
Nectarios Koziris
GGGeorgios Goumas
Georgios Goumas
NVNandita Vijaykumar
Nandita Vijaykumar
Resource disaggregation offers a cost effective solution to resource scaling, utilization, and failure-handling in data centers by physically separating hardware devices in a server. Servers are architected as pools of processor, memory, and storage devices, organized as independent failure-isolated components interconnected by a high-bandwidth network. A critical challenge, however, is the high performance penalty of accessing data from a remote memory module over the network. Addressing this challenge is difficult as disaggregated systems have high runtime variability in network latencies/bandwidth, and page migration can significantly delay critical path cache line accesses in other pages. This paper conducts a characterization analysis on different data movement strategies in fully disaggregated systems, evaluates their performance overheads in a variety of workloads, and introduces DaeMon, the first software-transparent mechanism to significantly alleviate data movement overheads in fully disaggregated systems. First, to enable scalability to multiple hardware components in the system, we enhance each compute and memory unit with specialized engines that transparently handle data migrations. Second, to achieve high performance and provide robustness across various network, architecture and application characteristics, we implement a synergistic approach of bandwidth partitioning, link compression, decoupled data movement of multiple granularities, and adaptive granularity selection in data movements. We evaluate DaeMon in a wide variety of workloads at different network and architecture configurations using a state-of-the-art simulator. DaeMon improves system performance and data access costs by 2.39× and 3.06×, respectively, over the widely-adopted approach of moving data at page granularity.

1 January 2018 in Future Generation Computer Systems
Verified
Journal Article
Closed access
GFG. Fylaktopoulos
G. Fylaktopoulos
MSM. Skolarikis
M. Skolarikis
IPI. Papadopoulos
I. Papadopoulos
GGGeorgios Goumas
Georgios Goumas
ASA. Sotiropoulos
A. Sotiropoulos
Ilias MaglogiannisIlias Maglogiannis
Ilias Maglogiannis

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.