Table of Contents Author Guidelines Submit a Manuscript
Journal of Computer Systems, Networks, and Communications
Volume 2008, Article ID 578180, 9 pages
http://dx.doi.org/10.1155/2008/578180
Research Article

Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with Dynamic Reassignment

1Department of Research Planning and Business Development, Central Building Research Institute, Roorkee 247667, Uttarakhand, India
2Department of Mathematics and Statistics, Gurkula Kangari University, Hardwar 249404, Uttarakhand, India

Received 5 September 2007; Revised 17 January 2008; Accepted 19 March 2008

Academic Editor: Y. -M. Huang

Copyright © 2008 Pradeep Kumar Yadav et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. H. Bokhari, Assignment Problem in Parallel and Distributed Computing, Kluwer Academic Publishers, Boston, Mass, USA, 1987.
  2. H. S. Stone, “Multiprocessor scheduling with the aid of network flow algorithms,” IEEE Transactions on Software Engineering, vol. SE-3, no. 1, pp. 85–93, 1977. View at Publisher · View at Google Scholar
  3. S. H. Bokhari, “A shortest tree algorithm for optimal assignments across space and time in a distributed processor system,” IEEE Transactions on Software Engineering, vol. SE-7, no. 6, pp. 583–589, 1981. View at Publisher · View at Google Scholar
  4. D. F. Towsley, “Allocating programs containing branches and loops within a multiple processor system,” IEEE Transactions on Software Engineering, vol. SE-12, no. 10, pp. 1018–1024, 1986. View at Google Scholar
  5. D. Fernandez-Baca, “Allocating modules to processors in a distributed system,” IEEE Transactions on Software Engineering, vol. 15, no. 11, pp. 1427–1436, 1989. View at Publisher · View at Google Scholar
  6. A. Ghafoor and J. Yang, “A distributed heterogeneous supercomputing management system,” Computer, vol. 26, no. 6, pp. 78–86, 1993. View at Publisher · View at Google Scholar
  7. M. P. Singh, P. K. Yadav, and H. Kumar, “A tasks allocation model for efficient utilization of processor's capacity in heterogeneous distributed systems,” in Proceeding of the 9th Conference of International Academy of Physical Sciences, Agra, India, February 2007.
  8. C.-H. Lee, D. Lee, and M. Kim, “Optimal task assignment in linear array networks,” IEEE Transactions on Computers, vol. 41, no. 7, pp. 877–880, 1992. View at Publisher · View at Google Scholar
  9. S.-Y. Cho and K. H. Park, “Dynamic task assignment in heterogeneous linear array networks for metacomputing,” in Proceeding of the Heterogeneous Computing Workshop, pp. 66–71, Cancun, Mexico, April 1994. View at Publisher · View at Google Scholar
  10. S. H. Bokhari, “Dual processor scheduling with dynamic reassignment,” IEEE Transactions on Software Engineering, vol. SE-5, no. 4, pp. 341–349, 1979. View at Publisher · View at Google Scholar
  11. V. Kumar, M. P. Singh, and P. K. Yadav, “An efficient algorithm for multiprocessor scheduling with dynamic reassignment,” in Proceeding of the 6th National Seminar on Theoretical Computer Science, pp. 105–118, Banasthali, Rajasthan, India, August 1996.