Repository logoGCRIS

Scopus İndeksli Yayınlar Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.12573/395

Browse

Filters

20252

Settings

Author: search.filters.author.Yalcin, GulayWoS Q: search.filters.wosQuartile.Q2

Search Results

Now showing 1 - 2 of 2
  • Article
    Citation - WoS: 1
    Citation - Scopus: 2
    Spec17Tre: A New Dataset in Hardware Security and Using Deep Learning for Detecting Spectre Attacks
    (Springer Heidelberg, 2025-05-21) Aktas-Aydin, Hatice; Yalcin, Gulay
    Computer performance has become a significant subject of study due to the processing of big data, the complexity of calculations and the importance of time efficiency. Many companies are improving processor operating principles to increase performance. The most common methods for this purpose are speculative execution and cache usage. While these techniques improve performance, they also introduce certain security vulnerabilities. Spectre is an attack that exploits vulnerabilities created by speculative execution, affecting all modern processor architectures. Research has shown that using machine learning to detect these attacks can be quite effective, although the features are typically gathered at the software level, which may limit detection since some performance parameters are not conveyed to the software. This study presents an analysis of Spectre attacks and their detection using machine learning and deep learning methods at the hardware level. Experiments are conducted using GEM5, a full-system hardware simulator, to ensure that only hardware-visible performance parameters are also collected. Attack detection is performed using Support Vector Machine (SVM) and Long Short-Term Memory (LSTM) methods. The LSTM method is used in conjunction with SVM and Convolutional Neural Network (CNN) techniques, and all models were tested on a new dataset, Spec17Tre, created using "519.lbm" from the SPEC CPU2017 benchmarks. The study achieved a 95% accuracy rate in attack detection using the LSTM + CNN hybrid model, which also yielded an F1 score of 0.999 for detecting applied Spectre attack scenarios.
  • Article
    Citation - Scopus: 3
    CompreCity: Accelerating the Traveling Salesman Problem on GPU With Data Compression
    (Elsevier, 2025-05) Yalcin, Salih; Usul, Hamdi Burak; Yalcin, Gulay
    Traveling Salesman Problem (TSP) is one of the significant problems in computer science which tries to find the shortest path for a salesman who needs to visit a set of cities and it is involved in many computing problems such as networks, genome analysis, logistics etc. Using parallel executing paradigms, especially GPUs, is appealing in order to reduce the problem solving time of TSP. One of the main issues in GPUs is to have limited GPU memory which would not be enough for the entire data. Therefore, transferring data from the host device would reduce the performance in execution time. In this study, we applied three data compression methodologies to represent cities in the TSP such as (1) Using Greatest Common Divisor (2) Shift Cities to the Origin (3) Splitting Surface to Grids. Therefore, we include more cities in GPU memory and reduce the number of data transfers from the host device. We implement our methodology in Iterated Local Search (ILS) algorithm with 2-opt and The Lin-Kernighan-Helsgaun (LKH) Algorithm. We show that our implementation presents more than 25% performance improvement for both algorithms.