This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Comments on "A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers"
February 2003 (vol. 52 no. 2)
pp. 255-256

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 least O(B^3) . Furthermore, we point out the discrepancy in the complexity analysis.

[1] J. Kim, C.R. Das, and W. Lin, “A Top-Down Processor Allocation Scheme for Hypercube Computers,” IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 20-30, Jan. 1991.
[2] K. Li and K.H. Cheng, “A Two Dimensional Buddy System for Dynamic Resource Allocation in a Partitionable Mesh Connected System,” Proc. ACM Computer Science Conf., pp. 22-28, Feb. 1990.
[3] B.S. Yoo and C.R. Das, “A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers,” IEEE Trans. Computers, vol. 51, no. 1, pp. 46-60, Jan. 2002.
[4] S.M. Yoo and H.Y. Youn, “An Efficient Task Allocation Scheme for 2D Mesh Architectures,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 9, pp. 934-942, Sept. 1997.

Index Terms:
Mesh-connected multicomputers, processor allocations, stack-based allocation algorithm.
Citation:
Lu Zhang, "Comments on "A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers"," IEEE Transactions on Computers, vol. 52, no. 2, pp. 255-256, Feb. 2003, doi:10.1109/TC.2003.1176990
Usage of this product signifies your acceptance of the Terms of Use.