操作系统-磁盘调度算法:先来先服务,最短寻道时间优先,scan算法 - JAVA

);
if((min>computing)&&(moveDirection==0)&&(in>startPosition)){//向外移动
index = i;
min = computing;
}
else if((min>computing)&&(moveDirection==1)&&(in index = i;
min = computing;
}
if((index == -1)&&(moveDirection == 0)){//若移动到尽头,则返回扫描
moveDirection = 1;
}
else if((index == -1)&&(moveDirection == 1)){
moveDirection = 0;
}
i++;
}
thisPosition = visitList.remove(index);//设置当前磁头，访问后移除
totalMoving += Math.abs(startPosition-thisPosition);

SCAN.startPosition = thisPosition;

return thisPosition;
}
public static void display(){
System.out.println("平均寻道时间是:"+(double)totalMoving/size);
}

}

作者：mzlqh

操作系统-磁盘调度算法:先来先服务,最短寻道时间优先,scan算法 (三)