CSC 456 Fall 2013/4b cv: Difference between revisions

From Expertiza_Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
Line 1: Line 1:
===Background===
===Background===
Non Uniform Memory (NUMA) technology has become the optimal solution for more complex systems in terms of the increase of processors. NUMA provides the functionality to distribute memory to each processor, giving each processor local access to its own share, as well as giving each processor the ability to access remote memory located in other processors.  
    Non Uniform Memory (NUMA) technology has become the optimal solution for more complex systems in terms of the increase of processors. NUMA provides the functionality to distribute memory to each processor, giving each processor local access to its own share, as well as giving each processor the ability to access remote memory located in other processors. Page allocation is especially important to a NUMA memory system because in order to maximize it's potential pages need to be efficiently manage the memory.


     


===History===
===History===

Revision as of 02:16, 6 November 2013

Background

    Non Uniform Memory (NUMA) technology has become the optimal solution for more complex systems in terms of the increase of processors. NUMA provides the functionality to distribute memory to each processor, giving each processor local access to its own share, as well as giving each processor the ability to access remote memory located in other processors. Page allocation is especially important to a NUMA memory system because in order to maximize it's potential pages need to be efficiently manage the memory.


History

Different Strategies

  • first touch - allocates the frame on the node that incurs the page fault, i.e. on the same node where the processor that accesses it resides.
  • round robin - pages are allocated in different memory nodes and are accessed based on time slices.
  • local to first access - waits
  • local to first request