Abstract
We adapt Nicol’s approach for the time parallel simulation with fix-up computations. We use the concept of monotonicity of a model related to the initial state of the simulation to derive bounds of the sample-paths. We prove several algorithms with fix-up computations which minimises the number of runs before we get a consistent sample-path. We obtain proved upper or lower bounds of the sample-path of the simulation and bounds of some estimates as well.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Andradottir, S., Hosseini-Nasab, M.: Parallel simulation of transfer lines by time segmentation. European Journal of Operational Research 159(2), 449–469 (2004)
Ben Mamoun, M., Pekergin, N.: Stochastic delay bounds of fair queuing policies by analyzing weighted round robin-related policies. Performance Evaluation 47(2), 181–196 (2002)
Bölöni, L., Turgut, D., Wang, G., Marinescu, D.C.: Challenges and benefits of time-parallel simulation of wireless ad hoc networks. In: Valuetools 2006: 1st International Conference on Performance Evaluation Methodologies and Tools, p. 31. ACM, New York (2006)
Czachórski, T., Fourneau, J.-M., Pekergin, F.: Diffusion model of the push-out buffer management policy. In: INFOCOM, pp. 252–261 (1992)
El Rabih, D., Pekergin, N.: Statistical model checking using perfect simulation. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol. 5799, pp. 120–134. Springer, Heidelberg (2009)
Fourneau, J.-M., Kadi, I.: Time parallel simulation of monotone systems. In: Poster Session, IFIP Performance Conference, Namur, Belgium (2010)
Fourneau, J.-M., Kadi, I., Pekergin, N.: Improving time parallel simulation for monotone systems. In: Turner, S.J., Roberts, D., Cai, W., El-Saddik, A. (eds.) DS-RT, pp. 231–234. IEEE Computer Society, Los Alamitos (2009)
Fourneau, J.-M., Kadi, I., Quessette, F.: Time parallel simulation and hv-monotonicity. In: Proceedings of the 26th Internation Symposium on Computer and Information Sciences. LNEE. Springer, Heidelberg (2011)
Fourneau, J.-M., Pekergin, N.: An algorithmic approach to stochastic bounds. In: Calzarossa, M.C., Tucci, S. (eds.) Performance 2002. LNCS, vol. 2459, pp. 64–88. Springer, Heidelberg (2002)
Fourneau, J.-M., Quessette, F.: Monotone queuing networks and time parallel simulation. In: Al-Begain, K., Balsamo, S., Fiems, D., Marin, A. (eds.) ASMTA 2011. LNCS, vol. 6751, pp. 204–218. Springer, Heidelberg (2011)
Fujimoto, R.M.: Parallel and Distributed Simulation Systems. Wiley Series on Parallel and Distributed Computing (2000)
Fujimoto, R.M., Cooper, C.A., Nikolaidis, I.: Parallel simulation of statistical multiplexers. J. of Discrete Event Dynamic Systems 5, 115–140 (1994)
Greenberg, A.G., Lubachevsky, B.D., Mitrani, I.: Algorithms for unboundedly parallel simulations. ACM Trans. Comput. Syst. 9(3), 201–221 (1991)
Harchol-Balter, M., Schroeder, B., Bansal, N., Agrawal, M.: Size-based scheduling to improve web performance. ACM Trans. Comput. Syst. 21, 207–233 (2003)
Kadi, I., Pekergin, N., Vincent, J.-M.: Different monotonicity definitions in stochastic modelling. In: Al-Begain, K., Fiems, D., Horváth, G. (eds.) ASMTA 2009. LNCS, vol. 5513, pp. 144–158. Springer, Heidelberg (2009)
Kiesling, T.: Using approximation with time-parallel simulation. Simulation 81, 255–266 (2005)
Lin, Y., Lazowska, E.: A time-division algorithm for parallel simulation. ACM Transactions on Modeling and Computer Simulation 1(1), 73–83 (1991)
Nicol, D., Greenberg, A., Lubachevsky, B.: Massively parallel algorithms for trace-driven cache simulations. IEEE Trans. Parallel Distrib. Syst. 5(8), 849–859 (1994)
Propp, J., Wilson, D.: Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Structures and Algorithms 9(1&2), 223–252 (1996)
Stoyan, D.: Comparison Methods for Queues and Other Stochastic Models. John Wiley and Sons, Berlin (1983)
Turgut, D., Wang, G., Boloni, L., Marinescu, D.C.: Speedup-precision tradeoffs in time-parallel simulation of wireless ad hoc networks. In: DS-RT 2006: Proceedings of the 10th IEEE International Symposium on Distributed Simulation and Real-Time Applications, pp. 265–268. IEEE Computer Society Press, Los Alamitos (2006)
Younes, H.L., Simmons, R.G.: Statistical probabilistic model checking with a focus on time-bounded properties. Information and Computation 204(9), 1368–1409 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fourneau, JM., Quessette, F. (2011). Monotonicity and Efficient Computation of Bounds with Time Parallel Simulation. In: Thomas, N. (eds) Computer Performance Engineering. EPEW 2011. Lecture Notes in Computer Science, vol 6977. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24749-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-24749-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24748-4
Online ISBN: 978-3-642-24749-1
eBook Packages: Computer ScienceComputer Science (R0)