BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:(Research) Energy-Efficient Sentient Computing - Mbou Eyole-Monono
DTSTART:20090119T140000Z
DTEND:20090119T150000Z
UID:TALK13729@talks.cam.ac.uk
CONTACT:Andrew Rice
DESCRIPTION:In a bid to improve the interaction between computers and huma
 ns\, it is becoming necessary to make increasingly larger deployments of s
 ensor networks. These clusters of small electronic devices can be embedded
  in our surroundings and can detect and react to physical changes. They wi
 ll make computers more proactive in general by gathering and interpreting 
 useful information about the physical environment through a combination of
  measurements. Increasing the performance of these devices will mean more 
 intelligence can be embedded within the sensor network. However\, most con
 ventional ways of increasing performance often come with the burden of inc
 reased power dissipation which is not an option for energy-constrained sen
 sor networks. This thesis proposes\, develops and tests a design methodolo
 gy for performing greater amounts of processing within a sensor network wh
 ile satisfying the requirement for low energy consumption. The crux of the
  thesis is that there is a great deal of concurrency present in sensor net
 works which when combined with a tightly-coupled group of small\, fast\, e
 nergy-conscious processors can result in a significantly more efficient ne
 twork. The construction of a multiprocessor system aimed at sensor network
 s is described in detail. It is shown that a routine critical to sensor ne
 tworks can be sped up with the addition of a small set of primitives. The 
 need for a very fast inter-processor communication mechanism is highlighte
 d\, and the hardware scheduler developed as part of this effort forms the 
 cornerstone of the new sentient computing framework by facilitating thread
  operations and minimising the time required for context-switching. The ex
 perimental results also show that end-to-end latency can be reduced in a f
 lexible way through multiprocessing.\n
LOCATION:FW26\, William Gates Building
END:VEVENT
END:VCALENDAR