Distributed Systems and Parallel Computing
No matter how powerful individual computers become, there are still reasons to harness the power of multiple computational units, often spread across large geographic areas. Sometimes this is motivated by the need to collect data from widely dispersed locations (e.g., web pages from servers, or sensors for weather or traffic). Other times it is motivated by the need to perform enormous computations that simply cannot be done by a single CPU.
From our company’s beginning, Google has had to deal with both issues in our pursuit of organizing the world’s information and making it universally accessible and useful. We continue to face many exciting distributed systems and parallel computing challenges in areas such as concurrency control, fault tolerance, algorithmic efficiency, and communication. Some of our research involves answering fundamental theoretical questions, while other researchers and engineers are engaged in the construction of systems to operate at the largest possible scale, thanks to our hybrid research model.
Recent Publications
The Live Database: Firestore’s Scalable and Consistent Realtime Queries
David Gay
Ram Kesavan
Namita Lal
Per Jacobsson
Hui Wu
Matt Bell
Xijiao Li
2026
Preview abstract
Google’s Firestore is a NoSQL serverless database service that scales to millions of queries per second and petabytes of storage, serving over 8 million databases and 1.5 billion monthly active end users. A key reason for its popularity is its unique realtime query feature, which greatly simplifes web and mobile application development. Realtime queries allow an application to present an up-to-date and strongly-consistent view of the state of the database to the end-user, and to receive fast notifications of changes to the database state.
In this paper we present the architecture of the Firestore realtime stack, how it provides seamless scaling and high availability while supplying strongly-consistent responses to clients, including evaluations simulating workloads that represent large applications. We also explain how the Firestore SDK enables the application to deliver a smooth user experience through periods of network disconnection.
View details
Preview abstract
This article presents a novel approach to automating operations tasks, particularly incident triage, by using AI agents defined entirely in Markdown. These agents orchestrate actions across various observability tools (e.g., Datadog, Splunk) and use the file system for state and communication, mimicking the Unix philosophy. The system enables parallel investigations, cross-tool validation, and structured reporting without traditional coding frameworks.
View details
Securing the Agentic Enterprise
Amazon Kindle (2026)
Preview abstract
Securing the Agentic Enterprise: Threat Modeling, Anomaly Detection, and Governing Autonomous Multi-Agent Systems addresses the critical security and governance gaps emerging as enterprises transition from human-supervised copilots to autonomous agentic workflows. As software processes gain the ability to reason, decompose natural language objectives, and execute multi-step tool calls at machine speed, traditional syntactic security boundaries (like firewalls and static analysis) become obsolete.
This book provides security architects, CISOs, and platform engineers with a practical, architecture-level blueprint for securing this new paradigm. It explores novel attack vectors such as indirect prompt injections and consumption-based economic threats and provides frameworks for robust mitigation. Key topics include modernizing agentic identity, implementing semantic firewalls, transition-state anomaly detection, and applying zero-trust principles to autonomous execution contexts. Bridging the gap between high-level ethical guidelines and isolated model safety, this guide prepares practitioners to confidently deploy and govern enterprise-grade autonomous systems.
View details
Preview abstract
Serverless platforms offer compelling economics for low-traffic inference of small language models (SLMs), but cold start latency remains a critical barrier. We present a systematic empirical study of cold start performance for quantized SLMs served via llama.cpp on Google Cloud Run’s CPU-only infrastructure. We benchmark five models (270M– 3.8B parameters) across two memory tiers (4 GiB and 8 GiB), with a quantization sweep spanning five GGUF formats (Q2_K through Q8_0) for LLaMA 3.2 1B and three-point validation on Gemma 3 270M and Qwen3 0.6B. Our results reveal that model loading dominates cold start time (55–70%), the 8 GiB tier provides a hidden 2× vCPU advantage that nearly halves warm inference time, and Q4_K_M quantization achieves a Pareto-optimal tradeoff across latency, throughput, and model quality (confirmed via WikiText-2 perplexity). A threepredictor latency model (R 2 = 0.97) and break-even cost analysis provide practitioners a quantitative framework for SLM deployment decisions. Index Terms—small language models, serverless computing, cold start, quantization, llama.cpp, Cloud Run, GGUF, inference optimization
View details
Scalability With AI: Lessons From Real Production Systems
Hackernoon (2026)
Preview abstract
Traditional software scaling methods often fall short when applied to AI and Machine Learning systems, especially those involving Large Language Models (LLMs). This document explores the paradigm shift required to scale AI applications effectively in production. It highlights the challenges, such as non-deterministic inference latency and non-linear cost explosion, and contrasts AI systems with traditional web services. We present key architectural patterns and lessons learned from real-world production systems, including: Tiered Model Architectures for cost/latency optimization, Asynchronous Inference Pipelines to prevent blocking, Intelligent Semantic Caching using vector databases, and strategies for Graceful Degradation and Dynamic Batching. Additionally, we emphasize the need for an observability stack that goes beyond CPU and memory to monitor model behavior, data quality, and prediction drift. The goal is to provide practical guidance for engineers building and scaling robust and efficient AI-powered services.
View details
Hybrid Reputation Routing for Decentralized Networks: A Blockchain-Enabled Secure and Scalable Protocol with On-Chain/Off-Chain Partitioning
Praveen Baskar
Om Narayan
Ramkinker Singh
2026
Preview abstract
Our suggestion is a hybrid reputation-based routing
protocol in the context of decentralized routing. networks which
partitions trust measurements to on-chain immutable logs and
off-chain dynamic computations to attain security and scalability.
The protocol incorporates a layer of sharded blockchain to store
critical. trust data and local reputation model to do real-time
updates, enabling routing choices that cannot be tampered with.
performance. The trust ledger which operated on-chain kept
the records of the impartiality of. Historical performance and
node identities, whereas the off-chain reputation engine uses
graph neural network to calculate dynamic. real-time scores like
packet delivery rate to be trusted. and latency. Additionally, it
uses rollup-based batches of synchronization off-chain. optimistic
updates to zero-knowledge proofs, making on-chain efficient.
checking with minimum overhead. The suggested approach
replaces conventional network discovery and forwarding modules
using trust-based adjacency lists and trust-based pathing, and
thus enhancing routing consistency over adversarial settings.
Moreover, the structure integrates Hyperledger Fabric with.
Graph Attention Network-based high-throughput sharded ledger
operations. to update reputation in a privacy-preserving manner,
proving to be linear. network size scalability. The experimental
findings indicate that the system supports 10,000 transactions per
shard and produces. Under 100 ms per ZK-Rollup proof, which
is appropriate to large-scale IoT. and DeFi deployments. This
publication fills the gap between pure on-chain. and off-chain
reputation systems, which provides a viable solution to scalable
and secure decentralized routing.
View details
Some of our teams
×
![]()