Messages Complexity Evaluation For

Messages Complexity Evaluation For Messages Complexity Evaluation For - Start

2016-05-13 40K 40 0 0

Messages Complexity Evaluation For - Description

Dijkstra-Scholton. and . Shavit-Francez. Termination Detection Algorithms . Kovan A. Mohammed Ali. Advanced Operating System Fall 2013. Kent State University. Abstract Of Presentation. The . Dijkstra-. ID: 318313 Download Presentation

Download Presentation

Messages Complexity Evaluation For




Download Presentation - The PPT/PDF document "Messages Complexity Evaluation For" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.



Presentations text content in Messages Complexity Evaluation For

Slide1

Messages Complexity Evaluation ForDijkstra-Scholton and Shavit-Francez Termination Detection Algorithms

Kovan A. Mohammed Ali

Advanced Operating System Fall 2013

Kent State University

Slide2

Abstract Of Presentation

The

Dijkstra-

Scholton

and

Shavit-Francez

are

algorithms for detecting termination in Distributed Systems. W

hich both are explicit termination or

proper

termination, all

processes are aware

of the

termination. In this

presentation, I

tried to compare

massages

complexity of both algorithms in fully connected

topology with two experiments.

Slide3

INTRODUCTION

The implicit termination algorithms are messages

termination.

The explicit termination is a processes

termination.

Dijkstra-Scholton

algorithm is for centralized (diffusing)

computations.

T

he

Shavit-Francez

Algorithm

generalized the

Dijkstra-Scholton

algorithm to be a decentralized

algorithm.

Two type of messages: MSG & SIG plus messages for Wave algorithm.

Slide4

Experimental Setup

I tried to run both

algorithms,

Dijkstra-Scholton

and

Shavit-Francez

in two different experiments of fully connected topology.

I started with

5

processes and

increased

the number

of the

processes by 5 in each step.

Also, I differ the number of initiators

5

to

50.

In the first

experiment: I used

Gossip-based topology

In

second

experiment:

I used

randomly

flood

on fully

connected topology.

Slide5

RESULTS

Slide6

RESULTS

Slide7

RESULTS

Slide8

CODE

I coded with C++.

I worked on MacBook and used

Xcode

5.0.2

I faced some problems at first with the Basic algorithms that keep sending messages. But I solve this problem by using guarded-commands.

I waited almost 3 hours for 1000 runs on random flood that never finished, after that, I realized that I typed one

extra zero.

Slide9

FUTURE WORK

Run both algorithms in different topologies

.

Run with more processes and more initiators.

Too many messages been sent during run time of algorithms. Improve both algorithms to be more efficient.

By

decreasing the number of initiators with random

flood the message complexity also decreased. Therefore, needs more research.

Slide10

References

Edsger

W.

Dijkstra

, C. S.

Scholten

“Termination Detection for Diffusing Computations” 1980.

Nir

Shavit

,

Nissim

Francez

“A new approach to detection of locally indicative stability” 1986.

Gerard Tel “Introduction to Distributed Algorithms”, Cambridge University Press, 2nd edition, 2000.

 

Slide11

Slide12

Slide13


About DocSlides
DocSlides allows users to easily upload and share presentations, PDF documents, and images.Share your documents with the world , watch,share and upload any time you want. How can you benefit from using DocSlides? DocSlides consists documents from individuals and organizations on topics ranging from technology and business to travel, health, and education. Find and search for what interests you, and learn from people and more. You can also download DocSlides to read or reference later.