Hack on: Difference between revisions
| Line 31: | Line 31: | ||
* [[Lamport's Hash]], [[Lamport's Clock]], [[Skip Lists]], I will put thoughts about [[automata|automata here]], [[Dijkstran Method]] | * [[Lamport's Hash]], [[Lamport's Clock]], [[Skip Lists]], I will put thoughts about [[automata|automata here]], [[Dijkstran Method]] | ||
* [[Flash]] sucks. Need get a handle on [[Compiler Design]] by tomorrow's midterm. | * [[Flash]] sucks. Need get a handle on [[Compiler Design]] by tomorrow's midterm. | ||
* [[Trees]] for smoking and computing. [[Lock-free algorithms]]. [[Cache-oblivious algorithms]]. [[RCU]] | * [[Trees]] for smoking and computing. [[Lock-free algorithms|lock- and wait-free]] algorithms. [[Cache-oblivious algorithms]]. [[RCU]] | ||
* [[Allocators]] get us that free store, son (usually through a [[DRAM]]-backed VM) | * [[Allocators]] get us that free store, son (usually through a [[DRAM]]-backed VM) | ||
** Said VM ''might'' implement [[transactional memory]], and ''almost certainly'' works on [[pages]] | ** Said VM ''might'' implement [[transactional memory]], and ''almost certainly'' works on [[pages]] | ||