Dezvoltarea unui program,intr-un mediu de dezvoltare C/C++,luand in considerare cativa marimi a memoriei cache.

Va sa salut pe toti.
Ma numesc Baciu Dragos,student la specializare electronica aplicata,si am de realizat un proiect,mai complex,la disciplina "Arhitectura Microprocesoarelor"ce are legatura cu memoria cache a calculatorului.
Eu trebuie sa scriu un cod C/C++,intr-un mediu de dezvoltare,luand iun considerare marimile memoriei cache:Cache Size (bytes),Line Size (bytes),Associativity,Nr. of Banks,Technology Node (nm) si la fiecare in parte trebuie sa introduc niste valori numerice.Astfel,introducand,valorile numerice la fiecare marime,de expemplu:Cache Size (bytes)->2048,Line Size (bytes)->64,Associativity->1,Nr. of Banks->1,Technology Node (nm)->90.
Dupa ce am adaptat fiecare marime dupa sintaxa si semantica C/C++,si dupa ce programulC/C++ a executat aceste instructiuni pe care i le-am dat sa faca,interfata cu reultatele executiei sa fie asa:
Cache Parameters:
Number of banks:1
Total Cache Size (bytes):2048
Size in bytes of bank:2048
Number of sets per bank:32
Associativity:1
Block Size (bytes):64
Read/Write Ports per bank:1
Read Ports per bank:0
Write Ports per bank:0
Technology Size (nm):90
Vdd:1.2
Access time (ns): 0.714737400046
Random cycle time (ns):0.635374314918
Multisubbank interleave cycle time (of data array) (ns):0.26816101827
Total read dynamic energy per read port(nJ): 0.0829746534039
Total read dynamic power per read port at max freq (W): 0.130591765288
Total standby leakage power per bank (W): 0.000416942568627
Refresh power (percentage of standby leakage power): 0.0
Total area (mm^2): 0.556598170039
DRAM array refresh interval (microseconds):0.0
DRAM array availability (percentage):0.0
Best number of wordline segments (data): 2
Best number of bitline segments (data): 2
Best number of sets per wordline (data): 1.0
Best degree of bitline muxing (data): 1
Best degree of sense-amp level 1 muxing (data): 1
Best degree of sense-amp level 2 muxing (data): 2
Best number of wordline segments (tag): 2
Best number of bitline segments (tag): 4
Best number of sets per wordline (tag): 0.5
Best degree of bitline muxing (tag): 1
Best degree of sense-amp level 1 muxing (data): 1
Best degree of sense-amp level 2 muxing (data): 1
Deci mie imi trebuie codul sursa,unde pentru executie,afiseaza la inceput,marimile memorriei cache,si eu trebuie
sa introduc cateva valori:
Cache Size (bytes) ->2048
Line Size (bytes)  ->   64
Associativity  ->  1
Nr. of Bankks ->   1
Technology Node (nm)->  90

La compilare,sa afiseze rezultatele astea:
Cache Parameters:
Number of banks:1
Total Cache Size (bytes):2048
Size in bytes of bank:2048
Number of sets per bank:32
Associativity:1
Block Size (bytes):64
Read/Write Ports per bank:1
Read Ports per bank:0
Write Ports per bank:0
Technology Size (nm):90
Vdd:1.2
Access time (ns): 0.714737400046
Random cycle time (ns):0.635374314918
Multisubbank interleave cycle time (of data array) (ns):0.26816101827
Total read dynamic energy per read port(nJ): 0.0829746534039
Total read dynamic power per read port at max freq (W): 0.130591765288
Total standby leakage power per bank (W): 0.000416942568627
Refresh power (percentage of standby leakage power): 0.0
Total area (mm^2): 0.556598170039
DRAM array refresh interval (microseconds):0.0
DRAM array availability (percentage):0.0
Best number of wordline segments (data): 2
Best number of bitline segments (data): 2
Best number of sets per wordline (data): 1.0
Best degree of bitline muxing (data): 1
Best degree of sense-amp level 1 muxing (data): 1
Best degree of sense-amp level 2 muxing (data): 2
Best number of wordline segments (tag): 2
Best number of bitline segments (tag): 4
Best number of sets per wordline (tag): 0.5
Best degree of bitline muxing (tag): 1
Best degree of sense-amp level 1 muxing (data): 1
Best degree of sense-amp level 2 muxing (data): 1

Tot ce am evidentiat mai spus are legatura cu similatorul CACTI.Program care simuleaza totatisi parametrii momeoriei cache.Acest program poate fi accesat de pe site-ul oficial:http://www.hpl.hp.com/research/cacti/  -> http://quid.hpl.hp.c...9081/cacti/   .
Va multumesc.

indubitabil.

Brava.
Vrei sa iti facem noi temele, iar tu ? Ne platesti ? Ai bani sa ne platesti ? Tu daca ai fi capabil sa faci tema asta, cati bani ai cere cuiva care vrea sa o frece pe Facebook si Instagram ?