A scalable parallel graph coloring algorithm for distributed memory computers.

Conference · Tue Feb 01 00:00:00 EST 2005

OSTI ID:950905

Bozdag, Doruk ^[1]; Manne, Fredrik ^[2]; Gebremedhin, Assefaw H ^[3]; Catalyurek, Umit ^[1]; Boman, Erik Gunnar

---

1. Ohio State University
2. University of Bergen, Norway
3. Old Dominion University

In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributed memory algorithm for doing the coloring itself in parallel. The algorithm operates in an iterative fashion; in each round vertices are speculatively colored based on limited information, and then a set of incorrectly colored vertices, to be recolored in the next round, is identified. Parallel speedup is achieved in part by reducing the frequency of communication among processors. Experimental results on a PC cluster using up to 16 processors show that the algorithm is scalable.

• Research Organization: Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA (United States)
• Sponsoring Organization: USDOE
• DOE Contract Number: AC04-94AL85000
• OSTI ID: 950905
• Report Number(s): SAND2005-1035C; TRN: US200911%%130
• Resource Relation: Conference: Proposed for presentation at the EuroPar 2005 held August 30-September 2, 2005 in Lisboa, Portugal.
• Country of Publication: United States
• Language: English

Related Subjects

97 MATHEMATICS AND COMPUTING
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
ALGORITHMS
PARALLEL PROCESSING
DIAGRAMS
COLOR
MEMORY MANAGEMENT
COMPUTERS