Parallel isolation-aggregation algorithms to solve Markov Chains problems with application to page Ranking

Abderezak Touzene*

*المؤلف المقابل لهذا العمل

نتاج البحث: Conference contribution

ملخص

In this paper, we propose two parallel Aggregation-Isolation iterative methods for solving Markov chains. These parallel methods conserves as much as possible the benefits of aggregation, and Gauss-Seidel effects. Some experiments have been conducted testing models from queuing systems and models from Google Page Ranking. The results of the experiments show super linear speed-up for the parallel Aggregation-Isolation method.

اللغة الأصليةEnglish
عنوان منشور المضيفProceedings of the 2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2010
المعرِّفات الرقمية للأشياء
حالة النشرPublished - 2010
الحدث2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2010 - Atlanta, GA, United States
المدة: أبريل ١٩ ٢٠١٠أبريل ٢٣ ٢٠١٠

سلسلة المنشورات

الاسمProceedings of the 2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2010

Other

Other2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2010
الدولة/الإقليمUnited States
المدينةAtlanta, GA
المدة٤/١٩/١٠٤/٢٣/١٠

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1703???
  • ???subjectarea.asjc.1700.1712???
  • ???subjectarea.asjc.2600.2614???

بصمة

أدرس بدقة موضوعات البحث “Parallel isolation-aggregation algorithms to solve Markov Chains problems with application to page Ranking'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا