skip to main content
poster

A scalable distance-1 vertex coloring algorithm for power-law graphs

Published:10 February 2018Publication History
Skip Abstract Section

Abstract

We propose a distributed, unordered, label-correcting distance-1 vertex coloring algorithm, called Distributed Control (DC) coloring algorithm. DC eliminates the need for vertex-centric barriers and global synchronization for color refinement, relying only on atomic operations and local termination detection to update vertex color. We implement our DC coloring algorithm and the well-known Jones-Plassmann algorithm in the AM++ AMT runtime and compare their performance. We show that, with runtime support, the elimination of waiting time of vertex-centric barriers and investing this time for local ordering results in better execution time for power-law graphs with dense local subgraphs.

References

  1. G. E. Blelloch, J. T. Fineman, and J. Shun. Greedy Sequential Maximal Independent Set and Matching Are Parallel on Average. In Proc. 24th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '12, pages 308--317, New York, NY, USA, 2012. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some Simplified NP-complete Problems. In Proc. 6th Annual ACM Symposium on Theory of Computing, STOC '74, pages 47--63, New York, NY, USA, 1974. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Q. Ho, J. Cipar, H. Cui, S. Lee, J. K. Kim, P. B. Gibbons, G. A. Gibson, G. Ganger, and E. Xing. More Effective Distributed ML Via A Stale Synchronous Parallel Parameter Server. In Advances in Neural Information Processing Systems, pages 1223--1231, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. T. Jones and P. E. Plassmann. A Parallel Graph Coloring Heuristic. SIAM J. Sci. Comput., 14(3):654--669, May 1993. ISSN 1064-8275. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M. Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem. In Proc. 17th Annual ACM Symposium on Theory of Computing, STOC '85, pages 1--10. ACM, 1985. ISBN 0-89791-151-2. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

(auto-classified)
  1. A scalable distance-1 vertex coloring algorithm for power-law graphs

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM SIGPLAN Notices
      ACM SIGPLAN Notices  Volume 53, Issue 1
      PPoPP '18
      January 2018
      426 pages
      ISSN:0362-1340
      EISSN:1558-1160
      DOI:10.1145/3200691
      Issue’s Table of Contents
      • cover image ACM Conferences
        PPoPP '18: Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
        February 2018
        442 pages
        ISBN:9781450349826
        DOI:10.1145/3178487

      Copyright © 2018 ACM

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 10 February 2018

      Check for updates

      Qualifiers

      • poster

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!