Introduction to Parallel Computing
By Vipin Kumar. 2004
1,167 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Hardware and Architecture
View Paper: https://www.semanticscholar.org/paper/551f848dc5e9a8345f5df79800c9e209b656992d
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Carole-Jean Wu
- Udit Gupta
- Johanne Bézy-Wendling
- Hervé Saint-Jalmes
- Jelena Pjesivac-Grbovic
- Edgar Gabriel
- Jimmy J. Lin
- Jongsoo Park
In Hardware and Architecture
- Johanne Bézy-Wendling
- Hervé Saint-Jalmes
- Jelena Pjesivac-Grbovic
- Edgar Gabriel
- Jimmy J. Lin
- Jongsoo Park
- Jack J. Dongarra
- George Bosilca
Citations in the corpus
- In Silico Modeling of Magnetic Resonance Flow Imaging in Complex Vascular Networks (2014, methodology): “The first parallel algorithm [42] is based on the master–slave model [43] and uses the message passing paradigm [44].”
- Book Reviews: Data-Intensive Text Processing with MapReduce by Jimmy Lin and Chris Dyer (2010, background): “Finally, it is easy to forget that parallel graph algorithms have been studied by computer scientists for several decades, particular in the PRAM model [77, 60].”
- Performance analysis of MPI collective operations (2005, methodology): “in [9] use Hockney model to perform cost analysis of different collective algorithms on various network topologies (such as torus, hypercube, etc).”
- Deep Learning Recommendation Model for Personalization and Recommendation Systems (2019, methodology): “Since model parallelism has been used to distribute the embeddings across devices, this requires a personalized all-to-all communication [12].”
- Scalable parallel numerical constraint solver using global load balancing (2015, methodology): “er process, which may limit scalability [23, 2]. A substantial amount of work exists regarding the parallelization of the branch and bound algorithm with both search-space splitting and work stealing [11, 15, 18]. Although the branch and bound algorithm resembles the solving process of NCSPs, existi”
- Parallel Spectral Clustering in Distributed Systems (2011, background): “Asdefinedin[ 16 ],[27], a parallel system is scalable if the speedup can be kept constant as the number of machines and the data sizes are both increased.”