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

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

Browse

Filters

2016 - 201922020 - 20211

Settings

Has files: YesSubject: search.filters.subject.Erasure coding

Search Results

Now showing 1 - 3 of 3
  • Article
    Citation - WoS: 5
    Citation - Scopus: 7
    Founsure 1.0: an Erasure Code Library With Efficient Repair and Update Features
    (Elsevier, 2021) Arslan, Şuayb Şefik; Arslan, Şefik Şuayb; 02.02. Department of Computer Engineering; 02. Faculty of Engineering; 01. MEF University
    Founsure is an open-source software library that implements a multi-dimensional graph-based erasure coding entirely based on fast exclusive OR (XOR) logic. Its implementation utilizes compiler optimizations and multi-threading to generate the right assembly code for the given multi-core CPU architecture with vector processing capabilities. Founsure possesses important features that shall find various applications in modern data storage, communication, and networked computer systems, in which the data needs protection against device, hardware, and node failures. As data size reached unprecedented levels, these systems have become hungry for network bandwidth, computational resources, and average consumed power. To address that, the proposed library provides a three-dimensional design space that trades off the computational complexity, coding overhead, and data/node repair bandwidth to meet different requirements of modern distributed data storage and processing systems. Founsure library enables efficient encoding, decoding, repairs/rebuilds, and updates while all the required data storage and computations are distributed across the network nodes.
  • Conference Object
    Citation - WoS: 2
    Citation - Scopus: 2
    Implementation of Multi-Threaded Erasure Coding Under Multi-Processing Environments
    (IEEE, 2016) Arslan, Şefik Şuayb; 02.02. Department of Computer Engineering; 02. Faculty of Engineering; 01. MEF University
    Galois alan aritmetiği depolama ve iletişim cihazlarını veri kayıplarına karşı korumak için Reed-Solomon silme kodlarının temelini oluşturmaktadır. Galois alan aritmeti^ginin en güncel uygulamaları hızlı Galois alan hesaplamaları yapmamıza imkan sağlayan Intel’in SIMD eklerinde olduğu gibi 128-bitlik işlemci vektör talimatlarına dayanmaktadır. Buna rağmen, bu uygulamalar çoklu–dizin ve çoklu–süreçli ortamlara göre optimize edilmemiştir. Diğer taraftan, sunucuların çoklu istekleri eş zamanlı olarak yerine getirmesi ve donanımın sağladığı tüm paralelliği kodlama yükünü etkili yürütmek için kullanması arzu edilmektedir. Bu makale silme kodlarının çoklu-dizin işlemcilerle çoklu–süreçli ortamlarda nasıl kullanılaca^gının detaylarını sunmakta ve tek dizinli uygulamalara göre emtia mikro işlemciler ve Jerasure 2.0 yazılım kütüphanesini kullanarak önemli ölçüde performans artışının olabileceğini göstermektedir.
  • Article
    Citation - WoS: 6
    Citation - Scopus: 7
    A Reliability Model for Dependent and Distributed Mds Disk Array Units
    (IEEE Transactions on Reliability, 2019) Arslan, Şuayb Şefik; Arslan, Şefik Şuayb; 02.02. Department of Computer Engineering; 02. Faculty of Engineering; 01. MEF University
    Archiving and systematic backup of large digital data generates a quick demand for multi-petabyte scale storage systems. As drive capacities continue to grow beyond the few terabytes range to address the demands of today’s cloud, the likelihood of having multiple/simultaneous disk failures became a reality. Among the main factors causing catastrophic system failures, correlated disk failures and the network bandwidth are reported to be the two common source of performance degradation. The emerging trend is to use efficient/sophisticated erasure codes (EC) equipped with multiple parities and efficient repairs in order to meet the reliability/bandwidth requirements. It is known that mean time to failure and repair rates reported by the disk manufacturers cannot capture life-cycle patterns of distributed storage systems. In this study, we develop failure models based on generalized Markov chains that can accurately capture correlated performance degradations with multiparity protection schemes based on modern maximum distance separable EC. Furthermore, we use the proposed model in a distributed storage scenario to quantify two example use cases: Primarily, the common sense that adding more parity disks are only meaningful if we have a decent decorrelation between the failure domains of storage systems and the reliability of generic multiple single-dimensional EC protected storage systems.