4. Parallel Computing 14. Introduction


Figure 307: State-transition diagram of multiprocessor flag signaling



Download 85,22 Kb.
Pdf ko'rish
bet18/26
Sana16.01.2022
Hajmi85,22 Kb.
#375116
1   ...   14   15   16   17   18   19   20   21   ...   26
Bog'liq
14 Parallel Computing

Figure 307: State-transition diagram of multiprocessor flag signaling

The type of signaling described above is called "busy-waiting" because the looping

processor is kept busy, but does no real work. To avoid this apparent waste of the

processor as a resource, we can interleave the testing of the bit with some useful work. Or

we can have the process "go to sleep" and try again later. Going to sleep means that the

process gives up the processor to another process, so that more use is made of the

resource.

Above we have shown how a shared variable can be used to control the progress of one

process in relation to another. While this type of technique could be regarded as a feature

of shared memory program, it can also present a liability. When two or more processors

share memory, it is possible for the overall result of a computation to fail to be unique.

This phenomenon is known as indeterminacy. Consider, for example, the case where two

processors are responsible for adding up a set of numbers. One way to do this would be to

share a variable used to collect the sum. Depending on how this variable is handled,

indeterminacy could result. Suppose, for example, that a process assigns the sum variable

to a local variable, adds a quantity to the local variable, then writes back the result to the

sum:

local = sum;



local += quantity to be added;

sum = local;

Suppose two processes follow this protocol, and each has its own local variable. Suppose

that sum is initially 0 and one process is going to add 4 and the other 5. Then depending

on how the individual instructions are interleaved, the result could be 9 or it could be 4 or

5. This can be demonstrated by a state diagram. The combined programs are

A1:  localA = sum;

B1: localB = sum;

A2:  localA += 4;

B2: localA += 5;

A3:  sum = localA;

B3: sum = localB;

A4:

B4:



600

Parallel Computing

The state is:

(ip of A, ip of B, localA, localB, sum)

A1, B1, _, _, 0

A2, B1,0, _, 0

A3, B1, 4, _, 0

A1, B2, _, 0, 0

A2, B2, 0, 0, 0

A3, B2, 4, 0, 0

A1, B3, _, 5, 0

A2, B3, 0, 5, 0

A3, B3, 4, 5, 0

A1, B4, _, 5, 5

A2, B4,5, 5, 5

A3, B4, 9, 5, 5

A4, B1, 4, _, 4

A4, B2, 4, 4, 4

A4, B3, 4, 9, 4

A4, B4, 9, 9,9

A4, B2, 4, 0, 4

A4, B3, 4, 5, 4

A2, B4, 0, 5, 5

A3, B4, 4, 5, 5

A4, B4, 4, 5, 4

A4, B4, 4, 5,5




Download 85,22 Kb.

Do'stlaringiz bilan baham:
1   ...   14   15   16   17   18   19   20   21   ...   26




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