Distributed computing



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

DISTRIBUTED COMPUTING

  • Fall 2007

ROAD MAP: OVERVIEW

  • Why are distributed systems interesting?
  • Why are they hard?

GOALS OF DISTRIBUTED SYSTEMS

  • Take advantage of cost/performance difference between microprocessors and shared memory multiprocessors
  • Build systems:
    • 1. with a single system image
    • 2. with higher performance
    • 3. with higher reliability
    • 4. for less money than uniprocessor systems
  • In wide-area distributed systems, information and work are physically distributed, implying that computing needs should be distributed. Besides improving response time, this contributes to political goals such as local control over data.

WHY SO HARD?

  • A distributed system is one in which each process has imperfect knowledge of the global state.
  • Reasons: Asynchrony and failures
  • We discuss problems that these two features raise and algorithms to address these problems.
  • Then we discuss implementation issues for real distributed systems.

ANATOMY OF A DISTRIBUTED SYSTEM

  • A set of asynchronous computing devices connected by a network. Normally, no global clock.
  • Communication is either through messages or shared memory. Shared memory is usually harder to implement.

ANATOMY OF A DISTRIBUTED SYSTEM (cont.)

  • BROADCAST MEDIUM
  • Special protocols will be possible for the broadcast medium.

COURSE GOALS

  • 1. To help you understand which system assumptions are important.
  • 2. To present some interesting and useful distributed algorithms and methods of analysis then have you apply them under challenging conditions.
  • 3. To explore the sources for distributed intelligence.

BASIC COMMUNICATION PRIMITIVE: MESSAGE PASSING

  • Paradigm:
  • Nice property: can make distribution transparent, since it does not matter whether destination is at a local computer or at a remote one (except for failures).
  • Clean framework: “Paradigms for Process Interaction in Distributed Programs,” G. R. Andrews, ACM Computing Surveys 23:1 (March 1991) pp. 49-90.

Download 0,86 Mb.

Do'stlaringiz bilan baham:
  1   2   3   4   5   6   7   8   9   ...   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