China
Africa
Explore chapters and articles related to this topic
Application Mapping on Network-on-Chip
Published in Santanu Kundu, Santanu Chattopadhyay, Network-on-Chip, 2018
Santanu Kundu, Santanu Chattopadhyay
Application mapping refers to the problem of determining the router positions to which individual cores of an application be mapped. The major goal of the operation is to minimize the communication cost. Communication cost controls the latency of communication between the cores and the overall power consumption. The mapping problem is NP-hard. In this chapter, various strategies for application mapping have been discussed. While ILP-based approaches produce the best results, the overall computation time is high, restricting its usage to only a few cores in the application graph. The constructive heuristic approaches attempt to construct a solution, which may be followed by an iterative improvement phase. The evolutionary algorithms perform particularly well. Such algorithms work well even for reasonably large number of cores (e.g., 128 cores). The mapping problem can be extended to the power- and thermal-aware strategies.
A mixed-integer programming formulation for the double row layout of machines in manufacturing systems
Published in International Journal of Production Research, 2019
In order to solve the DRLP with asymmetric flows, Murray, Smith, and Zhang (2013) implemented the five constructive heuristics of Chung and Tanchoco (2010) and three new ones. The new constructive heuristics, named minFFasym, maxFFasym and maxFFmod, are based on Chung and Tanchoco’s MinFF and MaxFF heuristics and aim at accommodating asymmetric material flow. They report that these eight constructive heuristics produce solutions of similar quality. However, a large improvement can be obtained by a combination of a constructive heuristic and a simple local search heuristic.
A study on GPU acceleration applied to 2D irregular packing problems
Published in International Journal of Computer Integrated Manufacturing, 2022
André Kubagawa Sato, Thiago Castro Martins, Marcos Sales Guerra Tsuzuki
Another important 2D irregular variant is the bin packing problem, which consists of minimizing the number of containers for a given set of items. Due to the larger size of practical instances, most proposed solutions adopt simple constructive heuristic methods. Okano (2002) and Babu and Babu (2001) used the popular bottom left heuristic with a scanline and a raster method approach, respectively. The raster method was also adopted by Baldacci et al. (2014), allowing for defective area avoidance in leather industry applications.