There is a growing trend towards systems in multiple distributed locations that generate massive amounts of data. Distributed inference algorithms enable these systems to combine noisy observations without communicating them to a central location. However, the design and implementation of distributed algorithms is very challenging. We propose a combination of overlays and declarative programming to simplify the design of distributed inference algorithms. We demonstrate the effectiveness of our approach on a number of inference algorithms and evaluate the implementation on a suite of datasets in a real network deployment.
Title
Distributed Inference with Declarative Overlay Networks
Published
2008-10-19
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
EECS-2008-135
Type
Text
Extent
13 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
