THE PERFORMANCE OF A MEMORY RESTRICTED COMPUTER WITH A STATE-DEPENDENT JOB ADMISSION POLICY

Congestion and memory occupancy in computer system may be reduced further if new jobs are admitted only when the num-ber of jobs queued at CPU is below CPU run queue cutoff (RQ). In this paper we prove that response time of a job is invariant with respect to RQ if jobs do not communicate each other. We also demonstrate this invariance property numerically using marix-geometric methods and present an approximate method for the delay due to context switch-ing under time slicing. The approximation suggests that time slicing with constant overhead yields a throughput similar to an FCFS system without overhead.