2
Oeueyiianeee Ainoaea?noaaiiue Oieaa?neoao
1999
CAIENEA II EO?NIAIE ?AAIOA
Nooaeaio a?oiiu II-42 Ieeeoi?ia TH.A.
Aeaeaa iienaiu i?eioeeiu ?aaiou nenoaiu oi?aaeaiey ia?aeeaeueiuie
i?ioeannaie a eieaeueiuo naoyo eiiiuethoa?ia.
1999
1. Oiiiaeaiea iao?eoe. (aeiioaoe/aneee i?eia?)
A * B =: C
Aaea A (m*s), B (s*n), C(m*n)
Aeai?eoi:
For i := 1 to s do
A?ao caaeneiinoae ii aeaiiui (Data Flow Graph)
A[1] C[1]
A[2] C[2]
A, B C
A[k] C[k]
Ae – aeeniao/a?. Eiiiooe?oao eaiaeu nayce e ?ani?aaeaeyao no?iee A[i] ii
i?ioeanni?ai.
I – i?e?iiee (aiieia iiaeao auoue oai aea aeeniao/a?ii), oi?ie?oao
iao?eoeo N ec iieo/aiiuo no?ie.
K – /enei i?ioeanni?ia ieion 2 (eee 1), eioi?ua auiieiytho oiiiaeaiea
no?iee ia iao?eoeo.
1) Anee k m. Oiaaea eaaeaeue i?ioeanni? iaeei ?ac auiieiyao
ia?aiiiaeaiea A[i]*B e ia?aaea?o ?acoeueoao i?ioeanni?o “I” . Aeaeaa
i?ioeann “I” oi?ie?oao iao?eoeo N e auaea?o ?acoeueoao iieueciaaoaeth.
2) Anee k m, oi aia/aea i?in/eouaathony ia?aua k no?ie.
Eiaaea au/eneaiey caeii/eony ia iaeiie ec k i?ioeanni?ia, oi ae
ia?aaea?ony neaaeothuay no?iea – o.a. A[k+1].
E oae aeaeaa, a inaiaiaeeaoeany i?ioeanni?u ia?aaeathony no?iee
A[k + i], i = 1 … m-k.
Aeinoieinoaa aeaiiie noaiu.
1) Iaeiie?aoaay caa?ocea iao?eoeu B a i?ioeanni?u-au/eneeoaee, e
aeaeueiaeoay caa?ocea oieueei aaeoi?ia-no?ie A[i] (ieieiecaoeey iioiea
aeaiiuo).
2) Aaoiiaoe/anee o/eouaaaony i?iecaiaeeoaeueiinoue i?ioeanni?ia. Anee
i?ioeanni? ?aaioaao auno?i, oi ii caa?oaeaaony aeiiieieoaeueii (neo/ae
i?e k
Нашли опечатку? Выделите и нажмите CTRL+Enter
