With further increase of the number of on-chip device, the bus structure has not met the requirements. In order to make better communication between each part, the chip designers need to explore a new structure to sol...With further increase of the number of on-chip device, the bus structure has not met the requirements. In order to make better communication between each part, the chip designers need to explore a new structure to solve the interconnection of on-chip device. The paper proposes a network-on-chip dynamic and adaptive algorithm which selects NoC platform with 2-dimension mesh as the carrier, incorporates communication energy consumption and delay into unified cost function and uses ant colony optimization to realize NOC map facing energy consumption and delay. The experiment indicates that compared with random map, single objective optimization can separately saves （30% - 47 %） and （ 20% - 39%） in communication energy consumption and execution time compared with random map, and joint objective optimization can further excavate the potential of time dimension in mapping scheme dominated by the energy.展开更多
This paper studies the batch sizing scheduling problem with earliness and tardiness penalties which is closely related to a two-level supply chain problem.In the problem,there are K customer orders,where each customer...This paper studies the batch sizing scheduling problem with earliness and tardiness penalties which is closely related to a two-level supply chain problem.In the problem,there are K customer orders,where each customer order consisting of some unit length jobs has a due date.The jobs are processed in a common machine and then delivered to their customers in batches,where the size of each batch has upper and lower bounds and each batch may incur a fixed setup cost which can also be considered a fixed delivery cost.The goal is to find a schedule which minimizes the sum of the earliness and tardiness costs and the setup costs incurred by creating a new batch.The authors first present some structural properties of the optimal schedules for single-order problem with an additional assumption(a):The jobs are consecutively processed from time zero.Based on these properties,the authors give a polynomial-time algorithm for single-order problem with Assumption(a).Then the authors give dynamic programming algorithms for some special cases of multiple-order problem with Assumption(a).At last,the authors present some structural properties of the optimal schedules for single-order problem without Assumption(a) and give a polynomial-time algorithm for it.展开更多
文摘With further increase of the number of on-chip device, the bus structure has not met the requirements. In order to make better communication between each part, the chip designers need to explore a new structure to solve the interconnection of on-chip device. The paper proposes a network-on-chip dynamic and adaptive algorithm which selects NoC platform with 2-dimension mesh as the carrier, incorporates communication energy consumption and delay into unified cost function and uses ant colony optimization to realize NOC map facing energy consumption and delay. The experiment indicates that compared with random map, single objective optimization can separately saves （30% - 47 %） and （ 20% - 39%） in communication energy consumption and execution time compared with random map, and joint objective optimization can further excavate the potential of time dimension in mapping scheme dominated by the energy.
基金National Nature Science Foundation of China under Grant Nos.11471210and 11171207the Natural Science Foundation of Ningbo City under Grant No.2015A610168the Natural Science Foundation of Zhejiang Province of China under Grant No.LQl3A010010
文摘This paper studies the batch sizing scheduling problem with earliness and tardiness penalties which is closely related to a two-level supply chain problem.In the problem,there are K customer orders,where each customer order consisting of some unit length jobs has a due date.The jobs are processed in a common machine and then delivered to their customers in batches,where the size of each batch has upper and lower bounds and each batch may incur a fixed setup cost which can also be considered a fixed delivery cost.The goal is to find a schedule which minimizes the sum of the earliness and tardiness costs and the setup costs incurred by creating a new batch.The authors first present some structural properties of the optimal schedules for single-order problem with an additional assumption(a):The jobs are consecutively processed from time zero.Based on these properties,the authors give a polynomial-time algorithm for single-order problem with Assumption(a).Then the authors give dynamic programming algorithms for some special cases of multiple-order problem with Assumption(a).At last,the authors present some structural properties of the optimal schedules for single-order problem without Assumption(a) and give a polynomial-time algorithm for it.
