ABSTRACT

Job scheduling typically focuses on the CPU with little work existing to include

I/O or memory. Time-shared execution provides the chance to hide I/O and long-

communication latencies though potentially creating a memory conflict. Hyperthreaded

CPUs support coscheduling without any context switches and provide additional options

for CPU-internal resource sharing. We present an approach that includes all possible

resources into the schedule optimization and improves utilization by coscheduling two

jobs if feasible.

Our LOMARC approach partially reorders the queue by lookahead to increase the

potential to find good matches. we have obtained improvements between 30 percent and

50 percent in both response times and relative bounded response times on hyperthreaded

CPUs.

i
 LIST OF FIGURES

FIGURE NO TITLE PAGE

NO

4.1 OVERALL FLOW DIAGRAM 7

4.2 SEQUENCE DIAGRAM 9
4.3 ACTIVITY DIAGRAM 10
6.1 PARALLEL COMPUTERS—
SHARED-MEMORY AND
DISTRIBUTED MEMORY
MODELS 19
6.2 FINDING BEST MATCH
AMONG CURRENTLY
RUNNING JOBS 30
6.3 REORDERING THE JOB
QUEUE IF FINDING A
MATCH IN THE WAITING 30

ii
 LIST OF TABLES

TABLE NO TITLE PAGE

NO

6.1 SLOWDOWN TABULATION

FOR DIFFERENT JOBS 28

iii
 LIST OF ABBREVIATIONS

SERIAL NAME ABBREVIATIONS

1 API Application Programming Interface

2 ASP Active Server Page

3 CLR Common Language Runtime

4 IDE Integrated Development Environment

5 XML Extended Markup Language

iv