An introduction to disk drive modeling

Ruemmler, Chris; Wilkes, John

doi:10.1109/2.268881

Cited by 637 publications

(298 citation statements)

References 2 publications

Supporting

Mentioning

290

Contrasting

Unclassified

Order By: Relevance

“…In principle, this requires a detailed model of the disk, including its topology in terms of tracks and sectors, and its internal features such as whether or not it caches read data [586]. But such a model cannot be applied if we don't know how the file data is mapped to the disk topology in the first place.…”

Section: I/o Operations and Disk Layoutmentioning

confidence: 99%

Workload Modeling for Computer Systems Performance Evaluation

Feitelson

2015

197

131

View full text Add to dashboard Cite

Reliable performance evaluations require the use of representative workloads. This is no easy task since modern computer systems and their workloads are complex, with many interrelated attributes and complicated structures. Experts often use sophisticated mathematics to analyze and describe workload models, making these models difficult for practitioners to grasp. This book aims to close this gap by emphasizing the intuition and the reasoning behind the definitions and derivations related to the workload models. It provides numerous examples from real production systems, with hundreds of graphs. Using this book, readers will be able to analyze collected workload data and clean it if necessary, derive statistical models that include skewed marginal distributions and correlations, and consider the need for generative models and feedback from the system. The descriptive statistics techniques covered are also useful for other domains.

show abstract

Section: I/o Operations and Disk Layoutmentioning

confidence: 99%

Workload Modeling for Computer Systems Performance Evaluation

Feitelson

2015

197

131

View full text Add to dashboard Cite

show abstract

“…They include all the I/O activity generated from 1/14/1999 to 2/28/1999 at the disk interface of the cello system. A detailed description of similar traces of 1992, collected in the same system, can we found in [5]. We will use packets with a payload equal to the size specified in the trace for the I/O accesses, but if the access is larger than 512 bytes, we will split it into packets with a payload of 512 bytes at most.…”

Section: Simulation Modelmentioning

confidence: 99%

Evaluation of Routing Algorithms for InfiniBand Networks

Gómez

Flich

Robles

et al. 2002

Euro-Par 2002 Parallel Processing

View full text Add to dashboard Cite

Abstract. Storage Area Networks (SANs) provide the scalability required by the IT servers. InfiniBand (IBA) interconnect is very likely to become the de facto standard for SANs as well as for NOWs. The routing algorithm is a key design issue in irregular networks. Moreover, as several virtual lanes can be used and different network issues can be considered, the performance of the routing algorithms may be affected. In this paper we evaluate three existing routing algorithms (up*/down*, DFS, and smart-routing) suitable for being applied to IBA. Evaluation has been performed by simulation under different synthetic traffic patterns and I/O traces. Simulation results show that the smart-routing algorithm achieves the highest performance.

show abstract

“…This will however just increase the significance of the I/O bottleneck since the development of disk technology lacks behind developments in CPU technology. At present, technological advances are increasing CPU speed at an annual rate of 40-60% while disk transfer rates are only increasing by 7-10% annually [25].…”

Section: Introductionmentioning

confidence: 99%

The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation

Arge¹

1996

BRICS

View full text Add to dashboard Cite

Ordered Binary-Decision Diagrams (OBDD) are the state-of-theart data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. OBDDs have been successfully used to solve problems in e.g. digital-systems design, verification and testing, in mathematical logic, concurrent system design and in artificial intelligence. The OBDDs used in many of these applications quickly get larger than the avaliable main memory and it becomes essential to consider the problem of minimizing the Input/Output (I/O) communication. In this paper we analyze why existing OBDD manipulation algorithms perform poorly in an I/O environment and develop new I/O-efficient algorithms. * An extended abstract version of this paper was presented at the Sixth International Symposium on Algorithms and Computation (ISAAC'95).

show abstract

An introduction to disk drive modeling

Cited by 637 publications

References 2 publications

Workload Modeling for Computer Systems Performance Evaluation

Workload Modeling for Computer Systems Performance Evaluation

Evaluation of Routing Algorithms for InfiniBand Networks

The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation

Contact Info

Product

Resources

About