-------------------------------------------------------------------------------
                                       
                                       
		   B O S T O N   U N I V E R S I T Y
                                       
		      Computer Science Department
                                       
			  C O L L O Q U I U M
                                       

                 New Algorithms and Metrics for Scheduling


                            Michael Bender
                          Harvard University


		       Wednesday, March 18th
                                       
   			      11:00am
	            (Coffee served at 10:30am)

                                       
               Seminar Room / MCS 135 / 111 Cummington Street
                                       

-------------------------------------------------------------------------------


      This talk is in two parts.  First, we consider the problem of
      scheduling disk requests.  We present new algorithms to maximize
      the throughput metric. 

      Then we focus on the more general problem of scheduling a stream
      of jobs on a single processor and show how to reduce response
      times of requests.  The traditional metric to optimize in this
      setting has the well-known drawback that it induces starvation
      of jobs.  We introduce new metrics that naturally avoid
      starvation.  We describe algorithms to optimize these metrics
      and show simulation results. 


Host: Wayne Snyder (snyder@cs.bu.edu)

-------------------------------------------------------------------------------
For colloquium info, including directions, see http://cs-www.bu.edu/colloquium
-------------------------------------------------------------------------------