Stochastic analysis of computer storage

From MaRDI portal





Storage and processing time are the two major resources of computer systems. While the latter has received enough attention from the performance evaluation community, the former was left at the outskirts of its interests. This book is intended to present a survey of results and techniques used in the analysis of computer storages. One may ask why the stochastic analysis of computer storage has been relatively slow to develop. The authors suggest that the obvious reason is that the problems of storage have been to difficult to solve. They list several effects that render to this: service mechanism consists of two processes, most of the processes in computer storage are non-Markovian, finite capacities and fragmentation cause other difficulties, and so forth. Nevertheless, this book contradicts in some sense all of these claims, and shows how human ingenuity can tackle these difficult problems and present new insights into these interesting phenomena. One should observe that the most of the results in the analysis of computer storage have been obtained by the authors and their collaborators. This is at least true for the results recoreded from the ``Eastern part of the performance community. The ``Western list of researchers in this area should be appended with some names, most notably Benes. The book is divided according to storage classification, that is, according to physical devices and the purpose they serve. The first chapter is an overview of results and types of processes that are used to describe storage models. Chapter 2, ``Buffer storage deals with storage data transfer, that is, a storage device is treated as the communication interface between input and output processes (i.e., buffer systems). This is the least interesting chapter in the opinion of this referee. Chapter 3, ``Primary computer storage is the most attractive for the referee, and discusses storage processes in primary (random access) computer memories. A reader can find here a survey of queueing results for \(M| G| 1\) storage process, finite memory models, extremely interesting analysis of fragmentation (I encourage to continue reading others paper by Coffman and his collaborators on this topic), and nice, reader-friedly introduction to rigorous treatment of diffusion approximation for storage models. The former chapter is almost entirely based on recent results of V. E. Benes. The latter chapter contains much of the material (two first subsections) from Benes' recent papers. The next two chapters, ``Paged two-level memories: Theory and analysis of algorithms and ``Paged two- level memories: Approximate models and efficient computations deal with analysis and models for virtual memory with paging. Chapter 4 is concerned with the (exact) analyses of different replacement algorithms. The reader may enjoy reading Sections 4.3 and 4.7 which discuss stochastic models for program behavior and performance bounds for replacement algorithms. Chapter 5 is focused on approximate analyses of program behavior. Most part of this section is devoted to a nearly decomposable model. Finally the last chapter, ``Secondary storage deals with queueing-theoretical models of secondary memory. This chapter contains detail analyses of mainly disk storage units. Most of the chapter is based on two papers of Coffman and Hofri. The book is concluded with references containing over 200 publications, and an index.











This page was built for publication: Stochastic analysis of computer storage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4205064)