🚀 go-pugleaf

          The University of Western Ontario
            Department of Computer Science

                    COLLOQUIUM

Speaker: Vladimir Estivill-Castro
         Laboratorio Nacional de Informatica Avanzada, Mexico
Title:   Adaptive Parallel Sorting
Time:    Wednesday, January 13, 1992, at 2:00pm
Place:   MC 320
Abstract:

  The capacity of an algorithm to modify its behavior
  for the size, difficulty
  or structure of a problem instance is called adaptivity.
  Parallel algorithms are normally called adaptive
  if they work with a fixed number of processors on
  inputs of unbounded size,
  whereas sorting algorithms are normally called
  adaptive if they perform work proportional
  to the amount of disorder in the input.
  We combine these two concepts and present the first
  two parallel sorting algorithms that:
  are designed for a fixed number of processors and reconfigure
  them according to the size of the input,
  adapt to the amount of disorder in the input, and
  are cost optimal.