Mathematical Models of Fire Growth
C. H. C. Leung · The Computer Journal · 1985
The number of records in a file system is often recognised as a key determinant of efficiency. For example, the performance of sequential processing is O(N(t)) and that of tree search is O(logN(t)), where N(t) is the number of records in the file at time t. In this paper, the growth behaviour of files is studied in terms of quite general record insertion and deletion characteristics, and the performance evolution of some of the common systems is analysed. The growth data of an actual system are compared with the model results and reasonable agreement is observed.