Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 723497, 7 pages
http://dx.doi.org/10.1155/2014/723497
Research Article

Complexity Analysis of New Task Allocation Problem Using Network Flow Method on Multicore Clusters

School of Science, Chongqing Jiaotong University, Chongqing 400074, China

Received 9 October 2013; Accepted 18 December 2013; Published 2 January 2014

Academic Editor: Balaji Raghavan

Copyright © 2014 Jixiang Yang. 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. L. Chai, Q. Gao, and D. K. Panda, “Understanding the impact of multi-core architecture in cluster computing: a case study with Intel dual-core system,” in Proceedings of the 7th IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07), pp. 471–478, Rio de Janeiro, Brazil, May 2007. View at Publisher · View at Google Scholar · View at Scopus
  2. X. F. Wu, V. Taylor, C. Lively, and S. Sharkawi, “Performance analysis and optimization of parallel scientific applications on CMP clusters,” Scalable Computing, vol. 10, no. 1, pp. 61–74, 2009. View at Google Scholar
  3. J. Parrow, “An introduction to the π-calculus,” in Handbook of Process Algebra, J. A. Bergstra, A. Ponse, and S. A. Smolka, Eds., pp. 479–543, Elsevier Science, Amsterdam, The Netherlands, 2001. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. K. Asanovic, R. Bodik, B. C. Catanzaro et al., “The landscape of parallel computing research: a view from Berkeley,” Tech. Rep. UCB/EECS-2006-183, Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, Calif, USA, 2006. View at Google Scholar
  5. A. Ernst, H. Jiang, and M. Krishnamoorthy, “Exact solutions to task allocation problems,” Management Science, vol. 52, no. 10, pp. 1634–1646, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  6. H. S. Stone, “Multiprocessor scheduling with the aid of network flow algorithms,” IEEE Transactions on Software Engineering, vol. 3, no. 1, pp. 85–93, 1977. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  7. S. H. Bokhari, “Dual processor scheduling with dynamic reassignment,” IEEE Transactions on Software Engineering, vol. 5, no. 4, pp. 341–349, 1979. View at Google Scholar · View at MathSciNet · View at Scopus
  8. H. S. Stone, “Program assignment in three-processor systems and tricutset partitioning of graphs,” Tech. Rep. ECE-CS-77-7, Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, Mass, USA, 1977. View at Google Scholar
  9. S. H. Bokhari, “Shortest tree algorithm for optimal assignments across space and time in a distributed processor system,” IEEE Transactions on Software Engineering, vol. 7, no. 6, pp. 583–589, 1981. View at Google Scholar · View at Scopus
  10. D. Towsley, “Allocating programs containing branches and loops within a multiple processor system,” IEEE Transactions on Software Engineering, vol. 12, no. 10, pp. 1018–1024, 1986. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  11. 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 · View at Scopus
  12. 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 · View at MathSciNet · View at Scopus
  13. S. Y. Cho and K. H. Park, “Dynamic task assignment in heterogeneous linear array networks for metacomputing,” in Proceedings of the Heterogeneous Computing Workshop, pp. 66–71, Cancún, Mexico, April 1994. View at Publisher · View at Google Scholar
  14. W. Fernandez de la Vega and M. Lamari, “The task allocation problem with constant communication,” Discrete Applied Mathematics, vol. 131, no. 1, pp. 169–177, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  15. P. K. Yadav, M. P. Singh, and H. Kumar, “Scheduling algorithm: tasks scheduling algorithm for multiple processors with dynamic reassignment,” Journal of Computer Systems, Networks, and Communications, vol. 2008, Article ID 578180, 9 pages, 2008. View at Publisher · View at Google Scholar
  16. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Upper Saddle River, NJ, USA, 1993. View at MathSciNet
  17. P. A. Jensen and W. J. P. Barnes, Network Flow Programming, Krieger Publishing Company, Malabar, Fla, USA, 1987. View at MathSciNet
  18. J. X. Yang, G. Z. Tan, F. Wang, and D. Pan, “Solution to new task allocation problem on multi-core clusters,” Journal of Computational Information Systems, vol. 7, no. 5, pp. 1691–1697, 2011. View at Google Scholar · View at Scopus