{ "@context": "https://schema.org", "@type": "Organization", "name": "Brainscape", "url": "https://www.brainscape.com/", "logo": "https://www.brainscape.com/pks/images/cms/public-views/shared/Brainscape-logo-c4e172b280b4616f7fda.svg", "sameAs": [ "https://www.facebook.com/Brainscape", "https://x.com/brainscape", "https://www.linkedin.com/company/brainscape", "https://www.instagram.com/brainscape/", "https://www.tiktok.com/@brainscapeu", "https://www.pinterest.com/brainscape/", "https://www.youtube.com/@BrainscapeNY" ], "contactPoint": { "@type": "ContactPoint", "telephone": "(929) 334-4005", "contactType": "customer service", "availableLanguage": ["English"] }, "founder": { "@type": "Person", "name": "Andrew Cohen" }, "description": "Brainscape’s spaced repetition system is proven to DOUBLE learning results! Find, make, and study flashcards online or in our mobile app. Serious learners only.", "address": { "@type": "PostalAddress", "streetAddress": "159 W 25th St, Ste 517", "addressLocality": "New York", "addressRegion": "NY", "postalCode": "10001", "addressCountry": "USA" } }

Election Algos Flashcards

(9 cards)

1
Q

Describe a simple election algorithm

A
  • P broadcasts its request to all processes
  • Each process responds with id & current load
  • P chooses least loaded process and announces to everyone
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What are the 5 states a process can be in?

A
  • Sleep
  • Cand/Active
  • Passive
  • Lost
  • Leader
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

An election algorithm must satisfy these 3 things:

A
  • Terminal configuration in each computation
  • Each configuration must have a leader and other active processes in state Lost
  • An execution can be initialised by any process
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Is an election algorithm centralised or decentralised?

A

Decentralised

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What must precede an election?

A

A ‘wake-up’ call.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Describe how ‘wake-up’ method works.

A
  • Election initiator sends wake up message to all neighbours
  • Any process that receives the message will:
    1. Wake up
    2. Send wake up message to its neighbours.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Why does a woken up process only execute the wave algorithm after it knows all its neighbours have woken up?

A

No First-In First-Out communication assumed.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What construction can be used to make an election algorithm centralised?

A

Extinction.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Explain the principles of extinction.

A
  • Each wave holds id of initiator
  • Only one wave, the one with smallest id, survives.
  • Initiator announces the process with smallest id as leader.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly