Storage Architecture and Data ReliabilityIntroduction and ContextComputer systems are useful only when they can preserve programs and data reliably and make that data available at an acceptable speed. Storage architecture is therefore more than a choice between a hard disk and a solid-state drive. It is the coordinated design of storage media, controllers, buses, caches, buffers, file systems, redundancy mechanisms, backup processes, and recovery procedures. Storage systems must satisfy several competing requirements: - Capacity: how much data can be retained.
- Performance: how quickly data can be read or written.
- Reliability: how consistently the system operates without data loss.
- Availability: whether data remains accessible during component failures.
- Endurance: how much writing a medium can tolerate.
- Cost and energy efficiency: whether the design is economically sustainable.
- Manageability: how easily the system can be monitored, repaired, expanded, and recovered.
A fast storage device does not automatically provide reliable data protection. Similarly, a highly redundant array is not a substitute for an independent backup. Sound storage architecture matches technology and protection mechanisms to workload requirements and the consequences of data loss. Learning ObjectivesBy the end of this chapter, you should be able to: - Explain the storage hierarchy and the roles of cache, main memory, local storage, and archival storage.
- Compare magnetic, solid-state, optical, tape, and emerging storage technologies.
- Describe latency, throughput, IOPS, queue depth, endurance, and reliability metrics.
- Explain RAID levels, their benefits, and their limitations.
- Distinguish buffering, caching, replication, fault tolerance, and backup.
- Apply capacity, performance, and reliability calculations to storage decisions.
- Select storage architectures for organizational workloads.
- Discuss governance, security, sustainability, and contemporary storage developments.
1. The Storage HierarchyStorage hierarchy arranges storage technologies according to speed, cost per bit, capacity, and persistence. At the top are small, expensive, very fast structures; at the bottom are large, inexpensive, slower structures. | Level | Typical technology | Persistence | Main purpose |
|---|
| Processor registers | Flip-flop or latch circuits | No | Immediate instruction execution | | Cache | SRAM | No | Reduce processor-memory latency | | Main memory | DRAM | No | Active programs and data | | Local solid-state storage | NAND flash SSD | Yes | Operating systems, applications, databases | | Magnetic storage | HDD | Yes | Bulk online data | | Nearline and archive | Tape, optical, object archive | Yes | Long-term retention and backup |
The hierarchy exists because no single technology simultaneously offers maximum speed, capacity, low cost, and unlimited endurance. Data is moved between levels according to use patterns. Frequently used data may be copied into a faster level, while inactive data is migrated to less expensive storage. A cache stores copies of data to reduce access time. A buffer temporarily holds data while two components operate at different rates or transfer sizes. A cache is generally intended to exploit repeated access; a buffer is intended to absorb timing or rate differences. The same physical memory can sometimes perform both roles, but the concepts are different. Locality and the hierarchyStorage hierarchies depend on locality: - Temporal locality: recently used data is likely to be used again.
- Spatial locality: data near recently used data is likely to be accessed soon.
- Sequential locality: a workload accesses data in an ordered stream.
Operating systems exploit locality through page caches, read-ahead, write-back caching, and file-system metadata caching. A database may add its own buffer pool. Multiple caching layers can improve performance, but they can also cause inconsistency or duplicate data if their policies are poorly coordinated. 2. Storage Media and InterfacesMagnetic disk storageA hard disk drive stores bits as changes in magnetisation on rotating platters. A spindle motor rotates the platters, while actuator arms position read/write heads over tracks. Access time includes mechanical positioning and rotational waiting. A simplified average access-time model is: Taccess = Tseek + Trotation + Ttransfer + Tcontroller Here, Taccess is total access time, Tseek is head-seek time, Trotation is rotational latency, Ttransfer is data-transfer time, and Tcontroller represents controller and interface overhead. The model assumes one request and excludes queueing delay. It is useful for understanding components of delay, not for predicting every real workload. For a disk rotating at R revolutions per minute, one full revolution takes 60/R seconds. Under the usual assumption that a request arrives at a random rotational position, average rotational latency is approximately half a revolution: Trotation ≈ 30/R seconds For a 7,200 rpm disk, average rotational latency is approximately 30/7200 = 0.00417 seconds, or 4.17 ms. Actual service time also includes seeking, transfer, firmware processing, and queueing. HDDs provide high capacity at relatively low cost and are suitable for sequential workloads, bulk files, backup repositories, and infrequently modified data. Their disadvantages include mechanical wear, vibration sensitivity, higher random-access latency, and lower input/output operations per second than SSDs. Solid-state storageSolid-state drives use non-volatile NAND flash memory. NAND stores charge in cells, and controllers manage logical-to-physical mapping, error correction, garbage collection, wear levelling, bad-block management, and sometimes compression. Common NAND cell types include: - SLC: one bit per cell; high endurance and performance, high cost.
- MLC: two bits per cell; a compromise between cost and endurance.
- TLC: three bits per cell; common in general-purpose SSDs.
- QLC: four bits per cell; high density and low cost, generally lower write endurance and sustained-write performance.
SSDs eliminate seek and rotational delay, so random access is much faster than on HDDs. However, writes are not completely simple. NAND is commonly programmed in pages and erased in larger blocks. Updating a small region can require reading valid pages, writing them elsewhere, and erasing a block. This process contributes to write amplification. A useful endurance relationship is: WAF = NANDwrites / Hostwrites WAF is write amplification factor. Both numerator and denominator refer to the same time period and use the same units, such as terabytes written. A value greater than 1 means the flash media performs more physical writing than the host requested. Compression, over-provisioning, workload randomness, and garbage collection affect the value. Theoretical flash endurance is not a guarantee of uninterrupted operation. SSDs can fail because of controller faults, firmware defects, power-loss events, connector problems, or accumulated uncorrectable errors. Enterprise SSDs may include power-loss protection, stronger error correction, and higher rated drive writes per day. Optical, tape, and object-oriented archival storageOptical media use lasers to read and sometimes write marks or changes in reflective material. They are useful for distribution and some offline archives, but their capacity and performance are generally less competitive than disk and tape for large data centres. Magnetic tape provides very low cost per stored bit and excellent offline protection against ransomware and online system failures. Tape has high access latency because locating data requires winding the medium, but it can provide high sequential throughput. It is therefore appropriate for backup and long-term archives rather than interactive applications. Object storage presents data as objects with content, metadata, and an identifier rather than as traditional disk blocks or hierarchical files. It scales across many nodes and is common in cloud platforms, data lakes, media repositories, and backup systems. Its access latency and consistency model must be considered before using it for transactional workloads. Emerging technologiesEmerging and specialised technologies include storage-class memory, persistent memory, DNA storage research, holographic concepts, computational storage, and advanced magnetic recording. Their practical value depends on cost, standards, endurance, software support, and operational maturity. Examples include: - Persistent memory: memory-like access with non-volatile retention, potentially reducing data movement between memory and storage.
- Computational storage: processing is moved closer to stored data, reducing network traffic for selected tasks.
- Heat-assisted magnetic recording and microwave-assisted recording: techniques intended to increase disk areal density.
- Zoned storage: the host follows placement rules that reduce device-managed write overhead.
Emerging technology should be adopted through controlled pilots. A promising laboratory result does not necessarily imply a reliable, supportable production platform. 3. Interfaces, Blocks, and Data MovementStorage devices communicate through interfaces such as SATA, SAS, Fibre Channel, USB, and PCI Express. NVMe is a protocol designed for non-volatile memory over PCI Express. It supports many queues and large numbers of concurrent commands, reducing overhead compared with protocols originally designed for mechanical disks. A storage request passes through several layers: application, file system or database, operating-system block layer, driver, controller, interconnect, device firmware, and media. Each layer can add latency, reorder requests, cache data, or report errors. Performance testing must therefore identify the layer being measured. Block size affects performance. Small random requests may produce high IOPS but low bandwidth; large sequential requests may produce high bandwidth with fewer I/O operations. A simple bandwidth relationship is: Bandwidth = IOPS × Blocksize Bandwidth is measured in bytes per second, IOPS in operations per second, and block size in bytes per operation. This relationship assumes that all operations have the same size and that protocol overhead is ignored. For mixed workloads, an average block size can provide only an approximation. For example, 20,000 IOPS using 16 KiB requests gives: 20,000 × 16,384 = 327,680,000 bytes per second, approximately 312.5 MiB/s, using 1 MiB = 1,048,576 bytes. The result is theoretical payload bandwidth; actual application throughput may be lower. Queue depth is the number of outstanding requests. Increasing queue depth can improve device utilisation, but it may increase latency. A system should not maximise IOPS by allowing response time to become unacceptable for users or transactions. 4. Performance Metrics and EvaluationImportant storage metrics include: - Latency: time from request submission to completion.
- Throughput: amount of data transferred per unit time.
- IOPS: completed input/output operations per second.
- Tail latency: high-percentile response time, such as the 95th or 99th percentile.
- Queue depth: outstanding requests awaiting service.
- Availability: proportion of required time during which service is usable.
- Utilisation: fraction of device or service capacity in use.
A basic throughput calculation is: Throughput = Datatransferred / Elapsedtime Units must be kept consistent. If 600 GB is transferred in 120 seconds, throughput is 5 GB/s under decimal units. It should not be silently reported as 5 GiB/s. A common availability expression is: Availability = MTBF / (MTBF + MTTR) MTBF is mean time between failures and MTTR is mean time to repair or restore. The model assumes a stable failure and repair process and excludes planned downtime unless it is included in the definitions. A component with high availability may still lose data if redundancy and backup are inadequate. Benchmark results must specify request size, read/write ratio, sequential or random pattern, queue depth, concurrency, cache state, data set size, duration, and measurement location. Vendor peak figures are not substitutes for workload-specific testing. 5. RAID and Fault ToleranceRAID, or Redundant Array of Independent Disks, combines multiple devices to improve capacity, performance, fault tolerance, or a combination of these objectives. RAID protects against specified device failures; it does not protect against accidental deletion, malware, fire, defective software, or all controller failures. | Level | Organisation | Strengths | Limitations |
|---|
| RAID 0 | Striping, no redundancy | High performance and full aggregate capacity | Any disk failure can destroy the array | | RAID 1 | Mirroring | Simple recovery and strong read availability | Approximately half raw capacity | | RAID 5 | Striping with single distributed parity | Efficient capacity and one-device fault tolerance | Write penalty; vulnerable during rebuild | | RAID 6 | Striping with dual parity | Tolerates two device failures | More parity overhead and write cost | | RAID 10 | Mirrored pairs striped together | Strong random-write performance and redundancy | Approximately half raw capacity |
For N equal-sized drives, ideal usable capacity is approximately: CR0 = N × C for RAID 0, and CR1 ≈ (N/2) × C for an even number of drives in RAID 1. For RAID 5 and RAID 6, simplified capacity estimates are: CR5 ≈ (N − 1) × C CR6 ≈ (N − 2) × C C is the capacity of one drive, and all drives are assumed to have equal usable capacity. Formatting, metadata, hot spares, and vendor capacity conventions reduce actual usable capacity. RAID 5 can continue operating after one drive failure. RAID 6 can continue after two. During a rebuild, the array reads surviving data and reconstructs missing data. Rebuild time and workload stress can be substantial, especially with large, high-capacity disks. A second failure or an unrecoverable read error during reconstruction can cause data loss. RAID 10 often offers better write performance and shorter recovery exposure than parity RAID, but uses more raw capacity. Reliability and failure domainsRedundancy is meaningful only when failures are independent enough for the design. Two mirrored disks in the same enclosure may both be lost through power failure, flooding, controller failure, or human error. Protection should therefore be considered across failure domains: - Device or flash package.
- Disk shelf or server.
- Rack, room, or power domain.
- Site or data centre.
- Geographic region.
Replication across sites provides availability and disaster recovery, but synchronous replication can add latency and asynchronous replication can lose recent updates when the primary site fails. 6. Buffering, Caching, and Write SafetyA write-back cache acknowledges a write before it reaches permanent media. This can improve performance, but it creates a risk if power is lost. Battery-backed or flash-backed cache, together with power-loss protection, allows acknowledged data to survive a sudden outage. A write-through cache acknowledges only after data has reached the defined persistence boundary, usually providing stronger safety at the cost of latency. The persistence boundary must be documented. Data may be in an application buffer, operating-system cache, controller cache, device cache, or non-volatile media. The command used to flush or force data persistence must be correctly supported by every layer. Read-ahead helps sequential workloads but may waste bandwidth for random access. Cache pollution occurs when pre-fetched data displaces more useful data. Database systems often disable or control operating-system caching because they maintain their own buffer-management policies. 7. Backup, Recovery, and Data ReliabilityRAID is availability technology; backup is recovery technology. A backup is a separate, recoverable copy maintained so that data can be restored after deletion, corruption, compromise, or disaster. A practical backup strategy considers: - Recovery point objective (RPO): maximum acceptable amount of data loss measured in time.
- Recovery time objective (RTO): maximum acceptable time to restore service.
- Retention period: how long versions must be preserved.
- Consistency: whether related databases and files are captured in a recoverable state.
- Isolation: whether attackers or administrators can alter every copy.
- Testing: whether restoration has been demonstrated.
The 3-2-1 principle recommends at least three copies, on two different media or storage systems, with one copy off-site. Many organisations extend this to 3-2-1-1-0: one offline or immutable copy and zero unverified backup errors. Backup methods include: - Full backup: copies all selected data.
- Incremental backup: copies changes since the previous backup of any type.
- Differential backup: copies changes since the last full backup.
- Snapshot: records a point-in-time view, often using copy-on-write metadata.
- Replication: maintains another current copy, usually for availability rather than historical recovery.
Snapshots are fast and space-efficient but may share the same storage failure domain. A ransomware attack or array failure can therefore affect both primary data and snapshots. Backups should use encryption, access control, immutable retention where appropriate, and regular restore tests. 8. Reliability, Endurance, and Data IntegrityReliability concerns the probability that a system performs its required function for a specified period. Storage reliability has several dimensions: - Device failure.
- Bit errors and uncorrectable read errors.
- Silent data corruption.
- Firmware or controller faults.
- Power-loss corruption.
- Human and software errors.
- Environmental damage.
Error-correcting codes add redundancy so that some bit errors can be detected and corrected. End-to-end checksums are also important because a correct device-level read does not prove that the application received the intended data. File systems such as ZFS and other integrity-focused systems can use checksums, scrubbing, and redundant copies to detect and repair corruption. For SSDs, endurance is often expressed as TBW, or terabytes written, or DWPD, drive writes per day. If a drive has usable capacity C and a rated D drive writes per day over a warranty period of Y years, an approximate total rated host-write endurance is: TBW ≈ C × D × 365 × Y When C is measured in TB, this result is in TB. The estimate assumes a constant daily workload and uses the manufacturer’s definition of capacity and warranty period. It does not predict an exact failure date and should be adjusted for write amplification and workload variability when planning. 9. Selecting Storage for Organizational WorkloadsSelection should begin with workload requirements, not with a device brand. A useful process is: - Classify data by value, sensitivity, access pattern, and retention.
- Measure read/write ratio, request size, concurrency, and burst behaviour.
- Define RPO, RTO, availability, and performance targets.
- Estimate capacity growth and endurance requirements.
- Identify failure domains and recovery procedures.
- Compare total cost, including power, support, migration, and administration.
- Pilot and benchmark with representative data.
- Document monitoring, replacement, backup, and disposal procedures.
| Workload | Commonly suitable approach | Main design concern |
|---|
| Operating-system boot and virtual machines | SSD, often redundant | Random latency and failure recovery | | Transactional database | Enterprise SSD, RAID 10 or resilient distributed storage | Low tail latency, write endurance, durable writes | | Video or scientific stream processing | High-throughput SSD/HDD tiers | Sustained bandwidth and capacity | | File sharing | HDD or hybrid tier with snapshots | Capacity, permissions, backup | | Long-term archive | Tape, object archive, or optical combinations | Retention, integrity, retrieval time | | Backup repository | HDD/object storage plus immutable or offline copy | Ransomware resistance and restore throughput |
Illustrative case: regional healthcare providerBackground. A fictional regional healthcare provider operates an electronic medical-record system, imaging archive, office file service, and nightly backup platform. The medical-record database requires rapid transactions and an RPO of 15 minutes. Imaging data is large, mostly sequential, and accessed frequently during the first few weeks after creation. Historical images are rarely accessed. Problem. The organisation uses one large HDD array. Users report delays during clinic hours, rebuilds take several days, and backups are stored in the same building. A malware incident could therefore affect both operational data and recovery copies. Analysis. The database has random, latency-sensitive reads and writes, so HDD seek time is unsuitable. Imaging requires high capacity and sequential throughput, but not all images require premium flash. The existing array has no independent disaster copy, and RAID alone cannot address deletion or malware. Approach. The provider places the database on enterprise SSDs in a redundant layout with protected write cache. Recent imaging data is placed on a hybrid tier using SSD metadata and HDD capacity. Older images move to object or tape archive according to retention policy. Backups are encrypted and copied to a separate site; one backup tier is immutable or offline. Database logs are transferred frequently to support the 15-minute RPO. Restoration is tested quarterly, and monitoring tracks latency, media errors, capacity, SSD wear, rebuild status, and backup success. Outcome. Transaction latency improves because random operations are served from SSDs. Capacity costs remain controlled because archival data uses lower-cost media. The provider gains recovery capability against accidental deletion and site loss rather than relying on RAID alone. Learning points. Workload-specific tiering is more effective than placing all data on one medium. RPO and RTO determine backup and replication design. A storage architecture must be evaluated as an operational process, not only as a hardware purchase. 10. Governance, Security, and SustainabilityStorage frequently contains personal, financial, medical, or proprietary information. Governance should address classification, least-privilege access, encryption in transit and at rest, key management, retention, legal holds, audit logs, and secure disposal. Encryption without effective key protection can become unusable; key loss can be equivalent to data loss. Organisations should comply with relevant privacy, records-management, sectoral, and cybersecurity requirements. Retaining every copy indefinitely increases legal exposure, storage cost, and breach impact. Conversely, deleting regulated records prematurely can violate obligations. Storage also has environmental costs. Capacity planning, compression, deduplication, efficient cooling, device reuse, and lifecycle-aware procurement can reduce energy and electronic waste. Deduplication can reduce required capacity, but it adds processing overhead and may complicate recovery if metadata is damaged. Sustainable design balances energy, availability, performance, and retention needs. 11. Contemporary Directions and LimitationsCurrent storage architecture increasingly separates compute, memory, and storage through high-speed fabrics and software-defined control. Cloud platforms offer elastic object, block, and file services, but customers remain responsible for configuration, identity, backup, and data lifecycle decisions. Multi-cloud replication can reduce provider dependence but increases cost and operational complexity. Artificial intelligence affects storage in two principal ways. First, AI workloads generate large data sets and demand high-throughput, parallel storage. Second, machine-learning methods can assist anomaly detection, failure prediction, tiering, and capacity forecasting. Such automation should remain explainable and monitored: a false prediction that migrates active data or suppresses an alert can damage service. No storage design eliminates risk. Redundancy can mask a failing device until several failures occur. Compression can make capacity estimates uncertain. Benchmarks may not represent real applications. Cloud replication can create a false sense of safety. Reliability is therefore achieved through layered controls, measurement, tested recovery, and disciplined operations. Best-Practice Checklist- Match media to access pattern, not merely to advertised speed.
- Separate availability mechanisms from backup mechanisms.
- Define RPO and RTO before selecting replication or backup technology.
- Use protected write caches where durable acknowledgements are required.
- Monitor latency percentiles, errors, wear, capacity, queue depth, and rebuilds.
- Use checksums, scrubbing, and end-to-end integrity validation where appropriate.
- Test restoration, including application-consistent restoration.
- Isolate at least one backup copy from ordinary administrative credentials.
- Plan for failure domains wider than a single device.
- Reassess architecture as data volume, workload, regulations, and technology change.
Chapter SummaryStorage architecture is a hierarchy of technologies and policies that balances speed, capacity, cost, endurance, availability, and recoverability. Magnetic disks provide economical capacity but have mechanical latency; SSDs provide fast random access but have write-management and endurance considerations; tape, object storage, and other archival technologies support economical long-term retention. Performance must be evaluated using latency, throughput, IOPS, queue depth, and tail behaviour under a specified workload. RAID improves availability and may improve performance, but RAID is not backup and does not protect against logical, site-wide, or security incidents. Buffering and caching improve data movement but require careful treatment of persistence and power loss. Reliable organisations combine redundancy, checksums, monitoring, backup, immutable or offline copies, and tested restoration. Storage selection should begin with workload and business requirements, then proceed through capacity, endurance, recovery, governance, security, and lifecycle analysis. Key TermsStorage hierarchy: Arrangement of storage levels by speed, cost, capacity, and persistence. Cache: A copy of data maintained to reduce access time for repeated requests. Buffer: Temporary storage that absorbs differences in timing, rate, or transfer size. Latency: Time required to complete a storage request. Throughput: Quantity of data transferred per unit time. IOPS: Input/output operations completed per second. Queue depth: Number of outstanding storage requests. HDD: Magnetic hard disk drive using rotating platters and moving heads. SSD: Solid-state drive using non-volatile flash memory. NAND flash: Non-volatile semiconductor memory used widely in SSDs. Write amplification: Ratio of physical media writes to host-requested writes. Endurance: Amount of writing or operating stress a device can tolerate. RAID: Redundant array of independent disks combining several devices for performance or fault tolerance. Parity: Redundant information used to reconstruct lost data. Replication: Maintaining another copy of data on a separate system or site. Backup: A recoverable copy retained for restoration after loss or corruption. RPO: Maximum acceptable data loss expressed as a time interval. RTO: Maximum acceptable time to restore service. Tail latency: High-percentile request latency, such as the 99th percentile. Failure domain: A set of components likely to fail from one common event. Review QuestionsShort Answer Questions- What are temporal and spatial locality, and why do they matter in storage hierarchy design?
- State two differences between a buffer and a cache.
- Why does an SSD still require garbage collection and wear levelling?
- What failures can RAID protect against, and what failures can it not normally protect against?
- Define RPO and RTO.
Long Answer Questions- Compare HDDs, SSDs, tape, and object storage for performance, capacity, endurance, and organizational use.
- Explain RAID 5, RAID 6, and RAID 10, including their capacity and fault-tolerance trade-offs.
- Discuss how caching, write persistence, power-loss protection, and checksums affect data reliability.
- Describe a complete backup and recovery strategy for a medium-sized organization.
- Explain why storage benchmarking must specify workload characteristics rather than relying on vendor peak figures.
Analytical / Application Questions- An organization has eight equal 12 TB drives and requires tolerance of two drive failures. Compare the approximate usable capacity of RAID 6 and RAID 10, and recommend one for a write-intensive database with justification.
- A service performs 25,000 IOPS with 8 KiB requests. Calculate its approximate payload bandwidth and explain why the measured application bandwidth may be lower.
- A hospital requires an RPO of 15 minutes and an RTO of two hours for a clinical database. Design a layered storage, replication, backup, and testing approach that meets these objectives and addresses ransomware and site failure.
Multiple Choice Questions with AnswersQuestion 1Which storage technology uses rotating platters and mechanical read/write heads? A. NAND flash SSD B. Magnetic HDD C. Optical cache D. DRAM Correct Answer: B. Magnetic HDD Question 2What is the primary purpose of a buffer? A. To provide permanent archival retention B. To correct all media errors C. To absorb differences in timing or transfer rate D. To duplicate data across geographic sites Correct Answer: C. To absorb differences in timing or transfer rate Question 3What does RAID 6 normally tolerate? A. No device failures B. One device failure C. Two device failures D. Failure of every device Correct Answer: C. Two device failures Question 4Which metric measures completed input/output operations per second? A. IOPS B. RTO C. MTTR D. TBW Correct Answer: A. IOPS Question 5A device performs 10,000 IOPS with 4 KiB requests. What is the approximate payload bandwidth? A. 4 KiB/s B. 2.5 MiB/s C. 40 MiB/s D. 400 MiB/s Correct Answer: C. 40 MiB/s Question 6Which statement best distinguishes RAID from backup? A. RAID protects against all forms of data loss B. Backup improves only random-read performance C. RAID mainly supports availability, while backup supports recovery from logical or major loss D. Backup requires all data to be stored on one disk Correct Answer: C. RAID mainly supports availability, while backup supports recovery from logical or major loss Question 7What does write amplification compare? A. Read latency with write latency B. Physical media writes with host-requested writes C. Capacity with queue depth D. RPO with RTO Correct Answer: B. Physical media writes with host-requested writes Question 8Which workload is generally most suitable for magnetic tape? A. Low-latency transaction processing B. Interactive random database updates C. Long-term sequential backup and archive D. Processor register access Correct Answer: C. Long-term sequential backup and archive Question 9If an organization can tolerate at most 15 minutes of recent data loss, which target is 15 minutes? A. RTO B. RPO C. MTBF D. IOPS Correct Answer: B. RPO Question 10Why can increasing queue depth fail to improve user experience? A. It always reduces capacity to zero B. It can increase latency even when it raises device utilisation C. It disables error correction permanently D. It converts SSDs into magnetic disks Correct Answer: B. It can increase latency even when it raises device utilisation
|