Practicably Boosting the Processing Performance of BFS-like Algorithms on Semi-External Graph System via I-O-Efficient Graph Ordering

Practicably Boosting the Processing Performance of BFS-like Algorithms on Semi-External Graph System via I-O-Efficient Graph Ordering

USENIX via YouTube Direct link

Overall Comparison

10 of 13

10 of 13

Overall Comparison

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

Practicably Boosting the Processing Performance of BFS-like Algorithms on Semi-External Graph System via I-O-Efficient Graph Ordering

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Semi-External Graph System
  3. 3 BFS-like Algorithms on Semi-External System
  4. 4 Existing Work for Optimizing BFS-like Algorithms
  5. 5 I/O Efficiency
  6. 6 Motivation
  7. 7 1/O-Efficient Graph Ordering (IOE-Order)
  8. 8 Out-Degree Binning (Conti.)
  9. 9 Evaluation Setup
  10. 10 Overall Comparison
  11. 11 Pre-processing Overhead
  12. 12 Non-BFS Evaluation
  13. 13 Conclusion

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.