Distributed computing


PERSISTENT DATA STRUCTURES AND WAIT-FREEDOM



Download 0,86 Mb.
bet7/38
Sana24.04.2022
Hajmi0,86 Mb.
#578449
1   2   3   4   5   6   7   8   9   10   ...   38
Bog'liq
distcomp

PERSISTENT DATA STRUCTURES AND WAIT-FREEDOM

  • One node added, one node removed. To establish change, change the current pointer.
  • Old tree would still be available.
  • Important point: If process doing change should abort, then no other process is affected.
  • current
  • Original Data Structure
  • current

Logical Level is Nice, but…

  • We have talked about some programming constructs one can use above a communications infrastructure.
  • Understanding that infrastructure will be necessary to understand performance and fault tolerance considerations.
  • Our discussion of that will come from Joe Conron’s lecture notes datacomessence.ppt

ORDER-PRESERVING BROADCAST PROTOCOLS ON BROADCAST NET

    • Proposes a virtual distributed system that implements ordered atomic broadcast and failure detection.
    • Shows that this makes designing the rest of system easier.
    • Shows that implementing these two primitives isn’t so hard.
  • Paradigm: find an appropriate intermediate level of abstraction that can be implemented and that facilitates the higher functions.
  • Build Facilities that use Broadcast Network.
  • Implement Atomic Broadcast Network.
  • Framework: Chang, Jo-Mei. “Simplifying Distributed Database Systems Design by Using a Broadcast Network,” ACM SIGMOD, June 1984.

RATIONALE

  • Use property of current networks, which are naturally broadcast, although not so reliable.
  • Common tasks of distributed systems: Send same information to many sites participating in a transaction (update all copies); reach agreement (e.g. transaction commitment).

DESCRIPTION OF ABSTRACT MACHINE

  • Services and assurances it provides:
    • Atomic broadcast: failure atomicity. If a message is received by an application program at one site, it will be received at all operational sites.
    • System-wide clock and all messages are timestamped in sequence. This is the effective message order.
  • Assumptions: Failures are fail-stop, not malicious. So, for example token site will not lie about messages or sequence numbers.
  • Network failures require extra memory.

Download 0,86 Mb.

Do'stlaringiz bilan baham:
1   2   3   4   5   6   7   8   9   10   ...   38




Ma'lumotlar bazasi mualliflik huquqi bilan himoyalangan ©hozir.org 2024
ma'muriyatiga murojaat qiling

kiriting | ro'yxatdan o'tish
    Bosh sahifa
юртда тантана
Боғда битган
Бугун юртда
Эшитганлар жилманглар
Эшитмадим деманглар
битган бодомлар
Yangiariq tumani
qitish marakazi
Raqamli texnologiyalar
ilishida muhokamadan
tasdiqqa tavsiya
tavsiya etilgan
iqtisodiyot kafedrasi
steiermarkischen landesregierung
asarlaringizni yuboring
o'zingizning asarlaringizni
Iltimos faqat
faqat o'zingizning
steierm rkischen
landesregierung fachabteilung
rkischen landesregierung
hamshira loyihasi
loyihasi mavsum
faolyatining oqibatlari
asosiy adabiyotlar
fakulteti ahborot
ahborot havfsizligi
havfsizligi kafedrasi
fanidan bo’yicha
fakulteti iqtisodiyot
boshqaruv fakulteti
chiqarishda boshqaruv
ishlab chiqarishda
iqtisodiyot fakultet
multiservis tarmoqlari
fanidan asosiy
Uzbek fanidan
mavzulari potok
asosidagi multiservis
'aliyyil a'ziym
billahil 'aliyyil
illaa billahil
quvvata illaa
falah' deganida
Kompyuter savodxonligi
bo’yicha mustaqil
'alal falah'
Hayya 'alal
'alas soloh
Hayya 'alas
mavsum boyicha


yuklab olish