Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Capacity Bounds for Multiresource Queues
Journal of the ACM (JACM)
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
Journal of the ACM (JACM)
Communications of the ACM
Operating system principles
The multics system: an examination of its structure
The multics system: an examination of its structure
A simulation of dynamic task allocation in a distributed computer system
WSC '87 Proceedings of the 19th conference on Winter simulation
Performance Modeling and Measurements of Real Time Multiprocessors with Time-Shared Buses
IEEE Transactions on Computers
The Impact of Performance Asymmetry in Emerging Multicore Architectures
Proceedings of the 32nd annual international symposium on Computer Architecture
| Hi-index | 0.00 |
A multiprocessor architecture is proposed which is based on the Multics concept of having all on-line information processor-addressible. All memory management is done 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 then 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 then defined which uses the optimal schedule of the formal model as a parameter, and its performance is simulated.