This Article 
 Bibliographic References 
 Add to: 
Multilevel Data Structures: Models and Performance
June 1988 (vol. 14 no. 6)
pp. 858-867

A stepwise method of deriving the high-performance implementation of a set of operations is proposed. This method is based on the ability to organize the data into a multilevel data structure to provide an efficient implementation of all the operations. Typically, for such data organization the performance may deteriorate over a period of time and that can be corrected by reorganizing the data. This data reorganization is done by the introduction of maintenance processes. For a particular example, the multilevel data organization and the different models of maintenance processes possible are considered. The various models of maintenance process provide varying amounts of concurrency by varying the degree of atomicity in different operations. Performance behavior for the different models is derived and a correctness proof for the developed implementation is outlined

[1] F. B. Bastani, S. S. Iyengar, and I. L. Yen, "Concurrent maintenance of multilevel data structures," Dep. Comput. Sci., Univ. Houston-- University Park, Tech. Rep., UH-CS-85-3, Jan. 1985.
[2] F. B. Bastani, I. L. Yen, A. Moitra, and S. S. Iyengar, "Impact of parallel processing on software quality," inProc. First Int. Conf. Supercomputing Systems, Dec. 1985, pp. 369-376.
[3] 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.
[4] C. S. Ellis, "Distributed data structures: A case study," inProc. 5th Int. Conf. Distributed Processing Systems, May 1985, pp. 201-209.
[5] T. Hickey and J. Cohen, "Performance analysis of on-the-fly garbage collection,"Commun. ACM, vol. 27, no. 11, pp. 1143-1154, Nov. 1984.
[6] C. Jones, "Tentative steps towards a development method for interfering programs,"ACM Trans. Prog. Lang., vol. 5,4 pp. 596-619, Oct. 1983.
[7] L. Kleinrock,Queueing Systems-Vol. I: Theory. New York: Wiley, 1975.
[8] B. W. Lampson, "Hints for computer system design,"IEEE Software, vol. 1, no. 1, pp. 11-28, Jan. 1984.
[9] U. Manber, "Concurrent maintenance of binary search trees,"IEEE Trans. Software Eng., vol. SE-10, no. 6, pp. 777-784, Nov. 1984.
[10] U. Manber and R. E. Ladner, "Concurrency control in a dynamic search structure,"ACM Trans. Database Syst., vol. 9, pp. 439-455, 1984.
[11] S. Owicki and D. Gries, "Verifying properties of parallel programs: An axiomatic approach,"Commun. ACM, vol. 19, pp. 279-285, May 1976.
[12] I. L. Yen, "The role of parallel processing in application programs," M.S. thesis, Dep. Comput. Sci., Univ. Houston-University Park, May 1985.

Index Terms:
program verification; multilevel data structure; data organization; maintenance processes; concurrency; correctness proof; data structures; program verification; programming theory; software reliability
A. Moitra, S.S. Iyengar, F.B. Bastani, I.L. Yen, "Multilevel Data Structures: Models and Performance," IEEE Transactions on Software Engineering, vol. 14, no. 6, pp. 858-867, June 1988, doi:10.1109/32.6164
Usage of this product signifies your acceptance of the Terms of Use.