Výsledky vyhledávání - "write efficient algorithms"
-
1
Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 11.07.2018Vydáno 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ískat plný text
Paper -
2
Survey: Computational Models for Asymmetric Read and Write Costs
Vydáno: IEEE 01.05.2018Vydáno v 2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) (01.05.2018)“…With the arrival of new emerging technologies for non-volatile main memory, the cost of reading from memory will be significantly cheaper than the cost of…”
Získat plný text
Konferenční příspěvek -
3
Implicit Decomposition for Write-Efficient Connectivity Algorithms
ISSN: 1530-2075Vydáno: IEEE 01.05.2018Vydáno v 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) (01.05.2018)“…The future of main memory appears to lie in the direction of new technologies that provide strong capacity-to-performance ratios, but have write operations…”
Získat plný text
Konferenční příspěvek -
4
Algorithms for Large Scale Graphs
ISBN: 9798845447708Vydáno: ProQuest Dissertations & Theses 01.01.2022“…Constructing efficient algorithms for graph problems is a fundamental problem in computer science theory.This dissertation studies algorithms for large scale…”
Získat plný text
Dissertation
-
5
Algorithmic Building Blocks for Asymmetric Memories
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 27.06.2018Vydáno v arXiv.org (27.06.2018)“… In this paper, we study which algorithmic techniques are useful in designing practical write-efficient algorithms…”
Získat plný text
Paper -
6
W[1]-hardness of some domination-like problems parameterized by tree-width
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 03.04.2014Vydáno v arXiv.org (03.04.2014)“…\). Very few problems are known not to be FPT when parameterized by tree-width, as usually this restriction allows one to write efficient algorithms to solve the considered problems…”
Získat plný text
Paper -
7
Pro TBB : C++ parallel programming with threading building blocks
ISBN: 9781484243978, 1484243978, 9781484243985, 1484243986Vydáno: Berkeley, CA Apress 2019“…This open access book is a modern guide for all C++ programmers to learn Threading Building Blocks (TBB). Written by TBB and parallel programming experts, this…”
Získat plný text
E-kniha Kniha