This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Disjoint Task Allocation Algorithms for MIN Machines with Minimal Conflicts
April 1995 (vol. 6 no. 4)
pp. 373-387

Abstract—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.

[1] K.C. Knowlton, “A Fast Storage Allocator,” Comm. ACM, vol. 8, pp. 623-625, Oct. 1965.
[2] M. S. Chen and K. G. Shin,“Processor allocation in an$N$-cube multiprocessor using gray codes,”IEEE Trans. Comput., vol. C-37, pp. 1396–1407, Dec. 1987.
[3] A. Al–Dhelaan and B. Bose,“A new strategy for processors allocation in an$n$-cube multiprocessor,”inProc. Int. Phoenix Conf. Comput. and Commun., 1989, pp. 114–118.
[4] P.-J. Chuang and N.-J. Tzeng,“Dynamic processor allocation in hypercube computers,”inProc. 17th Annu. Int. Symp. Comput. Architect., May 1990, pp. 40–49.
[5] J. Kim, C. R. Das, and W. Lin,“A top-down processor allocation scheme for hypercube computers,”IEEE Trans. Parallel and Distrib. Syst., vol. 2, pp. 20–30, Jan 1991.
[6] S. Dutt and J. P. Hayes,“Subcube allocation in hypercube computers,”IEEE Trans. Comput., vol. 40, pp. 341–352, Mar. 1991.
[7] D. L. Tuomenoksa and H. J. Siegel,“Task scheduling on the PASM parallel processing system,”IEEE Trans. Software Eng., vol. SE-11, pp. 145–157, Feb. 1985.
[8] U. V. Premkumar and J. C. Browne,“Resource allocation in rectangular SW banyans,”inProc. Int. Symp. on Comput. Architect., May 1982, pp. 326–333.
[9] M. Jeng and H. J. Siegel,“A distributed management scheme for partitionable parallel computers,”IEEE Trans. Parallel and Distrib. Syst., vol. 1, pp. 120–126, Jan. 1990.
[10] W. Lin and C.L. Wu,“Reconfiguration procedures for a polymorphic and partitionablemultiprocessor,” IEEE Trans. Computers, vol. 35, no. 10, pp. 910-916, Oct. 1986.
[11] ——,“A distributed resource management mechanism for a partitionable multiprocessor system,”IEEE Trans. Comput., vol. 37, pp. 201–210, Feb. 1988.
[12] Y. Chang and L. N. Bhuyan,“Extending multistage interconnection networks for nultitasking,”Proc. Int. Conf. Parallel Processing, 1992, pp. I-151–I-158.
[13] C. L. Wu and T. Y. Feng,“On a class of multistage interconnection networks,”IEEE Trans. Comput., vol. C-29, pp. 694–702, Aug. 1980.
[14] M. C. Pease, III,“The indirect binary$n$-cube microprocessor array,”IEEE Trans. Comput., vol. C-26, pp. 458–473, May 1977.
[15] D. H. Lawrie,“Access and alignment of data in an array processor,”IEEE Trans. Comput., vol. C-24, pp. 1145–1155, Dec. 1975.
[16] L. N. Bhuyan,“An analysis of processor-memory interconnection networks,”IEEE Trans. Comput., vol. C-34, pp. 279–283, Mar. 1985.
[17] G. F. Pfister and V. A. Norton,“Hot spot contention and combining in multistage interconnection networks,”inProc. Int. Conf. Parallel Processing, 1985, pp. 790–797.
[18] P. Krueger, T. H. Lai, and V. A. Radiya,“Job scheduling is more important than processor allocation for hypercube computers,”IEEE Trans. Parallel and Distrib. Syst., vol. 5, pp. 488–497, May 1994.
[19] P. Mohapatra, C. Yu, C. R. Das, and J. Kim,“A lazy scheduling scheme for improving hypercube performance,”inProc. Int. Conf. Parallel Processing, 1993, pp. I-110–I-117.
[20] S. Majumdar, D. L. Eager, and R. B. Bunt,“Scheduling in multiprogrammed parallel systems,”inProc. ACM Sigmetrics Conf., Santa Fe, NM, 1988, pp. 104–113.
[21] S. T. Leutenegger and M. K. Vernon,“The performance of multiprogrammed multiprocessor scheduling policies,”inProc. ACM Sigmetrics Conf., Boulder, CO, 1990, pp. 226–236.
[22] K.S. Trivedi, Probability and Statistics with Reliability, Queuing, and Computer Science Applications. Prentice Hall, 1982.

Citation:
Chansu Yu, Chita R. Das, "Disjoint Task Allocation Algorithms for MIN Machines with Minimal Conflicts," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 4, pp. 373-387, April 1995, doi:10.1109/71.372791
Usage of this product signifies your acceptance of the Terms of Use.