Browsing by Subject "Integer Linear Programming"
Now showing 1 - 2 of 2
Results Per Page
Sort Options
Item Open Access An ILP formulation for application mapping onto Network-on-Chips(IEEE, 2009) Tosun, S.; Öztürk, Özcan; Ozen, M.Ever shrinking technologies in VLSI era made it possible to place several modules onto a single die. However, the need for the new communication methods has also increased dramatically since traditional bus-based systems suffer from signal propagation delays, signal integrity, and scalability. Network-on-Chip (NoC) is the biggest step towards the communication bottleneck of System-on-Chip (SoC) architectures. In this paper, we present an Integer Linear Programming (ILP) formulation for application mapping onto mesh based Network-on-Chips to minimize the energy consumption of the system. The proposed method obtains optimal or close to optimal results within the given computation time limit. We also experimentally investigate the impact of the size of the mesh architecture on the application mapping and total communication. ©2009 IEEE.Item Open Access Routing and spectrum allocation in static fiber optic networks(2016-07) Öner, PelinThe continuous growth of demand on internet requires high speed connection and larger capacity on telecommunication networks. In order to satisfy the day-by-day increasing connection requests, a new modulation technique named Orthogonal Frequency Division Multiplexing (OFDM), which promises faster connection and better usage of optical spectrum has been developed in optical networks. In this thesis, we propose solution methods for the Routing and Spectrum Allocation problem that has emerged with the adaptation of OFDM technology. Our goal is to find the minimum amount of spectrum slots that can be used while routing connection requests from their source to destination and allocating an adequate spectrum to the signals. We provide a new integer linear programming formulation for RSA and an improved formulation for the RSA problem with a predefined set of paths. We also propose two heuristic algorithms, Least Cost Slot Allocation and Iterative Common Path Allocation, and provide computational tests to illustrate the performance of our ILP model and heuristic algorithms.