STAMPAR: A parallel processing approach for the explicit dynamic analysis of sheet stamping problems

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Industrial sheet stamping problems generally require enormous amounts of computer resource for their solution within an acceptable time. Explicit dynamic algorithms are commonly used for these analyses since they reduce the memory requirements but they still require large CPU times and parallel processing offers the only realistic alternative. This paper describes the parallel program Stampar used for the solution of industrial sheet stamping problems. The methodologies used for the parallelisation are described as well as an example with timings that show the advantage of this approach.

Cite

CITATION STYLE

APA

Neamţu, L., Zarate, F., Oñate, E., Duffett, G. A., & Cela, J. M. (1997). STAMPAR: A parallel processing approach for the explicit dynamic analysis of sheet stamping problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1300 LNCS, pp. 1369–1374). https://doi.org/10.1007/bfb0002897

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free