Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Niraj Tolia

dblp:t/NirajTolia · DBLP profile ↗
← Back
12ranked-venue papers
6as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 7 · 2 first-authorDatabases, data management, data science and information retrieval · 4 · 2 first-authorComputer networks · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
7 papers
Storage systems · 44% Memory systems · 34% Parallel and multicore computing · 11%
Databases, data mining, and information retrieval
2 papers
Distributed and cloud data management · 50% Transaction processing and concurrency control · 25% Indexing and storage engines · 25%
Computer networks
2 papers
Internet architecture and protocols · 59% Transport protocols and congestion control · 41%

Topics — the 20 heaviest of 22, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems
content-addressable storage
0.132007
Design Tradeoffs in Applying Content Addressable Storage to Enterprise-scale Systems Based on Virtual Machines · USENIX ATC, General Track 2006
Opportunistic Use of Content Addressable Storage for Distributed File Systems · USENIX ATC, General Track 2003
Improving mobile database access over wide-area networks without degrading consistency · MobiSys 2007
Memory systems › non-volatile memory › persistent memory
byte-addressable persistent memory
0.112011
Consistent and Durable Data Structures for Non-Volatile Byte-Addressable Memory · FAST 2011
Parallel and multicore computing › task scheduling
coordinated scheduling
0.112011
Pegasus: Coordinated Scheduling for Virtualized Accelerator-based Systems · USENIX ATC 2011
Storage systems
crash consistency
0.112011
Consistent and Durable Data Structures for Non-Volatile Byte-Addressable Memory · FAST 2011
Storage systems › transaction support › transactional storage
failure atomicity
0.112011
Consistent and Durable Data Structures for Non-Volatile Byte-Addressable Memory · FAST 2011
Memory systems
non-volatile memory
0.112011
Consistent and Durable Data Structures for Non-Volatile Byte-Addressable Memory · FAST 2011
Memory systems › non-volatile memory
persistent data structures
0.112011
Consistent and Durable Data Structures for Non-Volatile Byte-Addressable Memory · FAST 2011
Transaction processing and concurrency control
consistency
0.112007
Improving mobile database access over wide-area networks without degrading consistency · MobiSys 2007
Indexing and storage engines › caching
database caching
0.112007
Consistency-preserving caching of dynamic database content · WWW 2007
Distributed and cloud data management › web caching
dynamic content caching
0.112007
Consistency-preserving caching of dynamic database content · WWW 2007
Distributed and cloud data management › data replication
replica control
0.112007
Improving mobile database access over wide-area networks without degrading consistency · MobiSys 2007
Transport protocols and congestion control
transport protocols
0.112005
What the protocol stack missed: the transfer service · SOSP 2005
Storage systems
distributed storage
0.012004
Integrating Portable and Distributed Storage · FAST 2004
High-performance computing › HPC storage systems
data staging
0.012003
Data Staging on Untrusted Surrogates · FAST 2003
Storage systems › file systems
distributed file system
0.012003
Opportunistic Use of Content Addressable Storage for Distributed File Systems · USENIX ATC, General Track 2003
Cloud and datacenter computing
resource management
0.012011
Pegasus: Coordinated Scheduling for Virtualized Accelerator-based Systems · USENIX ATC 2011
Storage systems › data reduction
data deduplication
0.012007
Improving mobile database access over wide-area networks without degrading consistency · MobiSys 2007
Cloud and datacenter computing
virtualization
0.012006
Design Tradeoffs in Applying Content Addressable Storage to Enterprise-scale Systems Based on Virtual Machines · USENIX ATC, General Track 2006
Cloud and datacenter computing › virtualization
virtual machine storage
0.012006
Design Tradeoffs in Applying Content Addressable Storage to Enterprise-scale Systems Based on Virtual Machines · USENIX ATC, General Track 2006
Internet architecture and protocols › protocol design
protocol stack design
0.012005
What the protocol stack missed: the transfer service · SOSP 2005

Methods — techniques the papers use, named apart from their topics

