In a multiprocessor system, the handling of interrupts generated by jobs in the processors is assigned to a supervisory program and associated data base The two basic philosophies for deciding which processor executes the supervisor are master-slave and floating executive control In either case, queueing of requests to the supervisor may occur With the master-slave structure, the master processor can handle only one request at a time With floating executive control, while any processor can execute the supervisor, only one processor at a time can be allowed to access the supervisor's data baseA processor which is waiting to use the supervisor is not doing useful work Therefore, queueing of requests to the supervisor causes a degradation in the performance of the system Previous studies have indicated that this degradation is significant for systems with a large number of processorsA methodology is developed through simulation which reduces supervisor queueing by scheduling jobs to processors such that they request the use of the supervisor when the supervisor is predicted to be available Information concerning job execution characteristics required by the scheduler is shown to be available at sufficient accuracy via dynamic monitoring and forecasting during normal program execution

/pdf/minimization-of-supervisor-conflict-for-multiprocessor-1tz18tpiac.pdf

Minimization of supervisor conflict for multiprocessor computer systems

This paper describes a control technique for regulating the waiting times of jobs in a discrete manufacturing process.

The technique is based on the second method of Lyapunov, which has been extensively used for deterministic processes. Two illustrations of the method are included.

Experimental evidence of the effectiveness of the technique is indicated.

S. Shapiro

Papers

A technique to control waiting time in a queue