Parallel Solution of Ordinary Differential Equations

Authors:
M. A. Franklin
Affiliations:
Department of Electrical Engineering, Washington University
Venue:
IEEE Transactions on Computers
Year:
1978

Citing 3
Cited 9

Computer Interconnection Structures: Taxonomy, Characteristics, and Examples

ACM Computing Surveys (CSUR)
Parallel Methods for the Numerical Solution of Ordinary Differential Equations

IEEE Transactions on Computers
Interconnection networks: a survey and assessment

AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition

Parallel Block Predictor-Corrector Methods for Ode's

IEEE Transactions on Computers
Paper: Parallel algorithms for solving initial value problems: front broadening and embedded parallelism

Parallel Computing
An analysis of queuing network simulation using GPU-based hardware acceleration

ACM Transactions on Modeling and Computer Simulation (TOMACS)
One-dimensional optimization on multiprocessor systems

IEEE Transactions on Computers
Paper: Future computer technology for large power system simulation

Automatica (Journal of IFAC)
Research: Numerical analysis of some basic fluid communication models via parallel block methods

Computer Communications
A class of implicit advanced step-point methods with a parallel feature for the solution of stiff initial value problems

Mathematical and Computer Modelling: An International Journal
Parallel computation of continuous Petri nets based on hypergraph partitioning

The Journal of Supercomputing
Hypergraph partitioning for the parallel computing of fuzzy differential equations

Fuzzy Sets and Systems

Quantified Score

Hi-index	14.99

Visualization

Abstract

This paper presents a performance comparison of three parallel algorithms for the solution of sets of coupled first-order differential equations. A general format for comparison of the algorithms is given, and performance equations for the two processor cases are developed. The equations take into account both the computational and intercommunications requirements of the processors. These equations are applied to a benchmark of six problems and a simple, single bus multiprocessor architecture. The more than two processor case is considered for one of the parallel algorithms.