2001Unpublished venueRequires access

Parallel simulation for business process re-engineering

Behrouz Zarei

Open publisher page 0 citations

Abstract

This paper describes the development of a parallel simulation model for analysis of a business process system. Today’s increasing complexity of such systems, together with the need for more accurate results means that the task of simulation of business processes frequently outgrows the computational power of economically viable single process systems. One solution is to partition the computational task into sub-tasks and implement them on a parallel or distributed processing computers. This paper describes the process of modelling and execution of a simulation model in the context of a database development process and investigates the performance of the parallel execution of the model. The simulation computes the staff utilisation in various departments and the throughput of the system. The result of the parallel execution demonstrates that conservative parallel simulation algorithm using deadlock avoidance can provide significant speedup over a sequential simulation. Also the results of some experiments indicate that lookahead plays an important role in the performance of the simulation and, therefore, selecting the right lookahead generation technique can make a substantial difference. Key-Words: Discrete-event simulation, Parallel discrete event simulation, Lookahead, Business process simulation, Database management system

About this research paper

What this paper is about

This paper describes the development of a parallel simulation model for analysis of a business process system. Today’s increasing complexity of such systems, together with the need for more accurate results means that the task of simulation of business processes frequently outgrows the computational power of economically viable single process systems. One solution is to partition the computational task into sub-tasks and implement them on a parallel or distributed processing computers. This paper describes the process of modelling and execution of a simulation model in the context of a database development process and investigates the performance of the parallel execution of the model. The simulation computes the staff utilisation in various departments and the throughput of the system. The result of the parallel execution demonstrates that conservative parallel simulation algorithm using deadlock avoidance can provide significant speedup over a sequential simulation. Also the results of some experiments indicate that lookahead plays an important role in the performance of the simulation and, therefore, selecting the right lookahead generation technique can make a substantial difference. Key-Words: Discrete-event simulation, Parallel discrete event simulation, Lookahead, Business process simulation, Database management system

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper describes the development of a parallel simulation model for analysis of a business process system. Today’s increasing complexity of such systems, together with the need for more accurate results means that the task of simulation of business processes frequently outgrows the computational power of economically viable single process systems. One solution is to partition the computational task into sub-tasks and implement them on a parallel or distributed processing computers. This paper describes the process of modelling and execution of a simulation model in the context of a database development process and investigates the performance of the parallel execution of the model. The simulation computes the staff utilisation in various departments and the throughput of the system. The result of the parallel execution demonstrates that conservative parallel simulation algorithm using deadlock avoidance can provide significant speedup over a sequential simulation. Also the results of some experiments indicate that lookahead plays an important role in the performance of the simulation and, therefore, selecting the right lookahead generation technique can make a substantial difference. Key-Words: Discrete-event simulation, Parallel discrete event simulation, Lookahead, Business process simulation, Database management system

Key concepts: Computer science, Speedup, Process (computing), Deadlock, Parallel computing, Discrete event simulation, Task (project management), Partition (number theory)

Related papers

Back to paper searchBrowse research topicsOriginal source
Parallel simulation for business process re-engineering — Research Paper | ScholarLens