Hack on: Difference between revisions
| Line 30: | Line 30: | ||
* Getting into [[ARM]]. Getting into [[ACPI]]. Getting into [[Architecture]]. I want a (PIVT) MISD machine; until then, there's [[SIMD]]. | * Getting into [[ARM]]. Getting into [[ACPI]]. Getting into [[Architecture]]. I want a (PIVT) MISD machine; until then, there's [[SIMD]]. | ||
* [[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. Now it's [[Programming Language Theory]] by tomorrow's final. | ||
* [[Trees]] for smoking and computing. [[Lock-free algorithms|lock- and wait-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)! | ||