On Graphs, GPUs, and Blind Dating: A Workload to Processor Matchmaking Quest

@article{Gharaibeh2013OnGG,
  title={On Graphs, GPUs, and Blind Dating: A Workload to Processor Matchmaking Quest},
  author={Abdullah Gharaibeh and Lauro Beltr{\~a}o Costa and Elizeu Santos-Neto and Matei Ripeanu},
  journal={2013 IEEE 27th International Symposium on Parallel and Distributed Processing},
  year={2013},
  pages={851-862}
}
Graph processing has gained renewed attention. The increasing large scale and wealth of connected data, such as those accrued by social network applications, demand the design of new techniques and platforms to efficiently derive actionable information from large scale graphs. Hybrid systems that host processing units optimized for both fast sequential processing and bulk processing (e.g., GPUaccelerated systems) have the potential to cope with the heterogeneous structure of real graphs and… CONTINUE READING
Highly Cited
This paper has 54 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 33 extracted citations

54 Citations

051015'13'14'15'16'17'18
Citations per Year
Semantic Scholar estimates that this publication has 54 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Similar Papers

Loading similar papers…