Solving Rubik's Cube: Disk Is the New RAM.
The article focuses on disk-based computation, an effort to make use of parallel disks in scientific computation. It has reached the mainstream media in 2007 when its proponents showed that Rubik's Cube can be solved in 26 moves or less. Proponents used Rubik's Cube because it is an example of a lar...
| Publicado en: | Communications of the ACM Vol. 51; no. 4; pp. 31 - 34 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Apr2008
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=31663002&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 31663002 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Apr2008 vid: 51 iid: 4 pid: 68 pub: Association for Computing Machinery artinfo: ui: 31663002 10.1145/1330311.1330319 ppf: 31 ppct: 3 formats: tig: atl: Solving Rubik's Cube: Disk Is the New RAM. aug: au: Kunkle, Daniel Cooperman, Gene affil: Ph.D candidate in computer science, College of Computer and Information Science, Northeastern University, Boston, MA Professor, College of Computer and Information Science, Northeastern University, Boston, MA su: Computer programming Magnetic memory (Computers) Rubik's Cube Software verification Algorithms Coding theory Algebra Data compression Digital electronics Machine theory sug: subj: Computer programming Magnetic memory (Computers) Rubik's Cube Software verification Algorithms Coding theory Algebra Data compression Digital electronics Machine theory ab: The article focuses on disk-based computation, an effort to make use of parallel disks in scientific computation. It has reached the mainstream media in 2007 when its proponents showed that Rubik's Cube can be solved in 26 moves or less. Proponents used Rubik's Cube because it is an example of a large enumeration problem for which disk-based computation may lead to breakthroughs in several problem domains including group theory, hardware and software verification and coding theory. After limiting the study to 4 GB of main memory per computer, researchers performed an overall search for possible configurations and analyzed several possible algorithms. They conclude that disk-based computation enable solutions to problems that require even pentabytes of memory. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2008 holdings: @attributes: islocal: N |
|---|