SIMULATION OF 2-D METAL-CUTTING BY MEANS OF A DISTRIBUTED ALGORITHM

Citation
C. Ierotheou et al., SIMULATION OF 2-D METAL-CUTTING BY MEANS OF A DISTRIBUTED ALGORITHM, Computer journal (Print), 41(1), 1998, pp. 57-63
Citations number
17
Categorie Soggetti
Computer Science Hardware & Architecture","Computer Science Information Systems","Computer Science Software Graphycs Programming","Computer Science Hardware & Architecture","Computer Science Information Systems","Computer Science Software Graphycs Programming
Journal title
ISSN journal
00104620
Volume
41
Issue
1
Year of publication
1998
Pages
57 - 63
Database
ISI
SICI code
0010-4620(1998)41:1<57:SO2MBM>2.0.ZU;2-8
Abstract
Temperature distributions involved in some metal-cutting or surface-mi lling processes may be obtained by solving a non-linear inverse proble m. A two-level concept on parallelism is introduced to compute such te mperature distribution. The primary level is based on a problem-partit ioning concept driven by the nature and properties of the non-linear i nverse problem. Such partitioning results to a coarse-grained parallel algorithm, A simplified 2-D metal-cutting process is used as an examp le to illustrate the concept, A secondary level exploitation of furthe r parallel properties based on the concept of domain-data parallelism is explained and implemented using MPI, Some experiments were performe d on a network of loosely coupled machines consist of SUN Spare Classi c workstations and a network of tightly coupled processors, namely the Origin 2000.