Optimal Periodoc Memory Allocation

7/26/2019 Optimal Periodoc Memory Allocation

1/40

OPTIMAL PERIODIC MEMORY ALLOCATION

FOR IMAGE PROCESSING WITH MULTIPLE

WINDOWS

GUIDED BY PROF.R.R.DUBE

PRESENTED BY DESHPANDE TANVI A.


2/40

CONTENTS:

SMALL INTRODUCTION OF PREVIOUS RESEARCH WORK

PROPOSED METHOD IN OUR ARCHITECTURE

COMPARISION OF IT WITH PREVIOUS WORK WITH HELP OF STEREO MATCHING VLSI PROCESSOR & OPTICLE FLOW

FUTURE SCOPE

CONCLUSION


3/40

LOW POWER MEMORY MAPPING THROUGH

REDUCING ADDRESS BUS ACTIVITY


4/40


5/40


6/40


7/40


8/40

PROPOSED WORK:

EFFICIENT MEMORY ALLOCATION TO MINIMISATION OFMEMORY MODULES & PEs PARELLEL ACCES FROM MODULES DUE TO OPTIMLE NO. OF MEMORY MODULE POWER USE

MINIMISATION DUE TO PARELLEL ACCES TIME OPTIMISATION ISACHIEVED

IT IS PURPOSED FOR IMAGE PROCESSING WHICH USESMULTIPLE WINDOWS

OPTIMISATION OF MEMORY MODULE IS DONE BY

PERIODIC FUCTION FOR MAPPING PIXEL TO MODULE IF IT IS APPILED TO STEREOMATCHING & OPTICAL FLOWTHEN MODULES USED ARE REDUSED TO 2.7%.THAT ISREDUSED BY 97.3% AND 9 % REPT.

SEARCH TIME!"#s$PENTIUM AT 2GH '


9/40


10/40

MEMORY ALLOCATION


11/40

MEMORY ALLOCATION FORMULTIPLE WINDOWS

Fig. 4. Mem !" #$$ %# i ' ( ! ) )i'* )+. ,#-Wi'* )+. , - A$$ %# i '/.


12/40


13/40

K=Total no. Of module !"#M$=module %&e'e ($)el $ to *e to'ed+,- $ - K

N$=Total no. of ($)el t&t %$l *e to'ed $n M$!/#!) 0#=1o2o'd$nate of ($)el+,- 3 - N$+


14/40

4ECTOR PAIR


15/40


16/40

ESTIMATION OF NUM5ER OFMEMORY MODULS


17/40

5ASIC AL6O FOR SEARC7 MET7OD8

FIRST STEP TOFIND OUTOPTIMAL

RECTAN6LEW7IC7 OCCUPYALL WINDOWS


18/40

SECOND STEP TO INTIALI9E 4ECTOR PAIR AT MA:IMUM 4ALUE

E0AMPLE:

INTIALI9E Sm$n=NO. OF MEMORY MODULERE;UIRED AT MA:


19/40

FORT7 STEP INITAILI9E 6= ALLPOSSI5LE 4ECTOR PAIR

6I4E !U 4# TO 8,.MEMORY ALLOCATION IS DONE AS T7EPERIODIC FUCTION?.FOR EAC7 WINDOW SAY W, W? @.Wn WE C7ECK

W7ET7ER ALL T7E PI:EL OF IN WINDOW AREALLOCATED TO DIFFERENT MEMORY MODULES

IF TRUE T7EN IF!S-Sm$n#=TRUE Sm$n=S


20/40


21/40

FURT7ER IMRO4EMENT IN SEARC7AL6O 8

IT CAN BE DONE BY FINDING E1UIVALENT PAIR,A2B- OF ,U2V-


22/40


23/40


24/40

REDUCTION IN COMPLE:ITY OF C7ECK BBALACEES8


25/40


26/40

PARELLEL ACCESS FOR MULTIPLE WINDOW


27/40


28/40


29/40

,8STEREO MAC7TIN6 4LSIPROCESSOR


30/40


31/40


32/40

FOR SP=8,Q=4


33/40

?8OPTICAL FLOW


34/40


35/40


36/40

FUTURE SCOPE8


37/40


38/40

CONCLUSION8

THIS PAPER PRESENT THE OPTIMLE PERIODIC ALLOCATION.IT HAS ARCHRTECTURE AS SIMPLIFIED FORMOF RECENT IMAGE PROCESSORS.IN GPU ALSO SUCH AS RADEON 0/3 0T2WECAN IMPLIMENT THIS ALGO. IT WILL REDUCE THE POWER COMSUMTION OFGPU2,5 TO / W-


39/40

REFERENCES8

PAPER PRESENTED BY HARIYAMA &KAMEYAMA IN IEEE TRANSATION ,VLSI-INMARCH 6 3

PAPER PRESENTED BY N.D. DUTT2PANDA &P.RA7AN ON8LOW POWER MEMORY MAPPINGTHROUTH REDUSING ADDRESS BUS

ACTIVITY9IEEE TRANSACTION ,VLSI-WWW.WIKIPEDIA .COM


40/40

THANK YO

Optimal Periodoc Memory Allocation

Documents

Transcript of Optimal Periodoc Memory Allocation