View source for Seminar Fall 2012

From Cyber-Physical Systems Laboratory

← Seminar Fall 2012

You do not have permission to edit this page, for the following reason:

---

You can view and copy the source of this page.

=== Sep 6, 2012 - Jing Li === ExSched: An External CPU Scheduler Framework for Real-Time Systems, RTCSA 2012. Mikael Asberg, Thomas Nolte, Shinpei Kato and Ragunathan Rajkumar Links: [http://ertl.jp/~shinpei/papers/rtcsa12.pdf Paper] === Sep 13, 2012 - Andrew Kutta === OBSERVE: Occupancy-Based System for Efficient Reduction of HVAC Energy, IPSN 2011. Varick L. Erickson, Miguel Á. Carreira-Perpiñán and Alberto E.Cerpa Links: [http://andes.ucmerced.edu/papers/Erickson11a.pdf Paper] === Sep 20, 2012 - Chong Li === VNET/P: Bridging the Cloud and High Performance Computing Through Fast Overlay Networking, HPDC 2012. Lei Xia, Zheng Cui, John Lange, Yuan Tang, Peter Dinda, Patrick Bridges Links: [http://dl.acm.org/citation.cfm?id=2287116&preflayout=tabs Paper] === Sep 27, 2012 - Yong Fu === Practice talk on Emsoft paper. === Oct 4, 2012 - Chengjie Wu === Control-Quality Optimization for Distributed Embedded Systems with Adaptive Fault Tolerance, ECRTS 2012. Soheil Samii, Unmesh D. Bordoloi, Petru Eles, Zebo Peng, Anton Cervin Links: [http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6257560 Paper] === Oct 11, 2012 - N/A === Canceled due to CPS deadlines. === Oct 18, 2012 - Rahav Dor and Yong Fu === Practice talk on Wireless Health and ICNP papers. <!-- Low Power, Low Delay: Opportunistic Routing meets Duty Cycling Traditionally, routing in wireless sensor networks consists of two steps: First, the routing protocol selects a next hop, and, second, the MAC protocol waits for the intended desti- nation to wake up and receive the data. This design makes it difficult to adapt to link dynamics and introduces delays while waiting for the next hop to wake up. In this paper we introduce ORW, a practical opportunis- tic routing scheme for wireless sensor networks. In a duty- cycled setting, packets are addressed to sets of potential re- ceivers and forwarded by the neighbor that wakes up first and successfully receives the packet. This reduces delay and energy consumption by utilizing all neighbors as potential forwarders. Furthermore, this increases resilience to wire- less link dynamics by exploiting spatial diversity. Our re- sults show that ORW reduces radio duty-cycles on average by 50% (up to 90% on individual nodes) and delays by 30% to 90% when compared to the state of the art. [[http://wsn.cse.wustl.edu/images/9/9d/2012-04-ipsn-landsiedel-opp.pdf Paper]] --> === Oct 25, 2012 - Abusayeed Saifullah === Finishing Flows Quickly with Preemptive Scheduling, SIGCOMM 2012. Chi-Yao Hong, Matthew Caesar, P. Brighten Godfrey Links: [http://www.cs.illinois.edu/~caesar/papers/pdq-sigcomm12.pdf Paper] === Nov 1, 2012 - Sisu Xi === DSS practice talk. === Nov 8, 2012 - Jing Li === DSS practice talk. === Nov 15, 2012 - Bo Li === DSS practice talk. === Nov 22, 2012 - N/A === Canceled due to Thanksgiving. === Nov 29, 2012 - Andrew Kutta ===

Return to Seminar Fall 2012.