


default search action
Kaushik Rajan
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c24]Kaushik Rajan, Aseem Rastogi, Akash Lal, Sampath Rajendra, Krithika Subramanian, Krut Patel:
Welding Natural Language Queries to Analytics IRs with LLMs. CIDR 2024 - [c23]Ashwin Prasad
, Sampath Rajendra
, Kaushik Rajan
, R. Govindarajan
, Uday Bondhugula
:
SilvanForge: A Schedule-Guided Retargetable Compiler for Decision Tree Inference. SOSP 2024: 488-504 - 2022
- [c22]Ashwin Prasad, Sampath Rajendra, Kaushik Rajan
, R. Govindarajan, Uday Bondhugula:
Treebeard: An Optimizing Compiler for Decision Tree Based ML Inference. MICRO 2022: 494-511 - 2021
- [j4]Abhishek Modi, Kaushik Rajan
, Srinivas Thimmaiah, Prakhar Jain, Swinky Mann, Ayushi Agarwal, Ajith Shetty, Shahid K. I, Ashit Gosalia, Partho Sarthi:
New Query Optimization Techniques in the Spark Engine of Azure Synapse. Proc. VLDB Endow. 15(4): 936-948 (2021) - 2020
- [j3]Muthian Sivathanu, Midhul Vuppalapati, Bhargav S. Gulavani, Kaushik Rajan
, Jyoti Leeka, Jayashree Mohan, Piyus Kedia:
INSTalytics: Cluster Filesystem Co-design for Big-data Analytics. ACM Trans. Storage 15(4): 23:1-23:30 (2020) - [c21]Partho Sarthi, Kaushik Rajan, Akash Lal, Abhishek Modi, Prakhar Jain, Mo Liu, Ashit Gosalia, Saurabh Kalikar:
Generalized Sub-Query Fusion for Eliminating Redundant I/O from Big-Data Queries. OSDI 2020: 209-224
2010 – 2019
- 2019
- [j2]Jyoti Leeka, Kaushik Rajan
:
Incorporating Super-Operators in Big-Data Query Optimizers. Proc. VLDB Endow. 13(3): 348-361 (2019) - [c20]Guna Prasaad
, G. Ramalingam, Kaushik Rajan
:
Scaling Ordered Stream Processing on Shared-Memory Multicores. BIRTE 2019: 6:1-6:10 - [c19]Muthian Sivathanu, Midhul Vuppalapati, Bhargav S. Gulavani, Kaushik Rajan, Jyoti Leeka, Jayashree Mohan, Piyus Kedia:
INSTalytics: Cluster Filesystem Co-design for Big-data Analytics. FAST 2019: 235-248 - 2018
- [i1]Guna Prasaad, G. Ramalingam, Kaushik Rajan:
Scaling Ordered Stream Processing on Shared-Memory Multicores. CoRR abs/1803.11328 (2018) - 2017
- [c18]Matthias Schlaipfer
, Kaushik Rajan
, Akash Lal, Malavika Samak:
Optimizing Big-Data Queries Using Program Synthesis. SOSP 2017: 631-646 - 2016
- [c17]Kaushik Rajan
, Dharmesh Kakadia, Carlo Curino, Subru Krishnan:
PerfOrator: eloquent performance models for Resource Optimization. SoCC 2016: 415-427 - 2013
- [c16]Sagar Chordia, Sriram K. Rajamani, Kaushik Rajan
, Ganesan Ramalingam, Kapil Vaswani:
Asynchronous Resilient Linearizability. DISC 2013: 164-178 - 2012
- [c15]R. Manikantan, Kaushik Rajan
, R. Govindarajan:
Probabilistic Shared Cache Management (PriSM). ISCA 2012: 428-439 - [c14]Jose M. Faleiro, Sriram K. Rajamani, Kaushik Rajan
, G. Ramalingam, Kapil Vaswani:
CScale - A Programming Model for Scalable and Reliable Distributed Applications. Monterey Workshop 2012: 148-156 - [c13]Jose M. Faleiro, Sriram K. Rajamani, Kaushik Rajan
, G. Ramalingam, Kapil Vaswani:
Generalized lattice agreement. PODC 2012: 125-134 - 2011
- [c12]Hesam Samimi, Kaushik Rajan
:
Specification-based sketching with Sketch. FTfJP@ECOOP 2011: 3:1-3:7 - [c11]R. Manikantan, R. Govindarajan, Kaushik Rajan
:
Extended histories: improving regularity and performance in correlation prefetchers. HiPEAC 2011: 67-76 - [c10]R. Manikantan, Kaushik Rajan
, R. Govindarajan:
NUcache: An efficient multicore cache organization based on Next-Use distance. HPCA 2011: 243-253 - [c9]Abhishek Udupa, Kaushik Rajan
, William Thies:
ALTER: exploiting breakable dependences for parallelization. PLDI 2011: 480-491 - 2010
- [c8]R. Manikantan, Kaushik Rajan
, R. Govindarajan:
NUcache: a multicore cache organization based on next-use distance. PACT 2010: 569-570 - [c7]Kaushik Rajan
, Sriram K. Rajamani, Shashank Yaduvanshi:
GUESSTIMATE: a programming model for collaborative distributed systems. PLDI 2010: 210-220 - [c6]Sandya Mannarswamy, Dhruva R. Chakrabarti, Kaushik Rajan
, Sujoy Saraswati:
Compiler aided selective lock assignment for improving the performance of software transactional memory. PPoPP 2010: 37-46
2000 – 2009
- 2009
- [j1]Kaushik Rajan
, Ramaswamy Govindarajan:
A Novel Cache Architecture and Placement Framework for Packet Forwarding Engines. IEEE Trans. Computers 58(8): 1009-1025 (2009) - [c5]Rupesh Nasre
, Kaushik Rajan
, Ramaswamy Govindarajan, Uday P. Khedker:
Scalable Context-Sensitive Points-to Analysis Using Multi-dimensional Bloom Filters. APLAS 2009: 47-62 - 2007
- [c4]Kaushik Rajan, Ramaswamy Govindarajan, Bharadwaj Amrutur:
Dynamic Cache Placement with Two-level Mapping to Reduce Conflict Misses. PACT 2007: 422 - [c3]Kaushik Rajan
, Ramaswamy Govindarajan:
Emulating Optimal Replacement with a Shepherd Cache. MICRO 2007: 445-454 - 2006
- [c2]Kaushik Rajan
, Ramaswamy Govindarajan:
Two-level mapping based cache index selection for packet forwarding engines. PACT 2006: 212-221 - 2005
- [c1]Kaushik Rajan
, Ramaswamy Govindarajan:
A heterogeneously segmented cache architecture for a packet forwarding engine. ICS 2005: 71-80
Coauthor Index
aka: Ramaswamy Govindarajan

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 2025-01-21 00:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint