% Lecture notes - Lecture 9 - 10/06/2003
% C. Scott Ananian and Alexandru Caracas
%\documentclass{article}
%\usepackage{6895}
%\usepackage{epsfig}

%some column macros used for formulas
\newcommand{\column}[2]{\begin{array}{c}#1\\#2\end{array}}
\newcommand{\columnthree}[3]{\begin{array}{c}#1\\#2\\#3\end{array}}


% Begin the lecture with a line like the following:
% This replaces the usual \begin{document} that a latex
% file begins with.
\begin{guestlecture}{9}{Analysis of Cilk Scheduler}{Alexandru Caraca\c{s}, C.~Scott Ananian}{Michael A. Bender}
  
  \begin{summary}
    \sumitem{The Cilk Scheduler} 
    {We review the Cilk scheduler.}
    \sumitem{Location of Shallowest Thread} 
    {We define the depth of a thread and the shallowest thread. Next, We prove
      that the shallowest thread on a processor is either at the top of a deque or
      being executed.}
    \sumitem{Critical Threads} 
    {We construct a computation graph $G'$ similar to the computation graph $G$,
      such that when a thread has no incomplete predecessors in $G'$, then it is at
      the top of a deque.}  
    \sumitem{Execution Time Bounds For The {\em Cilk} Scheduler} 
    {We present the execution time bounds of the {\em Cilk} scheduler. We
      introduce an accounting argument to help in proving the bound.}  
    \sumitem {Performance Analysis of Scheduling Algorithm Using Delay Sequences} 
    {We analyze the performance of the {\em Cilk} work-stealing scheduling
    algorithm. We define delay sequences and  use them to prove the execution
    time bounds of the {\em Cilk } scheduler.}
  \end{summary}
  
  %scott
  %\include{lecture-9.1}
  \input{9/lecture-9.1}
  %alex
  %\include{lecture-9.2}
  \input{9/lecture-9.2}
  
\end{guestlecture}
\theend
