Parallel Computing Application in Rectangle Packing Problem

Article Preview

Abstract:

With the increasing mass data processing and requirement on interactive concurrency, parallel computing became the popular issue as one main method for improving service capability. The content and research objective of parallel computing were introduced, and the parallel computing based on divide-and-conquer for solving rectangle packing problem was designed with two processors, and achieved. The efficiency and quick solution of parallel computing were verified through the comparison with serial algorithm as well as analysis.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 605-607)

Pages:

2362-2365

Citation:

Online since:

December 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Linbo Zhang, Xuebin Chi , et. al. Introduction to Parallel Computing. Beijing: Tsinghua University press, 2006. 7.

Google Scholar

[2] Yu Zhang . Study on the Application of Linux Cluster for Parallel Computing. Guangzhou: Zhongshan University, (2009).

Google Scholar

[3] Hopper E, Turton B. European Journal of Operational Research, 2001, 128(1): 34-57.

Google Scholar

[4] Beasley J E. A. European Journal of Operational Research, 2004, 156(3): 601-627.

Google Scholar

[5] Wu Y L, Huang W Q, Lau S C, et al. European Journal of Operational Research, 2002, 141(2): 341-358.

Google Scholar

[6] Zhang D F, Deng A S, Kang Y. A Hybrid Heuristic Algorithm for the Rectangular Packing Problem. Proc. of the 5th International Conference on Computational Science. 2005: 22-25.

Google Scholar

[7] Huang W Q, Li Y, Akeb H, et al. Journal of the Operational Research Society, 2005, 56(5): 539-548.

Google Scholar