Professional Documents
Culture Documents
Gibbons SenSys08 Keynote
Gibbons SenSys08 Keynote
Phillip B. Gibbons
Intel Research Pittsburgh
November 5, 2008
Outline
Remarkable
progress
Expanding scope
y Singly tasked
Microservers? not so tiny, PDA-class processor
Fault-line monitoring? wide-area, not ad hoc
Broadband? not low-bandwidth
Webcams? not scalar, can be multi-tasked
Tanker/Fab monitoring? powered, wired
6 Slide
Phillipfrom IrisNet
B. Gibbons, talks
SenSys’08 ~2005
keynote
Sensor Networks is a Rich Space
WSN
y Distributed Smart Cameras core
– Computer Vision?
y Etc
Thrilling Opportunity ?
or
Self-inflicted Identity Theft ?
Discussion topic among the SenSys Steering Committee
9 Phillip B. Gibbons, SenSys’08 keynote
Embracing the Broadening
Environmental Activity
Coord. location (lat,lon) Object-based drawing
Symbolic location in a car Kinematic running
Surroundings low crime High-level vacationing
Social Cognitive
ID: you and others nearby Emotional angry
Type of interaction work Goal finish taxes
Current role teacher Temporal rushing
16 Philipose etPhillip
al, B.IRGibbons,
Seattle, IR keynote
SenSys’08 Pittsburgh, etc
ESP Application Structure
Applications Digital valet Life coach
Adaptive Low attention Interaction
Interaction interfaces interfaces planning Haptics
Sensing
accelerometer
“water”
“having
“mustard”
a meal”
“pepper”
Natural gesture
user interfaces Gestris
23 Sukthankar
Phillip B.et al, IR
Gibbons, Pittsburgh,
SenSys’08 keynote CMU
Outline
y Musings on the Thrills & Spills of
sensornet research
• Energy-efficient • Lighter
• Smaller • More durable
• Higher throughput
• Less cooling cost
25 Phillip B. Gibbons, SenSys’08 keynote
NAND Flash Chip Properties
Block (64‐128 pages) Page (512‐2048 B)
Read/write pages,
… … erase blocks
• Write page once after a block is erased
In-place update
• Write page once after a block is erased
In-place update
1. Copy 2. Erase
• Write page once after a block is erased
In-place update
• Write page once after a block is erased
In-place update
• Write page once after a block is erased
In-place update
• Expensive operations:
Sequential
Sequential
Random
• In‐place updates
• Random writes 0.4ms 0.6ms 0.4ms 127ms
Read Write
30 Phillip B. Gibbons, SenSys’08 keynote
Hi-Spade
1 2
3 1 2
3 14 2
378 146 2 5
378 1 4 6 12 2 11 5 9 10
Random
Se
Se
mi
mi
‐ra Applies to
‐ra
Se
Se
Ra
nd
nd
qu
qu
nd
o flash chips,
o
en
en
om
m
m
tia
tia
flash cards,
l
l
Query
Accept with
prob |R|/i
i’th item
Reservoir R
Not Flash‐Friendly:
Random writes, in‐place updates
39 Phillip B. Gibbons, SenSys’08 keynote
Existing Sampling Algorithms
y Memory: Reservoir Sampling [Vitter’85]
i’th item
Reservoir R
Not Flash‐Friendly:
Random writes, in‐place updates
40 Phillip B. Gibbons, SenSys’08 keynote
Flash-friendly Sampling Algorithm
1. Assign random
“levels” to items and
put them in buckets
Semi‐random writes, No in‐place updates
41 Phillip B. Gibbons, SenSys’08 keynote
Flash-friendly Sampling Algorithm
1. Assign random
“levels” to items and
put them in buckets
Semi‐random writes, No in‐place updates
42 Phillip B. Gibbons, SenSys’08 keynote
Flash-friendly Sampling Algorithm
1. Assign random
“levels” to items and
put them in buckets
Semi‐random writes, No in‐place updates
43 Phillip B. Gibbons, SenSys’08 keynote
Flash-friendly Sampling Algorithm
1. Assign random
“levels” to items and
put them in buckets
Semi‐random writes, No in‐place updates
44 Phillip B. Gibbons, SenSys’08 keynote
Flash-friendly Sampling Algorithm
1. Assign random
“levels” to items and
put them in buckets
Semi‐random writes, No in‐place updates
45 Phillip B. Gibbons, SenSys’08 keynote
Flash-friendly Sampling Algorithm
1. Assign random
Semi‐random writes, No in‐place updates
46 Phillip B. Gibbons, SenSys’08 keynote
Flash-friendly Sampling Algorithm
1. Assign random
“levels” to items and
put them in buckets
1. Assign random
“levels” to items and
put them in buckets
1. Assign random
“levels” to items and
put them in buckets
1. Assign random
“levels” to items and
put them in buckets
Our algorithm
Our Algorithm
On Lexar CF card
52 Phillip B. Gibbons, SenSys’08 keynote
Energy to Maintain Sample
Our algorithm
Our Algorithm
3 orders of
magnitude
better
On Lexar CF card
53 Phillip B. Gibbons, SenSys’08 keynote
Sub-sampling within Time Window
Only change: the level generation function
Hazards of
research on
fast-moving
technology
0.2
time (ms)
0.15
0.1
0.05
0
512
1K
2K
4K
8K
16K
Request Size
patterned “flower”,
2 mold wafers
including actuators bonded around
& control circuitry 1 thinned logic wafer
arms curl up
due to stresses
between layers
Standard approach:
(regular) gradient
Our approach:
• Hierarchical Overlay
• Speculative forwarding
on the long links
Still a Thrill!
68 Phillip B. Gibbons, SenSys’08 keynote
Sensornet Research
y What a thrill: exciting, impactful work
WSN