This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Modeling and Analysis of Concurrent Maintenance Policies for Data Structures Using Pointers
September 1993 (vol. 19 no. 9)
pp. 902-911

We present a state reduction method that effectively reduces a two-dimensional Markov model to a one-dimensional Markov model for the performance analysis of a class of concurrent data structure maintenance policies. The reduced model allows the derivation of a closed form expression for the average service time per operation and facilitates the identification of priority allocation functions under which: the system is stable; and the service time per operation is minimized. The applicability of the model is exemplified with a binary tree data structure and the conditions under which concurrent maintenance strategies are better than a conventional incremental maintenance strategy are determined.

[1] W. H. Bahaa-El-Din, F. B. Bastani, and J. E. Teng, "Performance analysis of periodic and concurrent data structure maintenance strategies for network servers,"IEEE Trans. Software Eng., vol. 15, no. 12, pp. 1526-1536, Dec. 1989.
[2] F. B. Bastani, I. R. Chen, and W. Hilal, "A model for the stability analysis of maintenance strategies for linear list,"Comput. J., vol. 34, no. 1, pp. 80-87, Feb. 1991.
[3] M. Ben-Ari, "Algorithm for on-the-fly garbage collection,"ACM Trans. Programming Languages Syst., vol. 6, no. 3, pp. 333-344, July 1984.
[4] P.A. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, Mass., 1987.
[5] A. Chesnais, E. Gelenbe, and I. Mitrani, "On the modeling of parallel access to shared data,"Commum. ACM, vol. 26, no. 3., pp. 196-202, Mar. 1983.
[6] E.W. Dijkstra, L. Lamport, A.J. Martin, C.S. Scholten, and E.F.M. Steffens, "On-the-fly garbage collection: An exercise in cooperation,"Commun. ACM, vol. 21, no. 11, pp. 966-975, Nov. 1978.
[7] E. Gelenbe, "On the optimum checkpoint interval,"J. ACM, vol. 26, no. 2, pp. 259-270, 1979.
[8] E. Gelenbe and M. Hernández, "Optimal checkpoints with age dependent failures",Acta Informatica, 27, pp. 519-531, 1990.
[9] T. Hickey and J. Cohen, "Performance analysis of on-the-fly garbage collection,"Commun. ACM, vol. 27, no. 11, pp. 1143-1154, Nov. 1984.
[10] C. H. C. Leung, "Dynamic storage fragmentation and file deterioration,"IEEE Trans. Software Eng., vol. 12, no. 12, pp. 436-441, Dec. 1986.
[11] L. Kleinrock,Queueing Systems, Vol. 1: Theory. New York: Wiley, 1975.
[12] E. D. Lazawskaet al., Quantitative System Performance--Computer System Analysis Using Queueing Network Models. Englewood Cliffs, NJ: Prentice-Hall, 1984.
[13] U. Maruyama and S. Smith, "Optimal reorganization of distributed space disk files,"Commun. ACM, vol. 19, no. 11, pp. 245-247, Nov. 1976.
[14] A. Moitra, S. S. Iyengar, F. B. Bastani, and I. L. Yen, "Multilevel data structures: Models and performance,"IEEE Trans. Software Eng., vol. 14, no. 6, pp. 858-867, June 1988.
[15] R. M. Needham and A. J. Herbert,The Cambridge Distributed Computing System. Reading, MA: Addison-Wesley, 1982.
[16] R. A. Sahner and K. S. Trivedi, "A hierarchical, combinatorial-Markov method of solving complex reliability models," inACM/IEEE Proc. Fall Joint Comput. Conf., Nov. 1986, pp. 817-825.
[17] C. H. Sauer and K. M. Chandy,Computer System Performance Modeling. Englewood Cliffs, NJ: Prentice-Hall, 1981.
[18] M. L. Shooman and A. E. Laemmel, "Simplification of Markov models by state merging," inProc. 1987 Annu. Reliability and Maintainability Symp., IEEE, New York, pp. 159-164.
[19] A. M. Tenenbaum and M. J. Augenstein,Data Structure Using Pascal. Englewood Cliffs, NJ: Prentice-Hall, 1981.

Index Terms:
concurrent maintenance policies; data structures; pointers; state reduction method; two-dimensional Markov model; one-dimensional Markov model; performance analysis; concurrent data structure maintenance policies; closed form expression; service time per operation; priority allocation functions; binary tree data structure; 1D Markov model; 2D Markov model; Markov processes; performance evaluation; software maintenance; tree data structures
Citation:
Ing-Ray Chen, S.A. Banawan, "Modeling and Analysis of Concurrent Maintenance Policies for Data Structures Using Pointers," IEEE Transactions on Software Engineering, vol. 19, no. 9, pp. 902-911, Sept. 1993, doi:10.1109/32.241772
Usage of this product signifies your acceptance of the Terms of Use.