The file paper.ps contains the CSRI technical report: 

          Processor Scheduling in Multiprogrammed Shared Memory
	                NUMA Multiprocessors

                                  by

                            Chee-Shong Wu

If you have the UNIX uncompress program, get the paper.ps.Z file.
Remember to transfer the file in binary mode.  Uncompress it, and 
print it on a postscript printer.

If you do not have uncompress, get the paper.ps file in ascii mode, 
and print it on a postscript printer.

This report was made available for anonymous ftp by: 

                         eparsons@cs.toronto.edu

ABSTRACT 

  In a multiprogrammed multiprocessor, the scheduler is not only
  responsible for deciding when to activate an application and when to
  suspend it, but is also responsible for determining how many
  processors to allocate to each application. In a scalable Non- Uniform
  Memory Access (NUMA) multiprocessor, it must further resolve the
  problem of which processor(s) to allocate to which application since
  the memory reference times are not the same for all processor-memory
  pairs.

  In this thesis, we study the problem of how to characterize parallel
  applications and how to apply this knowledge in scheduling for NUMA
  systems. We also study the performance of several scheduling
  algorithms in an NUMA environment. These algorithms differ in the
  frequency of reallocations. We propose two policies, the Static policy
  and the Immediate Start Static policy, that utilize application
  characteristics when making scheduling decisions. The performance of
  these two policies is compared with that of the Dynamic policy, on an
  NUMA multiprocessor, Hector.