WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

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

Browse

Browsing WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection by Institution Author "Arslan, Suayb S. (35955672100)"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    Article
    Array BP-XOR Codes for Hierarchically Distributed Matrix Multiplication
    (IEEE-Inst Electrical Electronics Engineers Inc, 2022) Arslan, Suayb S.
    A novel fault-tolerant computation technique based on array Belief Propagation (BP)-decodable XOR (BP-XOR) codes is proposed for distributed matrix-matrix multiplication. The proposed scheme is shown to be configurable and suited for modern hierarchical compute architectures such as Graphical Processing Units (GPUs) equipped with multiple nodes, whereby each has many small independent processing units with increased core-to-core communications. The proposed scheme is shown to outperform a few of the well-known earlier strategies in terms of total end-to-end execution time while in presence of slow nodes, called stragglers. This performance advantage is due to the careful design of array codes which distributes the encoding operation over the cluster (slave) nodes at the expense of increased master-slave communication. An interesting trade-off between end-to-end latency and total communication cost is precisely described. In addition, to be able to address an identified problem of scaling stragglers, an asymptotic version of array BP-XOR codes based on projection geometry is proposed at the expense of some computation overhead. A thorough latency analysis is conducted for all schemes to demonstrate that the proposed scheme achieves order-optimal computation in both the sublinear as well as the linear regimes in the size of the computed product from an end-to-end delay perspective.
  • Thumbnail Image
    Article
    Exact Construction of BS-Assisted MSCR Codes With Link Constraints
    (IEEE-Inst Electrical Electronics Engineers Inc, 2022) Arslan, Suayb S.
    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.