Greed Is Good: Parallel Algorithms for Bipartite-Graph Partial Coloring on Multicore Architectures

Author(s):  
Mustafa Kemal Tas ◽  
Kamer Kaya ◽  
Erik Saule

Author(s):  
Masoud Hemmatpour ◽  
Renato Ferrero ◽  
Filippo Gandino ◽  
Bartolomeo Montrucchio ◽  
Maurizio Rebaudengo

In a multicore environment, a major focus is represented by the synchronization among threads and processes. Since synchronization mechanisms strongly affect the performance of multithread algorithms, the selection of an effective synchronization approach is critical for multicore environments. In this chapter, the cost of the main existing synchronization techniques is estimated. The current investigation covers both hardware and software solutions. A comparative analysis highlights benefits and drawbacks of the considered approaches. The results are intended to represent a useful aid for researchers and practitioners interested in optimization of parallel algorithms.



Author(s):  
Masoud Hemmatpour ◽  
Renato Ferrero ◽  
Filippo Gandino ◽  
Bartolomeo Montrucchio ◽  
Maurizio Rebaudengo

In a multicore environment, a major focus is represented by the synchronization among threads and processes. Since synchronization mechanisms strongly affect the performance of multithread algorithms, the selection of an effective synchronization approach is critical for multicore environments. In this chapter, the cost of the main existing synchronization techniques is estimated. The current investigation covers both hardware and software solutions. A comparative analysis highlights benefits and drawbacks of the considered approaches. The results are intended to represent a useful aid for researchers and practitioners interested in optimization of parallel algorithms.





2018 ◽  
Vol 9 (12) ◽  
pp. 2147-2152
Author(s):  
V. Raju ◽  
M. Paruvatha vathana


2019 ◽  
Vol 38 (4) ◽  
pp. 817-850 ◽  
Author(s):  
Luisa D'Amore ◽  
Valeria Mele ◽  
Diego Romano ◽  
Giuliano Laccetti


10.37236/1748 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Nagi H. Nahas

The best lower bound known on the crossing number of the complete bipartite graph is : $$cr(K_{m,n}) \geq (1/5)(m)(m-1)\lfloor n/2 \rfloor \lfloor(n-1)/2\rfloor$$ In this paper we prove that: $$cr(K_{m,n}) \geq (1/5)m(m-1)\lfloor n/2 \rfloor \lfloor (n-1)/2 \rfloor + 9.9 \times 10^{-6} m^2n^2$$ for sufficiently large $m$ and $n$.





1989 ◽  
Author(s):  
John H. Reif
Keyword(s):  


Sign in / Sign up

Export Citation Format

Share Document