content addressable storage · 0.2optimistic replica control · 0.1cryptographic hashing · 0.1
YearPublicationVenuePosition
2011 Consistent and Durable Data Structures for Non-Volatile Byte-Addressable Memory
Shivaram Venkataraman, Niraj Tolia, Parthasarathy Ranganathan, Roy H. Campbell
FAST2
2011 Pegasus: Coordinated Scheduling for Virtualized Accelerator-based Systems
Vishakha Gupta, Karsten Schwan, Niraj Tolia, Vanish Talwar, Parthasarathy Ranganathan
USENIX ATC3
2007 Interactive Resource-Intensive Applications Made Easy
H. Andrés Lagar-Cavilla, Niraj Tolia, Eyal de Lara, Mahadev Satyanarayanan, David R. O'Hallaron
Middleware2
2007 Improving mobile database access over wide-area networks without degrading consistency
abstract
We report on the design, implementation, and evaluation of a system called Cedar that enables mobile database access with good performance over low-bandwidth networks. This is accomplished without degrading consistency. Cedar exploits the disk storage and processing power of a mobile client to compensate for weak connectivity. Its central organizing principle is that even a stale client replica can be used to reduce data transmission volume from a database server. The reduction is achieved by using content addressable storage to discover and elide commonality between client and server results. This organizing principle allows Cedar to use an optimistic approach to solving the difficult problem of database replica control. For laptop-class clients, our experiments show that Cedar improves the throughput of read-write workloads by 39% to as much as 224% while reducing response time by 28% to as much as 79%.
Niraj Tolia, Mahadev Satyanarayanan, Adam Wolbach
MobiSys1
2007 VMM-independent graphics acceleration
abstract
Graphical processing units (GPUs) are critical to high-quality visualization in many application domains. Running such applications in virtual machine monitor (VMM) environments is difficult for a number of reasons, all relating to the fact that the GPU hardware interface is proprietary rather than standardized. This paper describes the design, implementation, and evaluation of VMGL, a VMM-independent, GPU-independent, cross-platform solution to this problem. VMGL virtualizes at the OpenGL software interface, recognizing its widespread use in graphics-intensive applica-tions. Our experiments confirm excellent rendering performance with VMGL, coming within 14% or better of native hardware accelerated performance measured in frames per second. This is two orders of magnitude better than software rendering, which is the commonly available alternative today for graphics-intensive applications running in virtualized environments. Our results confirm VMGL’s portability across VMware Workstation and Xen (on VT and non-VT hardware), and across Linux (with and without paravirtualization), FreeBSD, and Solaris. Our results also show
H. Andrés Lagar-Cavilla, Niraj Tolia, Mahadev Satyanarayanan, Eyal de Lara
VEE2
2007 Consistency-preserving caching of dynamic database content
abstract
With the growing use of dynamic web content generated from relational databases, traditional caching solutions for through put and latency improvements are ineffective. We describe a middleware layer called Ganesh that reduces the volume of data transmitted without semantic interpretation of queries or results. It achieves this reduction through the use of cryptographic hashing to detect similarities with previous results. These benefits do not require any compromise of the strict consistency semantics provided by the back-end database. Further, Ganesh does not require modifications to applications, web servers, or database servers, and works with closed-source applications and databases. Using two bench marks representative of dynamic web sites, measurements of our prototype show that it can increase end-to-end throughput by as much as two fold for non-data intensive applications and by as much as ten fold for dataintensive ones.
Niraj Tolia, Mahadev Satyanarayanan
WWW1
2006 An Architecture for Internet Data Transfer
Niraj Tolia, Michael Kaminsky, David G. Andersen, Swapnil Patil 0001
NSDI1
2006 Design Tradeoffs in Applying Content Addressable Storage to Enterprise-scale Systems Based on Virtual Machines
Partho Nath, Michael A. Kozuch, David R. O'Hallaron, Jan Harkes, Mahadev Satyanarayanan, Niraj Tolia, Matt Toups
USENIX ATC, General Track6
2005 What the protocol stack missed: the transfer service
abstract
This WIP proposes a new architecture for applications that perform bulk data transfers. This architecture, called DOT (for data-oriented transfer), cleanly separates out two functions that are comingled in today's applications. Using DOT, applications perform content negotiation to determine what content to send. They then pass that data object to the transfer service to perform the actual data transmission. This separation increases application flexibility, enables the rapid development of innovative transfer mechanisms, reduces developer effort, and allows increased efficiency through cross-application sharing.
Niraj Tolia, David G. Andersen, Michael Kaminsky, Swapnil Patil 0001
SOSP1
2004 Integrating Portable and Distributed Storage
Niraj Tolia, Jan Harkes, Michael A. Kozuch, Mahadev Satyanarayanan
FAST1
2003 Data Staging on Untrusted Surrogates
Jason Flinn, Shafeeq Sinnamohideen, Niraj Tolia, Mahadev Satyanarayanan
FAST3
2003 Opportunistic Use of Content Addressable Storage for Distributed File Systems
Niraj Tolia, Michael A. Kozuch, Mahadev Satyanarayanan, Brad Karp, Thomas C. Bressoud, Adrian Perrig
USENIX ATC, General Track1