77 citations · 242 across the 19 of their papers we have counts for
21 papers
Fundamental limits of distributed multiclass classification from simple binary decisions
Ioannis Papageorgiou, Srinivas Nomula, Ayalvadi Ganesh +2
We consider the problem of constructing a -class classifier from the combination of simple binary classifiers -- this is a natural paradigm to construct a sophistica…
Bipartite matching under communication constraints
Moonmoon Mohanty, Gautham Bolar, Preetam Patil +3
In modern data center networks, thousands of hosts contend for shared link capacity; the scale of these systems makes centralized scheduling impractical. This article models such s…
Perfect Privacy and Strong Stationary Times for Markovian Sources
Fangwei Ye, Zonghong Liu, Parimal Parag +1
We consider the problem of sharing correlated data under a perfect information-theoretic privacy constraint. We focus on redaction (erasure) mechanisms, in which data are either wi…
Self-Creating Random Walks for Decentralized Learning under Pac-Man Attacks
Xingran Chen, Parimal Parag, Rohit Bhagat +1
Random walk (RW)-based algorithms have long been popular in distributed systems due to low overheads and scalability, with recent growing applications in decentralized learning. Ho…
Optimizing Resource Allocation for Geographically-Distributed Inference by Large Language Models
Tingyang Sun, Ting He, Bo Ji +1
Large language models have demonstrated extraordinary performance in many AI tasks but are expensive to use, even after training, due to their requirement of high-end GPUs. Recentl…
Random Walk Learning and the Pac-Man Attack
Xingran Chen, Parimal Parag, Rohit Bhagat +2
Random walk (RW)-based algorithms have long been popular in distributed systems due to low overheads and scalability, with recent growing applications in decentralized learning. Ho…
Adaptive Stochastic Gradient Descent for Fast and Communication-Efficient Distributed Learning
Serge Kas Hanna, Rawad Bitar, Parimal Parag +2
We consider the setting where a master wants to run a distributed stochastic gradient descent (SGD) algorithm on workers, each having a subset of the data. Distributed SGD may…
Modeling Performance and Energy trade-offs in Online Data-Intensive Applications
Ajay Badita, Rooji Jinan, Balajee Vamanan +1
We consider energy minimization for data-intensive applications run on large number of servers, for given performance guarantees. We consider a system, where each incoming applicat…
Latency-Redundancy Tradeoff in Distributed Read-Write Systems
Saraswathy Ramanathan, Gaurav Gautam, Vikram Srinivasan +1
Data is replicated and stored redundantly over multiple servers for availability in distributed databases. We focus on databases with frequent reads and writes, where both read and…
Optimal Pricing in Multi Server Systems
Ashok Krishnan K. S, Chandramani Singh, Siva Theja Maguluri +1
We study optimal service pricing in server farms where customers arrive according to a renewal process and have independent and identical () exponential service times and $…
Latency optimal storage and scheduling of replicated fragments for memory-constrained servers
Rooji Jinan, Ajay Badita, Pradeep Sarvepalli +1
We consider the setting of distributed storage system where a single file is subdivided into smaller fragments of same size which are then replicated with a common replication fact…
Load balancing policies without feedback using timed replicas
Rooji Jinan, Ajay Badita, Tejas Bodas +1
Dispatching policies such as the join shortest queue (JSQ), join smallest work (JSW) and their power of two variants are used in load balancing systems where the instantaneous queu…
Tracking an Auto-Regressive Process with Limited Communication per Unit Time
Rooji Jinan, Parimal Parag, Himanshu Tyagi
Samples from a high-dimensional AR[1] process are observed by a sender which can communicate only finitely many bits per unit time to a receiver. The receiver seeks to form an esti…
Adaptive Distributed Stochastic Gradient Descent for Minimizing Delay in the Presence of Stragglers
Serge Kas Hanna, Rawad Bitar, Parimal Parag +2
We consider the setting where a master wants to run a distributed stochastic gradient descent (SGD) algorithm on workers each having a subset of the data. Distributed SGD may s…
Optimal Server Selection for Straggler Mitigation
Ajay Badita, Parimal Parag, Vaneet Aggarwal
The performance of large-scale distributed compute systems is adversely impacted by stragglers when the execution time of a job is uncertain. To manage stragglers, we consider a mu…
Mode-Suppression: A Simple, Stable and Scalable Chunk-Sharing Algorithm for P2P Networks
Vamseedhar Reddyvari Raja, Parimal Parag, Srinivas Shakkottai
The ability of a P2P network to scale its throughput up in proportion to the arrival rate of peers has recently been shown to be crucially dependent on the chunk sharing policy emp…
Optimal Source Codes for Timely Updates
Prathamesh Mayekar, Parimal Parag, Himanshu Tyagi
A transmitter observing a sequence of independent and identically distributed random variables seeks to keep a receiver updated about its latest observations. The receiver need not…
A Systematic Approach to Incremental Redundancy over Erasure Channels
Anoosheh Heidarzadeh, Jean-Francois Chamberland, Parimal Parag +1
As sensing and instrumentation play an increasingly important role in systems controlled over wired and wireless networks, the need to better understand delay-sensitive communicati…
Minimizing Latency for Secure Coded Computing Using Secret Sharing via Staircase Codes
Rawad Bitar, Parimal Parag, Salim El Rouayheb
We consider the setting of a Master server, M, who possesses confidential data (e.g., personal, genomic or medical data) and wants to run intensive computations on it, as part of a…
Minimizing Latency for Secure Distributed Computing
Rawad Bitar, Parimal Parag, Salim El Rouayheb
We consider the setting of a master server who possesses confidential data (genomic, medical data, etc.) and wants to run intensive computations on it, as part of a machine learnin…
On the Queueing Behavior of Random Codes over a Gilbert-Elliot Erasure Channel
Parimal Parag, Jean-Francois Chamberland, Henry D. Pfister +1
This paper considers the queueing performance of a system that transmits coded data over a time-varying erasure channel. In our model, the queue length and channel state together f…