CHAPTER 1 The All-Pair Shortest-Path Problem in Shared-Memory Heterogeneous Systems

@inproceedings{OrtegaArranz2013CHAPTER1T,
  title={CHAPTER 1 The All-Pair Shortest-Path Problem in Shared-Memory Heterogeneous Systems},
  author={Hector Ortega-Arranz and Yuri Torres and Diego R. Llanos and Arturo Gonz{\'a}lez-Escribano},
  year={2013}
}
This chapter faces the All-Pair Shortest-Path problem for sparse graphs combining parallel algorithms and parallel-productivity methods in heterogeneous systems. As this problem can be divided into independent Single-Source ShortestPath subproblems, we distribute this computation space into different processing units, CPUs and graphical processing units (GPUs), that are usually present in modern shared-memory systems. Although the powerful GPUs are significantly faster than the CPUs, its… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-3 of 3 references

State - ofthe - art in heterogeneous computing

  • C. Dyken, T. R. Hagen, J. M. Hjelmervik, O. O. Storaasli
  • Journal Scientific Programming
  • 2012

Similar Papers

Loading similar papers…