Pseudo-vectorizing Compiler for the SR8000 (Research Note)

Authors:
Hiroyasu Nishiyama;Keiko Motokawa;Ichiro Kyushima;Sumio Kikuchi
Affiliations:
-;-;-;-
Venue:
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Year:
2000

Citing 4
Cited 1

The Cydra 5 Departmental Supercomputer: Design Philosophies, Decisions, and Trade-Offs

Computer
Design and evaluation of a compiler algorithm for prefetching

ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
Pseudo vector processor based on register-windowed superscalar pipeline

Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Iterative modulo scheduling: an algorithm for software pipelining loops

MICRO 27 Proceedings of the 27th annual international symposium on Microarchitecture

Performance Evaluation of the Hitachi SR8000 Using OpenMP Benchmarks

ISHPC '02 Proceedings of the 4th International Symposium on High Performance Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The pseudo-vector processing (PVP) is a framework that enables fast processing similar to vector processing. In this paper, we describe the compiler optimizations that effectively utilize PVP on the SR8000. These include access method analysis, preloading, and prefetching optimizations. Evaluations on the SR8000 indicate that PVP can effectively hides memory latency.