Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Ananian/Asanovi!/Kuszmaul/Leiserson/Lie: Unbounded Transactional Memory, HPCA '05(1) Unbounded Transactional Memory
 

Summary: Ananian/Asanovi!/Kuszmaul/Leiserson/Lie: Unbounded Transactional Memory, HPCA '05(1)
Unbounded Transactional Memory
C. Scott Ananian, Krste Asanovi!,
Bradley C. Kuszmaul, Charles E. Leiserson,
Sean Lie
Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology
!"#$#$%#$&'()*+&,(#-.+/&"+.012%*3+-4&5
)+#$1).%+3"#
Thanks to Marty Deneroff (then at SGI)
This research supported in part by a DARPA HPCS grant with SGI,
DARPA/AFRL Contract F33615-00-C-1692, NSF Grants ACI-0324974 and
CNS-0305606, NSF Career Grant CCR00093354, and the Singapore-MIT
Alliance
Ananian/Asanovi!/Kuszmaul/Leiserson/Lie: Unbounded Transactional Memory, HPCA '05(2)
Transactional Memory
(definition)
! A transaction is a sequence of memory loads and
stores that either commits or aborts
! If a transaction commits, all the loads and stores

  

Source: Ananian, C. Scott - One Laptop Per Child

 

Collections: Computer Technologies and Information Sciences