Mathematical adventures in performance analysis. From storage systems, through airplane boarding, to express line queues (Q405515): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / review text | |||
In the first chapter ``A Classical Model for Storage System Activity'' a simplified model of a disk drive is proposed. The purpose is to estimate the disk utilization. The proved properties of the average total seek time show that considered model is safe to use. In Chapter 2 ``A Fractal Model for Storage System Activity'' the author gives a strict analysis for I/O model which was introduced in [\textit{M. Wang} et al., Perform. Eval. Rev. 49, No. 1, 147--163 (2002; Zbl 1043.68013)]. Some useful basic results are derived. In Chapter 3 ``Airplane Boarding, Disk Scheduling, and Lorentzian Geometry'' the problem of minimizing the airplane boarding time is considered. The author shows the close connection between I/O disk scheduling and airplane boarding problems. It is shown how Lorentzian geometry can be used for approximation of an optimal boarding time. Chapter 4 ``Mirrored Configurations'' considers the situation when any file has a copy on each of two disks. The problem of configuration the file placement to optimize the performance of data reading is solved. The problem is stated in the terms of graph theory. The fifth chapter ``On Queues and Numbers'' considers a problem of effective managing a mini-market with two checkout counters. Some well solvable special cases of the problem are derived. Especial attention is paid to the role of symmetry. The end of each chapter is provided by a number of notes, where related problems are proposed for research. | |||
Property / review text: In the first chapter ``A Classical Model for Storage System Activity'' a simplified model of a disk drive is proposed. The purpose is to estimate the disk utilization. The proved properties of the average total seek time show that considered model is safe to use. In Chapter 2 ``A Fractal Model for Storage System Activity'' the author gives a strict analysis for I/O model which was introduced in [\textit{M. Wang} et al., Perform. Eval. Rev. 49, No. 1, 147--163 (2002; Zbl 1043.68013)]. Some useful basic results are derived. In Chapter 3 ``Airplane Boarding, Disk Scheduling, and Lorentzian Geometry'' the problem of minimizing the airplane boarding time is considered. The author shows the close connection between I/O disk scheduling and airplane boarding problems. It is shown how Lorentzian geometry can be used for approximation of an optimal boarding time. Chapter 4 ``Mirrored Configurations'' considers the situation when any file has a copy on each of two disks. The problem of configuration the file placement to optimize the performance of data reading is solved. The problem is stated in the terms of graph theory. The fifth chapter ``On Queues and Numbers'' considers a problem of effective managing a mini-market with two checkout counters. Some well solvable special cases of the problem are derived. Especial attention is paid to the role of symmetry. The end of each chapter is provided by a number of notes, where related problems are proposed for research. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Svetlana A. Kravchenko / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90-02 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B22 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 53B30 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68M20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 54C70 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B50 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C80 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 54E35 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6340483 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
disk drives | |||
Property / zbMATH Keywords: disk drives / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
performance analysis | |||
Property / zbMATH Keywords: performance analysis / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
metric spaces | |||
Property / zbMATH Keywords: metric spaces / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
I/O modeling | |||
Property / zbMATH Keywords: I/O modeling / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
entropy | |||
Property / zbMATH Keywords: entropy / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
dynamical systems | |||
Property / zbMATH Keywords: dynamical systems / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
random regular graphs | |||
Property / zbMATH Keywords: random regular graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
queueing | |||
Property / zbMATH Keywords: queueing / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
scheduling | |||
Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/978-3-319-09513-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2499106602 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 23:36, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Mathematical adventures in performance analysis. From storage systems, through airplane boarding, to express line queues |
scientific article |
Statements
Mathematical adventures in performance analysis. From storage systems, through airplane boarding, to express line queues (English)
0 references
5 September 2014
0 references
In the first chapter ``A Classical Model for Storage System Activity'' a simplified model of a disk drive is proposed. The purpose is to estimate the disk utilization. The proved properties of the average total seek time show that considered model is safe to use. In Chapter 2 ``A Fractal Model for Storage System Activity'' the author gives a strict analysis for I/O model which was introduced in [\textit{M. Wang} et al., Perform. Eval. Rev. 49, No. 1, 147--163 (2002; Zbl 1043.68013)]. Some useful basic results are derived. In Chapter 3 ``Airplane Boarding, Disk Scheduling, and Lorentzian Geometry'' the problem of minimizing the airplane boarding time is considered. The author shows the close connection between I/O disk scheduling and airplane boarding problems. It is shown how Lorentzian geometry can be used for approximation of an optimal boarding time. Chapter 4 ``Mirrored Configurations'' considers the situation when any file has a copy on each of two disks. The problem of configuration the file placement to optimize the performance of data reading is solved. The problem is stated in the terms of graph theory. The fifth chapter ``On Queues and Numbers'' considers a problem of effective managing a mini-market with two checkout counters. Some well solvable special cases of the problem are derived. Especial attention is paid to the role of symmetry. The end of each chapter is provided by a number of notes, where related problems are proposed for research.
0 references
disk drives
0 references
performance analysis
0 references
metric spaces
0 references
I/O modeling
0 references
entropy
0 references
dynamical systems
0 references
random regular graphs
0 references
queueing
0 references
scheduling
0 references