Article

Free access

Cache-optimal methods for bit-reversals

Authors:

Zhao Zhang,

Xiaodong ZhangAuthors Info & Claims

SC '99: Proceedings of the 1999 ACM/IEEE conference on Supercomputing

Pages 26 - es

https://doi.org/10.1145/331532.331558

Published: 01 January 1999 Publication History

PDF eReader

References

[1]

D. F. Bacon, S. L. Graham, and O. J. Sharp, "Compiler transformations for high performance computing", ACM Computing Surveys, Vol. 26, No. 4, December 1994, pp. 345-420.

Digital Library

Google Scholar

[2]

B. Bershad, D. Lee, T. Romer and B. Chen, "Avoiding conflict misses dynamically in large direct-mapped caches", Proceedings of the 6th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI), October, 1994.

Digital Library

Google Scholar

[3]

M. Cekleov and M. Dubois, "Virtual-address caches", IEEE Micro, September/October 1997, pp. 64-71.

Digital Library

Google Scholar

[4]

K. S. Gatlin and L. Carter, "Memory hierarchy considerations for fast transpose and bit-reversals", Proceedings of 5th International Symposium on High-Performance Computer Architecture, (HPCA-5), January 1999.

Digital Library

Google Scholar

[5]

A. H. Karp, "Bit reversal on uniprocessors", SIAM Review, Vol. 38, No. 1, March 1996, pp. 1-26.

Digital Library

Google Scholar

[6]

J. L Hennessy and D. A. Patterson, Computer Architecture: A Quantitative Approach, Morgan Kaufmann, 1996.

Digital Library

Google Scholar

[7]

L. McVoy and C. Staelin, "lmbench: portable tools for performance analysis", Proceedings of the 1996 USENIX Technical Conference, San Diego, California, 1996, pp. 279-295.

Digital Library

Google Scholar

[8]

C. Rivera and C.-W. Tseng, "Data transformations for eliminating conflict misses", Proceedings of the SIG- PLAN'98 Conference on Programming Language Design and Implementation, July 1998.

Digital Library

Google Scholar

[9]

M. Rosenblum, et.al, "Using the SimOS machine simulator to study complex computer systems", ACM Transactions on Modeling and Computer Simulation, Vol. 7, No. 1, 1997, pp. 78-103.

Digital Library

Google Scholar

[10]

Y. Yan, X. Zhang and Z. Zhang, "A memory-layout oriented run-time technique for locality optimization", Proceedings of 1998 International Conference of Parallel Processing, (ICPP'98), August, 1998, pp. 189-196.

Digital Library

Google Scholar

[11]

C. Zhang, X. Zhang and Y. Yan, "Two fast and high-associativity cache schemes", IEEE Micro, Vol. 17, No. 5, 1997, pp. 40-49.

Digital Library

Google Scholar

Cited By

View all

Elango KMuniandi K(2022)A Novel Digital Logic for Bit Reversal and Address Generations in FFT ComputationsWireless Personal Communications10.1007/s11277-022-10021-8128:3(1827-1838)Online publication date: 11-Sep-2022
https://doi.org/10.1007/s11277-022-10021-8
Gyanendra Raman BKaushik B(2020)Novel Bit-Reordering Circuit for Continuous-Flow Parallel FFT ArchitecturesIEEE Transactions on Circuits and Systems II: Express Briefs10.1109/TCSII.2020.298489267:12(3392-3396)Online publication date: Dec-2020
https://doi.org/10.1109/TCSII.2020.2984892
Garrido MGrajal JGustafsson O(2011)Optimum Circuits for Bit ReversalIEEE Transactions on Circuits and Systems II: Express Briefs10.1109/TCSII.2011.216414158:10(657-661)Online publication date: Oct-2011
https://doi.org/10.1109/TCSII.2011.2164141
Show More Cited By

Index Terms

Cache-optimal methods for bit-reversals

Recommendations

Prefix and Suffix Reversals on Strings
SPIRE 2015: Proceedings of the 22nd International Symposium on String Processing and Information Retrieval - Volume 9309

The Sorting by Prefix Reversals problem consists in sorting the elements of a given permutation $$\pi $$ with a minimum number of prefix reversals, i.e. reversals that always imply the leftmost element of $$\pi $$. A natural extension of this problem is ...
Prefix Reversals on Binary and Ternary Strings

Given a permutation $\pi$, the application of prefix reversal $f^{(i)}$ to $\pi$ reverses the order of the first $i$ elements of $\pi$. The problem of sorting by prefix reversals (also known as pancake flipping), made famous by Gates and Papadimitriou (...
Prefix reversals on binary and ternary strings
AB'07: Proceedings of the 2nd international conference on Algebraic biology

Given a permutation π, the application of prefix reversal f⁽ⁱ⁾ to π reverses the order of the first i elements of π. The problem of Sorting By Prefix Reversals (also known as pancake flipping), made famous by Gates and Papadimitriou (Bounds for sorting ...

Comments

Information & Contributors

Information

Published In

SC '99: Proceedings of the 1999 ACM/IEEE conference on Supercomputing

January 1999

1015 pages

ISBN:1581130910

DOI:10.1145/331532

General Chair:
Cherri Pancake

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 January 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SC '99

Sponsor:

SIGARCH
IEEE-CS

SC '99: International Conference for High Performance Computing, Networking, Storage and Analysis

November 14 - 19, 1999

Oregon, Portland, USA

Acceptance Rates

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
262
Total Downloads

Downloads (Last 12 months)25
Downloads (Last 6 weeks)3

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Elango KMuniandi K(2022)A Novel Digital Logic for Bit Reversal and Address Generations in FFT ComputationsWireless Personal Communications10.1007/s11277-022-10021-8128:3(1827-1838)Online publication date: 11-Sep-2022
Gyanendra Raman BKaushik B(2020)Novel Bit-Reordering Circuit for Continuous-Flow Parallel FFT ArchitecturesIEEE Transactions on Circuits and Systems II: Express Briefs10.1109/TCSII.2020.298489267:12(3392-3396)Online publication date: Dec-2020
Garrido MGrajal JGustafsson O(2011)Optimum Circuits for Bit ReversalIEEE Transactions on Circuits and Systems II: Express Briefs10.1109/TCSII.2011.216414158:10(657-661)Online publication date: Oct-2011
Jiang SZhang X(2005)Token-ordered LRUPerformance Evaluation10.1016/j.peva.2004.10.00260:1-4(5-29)Online publication date: 1-May-2005
D’Alberto PNicolau AVeidenbaum A(2004)A Data Cache with Dynamic MappingLanguages and Compilers for Parallel Computing10.1007/978-3-540-24644-2_28(436-450)Online publication date: 2004
(2003)Algorithms for memory hierarchiesundefinedOnline publication date: 1-Jan-2003
(2001)Dynamic Load Sharing With Unknown Memory Demands in ClustersProceedings of the The 21st International Conference on Distributed Computing Systems10.5555/876878.879245Online publication date: 16-Apr-2001
Songqing Chen Li Xiao Xiaodong Zhang (2001)Dynamic load sharing with unknown memory demands in clustersProceedings 21st International Conference on Distributed Computing Systems10.1109/ICDSC.2001.918939(109-118)Online publication date: 2001
Xiao LZhang XKubricht S(2000)Improving memory performance of sorting algorithmsACM Journal of Experimental Algorithmics10.1145/351827.3842455(3-es)Online publication date: 31-Dec-2000

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Prefix and Suffix Reversals on Strings

Prefix Reversals on Binary and Ternary Strings

Prefix reversals on binary and ternary strings