Bilgisayar Mühendisliği Bölümü Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.11779/1940

Browse

Filters

20222

Settings

Publication Index: search.filters.publicationIndex.ScopusSubject: search.filters.subject.Optimization

Search Results

Now showing 1 - 2 of 2
  • Conference Object
    Eaft: Evolutionary Algorithms for Gcc Flag Tuning
    (IEEE, 2022-09-14) Tagtekin, Burak; Çakar, Tuna
    Due to limited resources, some methods come to the fore in finding and applying the factors that affect the working time of the code. The most common one is choosing the correct GCC flags using heuristic algorithms. For the codes compiled with GCC, the selection of optimization flags directly affects the speed of the processing, however, choosing the right one among hundreds of markers during this process is a resource consuming problem. This article explains how to solve the GCC flag optimization problem with EAFT. Rather than other autotuner tools such as Opentuner, EAFT is an optimized tool for GCC marker selection. Search infrastructure has been developed with particle swarm optimization and genetic algorithm with diffent submodels rather than using only Genetic Algorithm like FOGA. © 2022 IEEE.
  • Article
    Citation - WoS: 3
    Citation - Scopus: 3
    Exact Construction of Bs-Assisted Mscr Codes With Link Constraints
    (IEEE Communications Letters, 2022-02-01) Arslan, Şuayb Şefik
    It is clear that 5G network resources would be consumed by heavy data traffic owing to increased mobility, slicing, and layered/distributed storage system architecture. The problem is elevated when multiple node failures are repaired to address service quality requirements. Typical approaches include individual or cooperative data regeneration to efficiently utilize the available bandwidth. It is observed that storage systems of 5G and beyond technologies shall have a multi–layer architecture in which base stations (BS) would be present. Moreover, communication with each layer would be subject to various communication costs and link constraints. Under limited BS assistance and cooperation, the trade-off between storage per node and communication bandwidth has been established. In this trade–off, two operating points, namely minimum storage, and bandwidth regeneration are particularly important. In this study, we first identify the optimal number of BS use at the minimum storage regeneration point. An explicit code construction is provided subsequently for the exact minimum storage regeneration whereby each layer may help the repair process subject to a communication link constraint.