Changeset 6eed619 for doc


Ignore:
Timestamp:
Apr 24, 2019, 11:06:30 AM (3 years ago)
Author:
Aaron Moss <a3moss@…>
Branches:
aaron-thesis, arm-eh, cleanup-dtors, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr
Children:
71a12390
Parents:
70eaa80b
Message:

thesis: add reference to concurrent hash tries

Location:
doc
Files:
2 edited

Legend:

Unmodified
Added
Removed
  • doc/bibliography/pl.bib

    r70eaa80b r6eed619  
    10911091    year        = 2006,
    10921092    edition     = {4th},
     1093}
     1094
     1095@techreport{Prokopec11,
     1096  keywords = {ctrie, concurrent map},
     1097  contributer = {a3moss@uwaterloo.ca},
     1098  title={Cache-aware lock-free concurrent hash tries},
     1099  author={Prokopec, Aleksandar and Bagwell, Phil and Odersky, Martin},
     1100  institution={EPFL},
     1101  year={2011}
    10931102}
    10941103
     
    16671676    address     = {Redwood City},
    16681677    year        = 1991,
     1678}
     1679
     1680@inproceedings{Prokopec12,
     1681  keywords={ctrie, hash trie, concurrent map},
     1682  contributer={a3moss@uwaterloo.ca},
     1683  title={Concurrent tries with efficient non-blocking snapshots},
     1684  author={Prokopec, Aleksandar and Bronson, Nathan Grasso and Bagwell, Phil and Odersky, Martin},
     1685  booktitle={ACM SIGPLAN Notices},
     1686  volume={47},
     1687  number={8},
     1688  pages={151--160},
     1689  year={2012},
     1690  organization={ACM}
    16691691}
    16701692
  • doc/theses/aaron_moss_PhD/phd/type-environment.tex

    r70eaa80b r6eed619  
    299299This persistent union-find data structure is efficient, but not thread-safe; as suggested in Section~\ref{resn-conclusion-sec}, it may be valuable to parallelize the \CFA{} expression resolver.
    300300However, allowing multiple threads concurrent access to the persistent data structure is likely to result in ``reroot thrashing'', as different threads reroot the data structure to their own versions of interest.
    301 This contention could be mitigated by partitioning the data structure into separate subtrees for each thread, with each subtree having its own root node, and the boundaries among them implemented with a lock-equipped !ThreadBoundary! edit node.
     301This contention could be mitigated by partitioning the data structure into separate subtrees for each thread, with each subtree having its own root node, and the boundaries among them implemented with a lock-equipped !ThreadBoundary! edit node.
     302\cbstartx
     303Alternatively, the concurrent hash trie of Prokopec \etal{} \cite{Prokopec11,Prokopec12} may be a useful hash-table replacement.
     304\cbendx
Note: See TracChangeset for help on using the changeset viewer.