This paper studies the distributed optimization problem over an undirected connected graph subject to digital communications with a finite data rate, where each agent holds strongly convex and smooth cost function. The agents need cooperatively minimize average of all agents’ functions. Each builds encoder/decoder pair that produces transmitted messages its neighbors finite-level uniform quanti...

Group communication is a widely studied paradigm for building fault-tolerant distributed systems. The Armada project at the University of Michigan is a collaborative effort with the Honeywell Technology Center to study how real-world applications use group communication. In this paper, we describe the results of our experience implementing a fault-tolerant distributed radar tracking system, and...

We present a distributed optimization algorithm for solving online personalized problems over network of computing and communicating nodes, each which linked to specific user. The local objective functions are assumed have composite structure consist known time-varying (engineering) part an unknown (user-specific) part. Regarding the part, it is parametric (e.g., quadratic) <italic xmlns:mml="h...

Numerous administration tools and techniques require near real time vision of the activity occuring on a distributed filesystem. The changelog facility provided by Lustre to address this need suffers limitations in terms of scalability and flexibility. We have been working on reducing those limitations by enhancing Lustre itself and developing external tools such as Lustre ChangeLog Aggregate a...