Abstract
A good task allocation algorithm should find available processors for incoming jobs, if they exist, with minimum overhead. Due to its topological generality and flexibility the k-ary n-cube architecture has been chosen for the task allocation problem. We propose a fast and efficient isomorphic processor allocation scheme for k-ary n-cube systems by using isomorphic partitioning where the processor space is partitioned into higher dimensional isomorphic subcube and by using Subcube recognition ability algorithm (SRA) which uses simple coordinate calculation and spatial subtraction. Thus the proposed scheme seeks to reduce the search space drastically, and hence can locate a free subcube very quickly providing scalable, faster, processor allocation, complete recognition ability with minimal overhead and minimizes the fragmentation
Chapter PDF
Similar content being viewed by others
REFERENCES
Y. Zhu, “Efficient Processor Allocation Strategies for Mesh-Connected Parallel Computers,” J. Parallel and Distributed Computing, vol. 16, pp. 328–337, 1992
T. Liu, W. Huang, F. Lombardi and L.N. Bhuyan, “A Submesh Allocation Scheme for Mesh Connected Multiprocessor Systems,” Proc.lnternational Conference on Parallel Processing, vol. II, pp. 193–200, 1995.
S. Yoo, H.Y. Youn and B. Shirazi, “An Efficient Task Allocation Scheme for 2D Mesh Architectures,” IEEE Transactions on Parallel and Distributed Systems, vol. 8,no. 9, pp. 934–938, 1997.
V. Gautam and V. Chaudhary, “Subcube Allocation Strategies in a K-Ary N-Cube,” Proc. Int’l Conf. Parallel and Distributed Computing and Systems, pp. 141–146, 1993.
G. Dommety, V. Chandhary, and B. Sabata, “Strategies for Processor Allocation in k-Ary n-Cubes,” Proc. Int’l Conf. Parallel and Distributed Computing and Systems, pp. 216–221, 1995.
K. Windisch, V. Lo, and B. Bose, “Contiguous and Non-Contiguous Processor Allocation Algorithms for k-Ary n-Cubes,” Proc. Int’l Conf. Parallel Processing, 1995.
H.L. Chert and C.T. King, “Efficient Dynamic Processor Allocation for k-Ary n-Cube Massive Parallel Processors,” Computers Math. Applications, pp. 59–73, 1997.
P.J. Chuang and C.M. Wu, “An Efficient Recognition-Complete Processor Allocation Strategy for k-Ary n-Cube Multiprocessors,” IEEE Trans. Parallel and Distributed Systems, vol. 11,no. 5, pp. 485–490, May 2000.
T. Srinivasan, PJS. Srikanth, K. Praveen, L.Harish Subramaniam, “Parallel AI Game Playing Approach for Faster Processor Allocation in Hypercube Systems using Veitch diagram”, Proc. of 11th IEEE International Conference on Parallel and Distributed Systems-ICPADS 2005, pp.536–542, July 2005.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Miriam, D.H., Srinivasan, T. (2006). A Fast and Efficient Isomorphic Task Allocation Scheme for K-Ary N-Cube Systems. In: Kleinjohann, B., Kleinjohann, L., Machado, R.J., Pereira, C.E., Thiagarajan, P.S. (eds) From Model-Driven Design to Resource Management for Distributed Embedded Systems. DIPES 2006. IFIP International Federation for Information Processing, vol 225. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-39362-9_18
Download citation
DOI: https://doi.org/10.1007/978-0-387-39362-9_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-39361-2
Online ISBN: 978-0-387-39362-9
eBook Packages: Computer ScienceComputer Science (R0)