Thread > on the Shared Memory Multiprocessors
    
    
  
  
  
      
      
      
        
Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie, no. 14 (2012), pp. 141-155
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			It is tradition to assume that computation decomposed in the certain way into several threads is executed on the systems with shared memory (SMP or NUMA) more efficiently than the same computation but decomposed into several processes. In the presented work we hypothesize that this assumption may be false for the computations with big data volumes, mainly by two reasons. Firstly, the support of common shared address space for the treads may introduce substantially more overhead than aggregate expenses on the execution context switching between processes. Secondly, even when computation does not require intensive memory management, the natural limitation for the memory workset description volume stored in TLB results in necessity to frequently renew that translation cache in the case of using threads too. Experiments and their results which prove our hypothesis correctness are described later in the article.
			
            
            
            
          
        
      
                  
                    
                    
                    
                    
                    
                      
Keywords: 
shared memory, performance, threads, processes.
                    
                  
                
                
                @article{VYURU_2012_14_a13,
     author = {M. O. Bakhterev},
     title = {Thread {<<Efficency>>} on the {Shared} {Memory} {Multiprocessors}},
     journal = {Vestnik \^U\v{z}no-Uralʹskogo gosudarstvennogo universiteta. Seri\^a, Matemati\v{c}eskoe modelirovanie i programmirovanie},
     pages = {141--155},
     publisher = {mathdoc},
     number = {14},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VYURU_2012_14_a13/}
}
                      
                      
                    TY - JOUR AU - M. O. Bakhterev TI - Thread <> on the Shared Memory Multiprocessors JO - Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie PY - 2012 SP - 141 EP - 155 IS - 14 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VYURU_2012_14_a13/ LA - ru ID - VYURU_2012_14_a13 ER -
%0 Journal Article %A M. O. Bakhterev %T Thread <> on the Shared Memory Multiprocessors %J Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie %D 2012 %P 141-155 %N 14 %I mathdoc %U http://geodesic.mathdoc.fr/item/VYURU_2012_14_a13/ %G ru %F VYURU_2012_14_a13
M. O. Bakhterev. Thread <> on the Shared Memory Multiprocessors. Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie, no. 14 (2012), pp. 141-155. http://geodesic.mathdoc.fr/item/VYURU_2012_14_a13/ 
