var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F6tzZkfSdk3MbxhYJP&jsonp=1&noBootstrap=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F6tzZkfSdk3MbxhYJP&jsonp=1&noBootstrap=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F6tzZkfSdk3MbxhYJP&jsonp=1&noBootstrap=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
    2. \n
  2. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
    3. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2017\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n The CSI Framework for Compiler-Inserted Program Instrumentation.\n \n \n \n\n\n \n Schardl, T. B.; Denniston, T.; Doucet, D.; Kuszmaul, B. C.; Lee, I. A.; and Leiserson, C. E.\n\n\n \n\n\n\n Proceedings of the ACM on Measurement and Analysis of Computing Systems — SIGMETRICS, 1(2): 43:1–43:25. December 2017.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{SchardlDeDo17,\n    author = {Tao B. Schardl and Tyler Denniston and Damon Doucet and Bradley C. Kuszmaul and I-Ting Angelina Lee and Charles E. Leiserson},\n    title = {The {CSI} Framework for Compiler-Inserted Program Instrumentation},\n    journal = {Proceedings of the ACM on Measurement and Analysis of Computing Systems --- SIGMETRICS},\n    year = {2017},\n    volume = {1},\n    number = {2},\n    pages = {43:1--43:25},\n    month = {December},\n    group = {Supertech},\n    localfile = {SchardlDeDo17},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Tapir: Embedding Fork-Join Parallelism into LLVM's Intermediate Representation.\n \n \n \n\n\n \n Schardl, T. B.; Moses, W. S.; and Leiserson, C. E.\n\n\n \n\n\n\n In Symposium on Principles and Practice of Parallel Programming, of PPoPP '17, pages 249–265, February 2017. ACM\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{SchardlMoLe17,\n  title={Tapir: Embedding Fork-Join Parallelism into {LLVM}'s Intermediate Representation},\n  author={Tao B. Schardl and William S. Moses and Charles E. Leiserson},\n  booktitle={Symposium on Principles and Practice of Parallel Programming},\n  series = {PPoPP '17},\n  Group = {Supertech},\n  pages={249--265},\n  month = {February},\n  year={2017},\n  publisher={ACM},\n  Localfile = {SchardlMoLe17},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (12)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n B-trees and Cache-Oblivious B-trees with Different-Sized Atomic Keys.\n \n \n \n\n\n \n Bender, M.; Ebrahimi, R.; Hu, H.; and Kuszmaul, B. C.\n\n\n \n\n\n\n Transactions on Database Systems, 41(3): 19-1–19-33. July 2016.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@Article{BenderEbHu16\n ,author       = {Michael Bender and Roozbeh Ebrahimi and Haodong Hu and Bradley C. Kuszmaul}\n ,title\t       = {B-trees and Cache-Oblivious B-trees with Different-Sized Atomic Keys}\n ,journal      = {Transactions on Database Systems}\n ,year\t       = 2016\n ,volume       = 41\n ,number       = 3\n ,month\t       = JUL\n ,pages\t       = {19-1--19-33}\n ,group        = {Supertech}\n ,localfile    = {BenderEbHu16}\n }\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n AutoGen: Automatic Discovery of Cache-Oblivious Parallel Recursive Algorithms for Solving Dynamic Programs.\n \n \n \n\n\n \n Chowdhury, R. A.; Ganapathi, P.; Tithi, J. J.; Bachmeier, C.; Kuszmaul, B. C.; Charles E. Leiserson, A. S.; and Tang, Y.\n\n\n \n\n\n\n In Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP '16), Barcelona, Spain, March 12–16 2016. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{ChowdhuryGaTi16\n ,author       = {Rezaul A. Chowdhury and Pramod Ganapathi and Jesmin Jahan Tithi and\n  Charles Bachmeier and Bradley C. Kuszmaul and Charles E. Leiserson,\n  Armando Solar-Lezama and Yuan Tang}\n ,title\t       = {{A}uto{G}en: Automatic Discovery of Cache-Oblivious Parallel Recursive Algorithms for Solving Dynamic Programs}\n ,booktitle    = {Proceedings of the 21st ACM SIGPLAN Symposium on Principles and\n    Practice of Parallel Programming (PPoPP '16)}\n ,year\t       = 2016\n ,address      = {Barcelona, Spain}\n ,month\t       = MAR # {~12--16}\n ,group        = {Supertech}\n ,localfile    = {ChowdhuryGaTi16}\n }\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n PageRank Pipeline Benchmark: Proposal for a Holistic System Benchmark for Big-Data Platforms.\n \n \n \n\n\n \n Dreher, P.; Byun, C.; Hill, C.; Gadepally, V.; Kuszmaul, B. C.; and Kepner, J.\n\n\n \n\n\n\n In Graph Algorithms Building Blocks, of GABB '16, Chicago, IL, USA, May 23 2016. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{DreherByHi16\n ,author       = {Patrick Dreher and Chansup Byun and Chris Hill and Vijay Gadepally and Bradley C. Kuszmaul and Jeremy Kepner}\n ,title\t       = {{P}age{R}ank Pipeline Benchmark: Proposal for a Holistic System Benchmark for Big-Data Platforms}\n ,series = {GABB '16}\n ,booktitle    = {Graph Algorithms Building Blocks}\n ,year\t       = 2016\n ,address      = {Chicago, IL, USA}\n ,month\t       = MAY # {~23}\n ,Group = {Supertech}\n ,localfile = {DreherByHi16}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Parallel Algorithms for Scheduling Data-Graph Computations.\n \n \n \n\n\n \n Hasenplaugh, W.\n\n\n \n\n\n\n Ph.D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, February 2016.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@phdthesis{Hasenplaugh16,\n  Author = {William Hasenplaugh},\n  Title = {Parallel Algorithms for Scheduling Data-Graph Computations},\n  Year = {2016},\n  Month = {February},\n  Localfile = {Hasenplaugh16},\n\tSchool = {Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology},\n\tGroup = {Supertech},\n  Address = {Cambridge, MA}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Lease/Release: Architectural Support for Scaling Contended Data Structures.\n \n \n \n\n\n \n Haider, S. K.; Hasenplaugh, W.; and Alistarh, D.\n\n\n \n\n\n\n In PPoPP '16: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, of PPoPP '16, March 2016. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{HaiderHaAl16,\n\tAuthor = {Syed Kamran Haider and William Hasenplaugh and Dan Alistarh},\n\tSeries = {PPoPP '16},\n  Booktitle = {PPoPP '16: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming},\n\tGroup = {Supertech},\n\tTitle = {Lease/Release: Architectural Support for Scaling Contended Data Structures},\n\tYear = {2016},\n\tMonth = {March},\n\tLocalfile = {HaiderHaAl16}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Optimizing Every Operation in a Write-optimized File System.\n \n \n \n\n\n \n Yuan, J.; Zhan, Y.; Jannen, W.; Pandey, P.; Akshintala, A.; Chandnani, K.; Deo, P.; Kasheff, Z.; Walsh, L.; Bender, M.; Farach-Colton, M.; Johnson, R.; Kuszmaul, B. C.; and Porter, D. E.\n\n\n \n\n\n\n In The 14th USENIX Conference on File and Storage Technologies (FAST '16), Santa Clara, California, February 22–25 2016. \n Best paper award. Also invited to USENIX ATC 2016 \"Best-of-the-Rest\" session.\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{YuanZhJa16\n ,author       = {Jun Yuan and Yang Zhan and William Jannen and Prashant Pandey and Amogh Akshintala and Kanchan Chandnani and Pooja Deo and Zardosht Kasheff and Leif Walsh and Michael Bender and Martin Farach-Colton and Rob Johnson and Bradley C. Kuszmaul and Donald E. Porter}\n ,title\t       = {Optimizing Every Operation in a Write-optimized File System}\n ,booktitle    = {The 14th USENIX Conference on File and Storage Technologies (FAST '16)}\n ,year\t       = 2016\n ,address      = {Santa Clara, California}\n ,month\t       = FEB # {~22--25}\n ,note         = {Best paper award.  Also invited to USENIX ATC 2016 "Best-of-the-Rest" session.}\n ,group        = {Supertech}\n ,localfile    = {YuanZhJa16}\n }\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Lazy Analytics: Let Other Queries Do the Work For You.\n \n \n \n\n\n \n Jannen, W.; Bender, M. A.; Farach-Colton, M.; Johnson, R.; Kuszmaul, B. C.; and Porter, D. E.\n\n\n \n\n\n\n In 8th USENIX Workshop on Hot Topics in Storage and File Systems, of HotStorage '16, Denver, CO, USA, June 20–21 2016. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{JannenBeFa16\n ,author       = {William Jannen and Michael A. Bender and Martin Farach-Colton and Rob Johnson and Bradley C. Kuszmaul and Donald E. Porter}\n ,title\t       = {Lazy Analytics: Let Other Queries Do the Work For You}\n ,booktitle    = {8th USENIX Workshop on Hot Topics in Storage and File Systems}\n ,series       = {HotStorage '16}\n ,year\t       = 2016\n ,address      = {Denver, CO, USA}\n ,month\t       = JUN # {~20--21}\n ,group = {Supertech}\n ,localfile = {JannenBeFa16}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Compact Navigation Oracles for Graphs with Bounded Clique-Width.\n \n \n \n\n\n \n Kamali, S.\n\n\n \n\n\n\n In Data Compression Conference, March 2016. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{Kamali16,\n\tAuthor = {Shahin Kamali},\n\tBooktitle = {Data Compression Conference},\n\tGroup = {Supertech},\n\tMonth = {March},\n\tTitle = {Compact Navigation Oracles for Graphs with Bounded Clique-Width},\n\tYear = {2016}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Performance Engineering of Multicore Software: Developing a Science of Fast Code for the Post-Moore Era.\n \n \n \n\n\n \n Schardl, T. B.\n\n\n \n\n\n\n Ph.D. Thesis, Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science, Cambridge, Massachusetts, September 2016.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@phdthesis{Schardl16,\n\tAddress = {Cambridge, Massachusetts},\n\tAuthor = {Tao B. Schardl},\n\tGroup = {Supertech},\n\tLocalfile = {neboat-phd-thesis},\n\tMonth = sep,\n\tSchool = {Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science},\n\tTitle = {Performance Engineering of Multicore Software: Developing a Science of Fast Code for the Post-Moore Era},\n\tYear = 2016}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n A Simple Deterministic Algorithm for Guaranteeing the Forward Progress of Transactions.\n \n \n \n\n\n \n Leiserson, C. E.\n\n\n \n\n\n\n Information Systems, 57: 69–74. April 2016.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@Article{Leiserson16,\n  author = \t {Charles E. Leiserson},\n  title = \t {A Simple Deterministic Algorithm for Guaranteeing the Forward Progress of Transactions},\n  journal = \t {Information Systems},\n  year = \t {2016},\n  OPTkey = \t {},\n  volume = \t {57},\n  OPTnumber = \t {},\n  pages = \t {69--74},\n  month = \t apr,\n  localfile =    {Leiserson16},\n  group =        {Supertech},\n  OPTnote = \t {},\n  OPTannote = \t {}\n}\n\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Upper Bounds on Number of Steals in Rooted Trees.\n \n \n \n\n\n \n Leiserson, C. E.; Schardl, T. B.; and Suksompong, W.\n\n\n \n\n\n\n Theory of Computing Systems, 58(2): 223–240. February 2016.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{LeisersonScSu16,\n    author = {Charles E. Leiserson and Tao B. Schardl and Warut Suksompong},\n    title = {Upper Bounds on Number of Steals in Rooted Trees},\n    journal = {Theory of Computing Systems},\n    year = {2016},\n    volume = {58},\n    number = {2},\n    pages = {223--240},\n    month = {February},\n    group = {Supertech},\n    localfile = {LeisersonScSu16},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n On the Efficiency of Localized Work Stealing.\n \n \n \n\n\n \n Suksompong, W.; Leiserson, C. E.; and Schardl, T. B.\n\n\n \n\n\n\n Information Processing Letters, 116(2): 100–106. February 2016.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{SuksompongLeSc16,\n    author = {Warut Suksompong and Charles E. Leiserson and Tao B. Schardl},\n    title = {On the Efficiency of Localized Work Stealing},\n    journal = {Information Processing Letters},\n    year = {2016},\n    volume = {116},\n    number = {2},\n    pages = {100--106},\n    month = {February},\n    group = {Supertech},\n    localfile = {SuksompongLeSc16},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (13)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Anatomy of a Meltdown: Non-Block Performance under High Contention.\n \n \n \n\n\n \n Alistarh, D.; and Hasenplaugh, W.\n\n\n \n\n\n\n In 10th ACM SIGPLAN Workshop on Transactional Computing, of TRANSACT 2015, June 2015. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{AlistarhHa15,\n  Author = {Dan Alistarh and William Hasenplaugh},\n  Series = {TRANSACT 2015},\n  Booktitle = {10th ACM SIGPLAN Workshop on Transactional Computing},\n  Title = {Anatomy of a Meltdown: Non-Block Performance under High Contention},\n  Year = {2015},\n  Month = {June},\n  Group = {Supertech},\n  Localfile = {AlistarhHa15}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n An Introduction to $B^ε$-trees and Write-Optimization.\n \n \n \n\n\n \n Bender, M. A.; Farach-Colton, M.; Jannen, W.; Johnson, R.; Kuszmaul, B. C.; Porter, D. E.; Yuan, J.; and Zhan, Y.\n\n\n \n\n\n\n ;login: The USENIX Magazine, 40(5): 22–28. October 2015.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@Article{BenderFaJa15\n ,author       = {Michael A. Bender and Martin Farach-Colton and William Jannen\n  and Rob Johnson and Bradley C. Kuszmaul and Donald E. Porter and Jun\n  Yuan and Yang Zhan}\n ,title\t       = {An Introduction to $B^\\epsilon$-trees and  Write-Optimization}\n ,journal      = {{;login: The USENIX Magazine}}\n ,year\t       = 2015\n ,pages        = {22--28}\n ,volume       = 40\n ,number       = 5\n ,month\t       = OCT\n ,Group        = {Supertech}\n ,localfile    = {BenderFaJa15}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Cache-Oblivious Iterated Predecessor Queries via Range Coalescing.\n \n \n \n\n\n \n Demaine, E. D.; Gopal, V.; and Hasenplaugh, W.\n\n\n \n\n\n\n In 14th International Symposium on Algorithms and Data Structures, of WADS '15, August 2015. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DemaineGoHa15,\n  Author = {Erik D. Demaine and Vineet Gopal and William Hasenplaugh},\n  Series = {WADS '15},\n  Booktitle = {14th International Symposium on Algorithms and Data Structures},\n  Title = {Cache-Oblivious Iterated Predecessor Queries via Range Coalescing},\n  Year = {2015},\n  Month = {August},\n  Group = {Supertech},\n  Localfile = {DemaineGoHa15}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Quantifying the Capactiy Limitations of Hardware Transactional Memory.\n \n \n \n\n\n \n Hasenplaugh, W.; Nguyen, A. T.; and Shavit, N.\n\n\n \n\n\n\n In 7th Workshop on the Theory of Transactional Memory, of WTTM '15, July 2015. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{HasenplaughNgSh15,\n\tAuthor = {William Hasenplaugh and Andrew T. Nguyen and Nir Shavit},\n\tSeries = {WTTM '15},\n\tBooktitle = {7th Workshop on the Theory of Transactional Memory},\n\tTitle = {Quantifying the Capactiy Limitations of Hardware Transactional Memory},\n\tGroup = {Supertech},\n\tYear = {2015},\n\tMonth = {July},\n\tLocalfile = {HasenplaughNgSh15}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n BetrFS: A Right-Optimized Write-Optimized File System.\n \n \n \n\n\n \n Jannen, W.; Yuan, J.; Zhan, Y.; Akshintala, A.; Esmet, J.; Jiao, Y.; Pandey, A. M. P.; Reddy, P.; Waslh, L.; Bender, M.; Farach-Colton, M.; Johnson, R.; Kuszmaul, B. C.; and Porter, D. E.\n\n\n \n\n\n\n In Proceedings of the 13th USENIX Conference on File and Storage Technologies (FAST '15), Santa Clara, California, February 16–19 2015. \n Runner up, best paper, one of three papers selected for fast-tracking to a special issue of Transactions on Storage\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{JannenYuZh15a,\n  author = \t {William Jannen and Jun Yuan and Yang Zhan and Amogh Akshintala and John Esmet and Yizheng Jiao and Ankur Mittaland Prashant Pandey and Phaneendra Reddy and Leif Waslh and Michael Bender and Martin Farach-Colton and Rob Johnson and Bradley C. Kuszmaul and Donald E. Porter},\n  title = \t {BetrFS: A Right-Optimized Write-Optimized File System},\n  localfile = {JannenYuZh15a},\n  group = {Supertech},\n  booktitle = {Proceedings of the 13th USENIX Conference on File and Storage Technologies (FAST '15)},\n  year = \t 2015,\n  address = \t {Santa Clara, California},\n  month = \t FEB # {~16--19},\n  note = \t {Runner up, best paper, one of three papers selected for fast-tracking to a special issue of Transactions on Storage}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n BetrFS: A Right-Optimized Write-Optimized File System.\n \n \n \n\n\n \n Jannen, W.; Yuan, J.; Zhan, Y.; Akshintala, A.; Esmet, J.; Jiao, Y.; Pandey, A. M. P.; Reddy, P.; Waslh, L.; Bender, M.; Farach-Colton, M.; Johnson, R.; Kuszmaul, B. C.; and Porter, D. E.\n\n\n \n\n\n\n ACM Transactions on Storage (TOS), 11(4). November 2015.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@Article{JannenYuZh15b,\n  author = \t {William Jannen and Jun Yuan and Yang Zhan and Amogh Akshintala and John Esmet and Yizheng Jiao and Ankur Mittaland Prashant Pandey and Phaneendra Reddy and Leif Waslh and Michael Bender and Martin Farach-Colton and Rob Johnson and Bradley C. Kuszmaul and Donald E. Porter},\n  title = \t {BetrFS: A Right-Optimized Write-Optimized File System},\n  localfile = {JannenYuZh15b},\n  group = {Supertech},\n  Journal = {ACM Transactions on Storage (TOS)},\n  year = \t 2015,\n  volume = 11,\n  number = 4,\n  page = {18:1-18:29},\n  month = NOV,\n  doi   = {10.1145/2798729}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Efficient Bin Packing Algorithms for Resource Provisioning in the Cloud.\n \n \n \n\n\n \n Kamali, S.\n\n\n \n\n\n\n In Proceedings of the International Workshop on Algorithmic Aspects of Cloud Computing, August 2015. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{Kamali15,\n\tAuthor = {Shahin Kamali},\n\tBooktitle = {Proceedings of the International Workshop on Algorithmic Aspects of Cloud Computing},\n\tGroup = {Supertech},\n\tLocalfile = {ShahinAlgoCloud15},\n\tMonth = {August},\n\tTitle = {Efficient Bin Packing Algorithms for Resource Provisioning in the Cloud},\n\tYear = {2015}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n All-Around Near-Optimal Solutions for the Online Bin Packing Problem.\n \n \n \n\n\n \n Kamali, S.; and López-Ortiz, A.\n\n\n \n\n\n\n In Proceedings of the 26th International Symposium on Algorithms and Computation, ISAAC 2015, pages 727–739, December 2015. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{KamaliLo15,\n\tAuthor = {Shahin Kamali and Alejandro L{\\'{o}}pez{-}Ortiz},\n\tBooktitle = {Proceedings of the 26th International Symposium on Algorithms and Computation, ISAAC 2015},\n\tGroup = {Supertech},\n\tLocalfile = {ShahinISAAC15},\n\tMonth = {December}, \n\tPages     = {727--739},\n\tTitle = {All-Around Near-Optimal Solutions for the Online Bin Packing Problem},\n\tYear = {2015}}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n SuperMalloc: A Super Fast Multithreaded malloc for 64-bit Machines.\n \n \n \n\n\n \n Kuszmaul, B. C.\n\n\n \n\n\n\n In Proceedings of the 2015 International Symposium on Memory Management, pages 41–55, Portland, OR, June 2015. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{Kuszmaul15\n ,author       = {Bradley C. Kuszmaul}\n ,title\t       = {{SuperMalloc}: A Super Fast Multithreaded malloc for 64-bit Machines}\n ,booktitle    = {Proceedings of the 2015 International Symposium on Memory Management}\n ,year\t       = 2015\n ,localfile = {Kuszmaul15}\n ,Group     = {Supertech}\n ,address      = {Portland, OR}\n ,month\t       = JUN\n ,pages\t       = {41--55}\n }\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Efficiently Detecting Races in Cilk Programs That Use Reducer Hyperobjects.\n \n \n \n \n\n\n \n Lee, I. A.; and Schardl, T. B.\n\n\n \n\n\n\n In Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, of SPAA '15, pages 111–122, New York, NY, USA, June 2015. ACM\n \n\n\n\n
