Vector register design for polycyclic vector scheduling
References
[1]
J. Tang, E. S. Davidson, and J. Tong, " Polycyclic Vector Scheduling vs. Chaining on 1-Port Vector Supercomputers," in Proc. of Supercomputing '88, pp. 122-129, 19 88.
[2]
J. L. Hennessy and D. A. Patterson, Computer Architecture: A Quantitative Approach, chapter 6.8, Morgan Kaufmann Publishers, 1990.
[3]
C. Eisenbeis, W. J alby, and A. Lichnewsky, "Squeezing More CPU Performance Out of a Cray-2 by Vector Block Scheduling," in Proc. of Supercomputing '88, pp. 237-246, 1988.
[4]
B. R. Rau, C. D. Glaeser, and R. L. Picard, "Efficient Code Generation for Horizontal Architectures' Compiler Techniques and Architectural Support," in Proc. of 9th Annual isca, pp. 295-304, 1982.
[5]
B. R. Rau, D. W. L. Yen, W. Yen, and R. A. Towle, "The Cydra 5 Departmental Supercomputer," IEEE Computer, pp. 12-35, 1989.
[6]
J. H. Patel and E. S. Davidson, "Improving the Throughput of a Pipeline by Insertion of Delays," in Proc. Third Annual I$CA, pp. 159-164, 1976.
[7]
P. Y. Hsu, Highly Concurrent Scalar Processing, PhD thesis, Coordinated Science Laboratory Report #49, Univ. of Illinois, 1986.
[8]
C. Eisenbeis, W. J alby, and A. Lichnewsky, "Compile-Time Optimization of Memory and Register Usage on the Cray2," in Proceedings of the Second Workshop on Languages and Compilers, Urbana llinois, August 1989.
[9]
M. Lam, A Systolic Array Optimizing Compiler, PhD thesis, Carnegie Mellon University, 1987.
[10]
F. H. McMahon, "The Livermore Fortran Kernels: A Computer Test of the Numerical Performance Range," Technical Report UCRL-53745, Lawrence Livermore National Laboratory, December 1986.
[11]
B. R. Rau, M. S. Schlansker, and D. W. L. Yen, "The Cydra 5 Stride-Insensitive Memory System," in Proc. of International Conference on Parallel Processing, pp. 1-242-246, 1989.
Index Terms
- Vector register design for polycyclic vector scheduling
Recommendations
Vector Register Allocation
The problem of allocating vector registers on supercomputers is addressed in the context of compiling vector languages. Two subproblems must be solved to achieve good vector register allocation. First, the vector operations in the source program must be ...
Polycyclic Vector scheduling vs. Chaining on 1-Port Vector supercomputers
Supercomputing '88: Proceedings of the 1988 ACM/IEEE conference on SupercomputingThis paper studies the impact of chaining and several instruction scheduling schemes on one-memory-port vector supercomputers, illustrated by the Cray-1 and Cray-2. The lack of instruction chaining in the Cray-2 vector processor requires a different ...
Comments
Information & Contributors
Information
Published In
Apr. 1991
305 pages
April 1991320 pages
Copyright © 1991 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 April 1991
Published in SIGPLAN Volume 26, Issue 4
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations8Total Citations
- 463Total Downloads
- Downloads (Last 12 months)64
- Downloads (Last 6 weeks)16
Reflects downloads up to 12 Aug 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in