{"id":951,"date":"2023-03-13T23:09:47","date_gmt":"2023-03-13T20:09:47","guid":{"rendered":"https:\/\/legendhomework.com\/tr\/?p=951"},"modified":"2023-03-13T23:09:47","modified_gmt":"2023-03-13T20:09:47","slug":"algoritmanin-bagimlilik-grafigi-multimedya-bolumu-multimedya-bolumu-odevleri-multimedya-bolumu-tez-yaptirma-multimedya-bolumu-odev-ucretleri","status":"publish","type":"post","link":"https:\/\/legendhomework.com\/tr\/algoritmanin-bagimlilik-grafigi-multimedya-bolumu-multimedya-bolumu-odevleri-multimedya-bolumu-tez-yaptirma-multimedya-bolumu-odev-ucretleri\/","title":{"rendered":"Algoritman\u0131n Ba\u011f\u0131ml\u0131l\u0131k Grafi\u011fi \u2013 Multimedya B\u00f6l\u00fcm\u00fc \u2013 Multimedya B\u00f6l\u00fcm\u00fc \u00d6devleri \u2013 Multimedya B\u00f6l\u00fcm\u00fc Tez Yapt\u0131rma \u2013Multimedya B\u00f6l\u00fcm\u00fc \u00d6dev \u00dccretleri"},"content":{"rendered":"

Algoritman\u0131n Ba\u011f\u0131ml\u0131l\u0131k Grafi\u011fi<\/span><\/strong><\/h3>\n

Bir ba\u011f\u0131ml\u0131l\u0131k grafi\u011fi t\u00fcretildikten sonra, (1) DG’deki her hesaplama d\u00fc\u011f\u00fcm\u00fcn\u00fc ger\u00e7ekle\u015ftirmek i\u00e7in bir donan\u0131m mod\u00fcl\u00fc belirleyerek ve (2) bu donan\u0131m mod\u00fcllerini programdaki y\u00f6nlendirilmi\u015f yaylara g\u00f6re birbirine ba\u011flayarak, DG do\u011frudan \u00f6zel bir donan\u0131m uygulamas\u0131na e\u015flenebilir.\u00a0<\/span><\/p>\n

Burada iki t\u00fcr donan\u0131m mod\u00fcl\u00fc kullan\u0131lacakt\u0131r: bir toplama i\u015flemini ger\u00e7ekle\u015ftirmek i\u00e7in bir saat d\u00f6ng\u00fcs\u00fc s\u00fcren bir toplay\u0131c\u0131 mod\u00fcl\u00fc ve bir \u00e7arpmay\u0131 hesaplamak i\u00e7in iki saat d\u00f6ng\u00fcs\u00fc s\u00fcren bir \u00e7arpan mod\u00fcl\u00fcd\u00fcr.<\/span><\/p>\n

DG’nin bir donan\u0131m mod\u00fcl\u00fcne e\u015flenmesi, DG’nin her d\u00fc\u011f\u00fcm\u00fcn\u00fcn, o d\u00fc\u011f\u00fcmde ger\u00e7ekle\u015ftirilecek i\u015flevi uygulayabilen bir donan\u0131m mod\u00fcl\u00fcne e\u015flendi\u011fi bir ba\u011flama i\u015flemidir. DG’de bir veya daha fazla d\u00fc\u011f\u00fcm uygulamak i\u00e7in tek bir donan\u0131m mod\u00fcl\u00fc kullan\u0131labilir. \u00d6nceki b\u00f6l\u00fcmde oldu\u011fu gibi, her bir donan\u0131m mod\u00fcl\u00fcn\u00fcn \u00e7\u0131kt\u0131s\u0131n\u0131n bir kay\u0131t defterinde tutulaca\u011f\u0131n\u0131 varsay\u0131yoruz.<\/span><\/p>\n

Performans K\u0131s\u0131tl\u0131 Mikro Mimari Sentezi<\/span><\/strong><\/h3>\n

Gerekti\u011fi kadar \u00e7ok donan\u0131m mod\u00fcl\u00fc kullan\u0131labilece\u011fini varsayal\u0131m. Ard\u0131ndan, teorik bir bak\u0131\u015f a\u00e7\u0131s\u0131yla, istenen verim oran\u0131n\u0131 elde etmek i\u00e7in her zaman bir uygulama t\u00fcretilebilir. Bunun nedeni, birbirini izleyen sekiz noktal\u0131 DCT i\u015flemlerinin birbirinden ba\u011f\u0131ms\u0131z olmas\u0131d\u0131r.<\/span><\/p>\n

Gelen her yeni sekiz noktal\u0131 veri \u00f6rne\u011fi i\u00e7in, her zaman yeni bir donan\u0131m mod\u00fcl\u00fc seti atanabilir ve hesaplama hemen ba\u015flat\u0131labilir. Bu nedenle, minimum ba\u015flatma aral\u0131\u011f\u0131 m\u00fcmk\u00fcn oldu\u011fu kadar k\u00fc\u00e7\u00fck yap\u0131labilir. Tek s\u0131n\u0131rlay\u0131c\u0131 fakt\u00f6r, veri \u00f6rneklerini uygun donan\u0131m mod\u00fcllerine y\u00f6nlendirme h\u0131z\u0131 olacakt\u0131r.<\/span><\/p>\n

Daha sonra, verim oran\u0131na ek olarak, gecikmenin de (veri \u00f6rneklerinin geli\u015fi ile bunlar\u0131n hesapland\u0131\u011f\u0131 zaman aras\u0131ndaki s\u00fcre) s\u0131n\u0131rland\u0131\u011f\u0131n\u0131 varsayal\u0131m.<\/span><\/p>\n

Yeterli say\u0131da donan\u0131m mod\u00fcl\u00fcn\u00fcn mevcut oldu\u011fu g\u00f6z \u00f6n\u00fcne al\u0131nd\u0131\u011f\u0131nda minimum gecikme, be\u015f toplama i\u015flemi ve \u00fc\u00e7 \u00e7arpma i\u015flemini i\u00e7eren kritik yol boyunca zaman gecikmesine e\u015fittir.<\/span><\/p>\n

B\u00f6ylece, minimum gecikme 5 \u00d7 1 + 3 \u00d7 2 = 11 saat \u00e7evrimidir. Maksimum gecikme s\u00fcresi, s\u0131rayla y\u00fcr\u00fct\u00fclen her i\u015flemle birlikte toplam hesaplama s\u00fcresine e\u015fittir. B\u00f6ylece, gecikmenin \u00fcst s\u0131n\u0131r\u0131 29 \u00d7 1 + 13 \u00d7 2 = 55 saat \u00e7evrimidir.<\/span><\/p>\n

Saat d\u00f6ng\u00fcs\u00fc ba\u015f\u0131na bir 8 noktal\u0131 DCT’lik bir \u00fcretim h\u0131z\u0131na ve 11 saat d\u00f6ng\u00fcs\u00fc gecikmesine ula\u015fan bir uygulamay\u0131 g\u00f6sterir. Saat frekans\u0131 95 MHz’den b\u00fcy\u00fckse, bu uygulaman\u0131n HDTV ana profil performans\u0131 i\u00e7in gerekli aktar\u0131m h\u0131z\u0131n\u0131 sa\u011flayabilece\u011fini unutmay\u0131n.<\/span><\/p>\n

Uygulama, yerden tasarruf etmek i\u00e7in \u00e7arp\u0131k bir bi\u00e7imde ifade edilir. Bu tabloda, Ai(1 \u2264 i \u2264 29) veya Mj(1 \u2264 j \u2264 13) \u00f6\u011felerinin her biri ayr\u0131 bir donan\u0131m mod\u00fcl\u00fcn\u00fc ifade eder ve uygulamada ayr\u0131 bir ham almal\u0131d\u0131r. \u0130\u00e7inde, her Ai veya Mj giri\u015fi, ayn\u0131 sekiz veri \u00f6rne\u011fine kar\u015f\u0131l\u0131k gelen belirli donan\u0131m mod\u00fcl\u00fcn\u00fcn program\u0131n\u0131 verir.<\/span><\/p>\n

Bu uygulamada 29 tam toplay\u0131c\u0131 ve 13 ard\u0131\u015f\u0131k d\u00fczen \u00e7arpan\u0131 kullan\u0131lm\u0131\u015ft\u0131r. Ard\u0131\u015f\u0131k \u00e7arpanla, her \u00e7arpma i\u015fleminin, her a\u015fama bir saat d\u00f6ng\u00fcs\u00fc alarak iki ard\u0131\u015f\u0131k a\u015famada ger\u00e7ekle\u015ftirilmesini \u015fart ko\u015fuyoruz. Bu iki a\u015fama aras\u0131ndaki bir tampon, ara sonucu saklayacakt\u0131r.<\/span><\/p>\n

\n

\nBa\u011f\u0131ml\u0131l\u0131k yapmayan UYU\u015eTURUCU maddeler<\/span>
\nMadde<\/a> ba\u011f\u0131ml\u0131l\u0131\u011f\u0131 Zararlar\u0131<\/span>
\nMadde ba\u011f\u0131ml\u0131s\u0131<\/span>
\nEn \u00e7ok ba\u011f\u0131ml\u0131l\u0131k yapan maddeler<\/span>
\nMadde ba\u011f\u0131ml\u0131l\u0131\u011f\u0131 yapan fakt\u00f6rler<\/span>
\nBa\u011f\u0131ml\u0131l\u0131k yapan zararl\u0131 madde<\/span>
\nMadde ba\u011f\u0131ml\u0131l\u0131\u011f\u0131 i\u00e7in al\u0131nacak \u00f6nlemler<\/span>
\nMadde Ba\u011f\u0131ml\u0131l\u0131\u011f\u0131 belirtileri<\/span><\/p>\n

\n

Bu \u015fekilde, 2. a\u015fama mevcut iterasyonun \u00e7arp\u0131m\u0131n\u0131n ikinci yar\u0131s\u0131n\u0131 tamamlarken, 1. a\u015fama bir sonraki iterasyondaki verilerin \u00e7arp\u0131m\u0131n\u0131n ilk yar\u0131s\u0131n\u0131 hesaplamaya ba\u015flayabilir. B\u00f6ylece, iki a\u015famal\u0131 ard\u0131\u015f\u0131k d\u00fczen i\u015flemiyle, b\u00f6yle bir \u00e7arpan, saat d\u00f6ng\u00fcs\u00fc ba\u015f\u0131na bir \u00e7arpmal\u0131k bir \u00fcretim h\u0131z\u0131na da ula\u015fabilir.<\/span><\/p>\n

\u00d6te yandan, iki ard\u0131\u015f\u0131k d\u00fczen a\u015famas\u0131na b\u00f6l\u00fcnemeyen bir t\u00fcr \u00e7arpan mod\u00fcl\u00fc kullan\u0131l\u0131rsa, her bir \u00e7arpma i\u015flemini serpi\u015ftirilmi\u015f bir \u015fekilde ger\u00e7ekle\u015ftirmek i\u00e7in iki \u00e7arpan da kullan\u0131lmal\u0131d\u0131r.<\/span><\/p>\n

Bu resimli. Veri setinin tek say\u0131s\u0131 \u00e7arpan #1’i kullan\u0131rken, veri setinin \u00e7ift say\u0131s\u0131 \u00e7arpan #2’yi kullan\u0131r. Bu nedenle, ortalama olarak, iki saat d\u00f6ng\u00fcs\u00fcnde iki \u00e7arpma i\u015flemi ger\u00e7ekle\u015ftirilebilir. Bu, saat d\u00f6ng\u00fcs\u00fc ba\u015f\u0131na bir \u00e7arpman\u0131n etkili bir verim oran\u0131na d\u00f6n\u00fc\u015f\u00fcr. Ancak ihtiya\u00e7 duyulan \u00e7arpan mod\u00fcllerinin toplam say\u0131s\u0131 2 \u00d7 13 = 26’ya y\u00fckselecektir.<\/span><\/p>\n

Verim oran\u0131n\u0131 iki saat d\u00f6ng\u00fcs\u00fc ba\u015f\u0131na bir 8 noktal\u0131 DCT’ye d\u00fc\u015f\u00fcrerek ve daha uzun gecikmeye izin vererek performans k\u0131s\u0131tlamalar\u0131n\u0131 gev\u015fetmeyi d\u00fc\u015f\u00fcnelim. Kompakt bir formatta olas\u0131 bir uygulama g\u00f6sterilmektedir.<\/span><\/p>\n

Bu uygulamada sadece normal \u00e7arpan mod\u00fclleri kullan\u0131yoruz. \u0130ki a\u015famal\u0131 ard\u0131\u015f\u0131k d\u00fczen \u00e7arpan mod\u00fclleri kullan\u0131rsak, \u00e7arpan say\u0131s\u0131 yediye d\u00fc\u015f\u00fcr\u00fclebilir. Toplay\u0131c\u0131 mod\u00fcl say\u0131s\u0131n\u0131 en aza indirmek i\u00e7in A26 ve A27’yi s\u0131rayla \u00e7al\u0131\u015ft\u0131rmay\u0131 se\u00e7iyoruz. Bu de\u011fi\u015fiklik, gecikmenin ek saat d\u00f6ng\u00fcs\u00fcn\u00fc a\u00e7\u0131klar.<\/span><\/p>\n

Kaynak K\u0131s\u0131tl\u0131 Mikro Mimari Sentezi<\/span><\/strong><\/h3>\n

Kaynak k\u0131s\u0131tlamal\u0131 bir sentez probleminde, donan\u0131m mod\u00fcllerinin say\u0131s\u0131 verilir. Ama\u00e7, bu kaynak k\u0131s\u0131tlamas\u0131 alt\u0131nda performans\u0131 (verim oran\u0131) en \u00fcst d\u00fczeye \u00e7\u0131karmakt\u0131r.<\/span><\/p>\n

A\u00e7\u0131klamak i\u00e7in, yaln\u0131zca bir toplay\u0131c\u0131 mod\u00fcl\u00fcn ve bir \u00e7arpan mod\u00fcl\u00fcn\u00fcn mevcut oldu\u011fu durumu ele alal\u0131m. \u0130\u00e7inde, ilk sat\u0131r, toplay\u0131c\u0131 mod\u00fcl i\u00e7in saat baz\u0131nda program\u0131 verir ve ikinci sat\u0131r, \u00e7arpan mod\u00fcl\u00fc i\u00e7in program\u0131 da verir.<\/span><\/p>\n

G\u00f6lgeli alan (M2, M6, M7), bu \u00e7arpma i\u015flemlerinin bir \u00f6nceki veri setine ait oldu\u011funu g\u00f6sterir. Bu nedenle, bu \u00f6rt\u00fc\u015fen bir programd\u0131r. Ba\u015flatma aral\u0131\u011f\u0131, yaln\u0131zca bir toplay\u0131c\u0131 mod\u00fclle elde edilebilecek minimum de\u011fer olan 29 saat \u00e7evrimidir.<\/span><\/p>\n

Toplay\u0131c\u0131n\u0131n ve \u00e7arpan\u0131n y\u00fcr\u00fct\u00fclmesi tamamen \u00f6rt\u00fc\u015f\u00fcyor. Dolay\u0131s\u0131yla, kaynak k\u0131s\u0131tlamas\u0131 (bir toplay\u0131c\u0131 ve bir \u00e7arpan mod\u00fcl\u00fc) g\u00f6z \u00f6n\u00fcne al\u0131nd\u0131\u011f\u0131nda, bunun verim oran\u0131n\u0131 (29 saat d\u00f6ng\u00fcs\u00fcnde 1 DCT) en \u00fcst d\u00fczeye \u00e7\u0131karan en uygun \u00e7\u00f6z\u00fcmlerden biri oldu\u011fu sonucuna da varabiliriz.<\/span><\/p>\n

Pratik Uygulama Hususlar\u0131<\/span><\/strong><\/h3>\n

Yukar\u0131daki sentez \u00f6rneklerinde, mod\u00fcller aras\u0131 ileti\u015fim yollar\u0131n\u0131n (veri yollar\u0131) karma\u015f\u0131kl\u0131\u011f\u0131 dikkate al\u0131nmaz ve bu ger\u00e7ekle\u015ftirmeyi kolayla\u015ft\u0131rmak i\u00e7in gereken ge\u00e7ici depolama \u00f6\u011felerinin (kay\u0131tlar) miktar\u0131n\u0131 da hesaba katmay\u0131z.<\/span><\/p>\n

Ayr\u0131ca, pratik donan\u0131m sentezinde, t\u00fcm mod\u00fcller ayn\u0131 kelime uzunlu\u011funa sahip de\u011fildir. Toplama ve \u00e7arpma i\u015flemleri nedeniyle dinamik aral\u0131k (anlaml\u0131 basamak say\u0131s\u0131) artacakt\u0131r.<\/span><\/p>\n

Hesaplaman\u0131n sonraki bir a\u015famas\u0131nda toplay\u0131c\u0131 daha fazla bite ihtiya\u00e7 duyacakt\u0131r. Bu nedenle, bir donan\u0131m sentezine ba\u015flamadan \u00f6nce, standard\u0131n gereksinimlerini kar\u015f\u0131lad\u0131\u011f\u0131ndan emin olmak i\u00e7in bu h\u0131zl\u0131 DCT algoritmas\u0131n\u0131n say\u0131sal \u00f6zelli\u011fini incelemek ve niceleme g\u00fcr\u00fclt\u00fc seviyesini belirlemek de \u00e7ok \u00f6nemlidir.<\/span><\/p>\n

\n\n
<\/div>\n\n<\/div>\n \n