List of Tables

• Two CPU and two IO bound processes. Care needs to be taken when scheduling these four processes to three hosts.
• Paging as a proportion of file size.
• Paging penalties as memory approaches the desperation threshold.
• The probability of a successful page transfer decreases with memory availability.
• Maximum disk IO performance on a SUN IPX.
• The naming conventions used in the load distribution algorithms
• A summary of all eight load distribution algorithms.
• The rankings of the selected trace periods. A dash indicates a ranking lower than 30 , which I have omitted for clarity.
• The fixed input parameters.
• The experimental numbering.

 

• Introduction
  • Motivation
  • Thesis Organisation
  • Contributions