New leader election algorithms in hypercube networks

العناوين الأخرى

خوارزميات جديدة لانتخاب القائد في الشبكات عالية التكعيب

مقدم أطروحة جامعية

al-Rifai, Muhammad N. S.

مشرف أطروحة جامعية

al-Ajluni, Naim

أعضاء اللجنة

Sharih, Ahmad
Abu Zitar, Raid
Qasim, Sharif
al-Bashir, Umar

الجامعة

جامعة عمان العربية

الكلية

كلية العلوم الحاسوبية و المعلوماتية

القسم الأكاديمي

قسم علم الحاسوب

دولة الجامعة

الأردن

الدرجة العلمية

دكتوراه

تاريخ الدرجة العلمية

2006

الملخص الإنجليزي

Leader Election is a fundamental problem in centralized control of distributed systems.

The election process starts when one or more processors discover that the leader has failed, and it terminates when the remaining processors are aware who the new leader is.

This Dissertation presents two new algorithms in distributed systems to solve this problem in Hypercube networks.

The first algorithm presents a new solution to leader failure problem with least number of messages and time steps.

The second algorithm provides a new solution to solve leader failure problem with the presence of one link failure.

Distributed leader election algorithms performance is evaluated in this dissertation by mathematical proof and simulation program for the first algorithm was made.

Contention and synchronization issues are considered in both algorithms.

In a network of N nodes connected by a hypercube network, the first algorithm uses O(N) messages to elect a new leader in O(log(N)) time steps when the leader failure is detected by one processor in the simple case.

In the worst case, when the failure is detected by more than one processor reached to N-1, the first algorithm uses O(N Log(N)) messages to elect a new leader in O(log(N)) time steps.

For the second algorithm, it uses O(N) messages to elect a new leader in O(log(N)) time steps in the simple case and O(N Log (N)) messages in O(log(N)) time steps in the worst case

التخصصات الرئيسية

الرياضيات

الموضوعات

عدد الصفحات

150

قائمة المحتويات

Table of contents.

Abstract.

Abstract in Arabic.

Chapter One : Introduction.

Chapter Two : Introduction to parallel and distributed systems.

Chapter Three : Literature review.

Chapter Four : New leader election algorithms in hypercube.

Chapter Five : Performance evaluation and simulation.

Chapter Six : Conclusions and future works.

References.

نمط استشهاد جمعية علماء النفس الأمريكية (APA)

al-Rifai, Muhammad N. S.. (2006). New leader election algorithms in hypercube networks. (Doctoral dissertations Theses and Dissertations Master). Amman Arab University, Jordan
https://search.emarefa.net/detail/BIM-528803

نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)

al-Rifai, Muhammad N. S.. New leader election algorithms in hypercube networks. (Doctoral dissertations Theses and Dissertations Master). Amman Arab University. (2006).
https://search.emarefa.net/detail/BIM-528803

نمط استشهاد الجمعية الطبية الأمريكية (AMA)

al-Rifai, Muhammad N. S.. (2006). New leader election algorithms in hypercube networks. (Doctoral dissertations Theses and Dissertations Master). Amman Arab University, Jordan
https://search.emarefa.net/detail/BIM-528803

لغة النص

الإنجليزية

نوع البيانات

رسائل جامعية

رقم السجل

BIM-528803