Wishbone: Profile-based Partitioning for Sensornet Applications
Name
wishbone-nsdi09.pdf
Size
2.57 MB
Format
Adobe PDF
Checksum (MD5)
c9b1cb70da236a80e8c201199d5224c4
Author(s)
Newton, Ryan
Toledo, Sivan
Girod, Lewis D.
Balakrishnan, Hari
Madden, Samuel R.
Date Issued
January 2009
Journal
Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Publisher
USENIX Association
Citation
Newton, Ryan et al. “Wishbone: profile-based partitioning for sensornet applications.” Proceedings of the 6th USENIX symposium on Networked systems design and implementation. Boston, Massachusetts: USENIX Association, 2009. 395-408.
Version
Author's final manuscript
Abstract
The ability to partition sensor network application code across sensor nodes and backend servers is important for running complex, data-intensive applications on sensor platforms that have CPU, energy, and bandwidth limitations. This paper presents Wishbone, a system that takes a dataflow graph of operators and produces an optimal partitioning. With Wishbone, users can run the same program on a range of sensor platforms, including TinyOS motes, smartphones running JavaME, and the iPhone. The resulting program partitioning will in general be different in each case, reflecting the different node capabilities. Wishbone uses profiling to determine how each operator in the dataflow graph will actually perform on sample data, without requiring cumbersome user annotations. Its partitioning algorithm models the problem as an integer linear program that minimizes a linear combination of network bandwidth and CPU load and uses program structure to solve the problem efficiently in practice. Our results on a speech detection application show that the system can quickly identify good trade-offs given limitations in CPU and network capacity.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Attribution-Noncommercial-Share Alike 3.0 Unported
Persistent DSpace Link
DOI of Published Version
http://portal.acm.org/citation.cfm?id=1559004
