Reconfiguration Procedures for a Polymorphic and Partitionable Multiprocessor
IEEE Transactions on Computers
Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
Scheduling in multiprogrammed parallel systems
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The performance of multiprogrammed multiprocessor scheduling algorithms
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Subcube Allocation in Hypercube Computers
IEEE Transactions on Computers
Dynamic processor allocation in hypercube computers
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Communications of the ACM
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
A Distributed Resource Management Mechanism for a Partitionable Multiprocessor System
IEEE Transactions on Computers
A Distributed Management Scheme for Partitionable Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
A Top-Down Processor Allocation Scheme for Hypercube Computers
IEEE Transactions on Parallel and Distributed Systems
Job Scheduling is More Important than Processor Allocation for Hypercube Computers
IEEE Transactions on Parallel and Distributed Systems
Resource allocation in rectangular SW banyans
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
Runtime Incremental Parallel Scheduling (RIPS) on Distributed Memory Computers
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
This paper addresses task allocation schemes for MIN-based multiprocessors. Two types of allocation policies, cubic and noncubic, are discussed here. Conflicts through the network and inability to partition the system effectively are the main bottlenecks in a MIN-based system. To solve both the problems, a renaming scheme for input and output ports of a MIN is proposed. We use the baseline MIN as an example in this work and call the renaming scheme as bit reversal (BR) matchingpattern. Allocation with the new matching pattern minimizes conflicts and partitions the system completely into independent subsystems. The novelty of this matching pattern is that we can use any dynamic cubic allocation and/or scheduling scheme developed for the hypercubes also for the MIN machines. The BR matching pattern can be used with any kind of MIN. An allocation policy for noncubic tasks is also presented with this matching pattern. Various performance measures with different allocation algorithms are compared via simulation. The advantages of the algorithms with the proposed matching pattern are shown in terms of system efficiency, delay and task miss ratio.