Which two statements regarding the Hitachi Dynamic Link Manager Least I/O and Least Block algorithms are true? (Choose two.)

Question

Options

• AThe Least I/O and Least Block algorithms redirect the I/Os to a single path determined by the
• BThe Least I/O and Least Block algorithms redirect the I/Os to a pair of paths determined by the
• CThe Extended Least I/O and Extended Least Block algorithms distribute sequential I/Os to a set
• DThe Extended Least I/O and Extended Least Block algorithms distribute I/Os to paths depending

• A
  85% (33)
• B
  5% (2)
• C
  10% (4)

Explanation

Least I/O and Least Block are "winner-takes-all" algorithms - at any given moment, all new I/Os are directed to the single path that currently has the lowest pending I/O count (Least I/O) or lowest pending block count (Least Block), making A correct. Extended Least I/O and Extended Least Block improve on this by dynamically distributing I/Os across multiple paths depending on their current load, rather than funneling everything to one winner - making D correct. Option B is wrong because the basic algorithms use one path, not a pair. Option C is wrong because the Extended algorithms don't selectively distribute only sequential I/Os - they distribute I/Os broadly based on real-time path load. Memory tip: Think of the "Extended" prefix as extending the selection from a single best path to a weighted distribution across many paths - like upgrading from "pick the fastest lane" to "continuously balance traffic across all lanes."

No community discussion yet for this question.