- Timestamp:
- Apr 24, 2019, 11:06:30 AM (5 years ago)
- Branches:
- ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, pthread-emulation, qualifiedEnum
- Children:
- 71a12390
- Parents:
- 70eaa80b
- Location:
- doc
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/bibliography/pl.bib
r70eaa80b r6eed619 1091 1091 year = 2006, 1092 1092 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} 1093 1102 } 1094 1103 … … 1667 1676 address = {Redwood City}, 1668 1677 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} 1669 1691 } 1670 1692 -
doc/theses/aaron_moss_PhD/phd/type-environment.tex
r70eaa80b r6eed619 299 299 This 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. 300 300 However, 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. 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. 302 \cbstartx 303 Alternatively, 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.