Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTrishul M. Chilimbi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c30]Samyam Rajbhandari, Yuxiong He, Olatunji Ruwase, Michael Carbin, Trishul M. Chilimbi:
Optimizing CNNs on Multicores for Scalability, Performance and Goodput. ASPLOS 2017: 267-280- 2015
- [c29]Vivek Seshadri, Gennady Pekhimenko, Olatunji Ruwase, Onur Mutlu, Phillip B. Gibbons, Michael A. Kozuch, Todd C. Mowry, Trishul M. Chilimbi:
Page overlays: an enhanced virtual memory framework to enable fine-grained memory management. ISCA 2015: 79-91 - [c28]Feng Yan, Olatunji Ruwase, Yuxiong He, Trishul M. Chilimbi:
Performance Modeling and Scalability Optimization of Distributed Deep Learning Systems. KDD 2015: 1355-1364 - 2014
- [c27]Trishul M. Chilimbi, Yutaka Suzue, Johnson Apacible, Karthik Kalyanaraman:
Project Adam: Building an Efficient and Scalable Deep Learning Training System. OSDI 2014: 571-582 - 2013
- [c26]Knut Magne Risvik, Trishul M. Chilimbi, Henry Tan, Karthik Kalyanaraman, Chris Anderson:
Maguro, a system for indexing and searching over very large text collections. WSDM 2013: 727-736 - 2011
- [j2]Vijay Janapa Reddi, Benjamin C. Lee, Trishul M. Chilimbi, Kushagra Vaid:
Mobile processors for energy-efficient web search. ACM Trans. Comput. Syst. 29(3): 9:1-9:39 (2011) - [c25]Xiaoya Xiang, Bin Bao, Tongxin Bai, Chen Ding, Trishul M. Chilimbi:
All-window profiling and composable models of cache sharing. PPoPP 2011: 91-102 - 2010
- [c24]Vijay Janapa Reddi, Benjamin C. Lee, Trishul M. Chilimbi, Kushagra Vaid:
Web search using mobile cores: quantifying and mitigating the price of efficiency. ISCA 2010: 314-325 - [c23]Woongki Baek, Trishul M. Chilimbi:
Green: a framework for supporting energy-conscious programming using controlled approximation. PLDI 2010: 198-209 - [c22]George G. Robertson, Trishul M. Chilimbi, Bongshin Lee:
AllocRay: memory allocation visualization for unmanaged languages. SOFTVIS 2010: 43-52
2000 – 2009
- 2009
- [c21]Trishul M. Chilimbi, Ben Liblit
, Krishna K. Mehra, Aditya V. Nori, Kapil Vaswani:
HOLMES: Effective statistical debugging via efficient path profiling. ICSE 2009: 34-44 - [c20]Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilimbi:
SPEED: precise and efficient static estimation of program computational complexity. POPL 2009: 127-139 - 2008
- [c19]Sigmund Cherem, Trishul M. Chilimbi, Sumit Gulwani:
Inferring locks for atomic sections. PLDI 2008: 304-315 - [c18]Chen Ding, Trishul M. Chilimbi:
All-window profiling of concurrent executions. PPoPP 2008: 265-266 - 2007
- [c17]Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi:
Preferential path profiling: compactly numbering interesting paths. POPL 2007: 351-362 - [c16]Trishul M. Chilimbi, Aditya V. Nori, Kapil Vaswani:
Quantifying the effectiveness of testing via efficient residual path profiling. ESEC/SIGSOFT FSE 2007: 545-548 - 2006
- [c15]Trishul M. Chilimbi, Vinod Ganapathy:
HeapMD: identifying heap-based bugs using anomaly detection. ASPLOS 2006: 219-228 - [c14]Trishul M. Chilimbi, Ran Shaham:
Cache-conscious coallocation of hot data streams. PLDI 2006: 252-262 - [c13]Wen-ke Chen, Sanjay Bhansali, Trishul M. Chilimbi, Xiaofeng Gao, Weihaw Chuang:
Profile-guided proactive garbage collection for locality optimization. PLDI 2006: 332-340 - 2005
- [c12]Erez Perelman, Trishul M. Chilimbi, Brad Calder:
Variational Path Profiling. IEEE PACT 2005: 7-16 - 2004
- [c11]Matthias Hauswirth, Trishul M. Chilimbi:
Low-overhead memory leak detection using adaptive statistical profiling. ASPLOS 2004: 156-164 - 2002
- [c10]Trishul M. Chilimbi, Martin Hirzel:
Dynamic Hot Data Stream Prefetching for General-Purpose Programs. PLDI 2002: 199-209 - [c9]Shai Rubin, Rastislav Bodík, Trishul M. Chilimbi:
An efficient profile-analysis framework for data-layout optimizations. POPL 2002: 140-153 - 2001
- [c8]Trishul M. Chilimbi:
On the Stability of Temporal Data Reference Profiles. IEEE PACT 2001: 151-160 - [c7]Trishul M. Chilimbi:
Efficient Representations and Abstractions for Quantifying and Exploiting Data Reference Locality. PLDI 2001: 191-202 - 2000
- [j1]Trishul M. Chilimbi, Mark D. Hill, James R. Larus:
Making Pointer-Based Data Structures Cache Conscious. Computer 33(12): 67-74 (2000) - [c6]Trishul M. Chilimbi, Richard E. Jones, Benjamin G. Zorn:
Designing a Trace Format for Heap Allocation Events. ISMM 2000: 35-49
1990 – 1999
- 1999
- [c5]Trishul M. Chilimbi, Mark D. Hill, James R. Larus:
Cache-Conscious Structure Layout. PLDI 1999: 1-12 - [c4]Trishul M. Chilimbi, Bob Davidson, James R. Larus:
Cache-Conscious Structure Definition. PLDI 1999: 13-24 - 1998
- [c3]Trishul M. Chilimbi, James R. Larus:
Using Generational Garbage Collection To Implement Cache-Conscious Data Placement. ISMM 1998: 37-48 - 1995
- [c2]Trishul M. Chilimbi, Thomas Ball, Stephen G. Eick, James R. Larus:
Storm Watch: A Tool for Visualizing Memory System Protocols. SC 1995: 38 - 1994
- [c1]Trishul M. Chilimbi, James R. Larus:
Cachier: A Tool for Automatically Inserting CICO Annotations. ICPP (2) 1994: 89-98
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-10 20:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
