Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Bagwell, Phil"'
This report describes an implementation of a non-blocking concurrent shared-memory hash trie based on single-word compare-and-swap instructions. Insert, lookup and remove operations modifying different parts of the hash trie can be run independent of
Externí odkaz:
http://arxiv.org/abs/1709.06056
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Languages & Compilers for Parallel Computing (9783642360350); 2013, p156-170, 15p
State-of-the-art immutable collections have wildly differing performance characteristics across their operations, often forcing programmers to choose different collection implementations for each task. Thus, changes to the program can invalidate the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______185::919ad6ae85fa2986bc2c410e3071e900
https://infoscience.epfl.ch/record/213452
https://infoscience.epfl.ch/record/213452
Autor:
Bagwell, Phil
Searching and traversing m-way trees using tries is a well known and broadly used technique. Three algorithms are presented, two have constant insert, search and delete cost, are faster than Hash Trees and can be searched twice as quickly cas Ternary
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______185::ae77574af427120cde6c078e92459e56
https://infoscience.epfl.ch/record/64394
https://infoscience.epfl.ch/record/64394
Autor:
Bagwell, Phil
Hash Trees with nearly ideal characteristics are described. These Hash Trees require no initial root hash table yet are faster and use significantly less space than chained or double hash trees. Insert, search and delete times are small and constant,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______185::63120bc903fba0e799f47a8a0ca69a57
https://infoscience.epfl.ch/record/64398
https://infoscience.epfl.ch/record/64398
Autor:
Bagwell, Phil
Since its inception Functional Programming, J. McCarthy, has almost universally used the Linked List as the underpinning data structure. This paper introduces a new data structure, the VList, that is compact, thread safe and significantly faster to u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______185::406c0575d9ed381f567a86fa880381c5
https://infoscience.epfl.ch/record/52465
https://infoscience.epfl.ch/record/52465
This report describes an implementation of a non-blocking concurrent shared-memory hash trie based on single-word compare-and-swap instructions. Insert, lookup and remove operations modifying different parts of the hash trie can be run independent of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a8bac552289497dc7f43a8eb408f641
https://infoscience.epfl.ch/record/166908
https://infoscience.epfl.ch/record/166908
As the number of cores increases in modern multiprocessors, it is becoming increasingly difficult to write general purpose applications that efficiently utilize this computing power. Most applications manipulate structured data. Modern languages and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______185::87cabd1b2c3e58ce42e1e6d6fb0b12f1
https://infoscience.epfl.ch/record/165523
https://infoscience.epfl.ch/record/165523