A formulation of a graph problem for scheduling parallel computations of multibody dynamic analysis is presented. The complexity of scheduling parallel computations for a multibody dynamic analysis is studied. The problem of finding a shortest critical branch spanning tree is described and transformed to a minimum radius spanning tree, which is solved by an algorithm of polynomial complexity. The problems of shortest critical branch minimum weight spanning tree (SCBMWST) and the minimum weight shortest critical branch spanning tree (MWSCBST) are also presented. Both problems are shown to be NP-hard by proving that the bounded critical branch bounded weight spanning tree (BCBBWST) problem is NP-complete. It is also shown that the minimum computational cost spanning tree (MCCST) is at least as hard as SCBMWST or MWSCBST problems, hence itself an NP-hard problem. A heuristic approach to solving these problems is developed and implemented, and simulation results are discussed.

1.
Bae, D. S., and Haug, E. J., 1987, “A Recursive Formulation for Constrained Mechanical Systems, Part I—Open Loop,” Mechanics of Structures and Machines, Vol. 15 (4).
2.
Bae, D. S., Hwang, R. S., and Haug, E. J., 1988, “A Recursive Formulation for Real-Time Dynamic Simulation,” Technical Report D-2, Center for Computer Aided Design, The University of Iowa, Jan.
3.
Booth
H.
, and
Westbrooke
J.
,
1994
, “
Linear Algorithm for Analysis of Minimum Spanning and Shortest-Path Trees of Planer Graphs
,”
Algorithmica
, Vol.
11
, No.
4
, pp.
341
352
.
4.
Christofedes, N., 1986, Graph Theory: An Algorithmic Approach, Academic Press.
5.
Easwarakumar
K. S.
,
Pandu Ranga
C.
, and
Cheston
G. A.
,
1994
, “
Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph
,”
Inf. Process. Letters
, Vol.
51
, No.
3
, pp.
121
124
.
6.
Garey, M. R., and Johnson, D. S., 1979, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, SF, CA.
7.
Haug, E. J., 1995, Private Communication, University of Iowa, Iowa City, IA, 52242.
8.
Ho, J. M., Lee, D. T., Chang, C. H., and Wong, C. K., 1991, “Minimum Diameter Spanning Trees and Related Problems,” SIAM J. Comput., Vol. 20, No. 5.
9.
Hwang, R. S., and Haug, E. J., 1989, “Topology Analysis of Multibody Systems for Recursive Dynamics Formulation,” Mech. Struct, and Mack., Hauh, E. J., ed., Vol. 17, No. 2, pp. 239–258.
10.
Iwano
K.
, and
Katoh
N.
,
1993
, “
Efficient Algorithms for Finding the Most Vital Edge of a Minimum Spanning Tree
,”
Information Processing Letters
, Vol.
48
, No.
5
, pp.
211
213
.
11.
Johnson, D. B., and Metaxas, P., 1992, “Parallel Algorithm for Computing Minimum Spanning Trees,” Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures, San Diego, CA.
12.
Khuller
S.
, and
Schieber
B.
,
1992
, “
On Independent Spanning Trees
,”
Information Processing Letters
, Vol.
42
, No.
6
, pp.
321
323
.
13.
Khuller, S., Raghavachari, B., and Young, N., 1993, “Balancing Minimum Spanning and Shortest Path Trees,” Proceedings of the Fourth Annual ACM-SIAm Symposium on Discrete Algorithms, New York, NY.
14.
Kim, S. S., 1984, “A State Space Formulation for Multibody Dynamic Systems Subject to Control,” Ph.D. thesis, The University of Iowa.
15.
NADS, 1995, National Advanced Driving Simulator Reference Manual, Center for Computer Aided Design, The University of Iowa, Iowa City, IA.
16.
Pape
U.
,
1980
, “
Program for Finding the Shortest Path from a Specific Node to All other Nodes in a Network
,”
ACM TOMS
, Vol.
6
, No.
562
, pp.
450
455
.
17.
Park
T. G.
, and
Oldfield
J. V.
,
1993
, “
Minimum Spanning Tree Generation with Content-Addressable Memory
,”
Electronics Letters
, Vol.
29
, No.
11
, pp.
1037
1039
.
18.
Pawagi
S.
, and
Kaser
O.
,
1993
, “
Optimal Parallel Algorithms for Multiple Updates of Minimum Spanning Trees
,”
Algorithmica
, Vol.
9
, No.
4
, pp.
357
381
.
19.
Roberson
R. E.
,
1984
, “
The Path Matrix of A Graph, Its Construction and Its Use in Evaluating Certain Products
,”
Computer Methods in Applied Mechanics and Engineering
, Vol.
42
, pp.
47
56
.
20.
Saitoh
A.
,
Tsujino
Y.
, and
Tokura
N.
,
1992
, “
Complete Spanning Tree Maintenance Algorithm and its Complexity
,”
Systems and Computers in Japan
, Vol.
23
, No.
11
, pp.
319
328
.
21.
Sheth
P. N.
, and
Uicker
J. J.
,
1972
, “
IMP (Integrated Mechanical Programs): A Computer-Aided Design System for Mechanisms and Linkages
,”
ASME Journal of Engineering for Industry
, Vol.
94
, No.
2
, pp.
454
464
.
22.
Suraweera, P., 1989, “A Fast Algorithm for the Minimum Spanning Tree,” Computers in Industry, Vol. 13.
23.
Suraweera
F.
, and
Bhattacharya
P.
,
1993
, “
O(log m) Parallel Algorithm for the Minimum Spanning Tree Problem
,”
Information Processing Letters
, Vol.
45
, No.
3
, pp.
159
163
.
24.
Tsai, F. F., and Haug, E. J., “Automated method for high speed simulation of multibody dynamic systems,” Tech. report R47, Center for Simulation and Design Optimization of Mech. Systems, The University of Iowa, Iowa City, 1989.
25.
Tsin
Y. H.
,
1993
, “
Incremental Distributed Asynchronous Algorithm for Minimum Spanning Trees
,”
Computer Networks and ISDN Systems
, Vol.
26
, No.
2
, pp.
227
232
.
26.
Wittenberg, J., and Wolz, U., “MESA VERDE: A Symbolic Program for Nonlinear Articulated-Rigid-Body Dynamics,” ASME, 85-DET-151.
27.
Wittenberg, J., 1977, Dynamics of Systems of Rigid Bodies, B. G. Terbner, Stuttgart.
28.
Wittenberg, J., 1978, “Nonlinear Equations of Motion for Arbitrary Systems on Interconnected Rigid Bodies,” Symposium on the Dynamics of Multibody Systems, Munich, Germany, Pro. published by Spring-Verlag, K. Magnus, ed.
29.
Yao, A. C., 1975, “An O(E log log V) Algorithm for Finding Minimum Spanning Trees,” Inf Process., Vol. 4.
30.
Zeid
A.
, and
Overholt
J. L.
,
1995
, “
Singularity Pperturbed Bond Graph Models for Simulation of Multibody Systems
,”
ASME JOURNAL OF DYNAMIC SYSTEMS, MEASUREMENT, AND CONTROL
, Vol.
117
, No.
3
, pp.
401
410
.
31.
Zeid
A.
,
1989
, “
Bond Graph Modeling of Planar Mechanisms with Realistic Joint Effects
,”
ASME JOURNAL OF DYNAMIC SYSTEMS, MEASUREMENT, AND CONTROL
, Vol.
111
, pp.
15
23
.
32.
Zou
H. L.
,
Abdel-Malek
K.
, and
Wang
,
1997
, “
Design propoagation in Mechanical Systems: Kinematic Analysis
,”
ASME Journal of Mechanical Design
, Vol.
119
, No.
3
, pp.
338
345
.
This content is only available via PDF.
You do not currently have access to this content.