column

Free access

Solving Rubik's Cube: disk is the new RAM

Authors:

Daniel Kunkle,

Gene CoopermanAuthors Info & Claims

Communications of the ACM, Volume 51, Issue 4

Pages 31 - 33

https://doi.org/10.1145/1330311.1330319

Published: 01 April 2008 Publication History

All formats PDF

Abstract

Substituting disk for RAM, disk-based computation is a way to increase working memory and achieve results that are not otherwise economical.

References

[1]

Kunkle, D. and Cooperman, G. Twenty-six moves suffice for Rubik's Cube. In Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation (Waterloo, Ontario, Canada, July 29--Aug. 1). ACM Press, New York, 2007, 235--242.

Digital Library

Google Scholar

[2]

Robinson, R., Kunkle, D., and Cooperman, G. A comparative analysis of parallel disk-based methods for enumerating implicit graphs. In Proceedings of the 2007 International Workshop on Parallel Symbolic Computation (London, Ontario, Canada, July 27--28). ACM Press, New York, 2007, 78--87.

Digital Library

Google Scholar

[3]

Vitter, J. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys 33, 2 (June 2001), 209--271.

Digital Library

Google Scholar

Cited By

View all

Zhou M(2023)PieRank: Embedded Large-Scale Sparse Matrix Processing2023 IEEE International Conference on Big Data (BigData)10.1109/BigData59044.2023.10386888(170-181)Online publication date: 15-Dec-2023
https://doi.org/10.1109/BigData59044.2023.10386888
Lan LShi RWang BZhang LShi J(2019)A Lightweight Time Series Main-Memory Database for IoT Real-Time ServicesInternet of Vehicles. Technologies and Services Toward Smart Cities10.1007/978-3-030-38651-1_19(220-236)Online publication date: 18-Nov-2019
https://dl.acm.org/doi/10.1007/978-3-030-38651-1_19
Holte RFelner ASharon GSturtevant NChen J(2017)MMArtificial Intelligence10.1016/j.artint.2017.05.004252:C(232-266)Online publication date: 1-Nov-2017
https://dl.acm.org/doi/10.1016/j.artint.2017.05.004
Show More Cited By

Index Terms

Solving Rubik's Cube: disk is the new RAM

Recommendations

Twenty-six moves suffice for Rubik's cube
ISSAC '07: Proceedings of the 2007 international symposium on Symbolic and algebraic computation

The number of moves required to solve any state of Rubik's cube has been a matter of long-standing conjecture for over 25 years -- since Rubik's cube appeared. This number is sometimes called "God's number". An upper bound of 29 (in the face-turn metric)...
From Chaos to Order: A Group Theory Approach to the Rubik's Cube
ICACS '23: Proceedings of the 7th International Conference on Algorithms, Computing and Systems

Rubik's cube is a classic puzzle toy, and restoring it is not an easy task, especially without memorizing formulas. In fact, the restoration of the Rubik's Cube is closely related to group theory. If we consider the cubes or facelets at each position of ...
Memory Coalescing for Hybrid Memory Cube
ICPP '18: Proceedings of the 47th International Conference on Parallel Processing

Arguably, many data-intensive applications pose significant challenges to conventional architectures and memory systems, especially when applications exhibit non-contiguous, irregular, and small memory access patterns. The long memory access latency can ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Communications of the ACM Volume 51, Issue 4

The psychology of security: why do good users make bad decisions?

April 2008

94 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/1330311

Issue’s Table of Contents

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 2008

Published in CACM Volume 51, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Column
Popular
Pre-selected

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
1,591
Total Downloads

Downloads (Last 12 months)190
Downloads (Last 6 weeks)31

Reflects downloads up to 21 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhou M(2023)PieRank: Embedded Large-Scale Sparse Matrix Processing2023 IEEE International Conference on Big Data (BigData)10.1109/BigData59044.2023.10386888(170-181)Online publication date: 15-Dec-2023
https://doi.org/10.1109/BigData59044.2023.10386888
Lan LShi RWang BZhang LShi J(2019)A Lightweight Time Series Main-Memory Database for IoT Real-Time ServicesInternet of Vehicles. Technologies and Services Toward Smart Cities10.1007/978-3-030-38651-1_19(220-236)Online publication date: 18-Nov-2019
https://dl.acm.org/doi/10.1007/978-3-030-38651-1_19
Holte RFelner ASharon GSturtevant NChen J(2017)MMArtificial Intelligence10.1016/j.artint.2017.05.004252:C(232-266)Online publication date: 1-Nov-2017
https://dl.acm.org/doi/10.1016/j.artint.2017.05.004
Smith RKelly SHeywood MNeumann FSutton A(2016)Discovering Rubik's Cube Subgroups using Coevolutionary GPProceedings of the Genetic and Evolutionary Computation Conference 201610.1145/2908812.2908887(789-796)Online publication date: 20-Jul-2016
https://dl.acm.org/doi/10.1145/2908812.2908887
Edelkamp S(2016)External-Memory State Space SearchAlgorithm Engineering10.1007/978-3-319-49487-6_6(185-225)Online publication date: 11-Nov-2016
https://doi.org/10.1007/978-3-319-49487-6_6
(2012)BibliographyHeuristic Search10.1016/B978-0-12-372512-7.00020-1(793-823)Online publication date: 2012
https://doi.org/10.1016/B978-0-12-372512-7.00020-1
Hogan AHarth APolleres A(2011)Scalable Authoritative OWL Reasoning for the Web*Semantic Services, Interoperability and Web Applications10.4018/978-1-60960-593-3.ch006(131-177)Online publication date: 2011
https://doi.org/10.4018/978-1-60960-593-3.ch006
Slavici VDong XKunkle DCooperman GKoepf W(2010)Fast multiplication of large permutations for disk, flash memory and RAMProceedings of the 2010 International Symposium on Symbolic and Algebraic Computation10.1145/1837934.1838001(355-362)Online publication date: 25-Jul-2010
https://dl.acm.org/doi/10.1145/1837934.1838001
(2009)Scalable Authoritative OWL Reasoning for the WebInternational Journal on Semantic Web and Information Systems10.4018/jswis.20090922035:2Online publication date: Aug-2011
https://doi.org/10.4018/jswis.2009092203
Edelkamp SJabbar SKissmann P(2009)Scaling Search with Pattern DatabasesModel Checking and Artificial Intelligence10.1007/978-3-642-00431-5_4(49-64)Online publication date: 25-Feb-2009
https://dl.acm.org/doi/10.1007/978-3-642-00431-5_4

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Magazine Site

Login options

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

Abstract

References

Cited By

Index Terms

Recommendations

Twenty-six moves suffice for Rubik's cube

From Chaos to Order: A Group Theory Approach to the Rubik's Cube

Memory Coalescing for Hybrid Memory Cube

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Digital Edition

Magazine Site

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations