Comments on "A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers"

Authors:
Lu Zhang
Affiliations:
-
Venue:
IEEE Transactions on Computers
Year:
2003

Citing 4
Cited 2

A two dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system

CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
An Efficient Task Allocation Scheme for 2D Mesh Architectures

IEEE Transactions on Parallel and Distributed Systems
A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers

IEEE Transactions on Computers
A Top-Down Processor Allocation Scheme for Hypercube Computers

IEEE Transactions on Parallel and Distributed Systems

Hardware implementation of processor allocation schemes for mesh-based chip multiprocessors

Microprocessors & Microsystems
Fast and efficient processor allocation algorithm for torus-based chip multiprocessors

Computers and Electrical Engineering

Quantified Score

Hi-index	14.98

Visualization

Abstract

In a recent paper in this journal, the so-called stack-based allocation (SBA) algorithm is claimed to be, at worst,O(B^2)expensive. In this paper, we present an exception for which the time complexity of SBA is at leastO(B^3) . Furthermore, we point out the discrepancy in the complexity analysis.