Which two statements regarding the Hitachi Dynamic Link Manager Round Robin algorithms are true? (Choose two.)

Question

Options

• AThe Round Robin algorithm distributes I/Os by alternating requests across two data paths.
• BThe Round Robin algorithm distributes I/Os by alternating requests across all available data
• CThe Extended Round Robin algorithm distributes I/Os to paths depending on whether the I/O
• DThe Extended Round Robin algorithm distributes sequential I/Os to a set of paths and random

• A
  16% (5)
• B
  77% (24)
• D
  6% (2)

Explanation

B is correct because the standard Round Robin algorithm distributes I/Os evenly across all available data paths in a rotating sequence, maximizing load balancing across every active path. C is correct because the Extended Round Robin algorithm is I/O-type-aware - it distinguishes between sequential and random I/Os and routes them to different path sets accordingly, which optimizes throughput based on workload characteristics.

A is wrong because it claims Round Robin alternates across only two paths - this is a fabricated limitation; Round Robin uses all available paths, not a fixed count of two. D is incorrect because, while it references sequential and random I/Os like option C, it misrepresents how Extended Round Robin assigns those I/Os to paths (likely reversing or mischaracterizing the path grouping logic).

Memory tip: Think of it as "R = Round = All Roads" - standard Round Robin sends traffic down every available path. "E = Extended = Evaluates" - Extended Round Robin evaluates the I/O type before choosing a path, like a smart traffic officer directing trucks vs. cars to different lanes.

No community discussion yet for this question.