Introduction
Computational effort required for the interactive parallel simulation of a structure under loading usually does not allow for results to be gained rapidly. Further, custom decomposition techniques, as in the case of long structures such as thigh bones, typically hinder the efficient exploitation of the underlying computing power. For the algebraic equations, gained by the p-version Finite Element Method (p-FEM) describing the behaviour of one such structure, K ( u = d with K the system stiffness matrix, u the nodal displacements, and d all accumulated forces, often, due to the poor condition numbers, sophisticated iterative solvers fail to be efficient. As it is pointed out in [1, 3], applying hierarchical concepts, based on a nested dissection approach (i. e. recursive domain decomposition technique based on Schur complements, the de-facto standard of most domain decomposition approaches), allow for both the design of sophisticated direct solvers as well as for advanced parallelisation strategies, both of which are indispensable within interactive applications. Our main goal is the development of an efficient load balancing strategy for the existing structure simulation of the bone stresses with p-FEM organised via octrees as described in [2].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Mundani, R.-P., Düster, A., Knežević, J., Niggl, A., Rank, E.: Dynamic Load Balancing Strategies for Hierarchical p-FEM Solvers. In: Ropo, M., Westerholm, J., Dongarra, J. (eds.) PVM/MPI. LNCS, vol. 5759, pp. 305–312. Springer, Heidelberg (2009)
Knežević, J., Mundani, R.-P., Rank, E.: Interactive Computing−Virtual Planning of Hip Joint Surgeries with Real-Time Structure Simulations. International Journal of Modeling and Optimization 1(4), 308–313 (2011)
Mundani, R.-P., Bungartz, H.-J., Rank, E., Niggl, A., Romberg, R.: Extending the p-version of finite elements by an octree-based hierarchy. In: Domain Decomposition Methods in Science and Engineering XVI. LNCSE, vol. 55, pp. 699–706. Springer (2007)
Kwok, Y.-K., Ahmad, I.: Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors. ACM Computing Surveys 31(4) (1999)
Izakian, H., Abraham, A., Snášel, V.: Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments. In: International Joint Conference on Computational Sciences and Optimization, April 24-26, vol. 1, pp. 8–12 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Knežević, J., Mundani, RP., Rank, E. (2013). Schedule Optimisation for Interactive Parallel Structure Simulations. In: Manninen, P., Öster, P. (eds) Applied Parallel and Scientific Computing. PARA 2012. Lecture Notes in Computer Science, vol 7782. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36803-5_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-36803-5_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36802-8
Online ISBN: 978-3-642-36803-5
eBook Packages: Computer ScienceComputer Science (R0)