benchmarks.wiki / Public workspace

MMLU-Pro / 10591 / Two alternatives for interconnecting a set of processors with bidirectional…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

question

Two alternatives for interconnecting a set of processors with bidirectional links are (1) the fully interconnected network, in which each processor is directly connected to every other processor, and (2) the ring network, in which each processor is connected to two other processors. The worst-case path length for a network is the maximum, over all pairs of nodes in the network, of the minimum length paths (measured in number of links) between the nodes. For each type of interconnection of n processors, a figure of merit can be formed as the product of the number of links required for the network times the worst-case path length connecting any two processors. The ratio of this figure of merit for the fully interconnected network compared to that of the ring network, for even n > 2, is

category

computer science

options

  1. (n-1)/n
  2. 1/(2n)
  3. 1/(n^2)
  4. n/(n-1)
  5. 1/(n(n-1))
  6. 1/n
  7. 1/(n+1)
  8. n^2
  9. (n+1)/n
  10. 2n

src

ori_mmlu-college_computer_science

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

Official source

initial import