2021-09-27T22:25:06Zhttps://nagoya.repo.nii.ac.jp/oaioai:nagoya.repo.nii.ac.jp:000131672021-03-01T18:36:56ZAn Improved Algorithm for the Net Assignment ProblemONO, TakaoHIRATA, TomioCopyright (C) 2001 IEICElogic emulatornet assignment problemedge coloringnearly equitable edge coloringIn this paper, we consider the net assignment problem in the logic emulation system. This problem is also known as the board-level-routing problem. There are field programmable logic arrays (FPGAs) and crossbars on an emulator board. Each FPGA is connected to each crossbar. Connection requests between FPGAs are called nets, and FPGAs are interconnected through crossbars. We are required to assign each net to the suitable crossbar. This problem is known to be NP-complete in general. A polynomial time algorithm is known for a certain restricted case, in which we treat only 2-terminal nets. In this paper we propose a new polynomial time algorithm for this case.Institute of Electronics, Information and Communication Engineers2001-05-01engjournal articlehttp://hdl.handle.net/2237/15062https://nagoya.repo.nii.ac.jp/records/131670916-8508IEICE transactions on fundamentals of electronics, communications and computer sciencesE84-A511611165https://nagoya.repo.nii.ac.jp/record/13167/files/461.pdfapplication/pdf258.4 kB2018-02-20