The Simplicity of Cache Efficient Functional Algorithms.
The article discusses a study published within the journal that demonstrated a model for analyzing and describing the efficiency of functional algorithms. Topics discussed include the accuracy and complexity of cache-aware estimates of real-world performance, the use of asymptotic notation to descri...
| Publicado en: | Communications of the ACM Vol. 58; no. 7; pp. 100 - 101 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Jul2015
|
| 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=103442044&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 103442044 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Jul2015 vid: 58 iid: 7 pid: 68 pub: Association for Computing Machinery artinfo: ui: 103442044 10.1145/2776827 ppf: 100 ppct: 1 formats: tig: atl: The Simplicity of Cache Efficient Functional Algorithms. aug: au: Clinger, William D. affil: Associate professor, College of Computer and Information Science at Northeastern University, Boston, MA su: Algorithm research Cache memory Cost estimates Cost analysis Computer science research Mathematical programming sug: subj: Algorithm research Cache memory Cost estimates Cost analysis Computer science research Mathematical programming ab: The article discusses a study published within the journal that demonstrated a model for analyzing and describing the efficiency of functional algorithms. Topics discussed include the accuracy and complexity of cache-aware estimates of real-world performance, the use of asymptotic notation to describe costs, and cache-oblivious algorithms as an example of the use of abstraction to combine accurate cost estimates with tractability. Also mentioned are the correspondence between allocation order and memory order, the expression and analysis of efficient cache-oblivious functional algorithms, and the ability of computer scientists to improve both the simplicity and accuracy of models. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2015 holdings: @attributes: islocal: N |
|---|