Multi-processor Scheduling

• Load sharing
• Each processor runs one process.
• A single ready queue is maintained (in a shared memory).
• Each processor makes scheduling decisions independently.
• Speed up of an application
• Processor assignment (within threads of the process): Dynamic or fixed
• Scheduling: Gang scheduling or independent scheduling

Multi-core Computing Multi-processor Scheduling

Introduction

• Design issues in system with multiple processors
  • Tightly coupled or loosely coupled.
  • Message passing, shared memory or both.
• Several new issues are introduced into the design of scheduling functions.
• Loosely coupled systems are easier to handle.
  • Not an OS issue but an application issue
  • Several message passing systems are available (such as MPI)
• We will examine these issues and the details of scheduling algorithms for tightly coupled multi-processor systems.