Petri Net Models and Collaborativeness for Parallel Processes with Resource Sharing and Message Passing

2017 ◽  
Vol 16 (4) ◽  
pp. 1-20 ◽  
Author(s):  
Guanjun Liu ◽  
Mengchu Zhou ◽  
Changjun Jiang
Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Soraia Oueida ◽  
Yehia Kotb ◽  
Seifedine Kadry ◽  
Sorin Ionescu

Healthcare systems are growing very fast, especially emergency departments (EDs) which constitute the major bottleneck of these complex concurrent systems. Emergency departments, where patients arrive without any prior notice, are considered real-time complex dynamic systems. Enhancing these systems requires tailored modeling techniques and a process optimization approach. A new mathematical approach is proposed in order to help multiple emergency units cooperate and share none-consumable resources to achieve the required flow. To achieve the cooperation, the process is modeled by a new subclass of Petri nets. The new Petri net model was proposed in a previous work and is used in this study in order to tackle the problem of modeling and managing these emergency units. The proposed Petri net is named Resource Preservation Net (RPN). Few theorems and lemmas are proposed to support the proposed Petri net model and to prove the correctness of cooperation and resource sharing. In this contribution, a model of cooperative healthcare units is proposed to achieve sound resource sharing and collaboration. The objective function of the proposed model is to improve the key performance indicators: patients length of stay (LoS), resource utilization rates, and patients waiting time. The cooperation among multiple EDs is then proposed through the study of merging two or more units. The cooperative and noncooperative behavior are also studied through theorems of soundness, separability and serializability, and a proof of scalability.


ETFA2011 ◽  
2011 ◽  
Author(s):  
Farhang Nemati ◽  
Rafia Inam ◽  
Thomas Nolte ◽  
Mikael Sjodin

1990 ◽  
Vol 51 (2) ◽  
pp. 213-220 ◽  
Author(s):  
Ajoy K. Datta ◽  
Sukumar Ghosh

2008 ◽  
Vol 17 (03) ◽  
pp. 365-387 ◽  
Author(s):  
LI JIAO ◽  
HEJIAO HUANG ◽  
TO-YAT CHEUNG

Resource sharing is a very complex task in system design because it may induce undesirable properties such as deadlocks and overflows. This paper proposes a method for handling this task. Resource sharing is formulated as a place fusion on a Petri net specification that satisfies a designated set of properties and includes some duplicated places representing accesses to the resources. If this fusion satisfies some conditions, the obtained net will preserve the original properties after the incorporation of resource sharing. This paper considers two classes of property-preserving place fusions. Each class specifies the Petri net type to be used, the structural relationship among the resource places and possibly some additional conditions for the place fusion to preserve a designated set of properties. As an illustration, these place fusion approaches are applied to solve a resource sharing problem in the design of manufacturing systems.


The asynchronous parallel processes and their structure, the features of the asynchronous parallel process and how to express them in bigram form is the main analysis of this article. Besically, it describes the characteristics and specifications of asynchronous parallel processes and processes in bigram form. The Petri nets are illustrated, the mathematical modeling of asynchronous processes using the Petri net, the marking diagram, the problem of the result and its solutions. Some of the oil and fat production processes were developed and piloted using the Petri net.


Author(s):  
Raed AlDhubhani ◽  
Fathy Eassa ◽  
Faisal Saeed

Deadlock detection is one of the main issues of software testing in High Performance Computing (HPC) and also inexascale computing areas in the near future. Developing and testing programs for machines which have millions of cores is not an easy task. HPC program consists of thousands (or millions) of parallel processes which need to communicate with each other in the runtime. Message Passing Interface (MPI) is a standard library which provides this communication capability and it is frequently used in the HPC. Exascale programs are expected to be developed using MPI standard library. For parallel programs, deadlock is one of the expected problems. In this paper, we discuss the deadlock detection for exascale MPI-based programs where the scalability and efficiency are critical issues. The proposed method detects and flags the processes and communication operations which are potential to cause deadlocks in a scalable and efficient manner. MPI benchmark programs were used to test the proposed method.


Sign in / Sign up

Export Citation Format

Share Document