3 ms·
if anything saves imperative programming it will be transactional memory, which is exremely hard. hardware TM and code written for TM are in a chicken-and-egg s
by arohner 17y ago
if anything saves imperative programming it will be transactional memory, which is exremely hard. hardware TM and code written for TM are in a chicken-and-egg situation. the answer is hybrid hardware/software TM and the sun guys are way ahead on this too.
What's interesting is STM is only hard in imperative languages. It's relatively straightforward in Clojure and Haskell. See http://enfranchisedmind.com/blog/posts/the-problem-with-stm-your-languages-still-suck/ http://enfranchisedmind.com/blog/posts/the-problem-with-stm-...
- benreesman 17y agoAwesome article! Also check out ch. 24 of Beautiful Code, which is about implementing STM in Haskell. <brag>Now seems like a reasonable chance to brag that Doug Crockford signed my copy of BC the other day! God I'm such a geek.</brag>
- zzygan 17y agoAlso recently there was a very interesting article in Communications of the ACM about STM vs HTM and the problems with both in a general sense. http://delivery.acm.org/10.1145/1410000/1400228/p40-cascaval.html?key1=1400228&key2=9950411421&coll=ACM&dl=ACM&CFID=33768312&CFTOKEN=64607598 http://delivery.acm.org/10.1145/1410000/1400228/p40-cascaval... Edit: Prettier version http://mags.acm.org/communications/200811/?folio=40&CFID=33768312&CFTOKEN=64607598 http://mags.acm.org/communications/200811/?folio=40&CFID...