Best Algorithms + Best Computers = Powerful Match.
The article introduces a paper concerning the efficient parallelization of an algorithm that exploits hierarchical representation of the forces that can be used for scientific computations that are too large or complex to be solved on a single processor.
| Publicado en: | Communications of the ACM Vol. 55; no. 5; pp. 100 - 101 |
|---|---|
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
May2012
|
| 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=74715565&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 74715565 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: May2012 vid: 55 iid: 5 pid: 68 pub: Association for Computing Machinery artinfo: ui: 74715565 10.1145/2160718.2160739 ppf: 100 ppct: 1 formats: tig: atl: Best Algorithms + Best Computers = Powerful Match. aug: su: Parallel programs (Computer programs) Algorithms sug: subj: Parallel programs (Computer programs) Algorithms ab: The article introduces a paper concerning the efficient parallelization of an algorithm that exploits hierarchical representation of the forces that can be used for scientific computations that are too large or complex to be solved on a single processor. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2012 holdings: @attributes: islocal: N |
|---|