Title:
Network calculus for parallel processing

Speaker:
George Kesidis, Professor, School of EECS, Penn State

Time/Location:
Sep 23, Wed 12:30 pm - 1:30 pm, Room: 5345 HP 

Abstract:
Focusing on low-level task management of interconnected 
virtual machines, we present preliminary results on the 
use of "network calculus" for parallel processing 
(fork-join) systems, as in MapReduce.  We derive a 
probabilistic bound that the delay through a single 
parallel processing stage exceeds a threshold, 
including under redundant tasking to reduce delays 
at barriers (joins).  We conclude with an overview 
of recent research on energy-efficient cloud 
operations - work in collaboration with Bhuvan Urgaonkar, 
IBM Research, and students.

Bio:
George Kesidis received his MS (in 1990) and PhD (in 1992) 
from UC Berkeley in EECS. Following eight years as a 
professor of ECE at the University of Waterloo, he has been 
a professor of CSE and EE at the Pennsylvania State University 
since 2000. His research interests include many aspects of 
networking, cyber security and machine learning, particularly 
network-based intrusion detection and, more recently, energy 
efficiency and the impact of economic policy. His work has 
been supported by over a dozen NSF research grants and 
several Cisco Systems URP gifts, the latter supporting 
applied work on cyber security.  

His web site is http://www.cse.psu.edu/~gik2