create new tag
view all tags

Chen+:PLDI06 Profile-guided proactive garbage collection for locality optimization by Wen-ke Chen, Sanjay Bhansali, Trishul M. Chilimbi, Xiaofeng Gao and Weihaw Chuang, PLDI 2006. Added by XiaomingGu (Comments)

Zhai:Dissertation Compiler Optimization of Value Communication for Thread-Level Speculation by Antonia Zhai, Ph.D. Dissertation, CMU, 2005.

Probabilistic Calling Context by Michael D. Bond and Kathryn S. McKinley, OOPSLA 2007.

Tracking Bad Apples: Reporting the Origin of Null and Undefined Value Errors by Michael D. Bond, Nicholas Nethercote, Stephen W. Kent, Samuel Z. Guyer, and Kathryn S. McKinley, OOPSLA 2007

AftGuyer:MSPC08 GC Assertions: Using the Garbage Collector to Check Heap Properties by Edward Aftandilian and Samuel Z. Guyer, MSPC 2008. Added by XiaomingGu

DHollander:TPDS92 Partitioning and Labeling of Loops by Unimodular Transformations by Erik H. D'Hollander, TPDS 1992. Added by Chen Ding

RamS:JPDC92 Tiling Multidimensional Iteration Spaces for Multicomputers by J. Ramanujam, P. Sadayappan, JPDC 1992. Added by Chen Ding

Hogstedt+:TPDS03 On the Parallel Execution Time of Tiled Loops, by Karin Högstedt, Larry Carter, Jeanne Ferrante, TPDS 2003. Added by Chen Ding

Drosinos+:IPDPS06 Selecting the tile shape to reduce the total communication volume, by Nikolaos Drosinos, Georgios I. Goumas, Nectarios Koziris, IPDPS 2006. Added by Chen Ding

Rothberg+:ISCA93 Working Sets, Cache Sizes, and Node Granularity Issues for Large-Scale Multiprocessors, by Edward Rothberg, Jaswinder Pal Singh, Anoop Gupta, ISCA 1993. Added by Chen Ding

Culler+:PPOPP93 LogP: Towards a Realistic Model of Parallel Computation, by David E. Culler, Richard M. Karp, David A. Patterson, Abhijit Sahay, Klaus E. Schauser, Eunice E. Santos, Ramesh Subramonian, Thorsten von Eicken, PPOPP 1993. Added by Chen Ding

SeidlZorn:ASPLOS98 Segregating Heap Objects by Reference Behavior and Lifetime, by Matthew L. Seidl and Benjamin G. Zorn, ASPLOS 1998. Added by XiaomingGu

Navabi+:PPOPP08 Quasi-static scheduling for safe futures, by Armand Navabi and Xiangyu Zhang and Suresh Jagannathan, PPoPP 2008. Added by KirkKelsey

Grant+:PEPM97 Annotation-Directed Run-Time Specialization in C, by B. Grant, M. Mock, M. Philipose, C. Chambers, and S.J. Eggers, ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM), 1997. Added by TongxinBai

Mock+:MICRO00 Calpa: A Tool for Automating Selective Dynamic Compilation, by M. Mock, C. Chambers, and S. Eggers, MICRO-33, 2000. Added by TongxinBai (Comments)

Chilimbi:PLDI01 Efficient representations and abstractions for quantifying and exploiting data reference locality, by Trishul M. Chilimbi, PLDI 2001. Added by XiaomingGu

JiangShen:NGS08 Adaptive Speculation in Behavior-oriented Parallelization, by Yunlian Jiang and Xipeng Shen, NGS workshop, 2008, to appear. Added by ChenDing (a pdf copy is in /p/compiler/writing/RelatedPapers) (Comments)

Ball+:PLDI01 Automatic Predicate Abastraction of C Programs, by Thomas Ball, Rupak Majumdar, Todd Millstein, Sriram Rajamani, PLDI 2001. Added by TongxinBai

Zhuang+:PLDI06 Accurate, efficient, and adaptive calling context profiling, by Xiaotong Zhuang, Mauricio J. Serrano, Harold W. Cain, Jong-Deok Choi, PLDI 2006. Added by XiaomingGu (Comments)

Raman+:CGO08 Spice: Speculative Parallel Iteration Chunk Execution; by Easwaran Raman, Neil Vachharajani, Ram Rangan, and David August. CGO 2008. Added by KirkKelsey

Bennett+:ISCA90 Adaptive software cache management for distributed shared memory architectures, by Bennett, Carter, and Zwaenepoel, ISCA, 1990. Added by ChenDing (Comments)

Smarag+:PE03 The EELRU Adaptive Replacement Algorithm, by Yannis Smaragdakis, Scott F. Kaplan, and Paul R. Wilson, Performance Evaluation (Elsevier), May 2003. Added by XiaomingGu (Comments)

Acar+:PLDI06 An Experimental Analysis of Self-Adjusting Computation, by Umut Acar, Guy Blelloch, Matthias Blume, and Kanat Tangwongsan. PLDI 2006. Added by KirkKelsey

Yorsh+:POPL08 Generating precise and concise procedure summaries, by Greta Yorsh, Eran Yahav, and Satish Chandra, POPL 2008. Added by TongxinBai

Olken:LBL81 Efficient Methods for Calculating the Success Function of Fixed Space Replacement Policies, by Frank Olken, M.S. Theis, 1981. Added by XiaomingGu. (Comments)

ThiebautStone:TOCS87 Footprints in the Cache, by Thiebaut and Stone, TOCS 5(4), 1987. Added by Ding. (Comments)

Ferrari:CACM74 Improving locality by critical working sets, by Ferrari, CACM 1974. Added by ChenDing. (Comments)

BK:IBM75 LRU stack processing, by Bennet and Kruskal, IBM JRD 1975. Added by XiaomingGu. (Comments)

Xu+:PASTE07 Dynamic purity analysis for java programs, by Xu, Pickett, and Verbrugge in PASTE ’07. Added by KirkKelsey.

Aiken:SCP99 Introduction to set constraint-based program analysis, by Alex Aiken, Science of Computer Programming, 1999. Added by TongxinBai.

Edit | Attach | Watch | Print version | History: r38 < r37 < r36 < r35 < r34 | Backlinks | Raw View | Raw edit | More topic actions
Topic revision: r38 - 2008-04-11 - ChenDing
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2020 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding URCS? Send feedback