Academic Journal
Scalable Hybrid Implementation of Graph Coloring using MPI and OpenMP
العنوان: | Scalable Hybrid Implementation of Graph Coloring using MPI and OpenMP |
---|---|
المؤلفون: | Ahmet Erdem Sarıyüce, Erik Saule, Ümit V. Çatalyürek |
المساهمون: | The Pennsylvania State University CiteSeerX Archives |
المصدر: | http://bmi.osu.edu/%7Eesaule/public-website/papers/pco12-SSC.pdf. |
سنة النشر: | 2012 |
المجموعة: | CiteSeerX |
مصطلحات موضوعية: | Graph coloring, Distributed Memory, Shared Memory, Hybrid programming |
الوصف: | Graph coloring algorithms are commonly used in large scientific parallel computing either for identifying parallelism or as a tool to reduce computation, such as compressing Hessian matrices. Large scientific computations are nowadays either run on commodity clusters or on large computing platforms. In both cases, the current target platform is hierarchical with distributed memory at the node level and shared memory at the processor level. In this paper, we present a novel hybrid graph coloring algorithm and discuss how to obtain the best performance on such systems from algorithmic, system and engineering perspectives. |
نوع الوثيقة: | text |
وصف الملف: | application/pdf |
اللغة: | English |
Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.226.8136; http://bmi.osu.edu/%7Eesaule/public-website/papers/pco12-SSC.pdf |
الاتاحة: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.226.8136 http://bmi.osu.edu/%7Eesaule/public-website/papers/pco12-SSC.pdf |
Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
رقم الانضمام: | edsbas.AA9FA981 |
قاعدة البيانات: | BASE |
الوصف غير متاح. |