Corpus ID: 61512503

The Graph 500 Benchmark on a Medium-Size Distributed-Memory Cluster with High-Performance Interconnect

@inproceedings{Angel2012TheG5,
  title={The Graph 500 Benchmark on a Medium-Size Distributed-Memory Cluster with High-Performance Interconnect},
  author={Jordan B. Angel and A. M. Flores and Nathan C. Wardrip and Andrew Raim and M. K. Gobbert and R. C. Murphy and David J. Mountain},
  year={2012}
}
  • Jordan B. Angel, A. M. Flores, +4 authors David J. Mountain
  • Published 2012
  • Computer Science
  • While traditional performance benchmarks for high-performance computers measure the speed of arithmetic operations, memory access time is a more useful performance gauge for many large problems today. The Graph 500 benchmark has been developed to measure a computer’s performance in memory retrieval. The Graph 500 implementation considers large, randomly generated graphs, which may be spread across many nodes on a distributedmemory cluster. The benchmark conducts breadth-first searches on these… CONTINUE READING
    2 Citations
    DWPE, a new data center energy-efficiency metric bridging the gap between infrastructure and workload
    • 20
    • PDF

    References

    SHOWING 1-9 OF 9 REFERENCES
    Introducing the Graph 500
    • 323
    • PDF
    Graph 500 performance on a distributed-memory cluster
    • Tech. Rep
    • 2012
    Ang, Introducing the Graph 500, Cray User Group 2010 Proceedings
    • Ang, Introducing the Graph 500, Cray User Group 2010 Proceedings
    • 2010
    Parallel performance studies for an elliptic test problem on the cluster tara
    • Parallel performance studies for an elliptic test problem on the cluster tara
    • 2010
    Optimizing the performance of IBM System x and BladeCenter servers using Intel Xeon 5500 series processors
    • Optimizing the performance of IBM System x and BladeCenter servers using Intel Xeon 5500 series processors
    • 2009
    Realistic
    • mathematically tractable graph generation and evolution, using Kronecker multiplication, in: A. Jorge, L. Torgo, P. Brazdil, R. Camacho, J. Gama (Eds.), Knowledge Discovery in Databases: PKDD 2005, Vol. 3721 of Lecture Notes in Computer Science, Springer-Verlag
    • 2005
    URL www.umbc.edu/hpcf
    • URL www.umbc.edu/hpcf
    We sincerely appreciate the additional funding for the students to travel to Supercomputing 2012
    • We sincerely appreciate the additional funding for the students to travel to Supercomputing 2012