Mem (computing)

For other meanings, see Mem (disambiguation)


In Computational complexity theory, computing efficiency, Combinatorial optimization, Supercomputing, computational cost (Algorithmic efficiency) and other computational metrics, MEMS is a measurement unit for the number of memory accesses used or needed by a process, function, instruction set, algorithm or data structure.

Example usage: "A typical search tree in a (10 x 10 Sudoku or Latin square) requires a node of about 75 mems (memory accesses) for processing, to check validity. Therefore the total running time on a modern processor would be roughly the time needed to perform 2×1020 mems." (Donald Knuth, 2011, The Art of Computer Programming, Volume 4A, p. 6).

Reducing MEMS as a speed and efficiency enhancement is not a linear benefit, as it trades off increases in ordinary operations costs.

PFOR Compression

This optimization technique also is called PForDelta[1]

Although lossless compression methods like Rice, Golomb and PFOR are most often associated with signal processing codecs, the ability to optimize binary integers also adds relevance in reducing MEMS tradeoffs vs. operations. (See Golomb coding for details).[2]

See also

Clock rate, Instructions per second, CAS latency, Memoization, Clock signal, Nanosecond, Benchmarking, Computer performance

References

  1. ↑ "Powerpoint on compression" techniques of benchmarking and optimization using compression
  2. ↑ MEMS vs. OOPS Article including compression codecs


This article is issued from Wikipedia - version of the Wednesday, July 08, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.