The Community for Technology Leaders
Green Image
<p>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.</p>
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

I. Chen and S. Banawan, "Modeling and Analysis of Concurrent Maintenance Policies for Data Structures Using Pointers," in IEEE Transactions on Software Engineering, vol. 19, no. , pp. 902-911, 1993.
83 ms
(Ver 3.3 (11022016))