The constrained 2D cutting stock problem is an irregular problem with dynamic data structures, highly variable amounts of computation per task, and unpredictable amounts and patterns of communication. This paper describes the design and implementation of a parallel solution to this problem on a clus
A parallel implementation of an asynchronous team to the point-to-point connection problem
✍ Scribed by Ricardo C. Corrêa; Fernando C. Gomes; Carlos A.S. Oliveira; Panos M. Pardalos
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 182 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
✦ Synopsis
We propose a parallel and asynchronous approach to give near-optimal solutions to the non-fixed point-to-point connection problem. This problem is NP-hard and has practical applications in multicast routing. The technique adopted to solve the problem is an organization of heuristics that communicate with each other by means of a virtually shared memory. This technique is called A-Teams (for Asynchronous Teams). The virtual shared memory is implemented in a physically distributed memory system. Computational results comparing our approach with a branch-and-cut algorithm are presented.
📜 SIMILAR VOLUMES
A new algorithm for location of the critical points in general scalar fields is described. The new method has been developed as part of an on-going process to exploit the topologic analysis of general 3D scalar fields. Part of this process involves the use of topologic information to seed the critic