The Experts below are selected from a list of 57 Experts worldwide ranked by ideXlab platform

Jianwen Cao - One of the best experts on this subject based on the ideXlab platform.

  • Parallel computation of continuous Petri nets based on hypergraph partitioning
    The Journal of Supercomputing, 2011
    Co-Authors: Zuohua Ding, Hui Shen, Jianwen Cao
    Abstract:

    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.

  • PaCT - Hypergraph partitioning for the parallel computation of continuous Petri nets
    Lecture Notes in Computer Science, 2011
    Co-Authors: Zuohua Ding, Hui Shen, Jianwen Cao
    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.

Zuohua Ding - One of the best experts on this subject based on the ideXlab platform.

  • Parallel computation of continuous Petri nets based on hypergraph partitioning
    The Journal of Supercomputing, 2011
    Co-Authors: Zuohua Ding, Hui Shen, Jianwen Cao
    Abstract:

    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.

  • PaCT - Hypergraph partitioning for the parallel computation of continuous Petri nets
    Lecture Notes in Computer Science, 2011
    Co-Authors: Zuohua Ding, Hui Shen, Jianwen Cao
    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.

Hui Shen - One of the best experts on this subject based on the ideXlab platform.

  • Parallel computation of continuous Petri nets based on hypergraph partitioning
    The Journal of Supercomputing, 2011
    Co-Authors: Zuohua Ding, Hui Shen, Jianwen Cao
    Abstract:

    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.

  • PaCT - Hypergraph partitioning for the parallel computation of continuous Petri nets
    Lecture Notes in Computer Science, 2011
    Co-Authors: Zuohua Ding, Hui Shen, Jianwen Cao
    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.

Marco Bernardo - One of the best experts on this subject based on the ideXlab platform.

  • FORTE - TwoTowers: A Tool Integrating Functional and Performance Analysis of Concurrent Systems
    IFIP Advances in Information and Communication Technology, 1998
    Co-Authors: Marco Bernardo, Rance Cleaveland, Steve Sims, W. Stewart
    Abstract:

    We present TwoTowers, a tool for analyzing functional and performance properties of concurrent systems expressed as terms in the stochastically timed reward process algebra EMPAr. TwoTowers builds on two existing tools, CWB-NC and MarCA, that have been retargeted to carry out functional and performance analysis (respectively) of EMPAr, system specifications. As an example, we describe the application of TwoTowers to the Lehmann-Rabin randomized distributed algorithm for the Dining Philosopher Problem.

  • Twotowers: A Tool Integrating Functional And Performance Analysis Of Concurrent Systems
    1998
    Co-Authors: Marco Bernardo, W. R. Cleaveland, S. T. Sims, W. J. Stewart
    Abstract:

    We present TwoTowers, a tool for analyzing functional and performance properties of concurrent systems expressed as terms in the stochastically timed reward process algebra EMPA r . TwoTowers builds on two existing tools, CWB-NC and MarCA, that have been retargeted to carry out functional and performance analysis (respectively) of EMPA r system specifications. As an example, we describe the application of TwoTowers to the Lehmann-Rabin randomized distributed algorithm for the Dining Philosopher Problem

  • TwoTowers: A Tool Integrating Functional and Performance Analysis of Concurrent Systems”, submitted for publication
    1998
    Co-Authors: Marco Bernardo, S. T. Sims, W. R. Cleavel, W. J. Stewart
    Abstract:

    Abstract: We present TwoTowers, a tool for analyzing functional and performance properties of concurrent systems expressed as terms in the stochastically timed reward process algebra EMPAr. TwoTowers builds on two existing tools, CWB-NC and MarCA, that have been retargeted to carry out functional and performance analysis (respectively) of EMPAr system specifications. As an example, we describe the application of TwoTow-ers to the Lehmann-Rabin randomized distributed algorithm for the Dining Philosopher Problem

  • TwoTowers: A Tool Integrating Functional and Performance Analysis of Concurrent Systems
    1998
    Co-Authors: Marco Bernardo, Rance Cleaveland, Steve Sims, W. Stewart
    Abstract:

    We present TwoTowers, a tool for analyzing functional and performance properties of concurrent systems expressed as terms in the stochastically timed reward process algebra EMPA r . TwoTowers builds on two existing tools, CWBNC and MarCA, that have been retargeted to carry out functional and performance analysis (respectively) of EMPA r system specifications. As an example, we describe the application of TwoTowers to the Lehmann-Rabin randomized distributed algorithm for the Dining Philosopher Problem. Keywords Software tools, process algebras, performance evaluation, Markov chains 1 INTRODUCTION The desirability of taking account of the performance aspects of a system in the early stages of its design has been widely recognized (Yemini et al. 1982, Ferrari 1986, Harvey 1986, Bochmann et al. 1988). Nevertheless, it often happens that a concurrent system is tested for efficiency only after it has been fully designed and tested for functionality. This results in two Problems. On the ..

W. Stewart - One of the best experts on this subject based on the ideXlab platform.

  • FORTE - TwoTowers: A Tool Integrating Functional and Performance Analysis of Concurrent Systems
    IFIP Advances in Information and Communication Technology, 1998
    Co-Authors: Marco Bernardo, Rance Cleaveland, Steve Sims, W. Stewart
    Abstract:

    We present TwoTowers, a tool for analyzing functional and performance properties of concurrent systems expressed as terms in the stochastically timed reward process algebra EMPAr. TwoTowers builds on two existing tools, CWB-NC and MarCA, that have been retargeted to carry out functional and performance analysis (respectively) of EMPAr, system specifications. As an example, we describe the application of TwoTowers to the Lehmann-Rabin randomized distributed algorithm for the Dining Philosopher Problem.

  • TwoTowers: A Tool Integrating Functional and Performance Analysis of Concurrent Systems
    1998
    Co-Authors: Marco Bernardo, Rance Cleaveland, Steve Sims, W. Stewart
    Abstract:

    We present TwoTowers, a tool for analyzing functional and performance properties of concurrent systems expressed as terms in the stochastically timed reward process algebra EMPA r . TwoTowers builds on two existing tools, CWBNC and MarCA, that have been retargeted to carry out functional and performance analysis (respectively) of EMPA r system specifications. As an example, we describe the application of TwoTowers to the Lehmann-Rabin randomized distributed algorithm for the Dining Philosopher Problem. Keywords Software tools, process algebras, performance evaluation, Markov chains 1 INTRODUCTION The desirability of taking account of the performance aspects of a system in the early stages of its design has been widely recognized (Yemini et al. 1982, Ferrari 1986, Harvey 1986, Bochmann et al. 1988). Nevertheless, it often happens that a concurrent system is tested for efficiency only after it has been fully designed and tested for functionality. This results in two Problems. On the ..