Paper Info
Title
Wishbone: profile-based partitioning for sensornet applications
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.
Year
Venue
Keywords
2009
NSDI
network capacity,sensornet application,program structure,dataflow graph,profile-based partitioning,integer linear program,sensor node,network bandwidth,sensor platform,cpu load,resulting program,sensor network application code,sensor network,speech detection
Field
DocType
Citations 
Wishbone,Profiling (computer programming),Voice activity detection,Computer science,Server,Real-time computing,Dataflow,Bandwidth (signal processing),Linear programming,Wireless sensor network,Embedded system,Distributed computing
Conference
53
PageRank 
References 
Authors
4.81
16
5
Name
Order
Citations
PageRank
Ryan Newton180270.80
Sivan Toledo21995181.13
Lewis Girod33105404.33
Hari Balakrishnan4316653441.21
Samuel Madden5161011176.38