Heterogeneous multiprocessor design and the distributed scheduling of its task group workload
A multiprocessor architecture is proposed which is based on the multics concept of having all online information processor-addressible. All memory management is performed by an intelligent paged virtual memory system, and each processor deals only with those segments relevant to its single executing program. The processors are chosen to have different implementations of a single system-wide instruction set and the problem is to effectively schedule different categories of programs, called task groups, on the dissimilar processors. Average weighted instruction times for each task group on every processor are defined as task/processor suitability measures, and typical values are given for different groups of programs running on IBM 370 models. Through the use of linear programming techniques, an optimal schedule for any such multiprocessor is defined for the static case where task group loads and task/processor suitability values are known in advance. A priority-based task management scheduling algorithm is defined which uses the optimal schedule of the formal model as a parameter, and its performance is simulated. 18 references.
- OSTI ID:
- 6483062
- Resource Relation:
- Conference: Sponsored by IEEE, Austin, TX, USA, 26 Apr 1982
- Country of Publication:
- United States
- Language:
- English
Similar Records
Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)
Self-scheduling, data synchronization, and program transformation for multiprocessor systems