微信公众号搜"智元新知"关注
微信扫一扫可直接关注哦!

内存管理结果数据处理MATLAB程序

clear all;

clc;

close all;

figure;

%%

m2 = load('申请内存大小.txt');

m = load('内存利用率ff.txt');

m1 = load('每次申请查询次数ff.txt');

m3 = load('分配记录IDff.txt');

m = m';

m1 = m1';

m2 = m2';

m3 = m3';

n = length(m);

n1 = length(m1);

n2 = length(m2);

count = sum(m1) / n1

num = sum(m2) / n2

x = 1:n;

for i = 1:n

   xx = 0;

   for j = 1:i

       xx = xx + m(j);

   end

   y(i)= xx / i;

end

s1 = y(n);

plot(x,y,'r');

title('内存利用率曲线图');

xlabel('申请次数');

ylabel('内存平均利用率');

hold on;

clear m n x y xx m1 m2 m3

%%

m = load('内存利用率nf.txt');

m1 = load('每次申请查询次数nf.txt');

m3 = load('分配记录IDnf.txt');

m = m';

m1 = m1';

m3 = m3';

n = length(m);

n1 = length(m1);

n3 = length(m3);

x = 1:n;

count = sum(m1) / n1

for i = 1:n

   xx = 0;

   for j = 1:i

       xx = xx + m(j);

   end

   y(i)= xx / i;

end

s2 = y(n);

plot(x,'b');

hold on;

clear m n x y xx m1 m2 m3

%%

m = load('内存利用率bf.txt');

m1 = load('每次申请查询次数bf.txt');

m3 = load('分配记录IDbf.txt');

m = m';

m1 = m1';

m3 = m3';

n = length(m);

n1 = length(m1);

n3 = length(m3);

x = 1:n;

count = sum(m1) / n1

for i = 1:n

   xx = 0;

   for j = 1:i

       xx = xx + m(j);

   end

   y(i)= xx / i;

end

s3 = y(n);

plot(x,'g');

hold on;

clear m n x y xx m1 m2 m3

%%

m = load('内存利用率wf.txt');

m1 = load('每次申请查询次数wf.txt');

m3 = load('分配记录IDwf.txt');

m = m';

m1 = m1';

m3 = m3';

n = length(m);

n1 = length(m1);

n3 = length(m3);

x = 1:n;

count = sum(m1) / n1

for i = 1:n

   xx = 0;

   for j = 1:i

       xx = xx + m(j);

   end

   y(i)= xx / i;

end

s4 = y(n);

plot(x,'m');

hold on;

clear m n x y xx m1 m2 m3

legend('首次适应算法','循环首次适应算法','最佳适应算法','最坏适应算法');

%%

figure;

s =[s1,s2,s3,s4];

x = 1:length(s);

bar(x,s,0.5);

for i = 1:length(s)

   text(i,s(i),num2str(s(i)),'VerticalAlignment','bottom','HorizontalAlignment','center');

end

title('内存平均利用率的条形图');

xlabel('申请次数');

ylabel('y内存平均利用率');

set(gca,'xticklabel',{'首次适应','循环首次适应','最佳适应','最坏适应'});

版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 [email protected] 举报,一经查实,本站将立刻删除。

相关推荐