Finding the Suitable Number of Resources to Maximize System Throughput

This paper presents a performance analysis tool (BAL) for concurrent systems that involves resources and synchronization. It is based on timed process algebra (BTC) for specifying process systems and their resource requirements. The output of the tool is the minimum time and resources needed to reach a given state. BAL makes the syntactic analysis of the system specification, draws up its relevant transition graph by applying the rules of the operational semantics and solves a performance optimization problem relevant to the minimization of the maximum completion time. A case study is used to assess how BAL works, the degree of usefulness of the results and the time required to obtain them.

[1]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[2]  C. A. R. Hoare,et al.  Notes on Communicating Sequential Systems , 1986 .

[3]  M. Carmen Ruiz,et al.  Analysis of the SET e-commerce protocol using a true concurrency process algebra , 2006, SAC.

[4]  Joseph Sifakis,et al.  Tools and Applications II: The IF Toolset , 2004 .

[5]  Wang Yi,et al.  Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.

[6]  Stavros Tripakis,et al.  KRONOS: A Model-Checking Tool for Real-Time Systems (Tool-Presentation for FTRTFT '98) , 1998, FTRTFT.

[7]  Kim G. Larsen,et al.  A Tutorial on Uppaal , 2004, SFM.

[8]  Gerd Behrmann,et al.  Production scheduling by reachability analysis - a case study , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.