Evaluation of distributed finite element algorithms on a workstation network

This paper discusses the design implementation and evaluation of linear finite element programs that distribute their computations over a network of workstations. We consider five different algorithms based on direct, interative and hybrid equation solvers, each of which partitions and maps the model domain across conventional network hardware. A software architecture based on the client-server model distributes the computations and, at the language level, Berkeley sockets enable communication between processes. We client-server model distributes the computations and, at the language level, Berkeley sockets enable communication between processes. We evaluate and describe the performance of these algorithms in terms of client-server model distributes the computations and, at the language level, Berkeley sockets enable communication between porcesses. We evaluate and describe the performance of these algorithms in terms of execution time and speed-up, and we conclude that distributed solvers particularly those based on substructuring and static condensation, can be effective even on high-latency communication networks.