lingo sample code for liveness analysis

最新推荐文章于 2024-04-08 12:03:36 发布

原创最新推荐文章于 2024-04-08 12:03:36 发布 · 1.5k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#ui #newline #file #graph #function #less

lingo 专栏收录该内容

1 篇文章

订阅专栏

本文介绍了一个用于优化内存分配的数学模型，该模型通过定义变量、约束条件和目标函数来最小化内存使用成本，并确保所有变量在内存中正确放置且不发生冲突。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

model:
sets:
	!F;
	V: vSize, vRead, vWrite,vStart, vDcost;
	U: uSize, uRead, uWrite;	
	!F2V(F,V);
	!F2U(F,U): fInU;
	V2U(V,U): x, cost;
	V2V(V, V): iltj;
endsets

data:
	M = 20000;
	DRead = 104.4;
	DWrite = 104.4;
	
	U, uRead, uWrite, uSize = @file('E:/qali/memory.txt');	
	
	V = @file('E:/qali/spm/basicmath.opt1.variable');
	
	vRead=@file(E:/qali/spm/basicmath.opt1.variable);
	vWrite=@file(E:/qali/spm/basicmath.opt1.variable);
	vSize=@file(E:/qali/spm/basicmath.opt1.variable);

	V2V=@file('E:/qali/spm/basicmath.opt.ig.out'); 
	!Inter=@file(E:/Mibench_spm/basicmath.opt.gIG);
	@text(E:/qali/lingo.log)='Size of Memory units:\n' uSize;
enddata

Calc:
	@for(U(ui): 
		@for(V(vi):
			cost(vi,ui) = (uRead(ui) * vRead(vi) + uWrite(ui) * vWrite(vi) ) 
		);
	);
	@for(V(vi):
		vDcost(vi) = (DRead * vRead(vi) + DWrite * vWrite(vi) ) * vSize(vi)
		);
	

	nNumber = @size(V);
	nSize = @sum(V(I): vSize(I) );
	@write('Total functions: ', @size(F), @newline(1));
	@write('Total variable number: ', nNumber, @newline(1));
	@write('Total variable size: ', nSize, @newline(1));
	@write('Total interfere: ', @size(V2V), @newline(1));	
endcalc

min = @sum(V2U: x * cost) + @sum(V(vi): (1-@sum(U(ui): x(vi,ui)))*vDcost);
!u2f: size of function fi in memory ui;
@for(U(ui): @sum(F2U(fi,ui):fInU(fi,ui)) <= uSize(ui) );
!@for(U2F(ui,fi): @bnd(0, fInU(ui,fi), uSize(ui)) );
!@for(F2U: @gin(fInU) );

!x(vi,ui): assuming variable vi is allocated into memory ui;
@for(V(vi): @sum(V2U(vi,ui): x(vi,ui)) <= 1 );
@for(V2U: @bin(x) );

!start(vi): start point of location of variable;
!@for(F2V(fi,vi): @for(U(ui): vStart(vi) >= @sum(F2U(f1,ui)| fID(f1) #lt# fID(fi): fInU(f1,ui) ) + (x(vi,ui)-1)*M) );
!@for(F2V(fi,vi): @for(U(ui): vStart(vi) <= @sum(F2U(f1,ui)| fID(f1) #le# fID(fi): fInU(f1,ui) ) - vSize(vi) + (1-x(vi,ui))*M) );
!@for(V(vi): @gin(vStart) );

!@for(F2V(fi,vi): @for(U(ui): vStart(vi)+vSize(vi) < fInU(fi,ui) + (1- x(vi,ui)) * M ) );
!@for(V(vi):@gin(vStart) );

!iltj: assuming i is less than j, for the interference graph;
@for(V2V: @bin(iltj) );
@for(V2V(v1,v2): @for(U(ui): vStart(v1) + 1<= vStart(v2) + (1-iltj(v1,v2))*M + (2-x(v1,ui)-x(v2,ui))*M ) );
@for(V2V(v1,v2): @for(U(ui): vStart(v2) + 1<= vStart(v1) + iltj(v1,v2)*M + (2-x(v1,ui)-x(v2,ui))*M) );