SAN Examples

These examples run in different versions of PEPS (2003/2007) as indicated. Moreover, a prototyped version (PEPS2009) using the new algorithm Split to accelerate the iterative method is available here, including a Windows version for PEPS2003. For PEPS2009 use different compile options: (1 - 1 Compile a SAN model) for PEPS2003 SAN syntax, and (1 - 4 Compilation of PEPS 2007 version) for PEPS2007 SAN syntax.


Queueing Network model ex1.san
An example of a queueing network modeled using SAN, composed of five queues of capacities indicated by Ki (i=1...5).

FERNANDES, P., PLATEAU, B. Modeling Finite Capacity Queueing Networks with Stochastic Automata Networks. In: Fourth International Workshop on Queueing Networks with Finite Capacity (QNETs 2000), Vol.1, p.16/01-16/12. Ilkley, West Yorkshire, UK, 20-21, July, 2000. PDF file. Bibtex.


Resource Sharing model ex1.san (only using PEPS2003) - ex2.san (only using PEPS2007)
A classical example of resource sharing with different network configurations since P is the number of processes (automata with two states: idle and occupied) and R is the number of possible occupied resources.

BRENNER L., FERNANDES P., SALES A. The Need for and the Advantages of Generalized Tensor Algebra for Kronecker Structured Representations. 20th Annual UK Performance Engineering Workshop (UKPEW 2004), p. 48-60. Bradford, UK, July, 2004. International Journal of Simulation: Systems, Science \& Technology (IJSIM), p. 52-60, 2005. PDF file. Presentation. Bibtex.


Resource Allocation (Dining Philosophers) model ex1.san ex2.san
A model for the classical problem of K philosophers sitting at a circular table doing one of three things - taking left fork, taking right fork or thinking. The philosopher can reserve the fork on his immediate left or right waiting for eating with two available forks. To avoid deadlock is established an ordering to get the forks in the table, for each philosopher in the model. A version without resource reservation, meaning the philosophers can only eat or think, is also available. (ex3.san)

FERNANDES P., VINCENT J. M., WEBBER T. Perfect Simulation of Stochastic Automata Networks. Proceedings of the 15th International Conference on Analytical and Stochastic Modelling Techniques and Applications (ASMTA '08). K. Al-Begain, A. Heindl, and M. Telek (Eds.). Lecture Notes in Computer Science Vol. 5055, p. 249–263. Springer-Verlag, June, 2008. PDF file. Bibtex.


First Available Server (FAS) model ex1.san ex2.san
A model to analyse server availability considering N servers. Each server can be in two distinct states: Idle and Busy. In this example, packages arriving at the servers switch block, depart through the first output port (or server) that is not busy, as long as at least one server is not blocked. The model can be viewed as a framework for analysis of different queueing systems (e.g. call centers lines occupation). Each package in the queue can advance as soon as possible to the first available server without preferring one over another (meaning that the priority of servers is given by themselves).




Alternate Service Pattern (ASP) model ex1.san (only using PEPS2003) - ex2.san (only using PEPS2003)
ex3.san (only using PEPS2007) - ex4.san (only using PEPS2007)
The model describes a small open network composed of four queues with finite capacities Ki (i=1,...,4) respectively. The model is composed by one automaton to each single-service pattern queue and two automata for the alternate service pattern queue. The states are representing the number of customers in each queue.

BRENNER L., FERNANDES P., SALES A. The Need for and the Advantages of Generalized Tensor Algebra for Kronecker Structured Representations. 20th Annual UK Performance Engineering Workshop (UKPEW 2004), p. 48-60. Bradford, UK, July, 2004. International Journal of Simulation: Systems, Science \& Technology (IJSIM), p. 52-60, 2005. PDF file. Presentation. Bibtex.


Wireless ad hoc Network Protocol (WN) model ex1.san ex2.san
The model represents a chain of N mobile nodes in a Wireless ad hoc Network running over the 802.11 standard for ad hoc networks where one node is the Source that generates packets as fast as the standard allows (two states: idle and transmitting). The packets are forwarded through the chain by the Relay nodes (three states: idle, receiving and transmitting), to the last node Sink which is the destination (two states: idle and receiving).

DOTTI F. L., FERNANDES P., SALES A., SANTOS O. M. Modular Analytical Performance Models for Ad Hoc Wireless Networks. Proceedings of the 3rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt 2005), p. 164-173. IEEE Computer Society, April, 2005. PDF File. Presentation. Bibtex.


Master-Slave Architecture (MS) model ex1.san ex2.san (only using PEPS2003)
A model for an evaluation of the master-slave parallel implementation of the Propagation algorithm considering asynchronous communication. One Master of three states (transmitting, receiving and idle), one huge Buffer of (K+1) positions, and S Slaves all with three states (idle, processing and transmitting).

BALDO L., BRENNER L., FERNANDES L. G., FERNANDES P., SALES A. Performance Models for Master/Slave Parallel Programs. Proceedings of the First International Workshop on Practical Applications of Stochastic Modelling (PASM 2004), p. 41-60. London, UK. 2004. Electronic Notes In Theoretical Computer Science (ENTCS), Vol. 128(4), p. 101-121, 2005. PDF file. Presentation. Bibtex.

BRENNER L., FERNANDES L. G., FERNANDES P., SALES A. Performance Analysis Issues for Parallel Implementations of Propagation Algorithm. Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing, p. 183-190. São Paulo, Brazil. 2003. PDF file. Bibtex.


Non-Uniform Memory Access (NUMA) model ex1.san
A model of processes running in NUMA processors for the Linux operating system. NUMA is a model for capturing the behavior of a single process under a multiprocessed point of view, and analytically calculate the chances for a given processor to fail.

CHANIN R., CORRÊA M., FERNANDES P., SALES A., SCHEER R., ZORZO A. F. Analytical Modeling for Operating System Schedulers on NUMA Systems. Electronic Notes In Theoretical Computer Science, Vol. 151(3), p. 131-149, 2006. Elsevier Science Publishers B. V., June, 2006. PDF File. Bibtex.



Random Waypoint Mobility Pattern (RWMP) model ex1.san
A model for studying the Random Waypoint Mobility Pattern in 2D areas where a mobile node chooses a destination to reach in a constant velocity considering also pause times.

DELAMARE F., DOTTI F. L., FERNANDES P., NUNES C. M., OST L. C. Analytical Modeling of Random Waypoint Mobility Patterns. Proceedings of the 3rd ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (ACM PE-WASUN 2006), p. 106-113. ACM, October, 2006 PDF File. ACM Link. Bibtex.



Back