Exportar Publicação

Freitas, C., Dias, J. & Dias, L. (2002). Simulating cloth free-form deformation with a beowulf cluster. In Dieter Kranzlmüller, Jens Volkert, Peter Kacsuk, Jack Dongarra (Ed.), EuroPVM/MPI 2002: Recent advances in parallel virtual machine and message passing interface, Proceedings. (pp. 96-104).  Berlin, Heidelberg: Springer.

F. C. et al.,  "Simulating cloth free-form deformation with a beowulf cluster", in EuroPVM/MPI 2002: Recent advances in parallel virtual machine and message passing interface, Proc., Dieter Kranzlmüller, Jens Volkert, Peter Kacsuk, Jack Dongarra, Ed.,  Berlin, Heidelberg, Springer, 2002, pp. 96-104

@inproceedings{c.2002_1732209649481,
	author = "Freitas, C. and Dias, J. and Dias, L.",
	title = "Simulating cloth free-form deformation with a beowulf cluster",
	booktitle = "EuroPVM/MPI 2002: Recent advances in parallel virtual machine and message passing interface, Proceedings",
	year = "2002",
	editor = "Dieter Kranzlmüller, Jens Volkert, Peter Kacsuk, Jack Dongarra",
	volume = "",
	number = "",
	series = "",
	doi = "10.1007/3-540-45825-5_23",
	pages = "96-104",
	publisher = "Springer",
	address = " Berlin, Heidelberg",
	organization = "",
	url = "https://link.springer.com/chapter/10.1007/3-540-45825-5_23"
}

TY  - CPAPER
TI  - Simulating cloth free-form deformation with a beowulf cluster
T2  - EuroPVM/MPI 2002: Recent advances in parallel virtual machine and message passing interface, Proceedings
AU  - Freitas, C.
AU  - Dias, J.
AU  - Dias, L.
PY  - 2002
SP  - 96-104
SN  - 0302-9743
DO  - 10.1007/3-540-45825-5_23
CY  -  Berlin, Heidelberg
UR  - https://link.springer.com/chapter/10.1007/3-540-45825-5_23
AB  - In this paper, we present the results of a parallel implementation of an algorithm which performs physical-based cloth free-form deformation, using a particle system modelling method. This sequential algorithm is characterised by being iterative over a large data set of coupled particles, which discretize cloth surface, and also of local nature in its mechanical simulation CPU-intensive method: the law of motion of each particle only depends in its local neighbourhood and is evaluated by solving an Ordinary Differential Equation (ODE). This characteristic makes the sequential algorithm suitable for a parallelisation. We have made a parallel algorithm implementation of the mentioned problem exploiting the computing capacity of a Beowulf Cluster. We also propose a simple load balancing method for this algorithm. The results show that substantial speedup gains can be achieved by dividing the particle system domain into several processes. To objectively evaluate the results obtained with the parallelisation technique, we have utilised known metrics related to measure the overall performance of the parallel algorithm such as Relative Speedup.
ER  -