Fundamentals of data structures in PASCAL
Fundamentals of data structures in PASCAL
Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
Computer algorithms: introduction to design and analysis (2nd ed.)
Computer algorithms: introduction to design and analysis (2nd ed.)
On allocating subcubes in a hypercube multiprocessor
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Task migration in hypercube multiprocessors
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Subcube Allocation and Task Migration in Hypercube Multiprocessors
IEEE Transactions on Computers
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
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 Top-Down Processor Allocation Scheme for Hypercube Computers
IEEE Transactions on Parallel and Distributed Systems
A Parallelized Algorithm for the All-Row Preconditioned Interval Newton/Generalized Bisection Method
Proceedings of the Fifth SIAM Conference on Parallel Processing for Scientific Computing
Distributed dynamic processor allocation for multicomputers
Parallel Computing
Process scheduling for future multicore processors
Proceedings of the Fifth International Workshop on Interconnection Network Architecture: On-Chip, Multi-Chip
Fast and efficient processor allocation algorithm for torus-based chip multiprocessors
Computers and Electrical Engineering
A minimal average accessing time scheduler for multicore processors
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part II
Exploration of heuristic scheduling algorithms for 3D multicore processors
Proceedings of the 15th International Workshop on Software and Compilers for Embedded Systems
A greedy heuristic approximation scheduling algorithm for 3d multicore processors
Euro-Par'11 Proceedings of the 2011 international conference on Parallel Processing
The Journal of Supercomputing
TLA: Temporal look-ahead processor allocation method for heterogeneous multi-cluster systems
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
A new approach for dynamic processor allocation in hypercube multicomputers which supports a multi-user environment is proposed. A dynamic binary tree is used for processor allocation along with an array of free lists. Two algorithms are proposed based on this approach, capable of efficiently handling cubic as well as noncubic allocation. Time complexities for both allocation and deallocation are shown to be polynomial, a significant improvement over the existing exponential and even super-exponential algorithms. Unlike existing schemes, the proposed strategies are best-fit strategies within their search space. Simulation results indicate that the proposed strategies outperform the existing ones in terms of parameters such as average delay in honoring a request, average allocation time, average deallocation time, and memory overhead.