---

Abstract:
Reconfiguration capability in nowadays embedded systems such as Reconfigurable Computing (RC) systems improves the execution of applications efficiently. However, the reconfiguration overhead in the mapping process of application compilation degrades the performance of these systems. In this paper, a novel distributed application graph mapping has been proposed to reduce the heavy computations of mapping problem analytically. For this purpose, matrix modifications have been used to derive a distance model in resource graph. Using this model, it is possible to remove heavy-weight values from the search space of solutions and achieve a low-cost solution faster, as well. This model classifies the distance matrix of resource graph into independent regions to transform the mapping problem into suboptimal problems. Simulation results show that the proposed approach for application graph mapping outperformed the stateof-art methods in terms of complexity and time overhead, especially for large-scale application graphs.

Keywords: Component , FPGA , Reconfigurable Hardware , Application Compilation , Application Mapping.

References:
[1] F. Lotfifar and H.S. Shahhoseini, "Performance modeling of partially reconfigurable computing systems", IEEE/ACS International Conference on Computer Systems and Applications, pp. 94-99, 2008.  Google Scholar
[2] H. Naderi, H.S. Shahhoseini and A.H. Jafari, "Evaluation mcdm multidisjoint paths selection algorithms using fuzzy-copeland ranking method", International Journal of Communication Networks and Information Security, vol. 5, pp. 59-67, 2013.  Google Scholar
[3] A. Tabatabaei, M.R. Mosavi, A. Khavari and H.S. Shahhoseini, "Reliable urban canyon navigation solution in GPS and GLONASS integrated receiver using improved fuzzy weighted least-square method", Wireless Personal Communications, vol. 94, pp. 3181-3196, 2017.   Google Scholar
[4] M. Saeed and H.S. Shahhoseini, "APPMA-An anti-phishing protocol with mutual authentication", IEEE symposium on Computers and Communications, pp. 308-313, 2010.
Show Context.  Google Scholar
[5] H.S. Shahhoseini, M. Naderi and R. Buyya, "Shared memory multistage clustering structure an efficient structure for massively parallel processing systems", Proceedings Fourth International Conference/Exhibition on High Performance Computing in the AsiaPacific Region, vol. 1, pp. 22-27, 2000.  Google Scholar
[6] A. Yoosefi and H.R. Naji, "A clustering algorithm for communicationaware scheduling of task graphs on multi-core reconfigurable systems", IEEE Transactions on Parallel and Distributed Systems, vol. 28, pp. 2718-2732, 2017.  Google Scholar
[7] M.M. Bassiri and H.S. Shahhoseini, "Configuration reusing in on-line task scheduling for reconfigurable computing systems", Journal of Computer Science and Technology, vol. 26, pp. 463-474, 2011.  Google Scholar
[8] Z. Guettatfi, M. Platzner, O. Kermia and A. Khouas, "An Approach for Mapping Periodic Real-Time Tasks to Reconfigurable Hardware", IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 99-106, 2019.  Google Scholar
[9] M.M. Bassiri and H.S. Shahhoseini, "Mitigating reconfiguration overhead in on-line task scheduling for reconfigurable computing systems", 2nd International Conference on Computer Engineering and Technology, pp. 391-397, 2010.  Google Scholar
[10] M.M. Bassiri and H.S. Shahhoseini, "A new approach in on-line task scheduling for reconfigurable computing systems", 21st IEEE International Conference on Application-specific Systems Architectures and Processors, pp. 321-324, 2010.  Google Scholar
[11] M.M. Bassiri and H.S. Shahhoseini, "On-line HW/SW partitioning and co-scheduling in reconfigurable computing systems", 2nd IEEE International Conference on Computer Science and Information Technology, pp. 557-562, 2009.  Google Scholar
[12] F. Lotfifar and H.S. Shahhoseini, "A low-complexity task scheduling algorithm for heterogeneous computing systems", Third Asia International Conference on Modelling & Simulation, pp. 596-601, 2009.  Google Scholar
[13] A. Purgato, D. Tantillo, M. Rabozzi, D. Sciuto and M.D. Santambrogio, "Resource-efficient scheduling for partially-reconfigurable FPGAbased systems", IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 189-197, 2016.  Google Scholar
[14] C.H. Huang, C.Y. Wang and P.A. Hsiung, "Elastic superposition task mapping for NoC-based reconfigurable systems", Microprocessors and Microsystems, vol. 51, pp. 297-312, 2017.  Google Scholar
[15] S. Saeidi, A. Khademzadeh and F. Vardi, "Crinkle: A heuristic mapping algorithm for network on chip", IEICE Electronics Express, vol. 6, pp. 1737-1744, 2009.  Google Scholar
[16] S.M. Mohtavipour and H.S. Shahhoseini, "A Link-Elimination Partitioning Approach for Application Graph Mapping in Reconfigurable Computing Systems", The Journal of Supercomputing, pp. 1-25, 2019.  Google Scholar
[17] T. Lei and S. Kumar, "A two-step genetic algorithm for mapping task graphs to a network on chip architecture", IEEE Euromicro Symposium on Digital System Design, pp. 180-187, 2003. Google Scholar
[18] F. Larumbe and B. Sanso, "A tabu search algorithm for the location of data centers and software components in green cloud computing networks", IEEE Transactions on Cloud Computing, vol. 1, pp. 2235, 2013.  Google Scholar
[19] M. Mollajafari and H.S. Shahhoseini, "An efficient ACO-based algorithm for scheduling tasks onto dynamically reconfigurable hardware using TSP-likened construction graph", Applied Intelligence, vol. 45, pp. 695-712, 2016.  Google Scholar
[20] S. Tosun, O. Ozturk, E. Ozkan and M. Ozen, "Application mapping algorithms for mesh-based network-on-chip architectures", The Journal of Supercomputing, vol. 71, pp. 995-1017, 2015.  Google Scholar
[21] H.S. Shahhoseini, A. Naseri and M. Naderi, "A new matrix method for pulse train identification", IEEE Mediterranean Electrotechnical Conference, pp. 183-187, 2002.  Google Scholar
[22] E. Andreotti, D. Remondini, G. Servizi and A. Bazzani, "On the multiplicity of Laplacian eigenvalues and Fiedler partitions", Linear Algebra and its Applications, vol. 544, pp. 206-222, 2018.  Google Scholar
[23] F. Galea, S. Carpov and L. Zaourar, "Multi-start simulated annealing for partially-reconfigurable FPGA floorplanning", IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 1335-1338, 2018.  Google Scholar
[24] H. Daryanavard, M. Eshghi and A. Jahanian, "A fast placement algorithm for embedded just-in-time reconfigurable extensible processing platform", The Journal of Supercomputing, vol. 71, pp. 121-143, 2015. Google Scholar
 

---

Cite this paper as:
S. M. Mohtavipour and H. Shahriar Shahhoseini, "A Low-Cost Distributed Mapping for Large-Scale Applications of Reconfigurable Computing Systems," 2020 25th International Computer Conference, Computer Society of Iran (CSICC), Tehran, Iran, 2020, pp. 1-6, doi: 10.1109/CSICC49403.2020.9050063