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
!"#$%&''#()*)+*),#-./'0#(/*)&1+2,
#3.*4506#!"#-7/89*75,#!:*.50/#;"#<0+/0./&),#
$0*)#<+0
Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology
!"#$#$%#$&'()*+&,(#-.+/&"+.012%*3+-4&
)+#$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(3)
9.355x10^6
10^6
10^4
10^2
1

  

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

 

Collections: Computer Technologies and Information Sciences