Author image not provided
 Andrew Anderson

Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article1.50
Citation Count3
Publication count2
Publication years2015-2016
Available for download2
Average downloads per article150.50
Downloads (cumulative)301
Downloads (12 Months)93
Downloads (6 Weeks)7
Arrow RightAuthor only

See all colleagues of this author


2 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 2 of 2
Sort by:

1 published by ACM
September 2016 PACT '16: Proceedings of the 2016 International Conference on Parallel Architectures and Compilation
Publisher: ACM
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 30,   Downloads (Overall): 56

Full text available: PDFPDF
We propose a scheme for reduced-precision representation of floating point data on a continuum between IEEE-754 floating point types. Our scheme enables the use of lower precision formats for a reduction in storage space requirements and data transfer volume. We describe how our scheme can accelerated using existing hardware vector ...
Keywords: approximate computing, floating point, multiple precision, simd, vector architecture

2 published by ACM
December 2015 ACM Transactions on Architecture and Code Optimization (TACO): Volume 12 Issue 4, January 2016
Publisher: ACM
Citation Count: 3
Downloads (6 Weeks): 4,   Downloads (12 Months): 63,   Downloads (Overall): 245

Full text available: PDFPDF
Automatically exploiting short vector instructions sets (SSE, AVX, NEON) is a critically important task for optimizing compilers. Vector instructions typically work best on data that is contiguous in memory, and operating on non-contiguous data requires additional work to gather and scatter the data. There are several varieties of non-contiguous access, ...
Keywords: SIMD, Vectorization, data permutation, interleaving

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us