Parallel iteration of high-order Runge-Kutta methods with stepsize control
Journal of Computational and Applied Mathematics
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
Starvation and Critical Race Analyzers for Ada
IEEE Transactions on Software Engineering
Automated Analysis of Concurrent Systems with the Constrained Expression Toolset
IEEE Transactions on Software Engineering
Representing circuits more efficiently in symbolic model checking
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
ACM Transactions on Software Engineering and Methodology (TOSEM)
Parallel and sequential methods for ordinary differential equations
Parallel and sequential methods for ordinary differential equations
Parallel computation: models and methods
Parallel computation: models and methods
Multilevel hypergraph partitioning: application in VLSI domain
DAC '97 Proceedings of the 34th annual Design Automation Conference
Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
Multilevel hypergraph partitioning: applications in VLSI domain
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication
IEEE Transactions on Parallel and Distributed Systems
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing
SIAM Journal on Scientific Computing
Graph partitioning models for parallel computing
Parallel Computing - Special issue on graph partioning and parallel computing
Flow diagrams, turing machines and languages with only two formation rules
Communications of the ACM
Improved algorithms for hypergraph bipartitioning
ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
A hypergraph-partitioning approach for coarse-grain decomposition
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Petri Nets, Hypergraphs and Conflicts (Preliminary Version)
WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
Journal of Parallel and Distributed Computing
SUNDIALS: Suite of nonlinear and differential/algebraic equation solvers
ACM Transactions on Mathematical Software (TOMS) - Special issue on the Advanced CompuTational Software (ACTS) Collection
Debugging Ada Tasking Programs
IEEE Software
Parallel Solution of Ordinary Differential Equations
IEEE Transactions on Computers
Performance Evaluation of Workflows Using Continuous Petri Nets with Interval Firing Speeds
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Static Analysis of Concurrent Programs Using Ordinary Differential Equations
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Hypergraph partitioning for the parallel computation of continuous Petri nets
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Continuization of timed petri nets: from performance evaluation to observation and control
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Hi-index | 0.00 |
Continuous Petri net can be used for performance analysis or static analysis. The analysis is based on solving the associated ordinary differential equations. This paper presents a method to parallel compute these differential equations. We first map the Petri net to a hypergraph, and then partition the hypergraph to minimize interprocessor communication while maintaining a good load balance; Based on the partition result, we divide the differential equations into several blocks; Finally, we design a parallel computing algorithm to compute these equations. Software hMETIS is used to partition the hypergraph, and software SUNDIALS is used to support the parallel computing of differential equations. Gas station problem and dining philosopher problem have been used to demonstrate the feasibility, accuracy, and scalability of our method.