Search the dblp DataBase
Trishul M. Chilimbi :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Trishul M. Chilimbi , Mark D. Hill , James R. Larus Cache-Conscious Structure Layout. [Citation Graph (1, 0)][DBLP ] PLDI, 1999, pp:1-12 [Conf ] Trishul M. Chilimbi On the Stability of Temporal Data Reference Profiles. [Citation Graph (0, 0)][DBLP ] IEEE PACT, 2001, pp:151-0 [Conf ] Erez Perelman , Trishul M. Chilimbi , Brad Calder Variational Path Profiling. [Citation Graph (0, 0)][DBLP ] IEEE PACT, 2005, pp:7-16 [Conf ] Matthias Hauswirth , Trishul M. Chilimbi Low-overhead memory leak detection using adaptive statistical profiling. [Citation Graph (0, 0)][DBLP ] ASPLOS, 2004, pp:156-164 [Conf ] Trishul M. Chilimbi , Vinod Ganapathy HeapMD: identifying heap-based bugs using anomaly detection. [Citation Graph (0, 0)][DBLP ] ASPLOS, 2006, pp:219-228 [Conf ] Trishul M. Chilimbi , James R. Larus Cachier: A Tool for Automatically Inserting CICO Annotations. [Citation Graph (0, 0)][DBLP ] ICPP, 1994, pp:89-98 [Conf ] Trishul M. Chilimbi , Richard E. Jones , Benjamin G. Zorn Designing a Trace Format for Heap Allocation Events. [Citation Graph (0, 0)][DBLP ] ISMM, 2000, pp:35-49 [Conf ] Trishul M. Chilimbi , James R. Larus Using Generational Garbage Collection To Implement Cache-Conscious Data Placement. [Citation Graph (0, 0)][DBLP ] ISMM, 1998, pp:37-48 [Conf ] Wen-Ke Chen , Sanjay Bhansali , Trishul M. Chilimbi , Xiaofeng Gao , Weihaw Chuang Profile-guided proactive garbage collection for locality optimization. [Citation Graph (0, 0)][DBLP ] PLDI, 2006, pp:332-340 [Conf ] Trishul M. Chilimbi Efficient Representations and Abstractions for Quantifying and Exploiting Data Reference Locality. [Citation Graph (0, 0)][DBLP ] PLDI, 2001, pp:191-202 [Conf ] Trishul M. Chilimbi , Bob Davidson , James R. Larus Cache-Conscious Structure Definition. [Citation Graph (0, 0)][DBLP ] PLDI, 1999, pp:13-24 [Conf ] Trishul M. Chilimbi , Martin Hirzel Dynamic Hot Data Stream Prefetching for General-Purpose Programs. [Citation Graph (0, 0)][DBLP ] PLDI, 2002, pp:199-209 [Conf ] Trishul M. Chilimbi , Ran Shaham Cache-conscious coallocation of hot data streams. [Citation Graph (0, 0)][DBLP ] PLDI, 2006, pp:252-262 [Conf ] Shai Rubin , Rastislav Bodík , Trishul M. Chilimbi An efficient profile-analysis framework for data-layout optimizations. [Citation Graph (0, 0)][DBLP ] POPL, 2002, pp:140-153 [Conf ] Kapil Vaswani , Aditya V. Nori , Trishul M. Chilimbi Preferential path profiling: compactly numbering interesting paths. [Citation Graph (0, 0)][DBLP ] POPL, 2007, pp:351-362 [Conf ] Trishul M. Chilimbi , Thomas Ball , Stephen G. Eick , James R. Larus Storm Watch: A Tool for Visualizing Memory System Protocols. [Citation Graph (0, 0)][DBLP ] SC, 1995, pp:- [Conf ] Trishul M. Chilimbi , Mark D. Hill , James R. Larus Making Pointer-Based Data Structures Cache Conscious. [Citation Graph (0, 0)][DBLP ] IEEE Computer, 2000, v:33, n:12, pp:67-74 [Journal ] Trishul M. Chilimbi , Aditya V. Nori , Kapil Vaswani Quantifying the effectiveness of testing via efficient residual path profiling. [Citation Graph (0, 0)][DBLP ] ESEC/SIGSOFT FSE, 2007, pp:545-548 [Conf ] HOLMES: Effective statistical debugging via efficient path profiling. [Citation Graph (, )][DBLP ] Web search using mobile cores: quantifying and mitigating the price of efficiency. [Citation Graph (, )][DBLP ] Inferring locks for atomic sections. [Citation Graph (, )][DBLP ] Green: a framework for supporting energy-conscious programming using controlled approximation. [Citation Graph (, )][DBLP ] SPEED: precise and efficient static estimation of program computational complexity. [Citation Graph (, )][DBLP ] All-window profiling of concurrent executions. [Citation Graph (, )][DBLP ] Quantifying the effectiveness of testing via efficient residual path profiling. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.004secs