John Black, Charles Martel. Designing Fast Graph Data Structures: An Experimental Approach. Preprint 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Performance and Analysis of Minimum Spanning Tree Algorithms in.. - Caesar (Correct)
....to those structures in an attempt to determine which works best for a given type of graph. We note that although differences in run times are attributable to cache effects, some are inherent in choices made in constructing the algorithm variants and distinguishments are made between the two [3][6] Our results show that certain optimizations to the heap usually produce limited benefit in terms of the run time of the whole algorithm for small data sizes. This is most likely due to the fact that cache misses caused by heap operations account for only a small part of all cache misses. ....
....influence on heaps, but understandably keep their discussion to a heap specific point of view. We build on their work by noticing that certain heap operations occur at a higher frequency than others in the minimum spanning tree problem, and we view their work in this light. Black, Martel, and Qi [3,8] look at graph representations and design of hashing algorithms while taking cache effects into account. This paper continues in a similar vein, applying similar analysis to minimum spanning tree algorithms. II Experimental Setting Kruskal s and Prim s algorithms were implemented along with ....
[Article contains additional citation context not shown here]
John Black, Charles Martel. Designing Fast Graph Data Structures: An Experimental Approach. Preprint 1997.
Design and Analysis of Hashing Algorithms with Cache Effects - Qi, Martel Self-citation (Martel) (Correct)
.... algorithms [8] They also introduced an analytical model called collective analysis that helps predict cache performance [7] Black and Martel presented simple alternatives to standard graph representations that substantially improved the performance of breadth first search and depth first search [3]. A recent hashing paper [11] develops a collision resolution scheme which can reduce the probes compared to double hashing for some very specialized settings. However, since they only look at probes rather than execution time they don t address the effects we study here. 3 Experimental Setting ....
John Black, Charles Martel. Designing fast graph data structures: an experimental approach. Preprint 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC