This paper presents a new logical mechanism called as Cluster Based Hierarchical Routing (CBHR) to improve the efficiency of NoC. This algorithm comprises the following steps: 1) the network is segmented logically int...This paper presents a new logical mechanism called as Cluster Based Hierarchical Routing (CBHR) to improve the efficiency of NoC. This algorithm comprises the following steps: 1) the network is segmented logically into clusters with same size or different sizes;2) algorithms are assigned for internal and global routing;3) routers working functions are modified logically to support local and global communication. The experiments have conducted for CBHR algorithm for two dimensional mesh and torus architectures. The performance of this mechanism is analyzed and compared with other deterministic and adaptive routing algorithms in terms of energy, throughput with different packet injection ratios.展开更多
为解决柔性流水车间变工时排产优化问题(flow shop scheduling problem with variable processing times,FFSP-VPT),对变工时工序工时选择方式、次品检测和返工方式进行分析,建立了FFSP-VPT数学模型。针对FFSP-VPT特点,结合ROV编码设计...为解决柔性流水车间变工时排产优化问题(flow shop scheduling problem with variable processing times,FFSP-VPT),对变工时工序工时选择方式、次品检测和返工方式进行分析,建立了FFSP-VPT数学模型。针对FFSP-VPT特点,结合ROV编码设计了一种二段式编码。在蝙蝠算法的基础上,加入了基于汉明距离的最优个体集和自适应位置更新机制,提出了一种基于精英个体集的自适应蝙蝠算法(self-adaptive elite bat algorithm,SEBA)作为全局优化算法。设计交叉实验确定SEBA算法中的重要参数的最佳值。通过仿真测试,将测试结果与其它算法比较,验证了SEBA算法对于解决实际生产中FFSP-VPT类问题的有效性。展开更多
文摘This paper presents a new logical mechanism called as Cluster Based Hierarchical Routing (CBHR) to improve the efficiency of NoC. This algorithm comprises the following steps: 1) the network is segmented logically into clusters with same size or different sizes;2) algorithms are assigned for internal and global routing;3) routers working functions are modified logically to support local and global communication. The experiments have conducted for CBHR algorithm for two dimensional mesh and torus architectures. The performance of this mechanism is analyzed and compared with other deterministic and adaptive routing algorithms in terms of energy, throughput with different packet injection ratios.
文摘为解决柔性流水车间变工时排产优化问题(flow shop scheduling problem with variable processing times,FFSP-VPT),对变工时工序工时选择方式、次品检测和返工方式进行分析,建立了FFSP-VPT数学模型。针对FFSP-VPT特点,结合ROV编码设计了一种二段式编码。在蝙蝠算法的基础上,加入了基于汉明距离的最优个体集和自适应位置更新机制,提出了一种基于精英个体集的自适应蝙蝠算法(self-adaptive elite bat algorithm,SEBA)作为全局优化算法。设计交叉实验确定SEBA算法中的重要参数的最佳值。通过仿真测试,将测试结果与其它算法比较,验证了SEBA算法对于解决实际生产中FFSP-VPT类问题的有效性。
