Multilevel data structures: models and performance

Author

Moitra, Abha ; Iyengar, S. Sitharama ; Bastani, Farokh B. ; Yen, I. Ling

Author_Institution

Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA

Volume

14

Issue

6

fYear

1988

fDate

6/1/1988 12:00:00 AM

Firstpage

858

Lastpage

867

Abstract

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

Keywords

data structures; program verification; programming theory; software reliability; concurrency; correctness proof; data organization; maintenance processes; multilevel data structure; program verification; Binary search trees; Computer science; Concurrent computing; Data structures; Delay; Distributed computing; Information science; Processor scheduling; Tail; Tree data structures;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/32.6164

Filename

6164