Voltage island based heterogeneous NoC design through constraint programming
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/25080
Computers and Electrical Engineering
- Research Paper 
This paper discusses heterogeneous Network-on-Chip (NoC) design from a Constraint Programming (CP) perspective and extends the formulation to solving Voltage-Frequency Island (VFI) problem. In general, VFI is a superior design alternative in terms of thermal constraints, power consumption as well as performance considerations. Given a Communication Task Graph (CTG) and subsequent task assignments for cores, cores are allocated to the best possible places on the chip in the first stage to minimize the overall communication cost among cores. We then solve the application scheduling problem to determine the optimum core types from a list of technological alternatives and to minimize the makespan. Moreover, an elegant CP model is proposed to solve VFI problem by mapping and grouping cores at the same time with scheduling the computation tasks as a limited capacity resource allocation model. The paper reports results based on real benchmark datasets from the literature. © 2014 Elsevier Ltd. All rights reserved.
Showing items related by title, author, creator and subject.
Bektaş, T.; Elmastaş, S. (2007)In this paper, an exact solution approach is described for solving a real-life school bus routing problem (SBRP) for transporting the students of an elementary school throughout central Ankara, Turkey. The problem is ...
New formulations of the Hop-Constrained Minimum Spanning Tree problem via Miller-Tucker-Zemlin constraints Akgün I.; Tansel, B.C. (2011)Given an undirected network with positive edge costs and a natural number p, the Hop-Constrained Minimum Spanning Tree problem (HMST) is the problem of finding a spanning tree with minimum total cost such that each path ...
Min-degree constrained minimum spanning tree problem: New formulation via Miller-Tucker-Zemlin constraints Akgün I.; Tansel, B. (2010)Given an undirected network with positive edge costs and a positive integer d > 2, the minimum-degree constrained minimum spanning tree problem is the problem of finding a spanning tree with minimum total cost such that ...