A new approach to parallelizing harmonic balance simulation is presented. The technique leverages circuit substructure to expose potential parallelism in the form of a directed, acyclic graph (dag) of computations. This dag is then allocated and scheduled using various linear clustering techniques. The result is a highly scalable and efficient approach to harmonic balance simulation. Two large examples, one from the integrated circuit regime and another from the communication regime, executed on three different parallel computers are used to demonstrate the efficacy of the approach.
CITATION STYLE
Rhodes, D. L., & Gerasoulis, A. (1999). Scalable parallelization of harmonic balance simulation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1586, pp. 1055–1064). Springer Verlag. https://doi.org/10.1007/BFb0097991
Mendeley helps you to discover research relevant for your work.