ORCID Profile
0000-0002-5526-0999
Current Organisation
Monash University
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Publisher: Elsevier BV
Date: 2018
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: ACM
Date: 03-12-2015
Publisher: IEEE
Date: 11-2015
Publisher: Emerald
Date: 06-1994
DOI: 10.1108/02644409410799416
Abstract: This paper presents a routing method for two dimensional transputer arrays particularly designed for parallel non‐linear and dynamic finite element analysis. Some general routing strategies with their strengths and weaknesses are discussed. The need for problem specific routing algorithms in transputer systems is considered and the communication requirements for parallel finite element analysis described. From the communication requirements the design parameters for the routing method are specified and the architectural design of the Router presented. An ex le of the use of the Router in the parallel non‐linear finite element analysis is given and the robustness of the routing methodology is illustrated by using arbitrary mappings of finite element subdomains distributed over a transputer array.
Publisher: IEEE
Date: 06-2014
Publisher: Science Publications
Date: 12-2013
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: IEEE
Date: 11-2016
Publisher: IEEE
Date: 06-2014
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: IGI Global
Date: 2016
Publisher: Elsevier BV
Date: 2011
Publisher: IEEE
Date: 06-2012
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: IEEE
Date: 08-2014
Publisher: Springer International Publishing
Date: 2014
Publisher: Elsevier BV
Date: 1991
Publisher: ACM
Date: 27-11-2006
Publisher: Elsevier BV
Date: 08-1993
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: IEEE
Date: 10-2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2017
Publisher: Springer Science and Business Media LLC
Date: 07-2018
Publisher: Springer International Publishing
Date: 2014
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: IEEE
Date: 12-2014
Publisher: Civil-Comp Press
Date: 2011
DOI: 10.4203/CCP.95.50
Publisher: IEEE
Date: 11-2007
Publisher: IEEE
Date: 06-2014
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: Springer Berlin Heidelberg
Date: 2005
DOI: 10.1007/11596042_22
Publisher: IEEE
Date: 12-2016
Publisher: Emerald
Date: 06-1994
DOI: 10.1108/02644409410799407
Abstract: This paper describes a parallel algorithm for the dynamic relaxation (DR) method. The basic theory of the dynamic relaxation is briefly reviewed to prepare the reader for the parallel implementation of the algorithm. Some fundamental parallel processing schemes have been explored for the implementation of the algorithm. Geometric Parallelism was found suitable for the DR method when using transputer‐based systems. The evolution of the parallel algorithm is given by identifying the steps which may be executed in parallel. The structure of the parallel code is discussed and then described algorithmically. Two geometrically non‐linear parallel finite element analyses have been performed using different mesh densities. The number of processors was varied to investigate algorithm efficiency and speed ups . Using the results obtained it is shown that the computational efficiency increases when the computational load per processor is increased.
Publisher: Elsevier BV
Date: 10-2015
Publisher: Elsevier BV
Date: 05-1997
Publisher: IEEE
Date: 12-2010
Publisher: Scientific Research Publishing, Inc.
Date: 2014
Publisher: Elsevier BV
Date: 03-1996
Publisher: Elsevier BV
Date: 03-1996
Publisher: IEEE
Date: 08-2013
DOI: 10.1109/NCA.2013.48
Publisher: Elsevier BV
Date: 10-1996
Publisher: Atlantis Press
Date: 2012
Publisher: Elsevier BV
Date: 2013
Publisher: IEEE
Date: 06-2012
Publisher: IEEE
Date: 12-2011
Location: United Kingdom of Great Britain and Northern Ireland
Start Date: 2001
End Date: 2015
Funder: Swedish Foundation for International Cooperation in Research and Higher Education
View Funded Activity