Cited By
View all- Lennerstad HLundberg L(2003)Chapter 9: Cache memoriesElectronic Notes in Discrete Mathematics10.1016/S1571-0653(04)80608-514(177-214)Online publication date: May-2003
Bounding on the gain of optimizing data layout in vector processors
Pages 235 - 242
References
[1]
A. Deb, "Multiskewing- A Novel Technique for Optimal Parallel Memory Access", IEEE Transactions on Parallel and Distributed Systems, Vol. 7, No. 6, June 1996, pp. 595-604.
[2]
B. D. De Dinechin, "A Ultra Fast Euclidean Division Algorithm for Prime Memory Systems", In Proceedings of Supercomputing '91, Albuquerque, USA, 1991, pp. 56-63.
[3]
Q.S. Gao, "The Chinese Remainder Theorem and the Prime Memory System", Computer Architecture News, Vol. 21, No. 2, pp. 337-340.
[4]
D.T. Harper III and J. R. Jump, "Vector Access Performance in Parallel Memories Using a Skewed Storage Scheme", IEEE Transactions on Computers, V ol. C-36. No. 12, December 1987, pp. 1440-1449.
[5]
J. Hennessy and D. A. Pattersson, "Computer Architecture a Quantitative Approach", Morgan Kaufmann, 1996.
[6]
A. Jennings and J. J. McKeown, "Matrix Computation", Wiley, 1992.
[7]
R. Raghavan and J. P. Hayes, "On Randomly Interleaved Memories", In Proceedings of Supercomputing '90, New York, 1990, pp. 49-57.
[8]
H.D. Shapiro, "Theoretical Limitations on the Efficient Use of Parallel Memories", IEEE Transactions on Computers, Vol. C-27, No. 5, May 1978, pp. 421-428.
[9]
M. Valero, T. Lang, M. Peiron, and E. Ayguarde, "Conflict- Free Access for Streams in Multimodule Memories", IEEE Transactions on Computers, Vol. 44, No. 5, May 1995, pp. 634-646.
Index Terms
- Bounding on the gain of optimizing data layout in vector processors
Recommendations
Bounding Average-Energy Games
Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures - Volume 10203We consider average-energy games, where the goal is to minimize the long-run average of the accumulated energy. While several results have been obtained on these games recently, decidability of average-energy games with a lower-bound constraint on the ...
PAC-Bayes bounds for twin support vector machines
Twin support vector machines are regarded as a milestone in the development of support vector machines. Compared to standard support vector machines, they learn two nonparallel hyperplanes rather than one as in standard support vector machines for ...
A Reduction of Grid-Bag Layout to Auckland Layout
ASWEC '10: Proceedings of the 2010 21st Australian Software Engineering ConferenceMany major programming platforms support layout managers in Grid-bag style, where GUI elements can be placed on a rectangular grid. In Grid-bag layout mangers, cells of the underlying grid can be merged in order to create more complex layouts. In this ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1998 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]
Sponsors
- SIGARCH: ACM Special Interest Group on Computer Architecture
- IEEE-CS: Computer Society
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 13 July 1998
Check for updates
Qualifiers
- Article
Conference
ICS98
Sponsor:
- SIGARCH
- IEEE-CS
Acceptance Rates
Overall Acceptance Rate 629 of 2,180 submissions, 29%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 269Total Downloads
- Downloads (Last 12 months)43
- Downloads (Last 6 weeks)7
Reflects downloads up to 16 Feb 2025
Other Metrics
Citations
Cited By
View all- Lennerstad HLundberg L(2003)Chapter 9: Cache memoriesElectronic Notes in Discrete Mathematics10.1016/S1571-0653(04)80608-514(177-214)Online publication date: May-2003
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in