SIMD instruction cache

  • Authors:
  • Todd E. Rockoff

  • Affiliations:
  • Discipline of Computer Science, Flinders University, GPO Box 2100, Adelaide 5001 SA, AUSTRALIA

  • Venue:
  • SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

SIMD instruction cache (or I-cache) is proposed to remedy a heretofore un-compensated instruction delivery rate limitation of SIMD computers. This paper introduces the concept of SIMD I-cache and sketches the I-cache design space. On the basis of throughput using chip area as a hardware cost constraint, detailed evaluations of simple I-cache variants for a diverse set of sample problems are presented. Simple I-cache variants occupy negligible area in chips while providing significant speedups, even for problems ordinarily thought to be inherently communication-bound. These results suggest that I-cached SIMD computers exhibit the highest throughput of any multiprocessors for scalable data-parallel problems.