A New Benchmark For Evaluation Of Graph-Theoretic Algorithms

Details A New Benchmark For Evaluation Of Graph-Theoretic Algorithms A New Benchmark For Evaluation Of Graph-Theoretic Algorithms

2010-05-05

arxiv.org/abs/1005.0806v1

Computer Science

Performance

Scientific paper

We propose a new graph-theoretic benchmark in this paper. The benchmark is developed to address shortcomings of an existing widely-used graph benchmark. We thoroughly studied a large number of traditional and contemporary graph algorithms reported in the literature to have clear understanding of their algorithmic and run-time characteristics. Based on this study, we designed a suite of kernels, each of which represents a specific class of graph algorithms. The kernels are designed to capture the typical run-time behavior of target algorithms accurately, while limiting computational and spatial overhead to ensure its computation finishes in reasonable time. We expect that the developed benchmark will serve as a much needed tool for evaluating different architectures and programming models to run graph algorithms.

Affiliated with

Also associated with

No associations

Rating

A New Benchmark For Evaluation Of Graph-Theoretic Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A New Benchmark For Evaluation Of Graph-Theoretic Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Benchmark For Evaluation Of Graph-Theoretic Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-437995