Výsledky vyhľadávania - write efficient algorithms

Upresniť hľadanie
  1. 1

    MacroTrend: A Write-Efficient Cache Algorithm for NVM-Based Read Cache Autor Bao, Ning, Chai, Yun-Peng, Qin, Xiao, Wang, Chuan-Wen

    ISSN: 1000-9000, 1860-4749
    Vydavateľské údaje: Singapore Springer Singapore 01.02.2022
    “… For NVM-based read caches, many kinds of NVM devices cannot stand frequent data updates due to limited write endurance or high energy consumption of writing…”
    Získať plný text
    Journal Article
  2. 2

    C++ data structures and algorithms : learn how to write efficient code to build scalable and robust applications in C++ Autor Anggoro, Wisnu

    ISBN: 9781788835213, 1788835212
    Vydavateľské údaje: Birmingham Packt Publishing 2018
    “… This book will be your companion as it takes you through implementing classic data structures and algorithms to help you get up and running as a confident C++ programmer…”
    Získať plný text
    E-kniha Kniha
  3. 3

    A Write-Efficient Cache Algorithm based on Macroscopic Trend for NVM-based Read Cache Autor Bao, Ning, Chai, Yunpeng, Qin, Xiao

    ISSN: 1558-1101
    Vydavateľské údaje: EDAA 01.03.2019
    “… Although some new algorithms like SieveStore reduce cache write pressure, they still rely on those traditional cache schemes for data popularity prediction…”
    Získať plný text
    Konferenčný príspevok..
  4. 4

    Implicit Decomposition for Write-Efficient Connectivity Algorithms Autor Ben-David, Naama, Blelloch, Guy, Fineman, Jeremy, Gibbons, Phillip, Gu, Yan, McGuffey, Charles, Shun, Julian

    ISSN: 1530-2075
    Vydavateľské údaje: IEEE 01.05.2018
    “… in terms of latency, bandwidth, and energy. Motivated by this trend, we propose sequential and parallel algorithms to solve graph connectivity problems using significantly fewer writes than conventional algorithms…”
    Získať plný text
    Konferenčný príspevok..
  5. 5

    Efficient Write Scheme for Algorithm-Based Multi-Ported Memory Autor Bo-Ya Chen, Bo-En Chen, Bo-Cheng Lai

    ISSN: 2472-9124
    Vydavateľské údaje: IEEE 01.04.2019
    “…This paper proposes REMAP+, a novel design that enables efficient write scheme for algorithmic multi-ported memory, and attains better performance with smaller area. REMAP…”
    Získať plný text
    Konferenčný príspevok..
  6. 6

    Correlation-Aware Stripe Organization for Efficient Writes in Erasure-Coded Storage: Algorithms and Evaluation Autor Shen, Zhirong, Lee, Patrick P. C., Shu, Jiwu, Guo, Wenzhong

    ISSN: 1045-9219, 1558-2183
    Vydavateľské údaje: New York IEEE 01.07.2019
    “… However, how to mitigate the parity update overhead of partial stripe writes in erasure-coded storage systems is still a critical concern…”
    Získať plný text
    Journal Article
  7. 7

    Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry Autor Blelloch, Guy E, Gu, Yan, Sun, Yihan, Shun, Julian

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 11.07.2018
    Vydané v arXiv.org (11.07.2018)
    “…In this paper, we design parallel write-efficient geometric algorithms that perform asymptotically fewer writes than standard algorithms for the same problem…”
    Získať plný text
    Paper
  8. 8

    PUD-LRU: An Erase-Efficient Write Buffer Management Algorithm for Flash Memory SSD Autor Jian Hu, Hong Jiang, Lei Tian, Lei Xu

    ISBN: 9781424481811, 1424481813
    ISSN: 1526-7539
    Vydavateľské údaje: IEEE 01.08.2010
    “… temporal locality, this paper proposes a new flash-aware write-buffer management algorithm, called PUD-aware LRU algorithm (PUD-LRU…”
    Získať plný text
    Konferenčný príspevok..
  9. 9

    Implicit Decomposition for Write-Efficient Connectivity Algorithms Autor Ben-David, Naama, Blelloch, Guy E, Fineman, Jeremy T, Gibbons, Phillip B, Gu, Yan, McGuffey, Charles, Shun, Julian

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 07.10.2017
    Vydané v arXiv.org (07.10.2017)
    “… in terms of latency, bandwidth, and energy. Motivated by this trend, we propose sequential and parallel algorithms to solve graph connectivity problems using significantly fewer writes than conventional algorithms…”
    Získať plný text
    Paper
  10. 10

    Survey: Computational Models for Asymmetric Read and Write Costs Autor Gu, Yan

    Vydavateľské údaje: IEEE 01.05.2018
    “… This raises new challenges to algorithm design since many of the classic algorithms use approximately the same number of reads and writes…”
    Získať plný text
    Konferenčný príspevok..
  11. 11

    Efficient Algorithm for Disseminating Consistent Data to Read-Write Mobile Clients Autor Manikandan, K.Chitra

    ISSN: 2231-007X, 2230-9608
    Vydavateľské údaje: 31.07.2012
    “… This paper proposes an index-based algorithm for ensuring the consistency of read-write mobile clients…”
    Získať plný text
    Journal Article
  12. 12
  13. 13

    Efficient Algorithms with Asymmetric Read and Write Costs Autor Blelloch, Guy E, Fineman, Jeremy T, Gibbons, Phillip B, Gu, Yan, Shun, Julian

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 28.08.2016
    Vydané v arXiv.org (28.08.2016)
    “… Such asymmetry in memory costs poses a fundamentally different model from the RAM for algorithm design…”
    Získať plný text
    Paper
  14. 14
  15. 15

    Decentralized RFID coverage algorithms using writeable tags Autor Jedda, Ahmed, Khair, Mazen G., Mouftah, Hussein T.

    ISSN: 1389-1286, 1872-7069
    Vydavateľské údaje: Amsterdam Elsevier B.V 19.06.2016
    “…+, and MAX-MIN which are randomized algorithms that run in O(1) write/read rounds, 2) algorithm GDE which is an…”
    Získať plný text
    Journal Article
  16. 16

    Semi-Fast Byzantine-tolerant Shared Register without Reliable Broadcast Autor Konwar, Kishori M., Kumar, Saptaparni, Tseng, Lewis

    ISSN: 2575-8411
    Vydavateľské údaje: IEEE 01.11.2020
    “… Numerous shared register applications have a considerably high read-to-write ratio. Thus, having algorithms that make reads more efficient than writes is a fair trade…”
    Získať plný text
    Konferenčný príspevok..
  17. 17

    Algorithms for Large Scale Graphs Autor Russell, Katina

    ISBN: 9798845447708
    Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.2022
    “…Constructing efficient algorithms for graph problems is a fundamental problem in computer science…”
    Získať plný text
    Dissertation
  18. 18

    Optimizing Write Fidelity of MRAMs by Alternating Water-Filling Algorithm Autor Kim, Yongjune, Jeon, Yoocharn, Choi, Hyeokjin, Guyot, Cyril, Cassuto, Yuval

    ISSN: 0090-6778, 1558-0857
    Vydavateľské údaje: New York IEEE 01.09.2022
    Vydané v IEEE transactions on communications (01.09.2022)
    “…). We derive analytic solutions and propose an alternating water-filling algorithm by casting the MRAM's write operation as communication over parallel channels…”
    Získať plný text
    Journal Article
  19. 19

    Time-efficient read/write register in crash-prone asynchronous message-passing systems Autor Mostéfaoui, Achour, Raynal, Michel, Roy, Matthieu

    ISSN: 0010-485X, 1436-5057
    Vydavateľské údaje: Vienna Springer Vienna 01.01.2019
    Vydané v Computing (01.01.2019)
    “… This paper visits the notion of a fast implementation of an atomic register, and presents a new time-efficient asynchronous algorithm that reduces latency in many cases…”
    Získať plný text
    Journal Article
  20. 20

    Sorting with Asymmetric Read and Write Costs Autor Blelloch, Guy E, Fineman, Jeremy T, Gibbons, Phillip B, Gu, Yan, Shun, Julian

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 11.03.2016
    Vydané v arXiv.org (11.03.2016)
    “… In this paper we present models and algorithms that account for this difference, with a focus on write-efficient sorting algorithms…”
    Získať plný text
    Paper