我终于确定这个函数是我的大部分瓶颈问题的原因。我认为这是因为当大多数突触已经活跃时发生的大量过度随机访问。基本上,正如标题所说,我需要以某种方式优化算法,以便在登陆剩下的少数几个之前,我不会随机检查大量活动元素。随机选择一个空向量元素,当事先可能知道哪些元素已满时
此外,我还包括可以发现其他缺陷的全部功能。
void NetClass::Explore(vector <synapse> & synapses, int & n_syns) //add new synapses
{
int size = synapses.size();
assert(n_syns <= size);
//Increase the age of each active synapse by 1
Age_Increment(synapses);
//make sure there is at least one inactive vector left
if(n_syns == size)
return;
//stochastically decide whether a new connection is added
if((rand_r(seedp) %1000) < (x/(1 +(n_syns * (y/100)))))
{
n_syns++; //a new synapse has been created
//main inefficiency here
while(1)
{
int syn = rand_r(seedp) % (size);
if (!synapses[syn].active)
{
synapses[syn].active = true;
synapses[syn].weight = .04 + (float (rand_r(seedp) % 17)/100);
break;
}
}
}
}
void NetClass::Age_Increment(vector <synapse> & synapses)
{
for(int q=0, int size = synapses.size(); q < size; q++)
if(synapses[q].active)
synapses[q].age++;
}