Abstract
Continuous Petri net can be used for performance analysis or static analysis. The analysis is based on solving the associated ordinary differential equations. However, large equation groups will give us overhead computing. To solve this issue, this paper presents a method to compute these differential equations in parallel. We first map the Petri net to a hypergraph, and then partition the hypergraph with minimal inter-processor communication and good load balance; Based on the partition result, we divide the differential equations into several blocks; Finally we design parallel computing algorithm to compute these equations. Software hMETIS and SUNDIALS have been used to partition the hypergraph and to support the parallel computing, respectively. Gas Station problem and Dining Philosopher problem have been used to demonstrate the benefit of our method.
This work is supported by the NSF under Grant No. 90818013 and Zhejiang NSF under Grant No.Z1090357.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alimonti, P., Feuerstein, E.: Petri Nets, Hypergraphs and Conflicts. In: van Leeuwen, J. (ed.) WG 1993. LNCS, vol. 790, pp. 293–309. Springer, Heidelberg (1994)
Burch, J.R., Clarke, E.M., Long, D.E.: Representing Circuts More Efficiently in Symbolic Model Checking. In: Proceedings of the 28th Design Automation Conference, pp. 403–407. IEEE Computer Society Press, Los Alamltos (1991)
Burrage, K.: Parallel and Sequential Methods for Ordinary Differential Equations. Oxford Science Publications (1995)
Çatalyürek, Ü., Aykanat, C.: A Hypergraph-partitioning Approach for Coarse-grain Decomposition. In: ACM/IEEE Supercomputing, Denver (2001)
Çatalyürek, Ü., Aykanat, C.: Hypergraph-partitioningbased Decomposition for Parallel Sparse-matrix Vector Multiplication. IEEE Transactions on Parallel and Distributed Systems 10(7), 673–693 (1999)
David, R., Alla, H.: Autonomous and Timed Continuous Petri Nets. In: Proceedings of 11th Intl Conference on Application and Theory of Petri Nets, Paris, France, pp. 367–381 (1990)
Dijkstra, E.W.: Hierarchical Ordering of Sequential Processes. Acta Informatica 2, 115–138 (1971)
Ding, Z.: Static analysis of concurrent programs using ordinary differential equations. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol. 5684, pp. 1–35. Springer, Heidelberg (2009)
Dingle, N.J., Harrison, P.G., Knottenbelt, W.J.: Uniformization and Hypergraph Partitioning for The Distributed Computation of Response Time Densities in Very Large Markov Models. Journal of Parallel and Distributed Computing 64, 908–920 (2004)
Ehrig, R., Nowak, U., Deuflhard, P.: Massively Parallel Linearly-implicit Extrapolation Algorithms As a Powerful Tool in Process Simulation. Parallel Computing: Fundamentals, Applications and New Directions, 517–524 (1998)
Hiraishi, K.: Performance evaluation of workflows using continuous petri nets with interval firing speeds. In: van Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol. 5062, pp. 231–250. Springer, Heidelberg (2008)
Helmbold, D., Luckham, D.: Debugging Ada Tasking Programs. IEEE Software 2(2), 47–57 (1985)
Hendrickson, B., Kolda, T.G.: Graph Partitioning Models for Parallel Computing. Parallel Computing 26, 1519–1534 (2000)
Hindmarsh, A.C., Brown, P.N., Grant, K.E., Lee, S.L., Serban, R., Shumaker, D.E., Woodward, C.S.: SUNDIALS, Suite of Nonlinear and Differential/Algebraic Equation Solvers. ACM Transactions on Math. Softw. 31, 363–396 (2005)
van der Houwen, P.J., Sommeijer, B.P.: Parallel Iteration of High-order Runge-Kutta Methods With Stepsize Control. J. Comput. Appl. Math. 29, 111–127 (1990)
Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel Hypergraph Partitioning: Application in VLSI Domain. IEEE Transactions on VLSI Systems 7(1), 69–79 (1999)
Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, Inc., New York (1990)
Rao, P.S., Mouney, G.: Data Communication in Parallel Block Predictor-corrector Methods for Solving ODE’s. Parallel Computing 23, 1877–1888 (1997)
Silva, M., Recalde, L.: Continuization of timed petri nets: From performance evaluation to observation and control. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 26–47. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ding, Z., Shen, H., Cao, J. (2011). Hypergraph Partitioning for the Parallel Computation of Continuous Petri Nets. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2011. Lecture Notes in Computer Science, vol 6873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23178-0_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-23178-0_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23177-3
Online ISBN: 978-3-642-23178-0
eBook Packages: Computer ScienceComputer Science (R0)