\n\n\n\n \n \n \"EfficientlyPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n 
@inproceedings{LeeSc15,\n author = {I-Ting Angelina Lee and Tao B. Schardl},\n title = {Efficiently Detecting Races in Cilk Programs That Use Reducer Hyperobjects},\n booktitle = {Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures},\n series = {SPAA '15},\n month = jun,\n year = {2015},\n isbn = {978-1-4503-3588-1},\n location = {Portland, Oregon, USA},\n pages = {111--122},\n numpages = {12},\n url = {http://doi.acm.org/10.1145/2755573.2755599},\n doi = {10.1145/2755573.2755599},\n acmid = {2755599},\n publisher = {ACM},\n address = {New York, NY, USA},\n keywords = {cilk, determinacy race, nondeterminism, reducers, view-read race},\n localfile = {redrace},\n group = {Supertech},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Cilkprof Scalability Profiler.\n \n \n \n \n\n\n \n Schardl, T. B.; Kuszmaul, B. C.; Lee, I. A.; Leiserson, W. M.; and Leiserson, C. E.\n\n\n \n\n\n\n In Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, of SPAA '15, pages 89–100, New York, NY, USA, June 2015. ACM\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n 
@inproceedings{SchardlKuLe15,\n author = {Tao B. Schardl and Bradley C. Kuszmaul and I-Ting Angelina Lee and William M. Leiserson and Charles E. Leiserson},\n title = {The Cilkprof Scalability Profiler},\n booktitle = {Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures},\n series = {SPAA '15},\n month = jun,\n year = {2015},\n isbn = {978-1-4503-3588-1},\n location = {Portland, Oregon, USA},\n pages = {89--100},\n numpages = {12},\n url = {http://doi.acm.org/10.1145/2755573.2755603},\n doi = {10.1145/2755573.2755603},\n acmid = {2755603},\n publisher = {ACM},\n address = {New York, NY, USA},\n keywords = {cilk, cilkprof, compiler instrumentation, llvm, multithreading, parallelism, performance, profiling, scalability, serial bottleneck, span, work},\n localfile = {cilkprof},\n group = {Supertech},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Extreme Multi-Resolution Visualization: A Challenge on Many Levels.\n \n \n \n\n\n \n Balme, J.; Brown-Dymkoski, E.; Guerrero, V.; Jones, S.; Kessler, A.; Lichtl, A.; Lung, K.; Moses, W.; Museth, K.; Roberson, N.; Taller, D.; and Fogal, T.\n\n\n \n\n\n\n In SuperComputing 2015 Visualization and Data Analytics Showcase, August 2015. ACM\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BalmeBrGu15,\n\tAuthor = {Joanna Balme and Eric Brown-Dymkoski and Victor Guerrero and Stephen Jones and Andre Kessler and Adam Lichtl and Kevin Lung and William Moses and Ken Museth and Nathan Roberson and Danny Taller and Tom Fogal},\n\tBooktitle = {SuperComputing 2015 Visualization and Data Analytics Showcase},\n\tGroup = {Supertech},\n\tLocalFile = {BalmeBrGu15},\n\tMonth = {August},\n\tPublisher = {ACM},\n\tTitle = {Extreme Multi-Resolution Visualization: A Challenge on Many Levels},\n\tYear = {2015},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing.\n \n \n \n\n\n \n Demaine, E. D.; Kaler, T.; Liu, Q.; Sidford, A.; and Yedidia, A.\n\n\n \n\n\n\n In Algorithms and Data Structures: 14th International Symposium, WADS 2015, of WADS '15, pages 263–275, August 2015. Springer\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DemaineKaLiSi15,\n  title={Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing},\n  author={Erik D. Demaine and Tim Kaler and Quanquan Liu and Aaron Sidford and Adam Yedidia},\n  booktitle={Algorithms and Data Structures: 14th International Symposium, WADS 2015},\n  series = {WADS '15},\n  Group = {Supertech},\n  pages={263--275},\n  month = {August},\n  year={2015},\n  publisher={Springer},\n  Localfile = {DemaineKaLiSi15},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2014\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Improving HTM Scaling with Consistency-Oblivious Programming.\n \n \n \n\n\n \n Avni, H.; and Kuszmaul, B. C.\n\n\n \n\n\n\n In The Ninth ACM SIGPLAN Workshop on Transacstional Computing (TRANSACT 2014), Salt Lake City, Utah, March 2 2014. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{AvniKu14\n ,author       = {Hillel Avni and Bradley C. Kuszmaul}\n ,title\t       = {Improving {HTM} Scaling with Consistency-Oblivious Programming}\n ,booktitle    = {The Ninth ACM SIGPLAN Workshop on Transacstional Computing (TRANSACT 2014)}\n ,year\t       = 2014\n ,address      = {Salt Lake City, Utah}\n ,month\t       = MAR # {~2}\n ,Group = {Supertech}\n ,localfile = {AvniKu14}\n }\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Ordering Heuristics for Parallel Graph Coloring.\n \n \n \n \n\n\n \n Hasenplaugh, W.; Kaler, T.; Schardl, T. B.; and Leierson, C. E.\n\n\n \n\n\n\n In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, of SPAA '14, June 2014. \n \n\n\n\n
\n\n\n\n \n \n \"OrderingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{HasenplaughKaSc14,\n\tAuthor = {William Hasenplaugh and Tim Kaler and Tao B. Schardl and Charles E. Leierson},\n        Series = {SPAA '14},\n\tBooktitle = {Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures},\n\tGroup = {Supertech},\n\tLocalfile = {HasenplaughKaSc14},\n\tMonth = jun,\n        Url = {http://doi.acm.org/10.1145/2612669.2612697},\n\tTitle = {Ordering Heuristics for Parallel Graph Coloring},\n\tYear = {2014}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling.\n \n \n \n \n\n\n \n Kaler, T.; Hasenplaugh, W.; Schardl, T. B.; and Leierson, C. E.\n\n\n \n\n\n\n In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, of SPAA '14, June 2014. \n \n\n\n\n
\n\n\n\n \n \n \"ExecutingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{KalerHaSc14,\n\tAuthor = {Tim Kaler and William Hasenplaugh and Tao B. Schardl and Charles E. Leierson},\n        Series = {SPAA '14},\n\tBooktitle = {Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures},\n\tGroup = {Supertech},\n\tLocalfile = {KalerHaSc14},\n\tMonth = jun,\n        Url = {http://doi.acm.org/10.1145/2612669.2612673},\n\tTitle = {Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling},\n\tYear = {2014}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Brief Announcement: Few Buffers, Many Hot Spots, and No Tree Saturation (with High probability).\n \n \n \n\n\n \n Kuszmaul, B. C.; and Kuszmaul, W. H.\n\n\n \n\n\n\n In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, pages 67–69, June 2014. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{KuszmaulKu14a,\n  group = {Supertech},\n  author = \t {Bradley C. Kuszmaul and William H. Kuszmaul},\n  localfile = {KuszmaulKu14a},\n  title = \t {Brief Announcement: Few Buffers, Many Hot Spots, and No Tree Saturation (with High probability)},\n  Booktitle = {Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures},\n  pages = \t {67--69},\n  month = JUN,\n  year = \t 2014}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Avoiding Tree Saturation in the Face of Many Hotspots with Few Buffers.\n \n \n \n\n\n \n Kuszmaul, B. C.; and Kuszmaul, W. H.\n\n\n \n\n\n\n In The 16th IEEE International Conference on High Performance and Communications (HPCC), Paris, France, August 20–22 2014. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{KuszmaulKu14b,\n  localfile = {KuszmaulKu14b},\n  group = {Supertech},\n  author = \t {Bradley C. Kuszmaul and William H. Kuszmaul},\n  title = \t {Avoiding Tree Saturation in the Face of Many Hotspots with Few Buffers},\n  booktitle = {The 16th IEEE International Conference on High Performance and Communications (HPCC)},\n  year = \t 2014,\n  address = \t {Paris, France},\n  month = \t Aug # {~20--22}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Bounds on Multithreaded Computations by Work Stealing.\n \n \n \n\n\n \n Suksompong, W.\n\n\n \n\n\n\n Master's thesis, Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science, Cambridge, Massachusetts, June 2014.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Suksompong14,\n\tAddress = {Cambridge, Massachusetts},\n\tAuthor = {Warut Suksompong},\n\tGroup = {Supertech},\n\tLocalfile = {thesis-warutsuk},\n\tMonth = jun,\n\tSchool = {Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science},\n\tTitle = {Bounds on Multithreaded Computations by Work Stealing},\n\tYear = 2014}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2013\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n On-the-Fly Pipeline Parallelism.\n \n \n \n\n\n \n Lee, I. A.; Leiserson, C. E.; Schardl, T. B.; Sukha, J.; and Zhang, Z.\n\n\n \n\n\n\n In Proceedings of the Twenty-fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pages 140–151, New York, NY, USA, July 2013. ACM\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{LeeLeSc13,\n        Address = {New York, NY, USA},\n        Author = {I-Ting Angelina Lee and Charles E. Leiserson and Tao B. Schardl and Jim Sukha and Zhunping Zhang},\n        Title = {On-the-Fly Pipeline Parallelism},\n        Booktitle = {Proceedings of the Twenty-fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures},\n        Month = {July},\n        Year = {2013},\n        Pages = {140--151},\n        Publisher = {ACM},\n        Group = {Supertech},\n        Localfile = {spaa030-lee}\n} \n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2012\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Don't Thrash: How to Cache Your Hash on Flash.\n \n \n \n\n\n \n Bender, M. A.; Farach-Colton, M.; Johnson, R.; Kraner, R.; Kuszmaul, B. C.; Medjedovic, D.; Montes, P.; Shetty, P.; Spillane, R. P.; and Zadoc., E.\n\n\n \n\n\n\n Proceedings of the VLDB Endowment, 5(11): 1627–1637. 2012.\n An earlier version appeared in HotStorage, Portland, OR, June 2011.\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@Article{BenderFaJo12,\n  localfile = {BenderFaJo12},\n  Group = {Supertech},\n  author = \t {Michael A. Bender and Martin Farach-Colton and Rob Johnson and Russell Kraner and Bradley C. Kuszmaul and Dzejla Medjedovic and Pablo Montes and Pradeep Shetty and Richard P. Spillane and Erez Zadoc.},\n  title = \t {Don't Thrash: How to Cache Your Hash on Flash},\n  journal = \t {Proceedings of the VLDB Endowment},\n  year = \t 2012,\n  volume = \t 5,\n  number = \t 11,\n  pages = \t {1627--1637},\n  montffffh = \t JUL,\n  note  = {An earlier version appeared in HotStorage, Portland, OR, June 2011.}}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Memory Abstractions for Parallel Programming.\n \n \n \n\n\n \n Lee, I. A.\n\n\n \n\n\n\n Ph.D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts, March 2012.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@phdthesis{Lee12,\n\tAddress = {Cambridge, Massachusetts},\n\tAuthor = {I-Ting Angelina Lee},\n\tGroup = {Supertech},\n\tLocalfile = {angelee-phdthesis},\n\tMonth = mar,\n\tSchool = {Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology},\n\tTitle = {Memory Abstractions for Parallel Programming},\n\tYear = 2012}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Memory-Mapping Support for Reducer Hyperobjects.\n \n \n \n\n\n \n Lee, I. A.; Shafi, A.; and Leiserson, C. E.\n\n\n \n\n\n\n In SPAA '12: Proceedings of the 24th ACM Symposium on Parallel Algorithms and Architectures, pages 287–297, Pittsburgh, Pennsylvania, June 2012. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{LeeShLe12,\n        Address = {Pittsburgh, Pennsylvania},\n        Author = {I-Ting Angelina Lee and Aamir Shafi and Charles E. Leiserson},\n        Booktitle = {SPAA '12: Proceedings of the 24th ACM Symposium on Parallel\n               Algorithms and Architectures},\n\tGroup = {Supertech},\n\tLocalfile = {mmred},\n        Day = {25--27},\n        Month = {June},\n        Title = {Memory-Mapping Support for Reducer Hyperobjects},\n        Pages = {287--297},\n        Year = {2012}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Deterministic Parallel Random-Number Generation for Dynamic-Multithreading Platforms.\n \n \n \n\n\n \n Leiserson, C. E.; Schardl, T. B.; and Sukha, J.\n\n\n \n\n\n\n In PPoPP '12: Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, February 2012. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{LeisersonScSu12,\n\tAuthor = {Charles E. Leiserson and Tao B. Schardl and Jim Sukha},\n\tBooktitle = {PPoPP '12: Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming},\n\tGroup = {Supertech},\n\tLocalfile = {dprng},\n\tMonth = feb,\n\tTitle = {Deterministic Parallel Random-Number Generation for Dynamic-Multithreading Platforms},\n\tYear = {2012}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Cache-Oblivious Algorithms.\n \n \n \n\n\n \n Frigo, M.; Leiserson, C. E.; Prokop, H.; and Ramachandran, S.\n\n\n \n\n\n\n ACM Transactions on Algorithms, 8(1): 4:1–4:22. January 2012.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{FrigoLePr12,\n author = {Matteo Frigo and Charles E. Leiserson and Harald Prokop and Sridhar Ramachandran},\n title = {Cache-Oblivious Algorithms},\n journal = {ACM Transactions on Algorithms},\n volume = {8},\n number = {1},\n month = jan,\n year = {2012},\n pages = {4:1--4:22},\n group={Supertech},\n localfile = {FrigoLePr12},\n}\n\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2011\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Optimal Cache-Oblivious Mesh Layouts.\n \n \n \n\n\n \n Bender, M. A.; Kuszmaul, B. C.; Teng, S.; and Wang, K.\n\n\n \n\n\n\n Theory of Computing Systems, 48(2): 269–296. 2011.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@Article{BenderKuTe11,\n  author = \t {Michael A. Bender and Bradley C. Kuszmaul and Shang-Hua Teng and Kebin Wang},\n  title = \t {Optimal Cache-Oblivious Mesh Layouts},\n  journal = \t {Theory of Computing Systems},\n  year = \t 2011,\n  group = {Supertech},\n  localfile = {BenderKuTe11},\n  volume = \t 48,\n  number = \t 2,\n  pages = \t {269--296}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Location-Based Memory Fences.\n \n \n \n\n\n \n Ladan-Mozes, E.; Lee, I. A.; and Vyukov, D.\n\n\n \n\n\n\n In SPAA '11: Proceedings of the 23rd ACM Symposium on Parallel Algorithms and Architectures, pages 75–84, San Jose, California, June 2011. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{Ladan-MozesLeDm11,\n\tAddress = {San Jose, California},\n\tAuthor = {Edya Ladan-Mozes and I-Ting Angelina Lee and Dmitry Vyukov},\n\tBooktitle = {SPAA '11: Proceedings of the 23rd ACM Symposium on Parallel Algorithms and Architectures},\n\tDay = {4--6},\n\tGroup = {Supertech},\n\tLocalfile = {l-mfence},\n\tMonth = {June},\n\tTitle = {Location-Based Memory Fences},\n\tpages = {75--84},                  \n\tYear = {2011}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Coding Stencil Computation using the Pochoir stencil-specification language.\n \n \n \n\n\n \n Tang, Y.; Chowdhury, R. A.; Luk, C.; and Leiserson, C. E.\n\n\n \n\n\n\n In HotPar '11: 3rd USENIX Workshop on Hot Topics in Parallelism, Berkeley, California, May 2011. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{TangChLu11,\n\tAddress = {Berkeley, California},\n\tAuthor = {Yuan Tang and Rezaul Alam Chowdhury and Chi-Keung Luk and Charles E. Leiserson},\n\tBooktitle = {HotPar '11: 3rd USENIX Workshop on Hot Topics in Parallelism},\n\tDate-Modified = {2012-02-09 17:14:42 -0500},\n\tGroup = {Supertech},\n\tLocalfile = {pochoir_hotpar11},\n\tMonth = may,\n\tTitle = {Coding {Stencil} {Computation} using the {Pochoir} stencil-specification language},\n\tYear = 2011,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n The Pochoir stencil compiler.\n \n \n \n\n\n \n Tang, Y.; Chowdhury, R. A.; Kuszmaul, B. C.; Luk, C.; and Leiserson, C. E.\n\n\n \n\n\n\n In SPAA '11: The 23rd ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, California, June 2011. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{TangChKu11,\n\tAddress = {San Jose, California},\n\tAuthor = {Yuan Tang and Rezaul Alam Chowdhury and Bradley C. Kuszmaul and Chi-Keung Luk and Charles E. Leiserson},\n\tBooktitle = {SPAA '11: The 23rd ACM Symposium on Parallelism in Algorithms and Architectures},\n\tDate-Modified = {2012-02-09 17:14:34 -0500},\n\tDay = {4--6},\n\tGroup = {Supertech},\n\tLocalfile = {pochoir_spaa11},\n\tMonth = {June},\n\tTitle = {The {P}ochoir stencil compiler},\n\tYear = {2011},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2010\n \n \n (7)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Helper Locks for Fork-Join Parallel Programming.\n \n \n \n\n\n \n Agrawal, K.; Leiserson, C. E.; and Sukha, J.\n\n\n \n\n\n\n In Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), Bangalore, India, January 2010. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{AgrawalLeSu10a,\n\tAddress = {Bangalore, India},\n\tAuthor = {Kunal Agrawal and Charles E. Leiserson and Jim Sukha},\n\tBooktitle = {Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)},\n\tDay = {9--14},\n\tGroup = {Supertech},\n\tLocalfile = {HELPER-ppopp10},\n\tMonth = JAN,\n\tTitle = {Helper Locks for Fork-Join Parallel Programming},\n\tYear = 2010}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Executing Task Graphs Using Work-Stealing.\n \n \n \n\n\n \n Agrawal, K.; Leiserson, C. E.; and Sukha, J.\n\n\n \n\n\n\n In Proceedings of the 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS), Atlanta, GA, USA, April 2010. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{AgrawalLeSu10b,\n\tAddress = {Atlanta, GA, USA},\n\tAuthor = {Kunal Agrawal and Charles E. Leiserson and Jim Sukha},\n\tBooktitle = {Proceedings of the 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS)},\n\tDay = {19--23},\n\tGroup = {Supertech},\n\tLocalfile = {nabbit-ipdps10},\n\tMonth = APR,\n\tTitle = {Executing Task Graphs Using Work-Stealing},\n\tYear = 2010}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Brief Announcement: Serial-Parallel Reciprocity in Dynamic Multithreaded Languages.\n \n \n \n\n\n \n Agrawal, K.; Lee, I. A.; and Sukha, J.\n\n\n \n\n\n\n In SPAA '10: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, pages 186–188, Thira, Santorini, Greece, June 2010. ACM\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{AgrawalLeSu10c,\n\tAddress = {Thira, Santorini, Greece},\n\tAuthor = {Kunal Agrawal and I-Ting Angelina Lee and Jim Sukha},\n\tBooktitle = {SPAA '10: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures},\n\tDoi = {http://doi.acm.org/10.1145/1810479.1810517},\n\tGroup = {Supertech},\n\tLocalfile = {prcilk-spaa10},\n\tMonth = {June},\n\tPages = {186--188},\n\tPublisher = {ACM},\n\tTitle = {Brief Announcement: Serial-Parallel Reciprocity in Dynamic Multithreaded Languages},\n\tYear = {2010},\n\t}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Performance Gurantees for B-trees with Different-Sized Atomic Keys.\n \n \n \n\n\n \n Bender, M. A.; Hu, H.; and Kuszmaul, B. C.\n\n\n \n\n\n\n In PODS, pages 305–316, 2010. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{BenderHuKu10,\n  author = \t {Michael A. Bender and Haodong Hu and Bradley C. Kuszmaul},\n  title = \t {Performance Gurantees for B-trees with Different-Sized Atomic Keys},\n  Group = {Supertech},\n  Localfile = {BenderHuKu10},\n  booktitle = {PODS},\n  pages = \t {305--316},\n  year = \t 2010}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Using Memory Mapping to Support Cactus Stacks in Work-Stealing Runtime Systems.\n \n \n \n\n\n \n Lee, I. A.; Boyd-Wickizer, S.; Huang, Z.; and Leiserson, C. E.\n\n\n \n\n\n\n In PACT '10: Proceedings of the 19th International Conference on Parallel Architectures and Compilation Techniques, pages 411–420, Vienna, Austria, September 2010. ACM\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{LeeBoHu10,\n\tAddress = {Vienna, Austria},\n\tAuthor = {I-Ting Angelina Lee and Silas Boyd-Wickizer and Zhiyi Huang and Charles E. Leiserson},\n\tBooktitle = {PACT '10: Proceedings of the 19th International Conference on Parallel Architectures and Compilation Techniques},\n\tGroup = {Supertech},\n\tLocalfile = {stacks},\n\tMonth = {September},\n\tPages = {411--420},\n\tPublisher = {ACM},\n\tTitle = {Using Memory Mapping to Support Cactus Stacks in Work-Stealing Runtime Systems},\n\tYear = {2010}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Work-Efficient Parallel Breadth-First Search Algorithm (or How to Cope with the Nondeterminism of Reducers).\n \n \n \n \n\n\n \n Leiserson, C. E.; and Schardl, T. B.\n\n\n \n\n\n\n In SPAA '10: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, pages 303-314, June 2010. \n \n\n\n\n
\n\n\n\n \n \n \"ALink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{LeisersonSc10,\n\tAuthor = {Charles E. Leiserson and Tao B. Schardl},\n\tBooktitle = {SPAA '10: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures},\n\tEe = {http://doi.acm.org/10.1145/1810479.1810534},\n\tGroup = {Supertech},\n\tLocalfile = {pbfs},\n\tMonth = jun,\n\tPages = {303-314},\n\tTitle = {A Work-Efficient Parallel Breadth-First Search Algorithm (or How to Cope with the Nondeterminism of Reducers)},\n\tYear = {2010}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n The Cilk++ Concurrency Platform.\n \n \n \n\n\n \n Leiserson, C. E.\n\n\n \n\n\n\n The Journal of Supercomputing, 51(3): 244–257. 2010.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{Leiserson10,\n\tAuthor = {Charles E. Leiserson},\n\tJournal = {The Journal of Supercomputing},\n\tNumber = {3},\n\tPages = {244--257},\n\tTitle = {The Cilk++ Concurrency Platform},\n\tVolume = {51},\n\tYear = {2010},\n        group = {Supertech},\n\tlocalfile = {Leiserson10},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2009\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Safe Open-Nested Transactions Through Ownership.\n \n \n \n\n\n \n Agrawal, K.; Lee, I. A.; and Sukha, J.\n\n\n \n\n\n\n In Proceedings of the 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), Raleigh, NC, USA, February 2009. ACM\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{AgrawalLeSu09,\n\tAddress = {Raleigh, NC, USA},\n\tAuthor = {Kunal Agrawal and I-Ting Angelina Lee and Jim Sukha},\n\tBooktitle = {Proceedings of the 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)},\n\tDay = {14--18},\n\tDoi = {http://doi.acm.org/10.1145/1504176.1504200},\n\tGroup = {Supertech},\n\tLocalfile = {oat-ppopp09},\n\tMonth = {February},\n\tPublisher = {ACM},\n\tTitle = {Safe Open-Nested Transactions Through Ownership},\n\tYear = {2009},\n\t}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Brief Announcement: A Lower Bound for Depth-Restricted Work Stealing.\n \n \n \n\n\n \n Sukha, J.\n\n\n \n\n\n\n In Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Calgary, Canada, August 2009. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{Sukha09,\n\tAddress = {Calgary, Canada},\n\tAuthor = {Jim Sukha},\n\tBooktitle = {Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},\n\tGroup = {Supertech},\n\tLocalfile = {ws_depth_spaa09},\n\tMonth = AUG,\n\tTitle = {Brief Announcement: A Lower Bound for Depth-Restricted Work Stealing},\n\tYear = 2009}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks.\n \n \n \n\n\n \n Buluç, A.; Fineman, J. T.; Frigo, M.; Gilbert, J. R.; and Leiserson, C. E.\n\n\n \n\n\n\n August 2009.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@conference{BulucFiFr09,\n\tAuthor = {Ayd\\in Bulu\\c{c} and Jeremy T. Fineman and Matteo Frigo and John R. Gilbert and Charles E. Leiserson},\n\tBooktitle = {SPAA},\n\tGroup = {Supertech},\n\tLocalfile = {csb},\n\tMonth = {August},\n\tPages = {233--144},\n\tPublisher = {ACM},\n\tTitle = {Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks},\n\tYear = {2009},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2008\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Nested Parallelism in Transactional Memory.\n \n \n \n\n\n \n Agrawal, K.; Fineman, J. T.; and Sukha, J.\n\n\n \n\n\n\n In Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), Salt Lake City, Utah, USA, February 2008. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{AgrawalFiSu08,\n\tAddress = {Salt Lake City, Utah, USA},\n\tAuthor = {Kunal Agrawal and Jeremy T. Fineman and Jim Sukha},\n\tBooktitle = {Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)},\n\tDay = {20--23},\n\tGroup = {Supertech},\n\tLocalfile = {cwstm},\n\tMonth = {February},\n\tTitle = {Nested Parallelism in Transactional Memory},\n\tYear = {2008}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Safe Open-Nested Transactions Through Ownership.\n \n \n \n\n\n \n Agrawal, K.; Lee, I. A.; and Sukha, J.\n\n\n \n\n\n\n Technical Report MIT-CSAIL-TR-2008-038, Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory, June 2008.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@techreport{AgrawalLeSu08,\n\tAuthor = {Kunal Agrawal and I-Ting Angelina Lee and Jim Sukha},\n\tGroup = {Supertech},\n\tInstitution = {Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory},\n\tLocalfile = {safe-tech},\n\tMonth = {June},\n\tNumber = {MIT-CSAIL-TR-2008-038},\n\tTitle = {Safe Open-Nested Transactions Through Ownership},\n\tYear = 2008}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Consistency Architecture for Hierarchical Shared Caches.\n \n \n \n \n\n\n \n Ladan-Mozes, E.; and Leiserson, C. E.\n\n\n \n\n\n\n In SPAA '08: Proceedings of the 20th ACM Symposium on Parallel Algorithms and Architectures, pages 11-22, Munich, Germany, June 2008. \n \n\n\n\n
\n\n\n\n \n \n \"ALink\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{Ladan-MozesL08,\n\tAddress = {Munich, Germany},\n\tAuthor = {Edya Ladan-Mozes and Charles E. Leiserson},\n\tBooktitle = {SPAA '08: Proceedings of the 20th ACM Symposium on Parallel Algorithms and Architectures},\n\tDay = {14--16},\n\tEe = {http://doi.acm.org/10.1145/1378533.1378536},\n\tGroup = {Supertech},\n\tLocalfile = {hcc-spaa08},\n\tMonth = {June},\n\tPages = {11-22},\n\tTitle = {A Consistency Architecture for Hierarchical Shared Caches},\n\tYear = {2008}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Adaptive Work-stealing with Parallelism Feedback.\n \n \n \n\n\n \n Agrawal, K.; Leiserson, C. E.; He, Y.; and Hsu, W. J.\n\n\n \n\n\n\n ACM Transactions on Computing Systems, 26(3): 7:1–7:32. September 2008.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{AgrawalLeHe08,\n author = {Kunal Agrawal and Charles E. Leiserson and Yuxiong He and Wen Jing Hsu},\n title = {Adaptive Work-stealing with Parallelism Feedback},\n journal = {ACM Transactions on Computing Systems},\n volume = {26},\n number = {3},\n month = sep,\n year = {2008},\n pages = {7:1--7:32},\n group = {Supertech},\n localfile = {AgrawalLeHe08}\n} \n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2007\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n The Worst Page-Replacement Policy.\n \n \n \n\n\n \n Agrawal, K.; Bender, M. A.; and Fineman, J. T.\n\n\n \n\n\n\n In Proceedings of the Fourth International Conference on Fun With Algorithms, Castiglioncello (LI), Tuscany, Italy, June3–5 2007. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{AgrawalBeFi07,\n\tAddress = {Castiglioncello (LI), Tuscany, Italy},\n\tAuthor = {Kunal Agrawal and Michael A. Bender and Jeremy T. Fineman},\n\tBooktitle = {Proceedings of the Fourth International Conference on Fun With Algorithms},\n\tGroup = {Supertech},\n\tLocalfile = {badcache},\n\tMonth = {June} # {3--5},\n\nTitle = {The Worst Page-Replacement Policy},\n\tYear = {2007}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Adaptive work stealing with parallelism feedback.\n \n \n \n\n\n \n Agrawal, K.; He, Y.; and Leiserson, C. E.\n\n\n \n\n\n\n In Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, of PPoPP '07, pages 112–120, New York, NY, USA, March14–17 2007. ACM\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{AgrawalHeLe07,\n\tauthor = {Kunal Agrawal and Yuxiong He and Charles E. Leiserson},\n\ttitle = {Adaptive work stealing with parallelism feedback},\n\tbooktitle = {Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming},\n\tGroup = {Supertech},\n\tLocalfile = {AgrawalHeLe07},\n\tseries = {PPoPP '07},\n        month = {March} # {14--17},\n\tyear = {2007},\n        location = {San Jose, California, USA},\n        pages = {112--120},\n        publisher = {ACM},\n        address = {New York, NY, USA},\n} \n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Cache-Oblivious Streaming B-trees.\n \n \n \n\n\n \n Bender, M. A.; Farach-Colton, M.; Fineman, J. T.; Fogel, Y.; Kuszmaul, B.; and Nelson, J.\n\n\n \n\n\n\n In Proceedings of the Nineteenth ACM Symposium on Parallelism in Algorithms and Architectures, pages 81–92, San Diego, CA, USA, June9–11 2007. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BenderFaFi07,\n\tAddress = {San Diego, CA, USA},\n\tAuthor = {Michael A. Bender and Martin Farach-Colton and Jeremy T. Fineman and Yonatan Fogel and Bradley Kuszmaul and Jelani Nelson},\n\tBooktitle = {Proceedings of the Nineteenth ACM Symposium on Parallelism in Algorithms and Architectures},\n\tGroup = {Supertech},\n\tLocalfile = {sbtree},\n\tMonth = {June} # {9--11},\n\tPages = {81--92},\n\tTitle = {Cache-Oblivious Streaming B-trees},\n\tYear = 2007}\n\n\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2006\n \n \n (9)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Adaptive Task Scheduling with Parallelism Feedback.\n \n \n \n\n\n \n Agrawal, K.; He, Y.; Hsu, W. J.; and Leiserson, C. E.\n\n\n \n\n\n\n In Proceedings of the Annual ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), New York City, NY, USA, March29–31 2006. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{AgrawalHeHs06,\n\tAddress = {New York City, NY, USA},\n\tAuthor = {Kunal Agrawal and Yuxiong He and Wen Jing Hsu and Charles E. Leiserson},\n\tBooktitle = {Proceedings of the Annual ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)},\n\tGroup = {Supertech},\n\tLocalfile = {greedy-adapt},\n\tMonth = {March} # { 29--31},\n        Day = { 29--31},          \n\tTitle = {Adaptive Task Scheduling with Parallelism Feedback},\n\tYear = 2006}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n An Empirical Evaluation of Work Stealing with Parallelism Feedback.\n \n \n \n\n\n \n Agrawal, K.; He, Y.; and Leiserson, C. E.\n\n\n \n\n\n\n In Proceedings of the International Conference on Distributed Computing Systems (ICDCS), July 2006. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{AgrawalHeLe06b,\n\tAuthor = {Kunal Agrawal and Yuxiong He and Charles E. Leiserson},\n\tBooktitle = {Proceedings of the International Conference on Distributed Computing Systems (ICDCS)},\n\tGroup = {Supertech},\n\tLocalfile = {adapt-exp},\n\tLocation = {Lisboa, Portugal},\n\tMonth = {July},\n\tTitle = {An Empirical Evaluation of Work Stealing with Parallelism Feedback},\n\tYear = {2006}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Memory Models for Open-Nested Transactions.\n \n \n \n\n\n \n Agrawal, K.; Leiserson, C. E.; and Sukha, J.\n\n\n \n\n\n\n In Proceedings of the ACM SIGPLAN Workshop on Memory Systems Performance and Correctness (MSPC), October 2006. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{AgrawalLeSu06,\n\tAuthor = {Kunal Agrawal and Charles E. Leiserson and Jim Sukha},\n\tBooktitle = {Proceedings of the ACM SIGPLAN Workshop on Memory Systems Performance and Correctness (MSPC)},\n\tGroup = {Supertech},\n\tLocalfile = {open-mspc},\n\tLocation = {San Jose, CA, USA},\n\tMonth = {October},\n\tTitle = {Memory Models for Open-Nested Transactions},\n\tYear = {2006}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Cache-Oblivious String B-Trees.\n \n \n \n\n\n \n Bender, M. A.; Farach-Colton, M.; and Kuszmaul, B. C.\n\n\n \n\n\n\n In Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 223–242, Chicago, IL, June 2006. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BenderFaKu06,\n\tAddress = {Chicago, IL},\n\tAuthor = {Michael A. Bender and Martin Farach-Colton and Bradley C. Kuszmaul},\n\tBooktitle = {Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems},\n\tGroup = {Supertech},\n\tLocalfile = {BenderFaKu06},\n\tMonth = JUN,\n\tPages = {223--242},\n\tTitle = {Cache-Oblivious String {B}-Trees},\n\tYear = 2006}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Contention Resolution with Heterogeneous Job Sizes.\n \n \n \n\n\n \n Bender, M. A.; Fineman, J. T.; and Gilbert, S.\n\n\n \n\n\n\n In Proceedings of the 14th Annual European Symposium on Algorithms (ESA), pages 112–123, Zürich, Switzerland, September 2006. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BenderFiGi06,\n\tAddress = {Z{\\"{u}}rich, Switzerland},\n\tAuthor = {Michael A. Bender and Jeremy T. Fineman and Seth Gilbert},\n\tBooktitle = {Proceedings of the 14th Annual European Symposium on Algorithms (ESA)},\n\tGroup = {Supertech},\n\tLocalfile = {varbackoff},\n\tMonth = {September},\n\tPages = {112--123},\n\tTitle = {Contention Resolution with Heterogeneous Job Sizes},\n\tYear = 2006}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Programming with Exceptions in JCilk.\n \n \n \n\n\n \n Danaher, J. S.; Lee, I. A.; and Leiserson, C. E.\n\n\n \n\n\n\n Science of Computer Programming (SCP), 63(2): 147–171. December 2006.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DanaherLeLe06,\n\tAuthor = {John S. Danaher and I-Ting Angelina Lee and Charles E. Leiserson},\n\tGroup = {Supertech},\n\tJournal = {Science of Computer Programming (SCP)},\n\tLocalfile = {jcilk-scp},\n\tMonth = dec,\n\tNumber = 2,\n\tPages = {147--171},\n\tPublisher = {Elsevier},\n\tTitle = {Programming with Exceptions in JCilk},\n\tVolume = 63,\n\tYear = 2006}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Provably Efficient Two-level Adaptive Scheduling.\n \n \n \n\n\n \n He, Y.; Hsu, W.; and Leiserson, C. E.\n\n\n \n\n\n\n In In the Proceedings of the 12th Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP), Saint-Malo, France, June 2006. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{HeHsLe06,\n\tAddress = {Saint-Malo, France},\n\tAuthor = {Yuxiong He and Wen-Jing Hsu and Charles E. Leiserson},\n\tBooktitle = {In the Proceedings of the 12th Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP)},\n\tGroup = {Supertech},\n\tLocalfile = {two-level-adapt},\n\tMonth = {June},\n\tTitle = {Provably Efficient Two-level Adaptive Scheduling},\n\tYear = {2006}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Concurrent Cache-Oblivious B-Trees Using Transactional Memory.\n \n \n \n\n\n \n Kuszmaul, B. C.; and Sukha, J.\n\n\n \n\n\n\n In Workshop on Transactional Memory Workloads, Ottawa, Canada, June 2006. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{KuszmaulSu06,\n\tAddress = {Ottawa, Canada},\n\tAuthor = {Bradley C. Kuszmaul and Jim Sukha},\n\tBooktitle = {Workshop on Transactional Memory Workloads},\n\tGroup = {Supertech},\n\tLocalfile = {cobtree-wtw06},\n\tMonth = jun,\n\tTitle = {Concurrent Cache-Oblivious B-Trees Using Transactional Memory},\n\tYear = {2006}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n External-Memory Search Trees with Fast Insertions.\n \n \n \n\n\n \n Nelson, J.\n\n\n \n\n\n\n Master's thesis, Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science, June 2006.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Nelson06,\n\tAuthor = {Jelani Nelson},\n\tGroup = {Supertech},\n\tLocalfile = {jelani-meng-thesis},\n\tMonth = jun,\n\tSchool = {Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science},\n\tTitle = {External-Memory Search Trees with Fast Insertions},\n\tYear = 2006}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2005\n \n \n (9)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Unbounded Transactional Memory.\n \n \n \n\n\n \n Ananian, C. S.; Asanović, K.; Kuszmaul, B. C.; Leiserson, C. E.; and Lie, S.\n\n\n \n\n\n\n In Proceedings of the 11th International Symposium on High-Performance Computer Architecture (HPCA'05), pages 316–327, San Franscisco, California, February 2005. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{AnanianAsKu05,\n\tAuthor = {C. Scott Ananian and Krste Asanovi\\'c and Bradley C. Kuszmaul and Charles E. Leiserson and Sean Lie},\n\tAddress = {San Franscisco, California},\n\tBooktitle = {Proceedings of the 11th International Symposium on High-Performance Computer Architecture (HPCA'05)},\n\tMonth = FEB,\n\tYear = 2005,\n\tGroup = {Supertech},\n\tLocalfile = {xaction},\n\tPages = {316--327},\n\tTitle = {Unbounded Transactional Memory}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Concurrent Cache-Oblivious B-Trees.\n \n \n \n\n\n \n Bender, M. A.; Fineman, J. T.; Gilbert, S.; and Kuszmaul, B. C.\n\n\n \n\n\n\n In Proceedings of the Seventeenth ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 228–237, Las Vegas, NV, USA, July17–20 2005. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BenderFiGi05,\n\tAddress = {Las Vegas, NV, USA},\n\tAuthor = {Michael A. Bender and Jeremy T. Fineman and Seth Gilbert and Bradley C. Kuszmaul},\n\tBooktitle = {Proceedings of the Seventeenth ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},\n\tGroup = {Supertech},\n\tLocalfile = {cobtree},\n\tMonth = {July} # {17--20},\n\tPages = {228--237},\n\tTitle = {Concurrent Cache-Oblivious B-Trees},\n\tYear = 2005}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n The JCilk-1 Runtime System.\n \n \n \n\n\n \n Danaher, J. S.\n\n\n \n\n\n\n Master's thesis, Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science, June 2005.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Danaher05,\n\tAuthor = {John S. Danaher},\n\tGroup = {Supertech},\n\tLocalfile = {danaher-thesis},\n\tMonth = jun,\n\tSchool = {Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science},\n\tTitle = {The JCilk-1 Runtime System},\n\tYear = 2005}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n The JCilk Language for Multithreaded Computing.\n \n \n \n\n\n \n Danaher, J. S.; Lee, I. A.; and Leiserson, C. E.\n\n\n \n\n\n\n In Synchronization and Concurrency in Object-Oriented Languages (SCOOL), San Diego, California, October 2005. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{DanaherLeLe05,\n\tAddress = {San Diego, California},\n\tAuthor = {John S. Danaher and I-Ting Angelina Lee and Charles E. Leiserson},\n\tBooktitle = {Synchronization and Concurrency in Object-Oriented Languages (SCOOL)},\n\tGroup = {Supertech},\n\tLocalfile = {jcilk-scool},\n\tMonth = oct,\n\tTitle = {The {JCilk} Language for Multithreaded Computing},\n\tYear = 2005}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Provably Good Race Detection That Runs in Parallel.\n \n \n \n\n\n \n Fineman, J. T.\n\n\n \n\n\n\n Master's thesis, Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science, August 2005.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Fineman05,\n\tAuthor = {Jeremy T. Fineman},\n\tGroup = {Supertech},\n\tLocalfile = {jfineman-msthesis},\n\tMonth = aug,\n\tSchool = {Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science},\n\tTitle = {Provably Good Race Detection That Runs in Parallel},\n\tYear = 2005}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Nondeterminator-3: A Provably Good Data-Race Detector That Runs in Parallel.\n \n \n \n\n\n \n Karunaratna, T. C.\n\n\n \n\n\n\n Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, September 2005.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Karunaratna05,\n\tAuthor = {Tushara C. Karunaratna},\n\tGroup = {Supertech},\n\tLocalfile = {tushara-meng-thesis},\n\tMonth = sep,\n\tSchool = {Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology},\n\tTitle = {Nondeterminator-3: A Provably Good Data-Race Detector That Runs in Parallel},\n\tYear = 2005}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n The JCilk Multithreaded Language.\n \n \n \n\n\n \n Lee, I. A.\n\n\n \n\n\n\n Master's thesis, Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science, August 2005.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Lee05,\n\tAuthor = {I-Ting Angelina Lee},\n\tGroup = {Supertech},\n\tLocalfile = {angelee-msthesis},\n\tMonth = Aug,\n\tSchool = {Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science},\n\tTitle = {The {JCilk} Multithreaded Language},\n\tYear = 2005}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n LecTix: A Lecture-Multimedia Player.\n \n \n \n\n\n \n Olsen, T. D.\n\n\n \n\n\n\n Master's thesis, Massachusetts Institute of Technology, June 2005.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Olsen05,\n\tAuthor = {Timothy D. Olsen},\n\tGroup = {Supertech},\n\tLocalfile = {thesis-tolsen},\n\tMonth = jun,\n\tSchool = {Massachusetts Institute of Technology},\n\tTitle = {{LecTix}: A Lecture-Multimedia Player},\n\tYear = 2005}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Memory-Mapped Transactions.\n \n \n \n\n\n \n Sukha, J.\n\n\n \n\n\n\n Master's thesis, Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science, Cambridge, Massachusetts, May 2005.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Sukha05,\n\tAddress = {Cambridge, Massachusetts},\n\tAuthor = {Jim Sukha},\n\tGroup = {Supertech},\n\tLocalfile = {Libxac},\n\tMonth = may,\n\tSchool = {Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science},\n\tTitle = {Memory-Mapped Transactions},\n\tYear = 2005}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2004\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs.\n \n \n \n\n\n \n Bender, M. A.; Fineman, J. T.; Gilbert, S.; and Leiserson, C. E.\n\n\n \n\n\n\n In Proceedings of the Sixteenth ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 133–144, Barcelona, Spain, June27–30 2004. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BenderFiGi04,\n\tAddress = {Barcelona, Spain},\n\tAuthor = {Michael A. Bender and Jeremy T. Fineman and Seth Gilbert and Charles E. Leiserson},\n\tBooktitle = {Proceedings of the Sixteenth ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},\n\tGroup = {Supertech},\n\tLocalfile = {sporder},\n\tMonth = {June} # {27--30},\n\tPages = {133--144},\n\tTitle = {On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs},\n\tYear = 2004}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Cache-Oblivious Dynamic Search Trees.\n \n \n \n \n\n\n \n Kasheff, Z.\n\n\n \n\n\n\n M.Eng., Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, June 2004.\n \n\n\n\n
\n\n\n\n \n \n \"Cache-ObliviousPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Kasheff04,\n\tAuthor = {Zardosht Kasheff},\n\tBradleynote = {Supervised by Bradley C. Kuszmaul},\n\tGroup = {Supertech},\n\tLocalfile = {Kasheff04},\n\tMonth = JUN,\n\tSchool = {Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology},\n\tTitle = {Cache-Oblivious Dynamic Search Trees},\n\tType = {M.Eng.},\n\tUrl = {http://bradley.csail.mit.edu/papers/Kasheff04},\n\tYear = 2004,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Hardware Support for Unbounded Transactional Memory.\n \n \n \n\n\n \n Lie, S.\n\n\n \n\n\n\n Master's thesis, Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science, May 2004.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Lie04,\n\tAuthor = {Sean Lie},\n\tGroup = {Supertech},\n\tLocalfile = {lie-thesis},\n\tMonth = may,\n\tSchool = {Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science},\n\tTitle = {Hardware Support for Unbounded Transactional Memory},\n\tYear = 2004}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Dynamic Processor Allocation for Adaptively Parallel Work-Stealing Jobs.\n \n \n \n\n\n \n Sen, S.\n\n\n \n\n\n\n Master's thesis, Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science, August 2004.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Sen04,\n\tAuthor = {Siddhartha Sen},\n\tGroup = {Supertech},\n\tLocalfile = {sid-thesis},\n\tMonth = Aug,\n\tSchool = {Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science},\n\tTitle = {Dynamic Processor Allocation for Adaptively Parallel Work-Stealing Jobs},\n\tYear = 2004}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2003\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Data-Race Detection in Transactions-Everywhere Parallel Programming.\n \n \n \n\n\n \n Huang, K.\n\n\n \n\n\n\n Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, June 2003.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Huang03,\n\tAuthor = {Kai Huang},\n\tGroup = {Supertech},\n\tLocalfile = {thesis-kai},\n\tMonth = jun,\n\tSchool = {Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology},\n\tTitle = {Data-Race Detection in Transactions-Everywhere Parallel Programming},\n\tYear = 2003}\n\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2002\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk.\n \n \n \n\n\n \n Bender, M. A.; and Rabin, M. O.\n\n\n \n\n\n\n Theory of Computing Systems Special Issue on SPAA00, 35: 289–304. 2002.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{BenderRa02,\n\tAuthor = {M. A. Bender and M. O. Rabin},\n\tGroup = {Supertech},\n\tJournal = {Theory of Computing Systems Special Issue on SPAA00},\n\tLocalfile = {tocs-heterogeneous},\n\tPages = {289--304},\n\tTitle = {Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to {Cilk}},\n\tVolume = {35},\n\tYear = {2002}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Using Cilk to Write Multiprocessor Chess Programs.\n \n \n \n\n\n \n Dailey, D.; and Leiserson, C. E.\n\n\n \n\n\n\n The Journal of the International Computer Chess Association. 2002.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{DaileyLe02,\n\tAuthor = {Don Dailey and Charles E. Leiserson},\n\tGroup = {Supertech},\n\tJournal = {The Journal of the International Computer Chess Association},\n\tLocalfile = {icca99},\n\tStkeyword = {cilk, chess},\n\tTitle = {Using {C}ilk to Write Multiprocessor Chess Programs},\n\tYear = {2002},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2001\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Cilk 5.4.6 Reference Manual.\n \n \n \n \n\n\n \n \n\n\n \n\n\n\n Supercomputing Technologies Group, Massachusetts Institute of Technology Laboratory for Computer Science, November 2001.\n \n\n\n\n
\n\n\n\n \n \n \"CilkPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@manual{cilk532referencemanual,\n\tGroup = {Supertech},\n\tKey = {Supercomputing},\n\tMonth = nov,\n\tOrganization = {Supercomputing Technologies Group, Massachusetts Institute of Technology Laboratory for Computer Science},\n\tStkeyword = {cilk, cilk-implementation},\n\tTitle = {Cilk 5.4.6 Reference Manual},\n\tUrl = {http://supertech.lcs.mit.edu/cilk/manual-5.4.6.pdf},\n\tYear = 2001,\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2000\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Scheduling Cilk Multithreaded Parallel Programs on Processors of Different Speeds.\n \n \n \n\n\n \n Bender, M. A.; and Rabin, M. O.\n\n\n \n\n\n\n In Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures, pages 13–21, July 2000. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BenderRa00,\n\tAuthor = {M. A. Bender and M. O. Rabin},\n\tBooktitle = {Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures},\n\tGroup = {Supertech},\n\tLocalfile = {spaa00-heterogeneous},\n\tLocation = {Bar Harbor, Maine, United States},\n\tMonth = {July},\n\tPages = {13--21},\n\tTitle = {Scheduling {Cilk} Multithreaded Parallel Programs on Processors of Different Speeds},\n\tYear = {2000}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n A Parallel File I/O API for Cilk.\n \n \n \n\n\n \n DeBergalis, M. S.\n\n\n \n\n\n\n Master's thesis, Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science, May 2000.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{DeBergalis00,\n\tAuthor = {Matthew S. DeBergalis},\n\tGroup = {Supertech},\n\tLocalfile = {deberg-thesis},\n\tMonth = may,\n\tSchool = {Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science},\n\tTitle = {A Parallel File {I/O} {API} for {Cilk}},\n\tYear = 2000}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1999\n \n \n (8)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Scheduling Multithreaded Computations by Work Stealing.\n \n \n \n\n\n \n Blumofe, R. D.; and Leiserson, C. E.\n\n\n \n\n\n\n Journal of the ACM, 46(5): 720–748. September 1999.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{BlumofeLe99,\n\tAuthor = {Robert D. Blumofe and Charles E. Leiserson},\n\tGroup = {Supertech},\n\tJournal = {Journal of the ACM},\n\tLocalfile = {steal},\n\tMonth = sep,\n\tNumber = 5,\n\tPages = {720--748},\n\tTitle = {Scheduling Multithreaded Computations by Work Stealing},\n\tVolume = 46,\n\tYear = 1999}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Efficient Detection of Determinacy Races in Cilk Programs.\n \n \n \n\n\n \n Feng, M.; and Leiserson, C. E.\n\n\n \n\n\n\n Theory of Computing Systems, 32(3): 301–326. 1999.\n A preliminary version appeared as i̧teFengLe97.\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{FengLe99,\n\tAuthor = {Mingdong Feng and Charles E. Leiserson},\n        Group = {Supertech},\n\tJournal = {Theory of Computing Systems},\n\tNote = {A preliminary version appeared as \\cite{FengLe97}.},\n\tNumber = 3,\n\tPages = {301--326},\n\tTitle = {Efficient Detection of Determinacy Races in {Cilk} Programs},\n\tVolume = 32,\n\tYear = 1999}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Portable High-Performance Programs.\n \n \n \n\n\n \n Frigo, M.\n\n\n \n\n\n\n Ph.D. Thesis, Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science, Cambridge, Massachusetts, June 1999.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@phdthesis{Frigo99,\n\tAddress = {Cambridge, Massachusetts},\n\tAuthor = {Matteo Frigo},\n\tGroup = {Supertech},\n\tLocalfile = {frigo-phd-thesis},\n\tMonth = jun,\n\tSchool = {Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science},\n\tTitle = {Portable High-Performance Programs},\n\tYear = 1999}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n A Fast Fourier Transform Compiler.\n \n \n \n\n\n \n Frigo, M.\n\n\n \n\n\n\n In Proceedings of the ACM SIGPLAN'99 Conference on Programming Language Design and Implementation (PLDI), Atlanta, Georgia, May 1999. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{Frigo99a,\n\tAddress = {Atlanta, Georgia},\n\tAuthor = {Matteo Frigo},\n\tBooktitle = {Proceedings of the ACM SIGPLAN'99 Conference on Programming Language Design and Implementation (PLDI)},\n\tGroup = {Supertech},\n\tLocalfile = {pldi99},\n\tMonth = may,\n\tTitle = {A Fast {Fourier} Transform Compiler},\n\tYear = 1999}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n A Fast Fourier Transform Compiler.\n \n \n \n\n\n \n Frigo, M.\n\n\n \n\n\n\n ACM SIGPLAN Notices, 34(5): 169–180. May 1999.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{Frigo99b,\n\tAuthor = {Matteo Frigo},\n\tGroup = {Supertech},                  \n\tJournal = {ACM SIGPLAN Notices},\n\tMonth = may,\n\tNumber = {5},\n\tPages = {169--180},\n\tTitle = {A Fast {Fourier} Transform Compiler},\n\tVolume = {34},\n\tYear = {1999}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Cache-Oblivious Algorithms.\n \n \n \n\n\n \n Frigo, M.; Leiserson, C. E.; Prokop, H.; and Ramachandran, S.\n\n\n \n\n\n\n In 40th Annual Symposium on Foundations of Computer Science, pages 285–297, New York, New York, October17–19 1999. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{FrigoLePr99,\n\tAddress = {New York, New York},\n\tAuthor = {Matteo Frigo and Charles E. Leiserson and Harald Prokop and Sridhar Ramachandran},\n\tBooktitle = {40th Annual Symposium on Foundations of Computer Science},\n\tGroup = {Supertech},\n\tLocalfile = {FrigoLePr99},\n\tMonth = oct # { 17--19},\n\tPages = {285--297},\n\tTitle = {Cache-Oblivious Algorithms},\n\tYear = 1999}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n A Comparison of Scalable Superscalar Processors.\n \n \n \n\n\n \n Kuszmaul, B. C.; Henry, D. S.; and Loh, G. H.\n\n\n \n\n\n\n In Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 126–137, Saint-Malo, France, June 27–30 1999. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{KuszmaulHeLo99\n ,author       = {Bradley C. Kuszmaul and Dana S. Henry and Gabriel H. Loh}\n ,title\t       = {A Comparison of Scalable Superscalar Processors}\n ,booktitle    = {Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures}\n ,year\t       = 1999\n ,address      = {Saint-Malo, France}\n ,month\t       = JUN # {~27--30}\n ,pages\t       = {126--137}\n ,Group = {Supertech}\n ,localfile = {KuszmaulHeLo99}\n }\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Cache-Oblivious Algorithms.\n \n \n \n\n\n \n Prokop, H.\n\n\n \n\n\n\n Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, June 1999.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Prokop99,\n\tAuthor = {Harald Prokop},\n\tGroup = {Supertech},\n\tLocalfile = {Prokop99},\n\tMonth = jun,\n\tSchool = {Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology},\n\tTitle = {Cache-Oblivious Algorithms},\n\tYear = 1999}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1998\n \n \n (17)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Space-Efficient Scheduling of Multithreaded Computations.\n \n \n \n\n\n \n Blumofe, R. D.; and Leiserson, C. E.\n\n\n \n\n\n\n SIAM Journal on Computing, 27(1): 202–229. February 1998.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{BlumofeLe98,\n\tAuthor = {Robert D. Blumofe and Charles E. Leiserson},\n\tGroup = {Supertech},\n\tJournal = {SIAM Journal on Computing},\n\tMonth = feb,\n\tNumber = 1,\n\tPages = {202--229},\n\tTitle = {Space-Efficient Scheduling of Multithreaded Computations},\n\tVolume = 27,\n\tYear = 1998}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Algorithms for Data-Race Detection in Multithreaded Programs.\n \n \n \n\n\n \n Cheng, G.\n\n\n \n\n\n\n Master's thesis, Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science, Cambridge, Massachusetts, June 1998.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Cheng98,\n\tAddress = {Cambridge, Massachusetts},\n\tAuthor = {Guang-Ien Cheng},\n\tGroup = {Supertech},\n\tLocalfile = {cheng-thesis},\n\tMonth = jun,\n\tSchool = {Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science},\n\tTitle = {Algorithms for Data-Race Detection in Multithreaded Programs},\n\tX_Department = {Department of Electrical Engineering and Computer Science},\n\tYear = 1998}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Detecting Data Races in Cilk Programs That Use Locks.\n \n \n \n\n\n \n Cheng, G.; Feng, M.; Leiserson, C. E.; Randall, K. H.; and Stark, A. F.\n\n\n \n\n\n\n In Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '98), pages 298–309, Puerto Vallarta, Mexico, June 28–July 2 1998. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{ChengFeLe98,\n\tAuthor = {Guang-Ien Cheng and Mingdong Feng and Charles E. Leiserson and Keith H. Randall and Andrew F. Stark},\n        Address = {Puerto Vallarta, Mexico},\n\tBooktitle = {Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '98)},\n\tMonth = jun # {~28--} # jul # {~2},\n\tYear = 1998,\n\tGroup = {Supertech},\n\tLocalfile = {brelly},\n\tPages = {298--309},\n\tTitle = {Detecting Data Races in Cilk Programs That Use Locks}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n The Weakest Reasonable Memory Model.\n \n \n \n\n\n \n Frigo, M.\n\n\n \n\n\n\n Master's thesis, Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science, January 1998.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Frigo98,\n\tAuthor = {Matteo Frigo},\n\tGroup = {Supertech},\n\tLocalfile = {frigo-ms-thesis},\n\tMonth = jan,\n\tSchool = {Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science},\n\tTitle = {The Weakest Reasonable Memory Model},\n\tYear = 1998}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n FFTW: An Adaptive Software Architecture for the FFT.\n \n \n \n\n\n \n Frigo, M.; and Johnson, S. G.\n\n\n \n\n\n\n In Proceedings of the International Conference on Acoustics, Speech, and Signal Processing, volume 3, pages 1381–1384, Seattle, Washington, 1998. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{FrigoJo98,\n\tAddress = {Seattle, Washington},\n\tGroup = {Supertech},                  \n\tAuthor = {Matteo Frigo and Steven G. Johnson},\n\tBooktitle = {Proceedings of the International Conference on Acoustics, Speech, and Signal Processing},\n\tPages = {1381--1384},\n\tTitle = {{FFTW}: {A}n Adaptive Software Architecture for the {FFT}},\n\tVolume = 3,\n\tYear = 1998}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n The Implementation of the Cilk-5 Multithreaded Language.\n \n \n \n\n\n \n Frigo, M.; Leiserson, C. E.; and Randall, K. H.\n\n\n \n\n\n\n In Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation (PLDI), pages 212–223, Montreal, Quebec, Canada, June 1998. \n Proceedings published ACM SIGPLAN Notices, Vol. 33, No. 5, May, 1998.\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{FrigoLeRa98,\n\tAuthor = {Matteo Frigo and Charles E. Leiserson and Keith H. Randall},\n\tAddress = {Montreal, Quebec, Canada},\n\tBooktitle = {Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation (PLDI)},\n\tMonth = jun,\n\tNote = {Proceedings published ACM SIGPLAN Notices, Vol. 33, No. 5, May, 1998.},\n\tYear = 1998,\n\tGroup = {Supertech},\n\tLocalfile = {cilk5},\n\tPages = {212--223},\n\tTitle = {The Implementation of the {C}ilk-5 Multithreaded Language}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Computation-Centric Memory Models.\n \n \n \n\n\n \n Frigo, M.; and Luchangco, V.\n\n\n \n\n\n\n In Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '98), pages 240–249, Puerto Vallarta, Mexico, June 28–July 2 1998. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{FrigoLu98,\n\tAuthor = {Matteo Frigo and Victor Luchangco},\n\tAddress = {Puerto Vallarta, Mexico},\n\tBooktitle = {Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '98)},\n\tMonth = jun # {~28--} # jul # {~2},\n\tYear = 1998,\n\tGroup = {Supertech},\n\tLocalfile = {spaa98-memory},\n\tPages = {240--249},\n\tTitle = {Computation-Centric Memory Models}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Performance Nonmonotonicities: A Case Study of the UltraSPARC Processor.\n \n \n \n\n\n \n Kushman, N. A.\n\n\n \n\n\n\n Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, June 1998.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Kushman98,\n\tAuthor = {Nathaniel A. Kushman},\n\tGroup = {Supertech},\n\tLocalfile = {kushman-ms-thesis},\n\tMonth = jun,\n\tSchool = {Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology},\n\tTitle = {Performance Nonmonotonicities: A Case Study of the {U}ltra{SPARC} Processor},\n\tYear = 1998}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Programming Parallel Applications in Cilk.\n \n \n \n\n\n \n Leiserson, C. E.; and Plaat, A.\n\n\n \n\n\n\n SIAM News, 31(4): 6–7. May 1998.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{LeisersonPl98,\n\tAuthor = {Charles E. Leiserson and Aske Plaat},\n\tGroup = {Supertech},\n\tJournal = {SIAM News},\n\tMonth = may,\n\tNumber = 4,\n\tPages = {6--7},\n\tTitle = {Programming Parallel Applications in {C}ilk},\n\tVolume = 31,\n\tYear = 1998}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n A Minicourse on Multithreaded Programming.\n \n \n \n\n\n \n Leiserson, C. E.; and Prokop, H.\n\n\n \n\n\n\n 1998.\n Available on the Internet from ˘rlhttp://theory.lcs.mit.edu/ cilk\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@unpublished{LeisersonPr98,\n\tAuthor = {Charles E. Leiserson and Harald Prokop},\n\tGroup = {Supertech},\n\tLocalfile = {minicourse},\n\tNote = {Available on the Internet from \\url{http://theory.lcs.mit.edu/~cilk}},\n\tTitle = {A Minicourse on Multithreaded Programming},\n\tYear = 1998}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Using de Bruijn Sequences to Index a 1 in a Computer Word.\n \n \n \n\n\n \n Leiserson, C. E.; and Prokop, H.\n\n\n \n\n\n\n June 1998.\n Unpublished manuscript\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@unpublished{LeisersonPrRa98,\n\tAuthor = {Charles E. Leiserson and Harald Prokop},\n\tGroup = {Supertech},\n\tLocalfile = {debruijn},\n\tMonth = jun,\n\tTitle = {Using de Bruijn Sequences to Index a 1 in a Computer Word},\n\tYear = 1998,\n        Note = "Unpublished manuscript"}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Portable Fault-Tolerant File I/O.\n \n \n \n\n\n \n Lyubashevskiy, I. B.\n\n\n \n\n\n\n Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, June 1998.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Lyubashevskiy,\n\tAuthor = {Igor B. Lyubashevskiy},\n\tGroup = {Supertech},\n\tLocalfile = {igor-meng-thesis},\n\tMonth = jun,\n\tSchool = {Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology},\n\tTitle = {Portable Fault-Tolerant File I/O},\n\tYear = 1998}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Cilk: Efficient Multithreaded Computing.\n \n \n \n\n\n \n Randall, K. H.\n\n\n \n\n\n\n Ph.D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, May 1998.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@phdthesis{Randall98,\n\tAuthor = {Keith H. Randall},\n\tGroup = {Supertech},\n\tLocalfile = {randall-phdthesis},\n\tMonth = may,\n\tSchool = {Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology},\n\tTitle = {Cilk: Efficient Multithreaded Computing},\n\tYear = 1998}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Scheduling Adaptively Parallel Jobs.\n \n \n \n\n\n \n Song, B.\n\n\n \n\n\n\n Master's thesis, Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science, Cambridge, Massachusetts, January 1998.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Song98,\n\tAddress = {Cambridge, Massachusetts},\n\tAuthor = {Bin Song},\n\tGroup = {Supertech},\n\tLocalfile = {bsong-msthesis},\n\tMonth = jan,\n\tSchool = {Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science},\n\tTitle = {Scheduling Adaptively Parallel Jobs},\n\tYear = 1998}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Debugging Multithreaded Programs that Incorporate User-Level Locking.\n \n \n \n\n\n \n Stark, A. F.\n\n\n \n\n\n\n Master's thesis, Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science, Cambridge, Massachusetts, May 1998.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Stark98,\n\tAddress = {Cambridge, Massachusetts},\n\tAuthor = {Andrew F. Stark},\n\tGroup = {Supertech},\n\tLocalfile = {astark-thesis},\n\tMonth = may,\n\tSchool = {Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science},\n\tTitle = {Debugging Multithreaded Programs that Incorporate User-Level Locking},\n\tYear = 1998}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Compiler Technology for Portable Checkpoints.\n \n \n \n\n\n \n Strumpen, V.\n\n\n \n\n\n\n 1998.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@misc{Strumpen98,\n\tAuthor = {V. Strumpen},\n\tGroup = {Supertech},\n\tLocalfile = {porch},\n\tText = {Volker Strumpen. Compiler Technology for Portable Checkpoints. submitted for publication (http://theory.lcs. mit.edu/\\~strumpen/porch.ps.gz), 1998.},\n\tTitle = {Compiler Technology for Portable Checkpoints},\n\tYear = {1998}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Cilk Pousse.\n \n \n \n \n\n\n \n Adkins, D.; Barton, R.; Dailey, D.; Frigo, M.; Joerg, C.; Leiserson, C.; Prokop, H.; and Rinard, M.\n\n\n \n\n\n\n 1998.\n Winner of the 1998 ICFP Programming Contest\n\n\n\n
\n\n\n\n \n \n \"CilkPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@misc{AdkinsBaDa98,\n\tAuthor = {Dan Adkins and Reid Barton and Don Dailey and Matteo Frigo and Chris Joerg and Charles Leiserson and Harald Prokop and Martin Rinard},\n        Group = {Supertech},\n\tNote = {Winner of the 1998 ICFP Programming Contest},\n\tTitle = {{C}ilk {P}ousse},\n        Year = 1998,\n\tUrl = {http://supertech.lcs.mit.edu/~pousse},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1997\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Adaptive and Reliable Parallel Computing on Networks of Workstations.\n \n \n \n\n\n \n Blumofe, R. D.; and Lisiecki, P. A.\n\n\n \n\n\n\n In Proceedings of the USENIX 1997 Annual Technical Conference on UNIX and Advanced Computing Systems, pages 133–147, Anaheim, California, January 1997. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BlumofeLi97,\n\tAddress = {Anaheim, California},\n\tAuthor = {Robert D. Blumofe and Philip A. Lisiecki},\n\tBooktitle = {Proceedings of the USENIX 1997 Annual Technical Conference on UNIX and Advanced Computing Systems},\n\tDay = {6--10},\n\tGroup = {Supertech},\n\tLocalfile = {USENIX97},\n\tMonth = jan,\n\tPages = {133--147},\n\tTitle = {Adaptive and Reliable Parallel Computing on Networks of Workstations},\n\tYear = 1997}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Efficient Detection of Determinacy Races in Cilk Programs.\n \n \n \n\n\n \n Feng, M.; and Leiserson, C. E.\n\n\n \n\n\n\n In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 1–11, Newport, Rhode Island, June22–25 1997. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{FengLe97,\n\tAddress = {Newport, Rhode Island},\n\tAuthor = {Mingdong Feng and Charles E. Leiserson},\n\tBooktitle = {Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)},\n\tGroup = {Supertech},\n\tLocalfile = {spbags},\n\tMonth = {June} # {22--25},\n\tPages = {1--11},\n\tTitle = {Efficient Detection of Determinacy Races in {Cilk} Programs},\n\tYear = 1997}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n The Fastest Fourier Transform in the West.\n \n \n \n\n\n \n Frigo, M.; and Johnson, S. G.\n\n\n \n\n\n\n Technical Report MIT/LCS/TR-728, Massachusetts Institute of Technology Laboratory for Computer Science, 1997.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@techreport{FrigoJo97,\n\tAuthor = {Matteo Frigo and Steven G. Johnson},\n\tGroup = {Supertech},\n\tInstitution = {Massachusetts Institute of Technology Laboratory for Computer Science},\n\tLocalfile = {fftw-paper},\n\tNumber = {MIT/LCS/TR-728},\n\tPages = {20},\n\tTitle = {The Fastest Fourier Transform in the West},\n\tYear = {1997}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Programming Irregular Parallel Applications In Cilk.\n \n \n \n\n\n \n Leiserson, C. E.\n\n\n \n\n\n\n In Solving Irregularly Structured Problems in Parallel: 4th International Symposium (IRREGULAR'97), pages 61–71, Paderborn, Germany, June 1997. Springer-Verlag\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{Leiserson97,\n\tAddress = {Paderborn, Germany},\n\tGroup = {Supertech},\n\tAuthor = {Charles E. Leiserson},\n\tBooktitle = {Solving Irregularly Structured Problems in Parallel: 4th International Symposium (IRREGULAR'97)},\n\tMonth = jun,\n\tPages = {61--71},\n\tPublisher = {Springer-Verlag},\n\tTitle = {Programming Irregular Parallel Applications In {C}ilk},\n\tYear = 1997}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Parallel algorithms for the circuit value update problem.\n \n \n \n\n\n \n Leiserson, C. E.; and Randall, K. H.\n\n\n \n\n\n\n Theory of Computing Systems, 30: 583–597. 1997.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{LeisersonRa97,\n\tAuthor = {Charles E. Leiserson and Keith H. Randall},\n\tGroup = {Supertech},\n\tJournal = {Theory of Computing Systems},\n\tPages = {583--597},\n\tTitle = {Parallel algorithms for the circuit value update problem},\n\tVolume = 30,\n\tYear = 1997}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Portable Checkpointing for Heterogeneous Architectures.\n \n \n \n\n\n \n Ramkumar, B.; and Strumpen, V.\n\n\n \n\n\n\n In Symposium on Fault-Tolerant Computing, pages 58–67, 1997. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{RamkumarSt97,\n\tAuthor = {Balkrishna Ramkumar and Volker Strumpen},\n\tBooktitle = {Symposium on Fault-Tolerant Computing},\n\tGroup = {Supertech},\n\tLocalfile = {ftcs27},\n\tPages = {58--67},\n\tTitle = {Portable Checkpointing for Heterogeneous Architectures},\n\tYear = {1997}}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1996\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Dag-Consistent Distributed Shared Memory.\n \n \n \n\n\n \n Blumofe, R. D.; Frigo, M.; Joerg, C. F.; Leiserson, C. E.; and Randall, K. H.\n\n\n \n\n\n\n In Proceedings of the 10th International Parallel Processing Symposium, pages 132–141, Honolulu, Hawaii, April 1996. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BlumofeFrJo96,\n\tAddress = {Honolulu, Hawaii},\n\tAuthor = {Robert D. Blumofe and Matteo Frigo and Christopher F. Joerg and Charles E. Leiserson and Keith H. Randall},\n\tBooktitle = ipps10,\n\tGroup = {Supertech},\n\tLocalfile = {ipps96},\n\tMonth = apr,\n\tPages = {132--141},\n\tTitle = {Dag-Consistent Distributed Shared Memory},\n\tYear = 1996}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms.\n \n \n \n\n\n \n Blumofe, R. D.; Frigo, M.; Joerg, C. F.; Leiserson, C. E.; and Randall, K. H.\n\n\n \n\n\n\n In Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 297–308, Padua, Italy, June 1996. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BlumofeFrJo96a,\n\tAddress = {Padua, Italy},\n\tAuthor = {Robert D. Blumofe and Matteo Frigo and Chrisopher F. Joerg and Charles E. Leiserson and Keith H. Randall},\n\tBooktitle = spaa8,\n\tGroup = {Supertech},\n\tLocalfile = {spaa96},\n\tMonth = jun,\n\tPages = {297--308},\n\tTitle = {An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms},\n\tYear = 1996}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Cilk: An Efficient Multithreaded Runtime System.\n \n \n \n \n\n\n \n Blumofe, R. D.; Joerg, C. F.; Kuszmaul, B. C.; Leiserson, C. E.; Randall, K. H.; and Zhou, Y.\n\n\n \n\n\n\n Journal of Parallel and Distributed Computing, 37(1): 55–69. August 25 1996.\n (An early version appeared in the \\em Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP '95), pages 207–216, Santa Barbara, California, July 1995.)\n\n\n\n
\n\n\n\n \n \n \"Cilk:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{BlumofeJoKu96,\n\tAffiliation = mitlcs,\n\tAuthor = {Robert D. Blumofe and Christopher F. Joerg and Bradley C. Kuszmaul and Charles E. Leiserson and Keith H. Randall and Yuli Zhou},\n\tGroup = {Supertech},\n\tJournal = {Journal of Parallel and Distributed Computing},\n\tKey = {Blumofe96},\n\tLocalfile = {cilkjpdc96},\n\tMonth = {August 25},\n\tNote = {(An early version appeared in the {\\em Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP~'95)}, pages~207--216, Santa Barbara, California, July 1995.)},\n\tNumber = 1,\n\tPages = {55--69},\n\tStkeyword = {cilk},\n\tTitle = {{C}ilk: An Efficient Multithreaded Runtime System},\n\tUrl = {ftp://theory.lcs.mit.edu/pub/cilk/cilkjpdc96.ps.gz},\n\tVolume = 37,\n\tYear = 1996,\n\t}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n The Cilk System for Parallel Multithreaded Computing.\n \n \n \n\n\n \n Joerg, C. F.\n\n\n \n\n\n\n Ph.D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts, January 1996.\n Available as MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-701.\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@phdthesis{Joerg96,\n\tAddress = {Cambridge, Massachusetts},\n\tAuthor = {Christopher F. Joerg},\n\tGroup = {Supertech},\n\tLocalfile = {joerg-phd-thesis},\n\tMonth = jan,\n\tNote = {Available as MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-701.},\n\tSchool = {Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology},\n\tStkeyword = {cilk},\n\tTitle = {The {Cilk} System for Parallel Multithreaded Computing},\n\tYear = 1996}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Macro-Level Scheduling in the Cilk Network of Workstations Environment.\n \n \n \n\n\n \n Lisiecki, P.\n\n\n \n\n\n\n Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, May 1996.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Lisiecki96,\n\tAuthor = {Philip Lisiecki},\n\tGroup = {Supertech},\n\tLocalfile = {lisiecki-msthesis},\n\tMonth = may,\n\tSchool = {Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology},\n\tTitle = {Macro-Level Scheduling in the {C}ilk Network of Workstations Environment},\n\tYear = 1996}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1995\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Executing Multithreaded Programs Efficiently.\n \n \n \n\n\n \n Blumofe, R. D.\n\n\n \n\n\n\n Ph.D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts, September 1995.\n Available as MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-677.\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@phdthesis{Blumofe95,\n\tAddress = {Cambridge, Massachusetts},\n\tAuthor = {Robert D. Blumofe},\n\tGroup = {Supertech},\n\tLocalfile = {rdb-phdthesis},\n\tMonth = sep,\n\tNote = {Available as MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-677.},\n\tSchool = {Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology},\n\tTitle = {Executing Multithreaded Programs Efficiently},\n\tYear = 1995}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Cilk: An Efficient Multithreaded Runtime System.\n \n \n \n\n\n \n Blumofe, R. D.; Joerg, C. F.; Kuszmaul, B. C.; Leiserson, C. E.; Randall, K. H.; and Zhou, Y.\n\n\n \n\n\n\n In Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), pages 207–216, Santa Barbara, California, July 1995. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BlumofeJoKu95,\n\tAddress = {Santa Barbara, California},\n\tAuthor = {Robert D. Blumofe and Christopher F. Joerg and Bradley C. Kuszmaul and Charles E. Leiserson and Keith H. Randall and Yuli Zhou},\n\tBooktitle = {Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)},\n\tDay = {19--21},\n\tGroup = {Supertech},\n\tLocalfile = {PPoPP95},\n\tMonth = jul,\n\tPages = {207--216},\n\tTitle = {{Cilk}: An Efficient Multithreaded Runtime System},\n\tYear = 1995}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n The StarTech Massively Parallel Chess Program.\n \n \n \n\n\n \n Kuszmaul, B. C.\n\n\n \n\n\n\n The Journal of the International Computer Chess Association, 18(1): 3–20. March 1995.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@article{Kuszmaul95,\n\tAuthor = {Bradley C. Kuszmaul},\n\tGroup = {Supertech},\n\tJournal = {The Journal of the International Computer Chess Association},\n\tLocalfile = {startech},\n\tMonth = mar,\n\tNumber = 1,\n\tPages = {3--20},\n\tTitle = {The {S}tar{T}ech Massively Parallel Chess Program},\n\tVolume = 18,\n\tYear = 1995}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Heterogeneous Multithreaded Computing.\n \n \n \n\n\n \n Lu, H. J.\n\n\n \n\n\n\n Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, May 1995.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Lu95,\n\tAuthor = {Howard J. Lu},\n\tGroup = {Supertech},\n\tLocalfile = {lu-msthesis},\n\tMonth = {May},\n\tSchool = {Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology},\n\tTitle = {Heterogeneous Multithreaded Computing},\n\tYear = {1995}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n A Type-checking Preprocessor for Cilk 2, a Multithreaded C Language.\n \n \n \n\n\n \n Miller, R. C.\n\n\n \n\n\n\n Master's thesis, Massachusetts Institute of Technology Electrical Engineering and Computer Science, May 1995.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Miller95,\n\tAuthor = {Robert C. Miller},\n\tGroup = {Supertech},\n\tLocalfile = {rcm-msthesis},\n\tMonth = may,\n\tSchool = {Massachusetts Institute of Technology Electrical Engineering and Computer Science},\n\tSchool-Verbose = {Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science},\n\tSummary = {Describes c2c.},\n\tTitle = {A Type-checking Preprocessor for {C}ilk 2, a Multithreaded {C} Language},\n\tYear = 1995}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1994\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Scheduling Large-Scale Parallel Computations on Networks of Workstations.\n \n \n \n\n\n \n Blumofe, R. D.; and Park, D. S.\n\n\n \n\n\n\n In Proceedings of the Third International Symposium on High Performance Distributed Computing (HPDC), pages 96–105, San Francisco, California, August 1994. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BlumofePa94,\n\tAddress = {San Francisco, California},\n\tAuthor = {Robert D. Blumofe and David S. Park},\n\tBooktitle = {Proceedings of the Third International Symposium on High Performance Distributed Computing (HPDC)},\n\tDay = {2--5},\n\tGroup = {Supertech},\n\tLocalfile = {hpdc94},\n\tMonth = aug,\n\tPages = {96--105},\n\tTitle = {Scheduling Large-Scale Parallel Computations on Networks of Workstations},\n\tYear = 1994}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n How to Get Good Performance from the CM-5 Data Network.\n \n \n \n\n\n \n Brewer, E. A.; and Kuszmaul, B. C.\n\n\n \n\n\n\n In Proceedings of the 8th International Parallel Processing Symposium, pages 858–867, Cancun, Mexico, April 1994. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BrewerKu94,\n\tAddress = {Cancun, Mexico},\n\tAuthor = {Eric A. Brewer and Bradley C. Kuszmaul},\n\tBooktitle = ipps8,\n\tGroup = {Supertech},\n\tMonth = apr,\n\tPages = {858--867},\n\tTitle = {How to Get Good Performance from the {CM-5} Data Network},\n\tYear = 1994}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n MIMD-Style Parallel Programming with Continuation-Passing Threads.\n \n \n \n\n\n \n Halbherr, M.; Zhou, Y.; and Joerg, C. F.\n\n\n \n\n\n\n In Proceedings of the 2nd International Workshop on Massive Parallelism: Hardware, Software, and Applications, Capri, Italy, September 1994. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{HalbherrZhJo94,\n\tAddress = {Capri, Italy},\n\tAuthor = {Michael Halbherr and Yuli Zhou and Chris F. Joerg},\n\tBooktitle = {Proceedings of the 2nd International Workshop on Massive Parallelism: Hardware, Software, and Applications},\n\tGroup = {Supertech},\n\tMonth = sep,\n\tTitle = {{MIMD}-Style Parallel Programming with Continuation-Passing Threads},\n\tYear = 1994}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Massively Parallel Chess.\n \n \n \n\n\n \n Joerg, C.; and Kuszmaul, B. C.\n\n\n \n\n\n\n In Proceedings of the Third DIMACS Parallel Implementation Challenge, Rutgers University, New Jersey, October17–19 1994. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{JoergKu94,\n\tAddress = {Rutgers University, New Jersey},\n\tAuthor = {Chris Joerg and Bradley C. Kuszmaul},\n\tBooktitle = {Proceedings of the Third DIMACS Parallel Implementation Challenge},\n\tDay = {17--18},\n\tGroup = {Supertech},\n\tLocalfile = {dimacs94},\n\tMonth = oct # { 17--19},\n\tTitle = {Massively Parallel Chess},\n\tYear = 1994}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Synchronized MIMD Computing.\n \n \n \n\n\n \n Kuszmaul, B. C.\n\n\n \n\n\n\n Ph.D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, May 1994.\n Available as MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-645.\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@phdthesis{Kuszmaul94,\n\tAuthor = {Bradley C. Kuszmaul},\n\tGroup = {Supertech},\n\tLocalfile = {thesis-kuszmaul},\n\tMonth = may,\n\tNote = {Available as MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-645.},\n\tSchool = {Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology},\n\tTitle = {Synchronized {MIMD} Computing},\n\tYear = 1994}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Strata: A Multi-Layer Communications Library.\n \n \n \n\n\n \n Brewer, E. A.; and Blumofe, R.\n\n\n \n\n\n\n 1994.\n MIT Laboratory for Computer Science. Available as \\ttfamily ftp://ftp.lcs.mit.edu/pub/supertech/strata/strata.tar.Z\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@unpublished{BrewerBl94,\n\tAuthor = {Eric A. Brewer and Robert Blumofe},\n\tGroup = {Supertech},\n\tLocalfile = {strata},\n        Year = 1994,                  \n\tNote = {MIT Laboratory for Computer Science. Available as {\\ttfamily ftp://ftp.lcs.mit.edu/pub/supertech/strata/strata.tar.Z}},\n\tTitle = {{Strata}: A Multi-Layer Communications Library}}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1993\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Space-Efficient Scheduling of Multithreaded Computations.\n \n \n \n\n\n \n Blumofe, R. D.; and Leiserson, C. E.\n\n\n \n\n\n\n In Proceedings of the Twenty Fifth Annual ACM Symposium on Theory of Computing, pages 362–371, San Diego, California, May 1993. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BlumofeLe93,\n\tAddress = {San Diego, California},\n\tAuthor = {Robert D. Blumofe and Charles E. Leiserson},\n\tGroup = {Supertech},\n\tBooktitle = stoc25,\n\tDay = {16--18},\n\tMonth = may,\n\tPages = {362--371},\n\tTitle = {Space-Efficient Scheduling of Multithreaded Computations},\n\tYear = 1993}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1992\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Managing Storage for Multithreaded Computations.\n \n \n \n\n\n \n Blumofe, R. D.\n\n\n \n\n\n\n Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, September 1992.\n Also available as MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-552.\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@mastersthesis{Blumofe92,\n\tAuthor = {Robert D. Blumofe},\n\tGroup = {Supertech},\n\tLocalfile = {msthesis},\n\tMonth = sep,\n\tNote = {Also available as MIT Laboratory for Computer Science Technical Report MIT/LCS/TR-552.},\n\tSchool = {Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology},\n\tTitle = {Managing Storage for Multithreaded Computations},\n\tYear = 1992}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n The Network Architecture of the Connection Machine CM-5.\n \n \n \n\n\n \n Leiserson, C. E.; Abuhamdeh, Z. S.; Douglas, D. C.; Feynman, C. R.; Ganmukhi, M. N.; Hill, J. V.; Hillis, W. D.; Kuszmaul, B. C.; St. Pierre, M. A.; Wells, D. S.; Wong, M. C.; Yang, S.; and Zak, R.\n\n\n \n\n\n\n In Proceedings of the Fourth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 272–285, San Diego, California, June 1992. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{LeisersonAbDo92,\n\tAddress = {San Diego, California},\n\tAuthor = {Charles E. Leiserson and Zahi S. Abuhamdeh and David C. Douglas and Carl R. Feynman and Mahesh N. Ganmukhi and Jeffrey V. Hill and W. Daniel Hillis and Bradley C. Kuszmaul and Margaret A. {St. Pierre} and David S. Wells and Monica C. Wong and Shaw-Wen Yang and Robert Zak},\n\tBooktitle = spaa4,\n\tGroup = {Supertech},\n\tMonth = jun,\n\tPages = {272--285},\n\tTitle = {The Network Architecture of the {Connection Machine CM-5}},\n\tYear = 1992}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1988\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n NAP (No ALU Processor): The Great Communicator.\n \n \n \n\n\n \n Fried, J.; and Kuszmaul, B. C.\n\n\n \n\n\n\n In The Second Symposium on the Frontiers of Massively Parallel Computation (Frontiers '88), pages 383–389, George Mason University, Fairfax, Virginia, 1988. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@InProceedings{FriedKu88\n  ,author = {Jeff Fried and Bradley C. Kuszmaul}\n  ,title = {{NAP} ({N}o {ALU} {P}rocessor): The Great Communicator}\n  ,booktitle = {The Second Symposium on the Frontiers of Massively Parallel\n\t\t Computation (Frontiers '88)}\n  ,year = 1988\n  ,pages = {383--389}\n  ,address = {George Mason University, Fairfax, Virginia}\n  ,date = {October 10--12}\n  ,file = {Bookshelves}\n  ,affiliation = {GTE, MIT, TMC}\n  ,localfile = "FriedKu88"\n  ,group     = {Supertech}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1986\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Solving Sparse Linear Systems via Parallel Nested Dissection on the Connection Machine.\n \n \n \n\n\n \n Leiserson, C. E.; Mesirov, J. P.; Nekludova, L.; Omohundro, S. M.; and Reif, J.\n\n\n \n\n\n\n In SIAM 1986 National Meeting, Boston, Massachusetts, July 1986. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{LeisersonMeNe86,\n\tAddress = {Boston, Massachusetts},\n\tAuthor = {Charles E. Leiserson and Jill P. Mesirov and Lena Nekludova and Stephen M. Omohundro and John Reif},\n\tGroup = {Supertech},\n\tBooktitle = {SIAM 1986 National Meeting},\n\tMonth = jul,\n\tTitle = {Solving Sparse Linear Systems via Parallel Nested Dissection on the {C}onnection {M}achine},\n\tYear = 1986}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);