DocumentCode
1138490
Title
Comments on "A fast and efficient processor allocation scheme for mesh-connected multicomputers"
Author
Zhang, Lu
Author_Institution
Dept. of Comput. Sci., Liverpool Univ., UK
Volume
52
Issue
2
fYear
2003
Firstpage
255
Lastpage
256
Abstract
In a recent paper by B.S. Yoo and C.R. Das (2002), the so-called stack-based allocation (SBA) algorithm is claimed to be, at worst, O(B/sup 2/) expensive. In this paper, we present an exception for which the time complexity of SBA is at least O(B/sup 3/). Furthermore, we point out the discrepancy in the complexity analysis.
Keywords
computational complexity; multiprocessor interconnection networks; processor scheduling; mesh-connected multicomputers; processor allocation; stack-based allocation algorithm; time complexity; Complexity theory; Multiprocessor interconnection; Processor scheduling;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.2003.1176990
Filename
1176990
Link To Document