An enhanced simulated annealing approach for cylindrical, rectangular mesh, and semi-diagonal torus network topologies

A multiprocessing system has processor-memory modules in a network which is always referred to as net. In many cases, the modules are placed in a regular arrangement such as rectangular grid, bus, star and hypercube. In this research, we proposed one conceptual model and two network topologies for r...

Full description

Saved in:

Bibliographic Details
Main Author:	Adzhar, Noraziah
Format:	Thesis
Language:	English
Published:	2015
Subjects:	QA Mathematics
Online Access:	http://eprints.utm.my/id/eprint/54790/1/NoraziahAdzharPFS2015.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-utm-ep.54790
record_format	uketd_dc
spelling	my-utm-ep.547902020-11-07T01:17:42Z An enhanced simulated annealing approach for cylindrical, rectangular mesh, and semi-diagonal torus network topologies 2015-11 Adzhar, Noraziah QA Mathematics A multiprocessing system has processor-memory modules in a network which is always referred to as net. In many cases, the modules are placed in a regular arrangement such as rectangular grid, bus, star and hypercube. In this research, we proposed one conceptual model and two network topologies for routing the elements of the network. In the first model, a static single-row network was transformed into a dynamic three-dimensional cylindrical model. This new routing model has its axis perpendicular to single-row planes, which gives the advantage of allowing unlimited connections between the pairs of elements based on the program requirements. The single-row routings in each network were produced optimally using the earlier model called Enhanced Simulated Annealing for Single-row Routing (ESSR). In the second part of this research, mesh network topology which consists of an array of square cells was proposed as our routing platform to achieve a complete automatic routing. The problem was further split into two cases; first, a fully gridded network to minimize the number of layers and second, the obstacle avoidance network model. Dijkstra?s shortest path algorithm was used to provide the shortest path for each net. The arrangement was further refined using a simulated annealing method. From this technique, the minimum number of layers was produced to complete the routing with lower energy level and to provide the best path if it exists, with the presence of obstacles. The last part of this research is an extension of our previous work, where a more scalable and regular network called semi-diagonal torus (SD-Torus) network was used as a routing platform instead of the mesh network. The performance of SD-Torus network was much better compared to torus and mesh networks in terms of energy level and the number of routed nets. The network topology performed complete routing up to 81 nodes with 80 nets in 9?9 network size. This technique maximizes the number of nets through the minimum energy. The simulations for each network are developed using Microsoft Visual C++ 2010 programming language. 2015-11 Thesis http://eprints.utm.my/id/eprint/54790/ http://eprints.utm.my/id/eprint/54790/1/NoraziahAdzharPFS2015.pdf application/pdf en public http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:95961 phd doctoral Universiti Teknologi Malaysia, Faculty of Science Faculty of Science
institution	Universiti Teknologi Malaysia
collection	UTM Institutional Repository
language	English
topic	QA Mathematics
spellingShingle	QA Mathematics Adzhar, Noraziah An enhanced simulated annealing approach for cylindrical, rectangular mesh, and semi-diagonal torus network topologies
description	A multiprocessing system has processor-memory modules in a network which is always referred to as net. In many cases, the modules are placed in a regular arrangement such as rectangular grid, bus, star and hypercube. In this research, we proposed one conceptual model and two network topologies for routing the elements of the network. In the first model, a static single-row network was transformed into a dynamic three-dimensional cylindrical model. This new routing model has its axis perpendicular to single-row planes, which gives the advantage of allowing unlimited connections between the pairs of elements based on the program requirements. The single-row routings in each network were produced optimally using the earlier model called Enhanced Simulated Annealing for Single-row Routing (ESSR). In the second part of this research, mesh network topology which consists of an array of square cells was proposed as our routing platform to achieve a complete automatic routing. The problem was further split into two cases; first, a fully gridded network to minimize the number of layers and second, the obstacle avoidance network model. Dijkstra?s shortest path algorithm was used to provide the shortest path for each net. The arrangement was further refined using a simulated annealing method. From this technique, the minimum number of layers was produced to complete the routing with lower energy level and to provide the best path if it exists, with the presence of obstacles. The last part of this research is an extension of our previous work, where a more scalable and regular network called semi-diagonal torus (SD-Torus) network was used as a routing platform instead of the mesh network. The performance of SD-Torus network was much better compared to torus and mesh networks in terms of energy level and the number of routed nets. The network topology performed complete routing up to 81 nodes with 80 nets in 9?9 network size. This technique maximizes the number of nets through the minimum energy. The simulations for each network are developed using Microsoft Visual C++ 2010 programming language.
format	Thesis
qualification_name	Doctor of Philosophy (PhD.)
qualification_level	Doctorate
author	Adzhar, Noraziah
author_facet	Adzhar, Noraziah
author_sort	Adzhar, Noraziah
title	An enhanced simulated annealing approach for cylindrical, rectangular mesh, and semi-diagonal torus network topologies
title_short	An enhanced simulated annealing approach for cylindrical, rectangular mesh, and semi-diagonal torus network topologies
title_full	An enhanced simulated annealing approach for cylindrical, rectangular mesh, and semi-diagonal torus network topologies
title_fullStr	An enhanced simulated annealing approach for cylindrical, rectangular mesh, and semi-diagonal torus network topologies
title_full_unstemmed	An enhanced simulated annealing approach for cylindrical, rectangular mesh, and semi-diagonal torus network topologies
title_sort	enhanced simulated annealing approach for cylindrical, rectangular mesh, and semi-diagonal torus network topologies
granting_institution	Universiti Teknologi Malaysia, Faculty of Science
granting_department	Faculty of Science
publishDate	2015
url	http://eprints.utm.my/id/eprint/54790/1/NoraziahAdzharPFS2015.pdf
_version_	1747817727466143744

An enhanced simulated annealing approach for cylindrical, rectangular mesh, and semi-diagonal torus network topologies

Similar Items