Abstract
Given a set of m tasks, where each task has an execution time and a subcube requirement, the Hypercube Scheduling Problem (HSP) is to find an assignment of tasks which minimizes the total completion time. The general HSP is known to be NP-hard. In this paper, we present a O(m log m) time algorithm for HSP when all the m tasks have the same execution time. We also present a polynomial time approximation algorithm which generates a solution within \(\frac{2}{{(1 + \tfrac{1}{{2^n }})}}\)of the optimal solution for the general HSP, where n is the hypercube dimension.
Research Supported in part by fellowships from the Faculty Research and Creative Activities Support Fund WMU-FRCASF 90-15 and WMU-FRCASF 89-225274, and by the National Science Foundation under grant USE-90-52346.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
E. G. Coffman, “Computer and Job-Shop Scheduling Theory,” New York Wiley, 1976.
K. P. Belkhale and P. Banerjee, “Approximation Algorithm For The Partitionable Independent Task Scheduling Problem,” Proceedings of The 1990 International Conference on Parallel Processing, 1990, Vol. I, pp. 72–75.
M. Chen and K. G. Shin, “Processor Allocation in an n-cube Multiprocessor Using Gray Codes,” IEEE Transactions on Computers, vol. C-36, no. 12, Dec. 1987, pp. 1396–1407.
S. Al-Bassam, H. El-Rewini, B. Bose, and T. Lewis, “Efficient Serial and Parallel Subcube Recognition in Hypercubes,” to appear in The Proceedings of the First Great Lakes Computer Science Conference, August 1990.
Abdullah Al-Dhelaan and Bella Bose, “A new strategy for processor allocation in an n-cube multiprocessor,” 8th Annual International Phoenix Conf. on Computers and communications, March 1989, pp. 114–118.
Win-Tsung Lo, S. K. Tripathi and D. Gosal, “Task Allocation on the Hypercube Multiprocessor,” 1990 International Conference on Parallel Processing, vol I, pp. 573–574.
M. Chen and K. G. Shin, “Message Routing in a Injured Hypercube,” in the Proceedings of the Third Conference on Hyercube Concurrent Computers and Applications, 1988, pp. 312–317.
J. K. Lenstra and A. H. G. R. Kan, “Complexity of Scheduling Under Precedence Constraints,” Oper. Res., Jan 1978, vol 26, pp. 22–35.
R. L. Graham, “Bounds on Multiprocessing Timing Anomalies,” SIAM Journal of Applied Math., vol. 17, pp. 263–269, 1969.
K. P. Garey and D. S. Johnson, “Computers and Intractability, A Guide to the Theory of NP-Completeness,” W. H. Freeman and Company, N. Y., 1979.
R. L. Graham, E. L. Lawler, J. K. Lensta, and A. H. G. Rinnooy Kan, “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey,” Annals of Discrete MAthematics, vol. 5, pp. 287–326, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boals, A., Gupta, A., Hashmi, J., Sherwani, N. (1991). An efficient approximation algorithm for hypercube scheduling. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_197
Download citation
DOI: https://doi.org/10.1007/3-540-54029-6_197
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54029-8
Online ISBN: 978-3-540-47359-6
eBook Packages: Springer Book Archive