Amneh Obeid

Background and Objective: An enhancement model of the Simple Standard Genetic Algorithm is being presented. This model is based on custom, behavior, age, gender and pattern of human community. It is an enhanced structured population approach for genetic algorithm so called the Human Community Based Genetic Algorithm. The Traveling Salesman Problem is used as a test problem, which is a minimization problem. Methodology: This test show differences of each model based on the Human Community Based Genetic Algorithm’s best fit values and averages in different generations. Tests are conducted over three models, the Simple Standard Genetic Algorithm, the Island Genetic Algorithm and the enhanced Human Community Based Genetic Algorithm. Results: Best fit solutions in different populations of different generations show better performance of the enhanced Human Community Based Genetic Algorithm over the other two models the Simple Standard Genetic Algorithm and the Island Genetic Algorithm. In addition, Results towards slowing the convergence of solutions are significantly better in the enhanced Human Community Based Genetic Algorithm than both the Simple Standard Genetic Algorithm and the Island Genetic Algorithm. Conclusion: The enhanced Human Community Based Genetic Algorithm indicate that a population structure model based on the rules of marriage concepts can clearly improve the performance of the Simple Standard Genetic Algorithm and the Island Genetic Algorithm.

Traffic congestions are recognized as a major problem in the modern urban cities. The Hashemite Kingdom
of Jordan is considered as one of the top countries worldwide that is suffering from the traffic jam problem
due to its old infrastructure. The current traffic light signals system in Jordan is still controlled by the fixed
timers. Therefore, this research develops an intelligent Traffic Light Management System Based on the
Hamiltonian Routing Technique (TLBH) and on the Decision Support System (DSS) in order to execute a
proper action. Hence, this research develops a system can that be used to minimize the waiting time on the
traffic signals for vehicles, which can in return lead to the reduction of the traffic congestion incurred by the
vehicles.
This research is comprehensive to many scenarios, where three of these scenarios are listed in this
research and are implemented by the system by using the MATLAB programming language; based on
specific rules. According to these sufficient testing scenarios, the simulation result shows significant
improvements in the TLBH technique in comparison with the current traffic system. The proposed
technique has the minimum total and waiting time in all scenarios compared to the current traffic system.

Broadcast is one of the most important approach in distributed memory parallel computers that is used to find a routing approach from a one source to all nodes in the mesh. The approach of this case of Broadcasting is to send the message from one source to all destinations in the network which corresponds to one-to-all communication. Routing schema is the approach that used to determine the road that is used to send a message from a source node to destination nodes. Wormhole routing is a fundamental routing mechanism in modern parallel computers which is characterized with low communication latency. We show how to apply this approach to 3-D meshes. In wormhole routing large network packets are broken into small pieces called FLITs (flow control digits). The destination address is kept in the first flit which is called the header flit and sets up the routing behavior for all subsequent flits associated with the packet. If the packets of the message can’t deliver to their destination and there is a cyclic dependence over the channels in the network, then the deadlock even is occurred. In this paper, we consider an efficient algorithm for broadcasting on Multi-Port wormhole-routed 3D mesh with arbitrary size. We introduce an efficient algorithm, Three-Dimension Tow Phase Multi-Port (3-DTPMP) algorithm which used broadcast communication facility with deadlock-free wormhole routing in general three-dimensional networks. In this paper the behaviors of this algorithm were compared to the previous results, our paradigm reduces broadcast latency and is simpler. In this paper our simulation results show the average of our proposed algorithm over the other algorithms that presented

Broadcast is one of the most important approach in distributed memory parallel computers that is
used to find a routing approach from one source to all nodes in the mesh. Broadcasting is a data
communication task in which corresponds to one-to-all communication. Routing schema is the
approach used to determine the road that is used to send a message from a source node to destination
nodes. In this paper, we propose an efficient algorithm for broadcasting on an all-port
wormhole-routed 3D mesh with arbitrary size. Wormhole routing is a fundamental routing mechanism
in modern parallel computers which is characterized with low communication latency.
We show how to apply this approach to 3-D meshes. In wormhole, routing large network packets
are broken into small pieces called FLITs (flow control digits). The destination address is kept in
the first flit which is called the header flit and sets up the routing behavior for all subsequent flits
associated with the packet. In this paper, we introduce an efficient algorithm, X-Hamiltonian Surface
Broadcast (X-HSB) which uses broadcast communication facility with deadlock-free wormhole
routing in general three dimensional networks. In this paper, the behaviors of this algorithm
are compared to the previous results using simulation; our paradigm reduces broadcast latency
and is simpler. The results presented in this paper indicate the advantage of our proposed algorithm.

Anew approach to broadcast in wormhole routed three-dimensional networks is proposed. One of the most
important process in communication and parallel computer is broadcast approach.. The approach of this
case of Broadcasting is to send the message from one source to all destinations in the network which
corresponds to one-to-all communication. Wormhole routing is a fundamental routing mechanism in
modern parallel computers which is characterized with low communication latency. We show how to apply
this approach to 3-D meshes. Wormhole routing is divided the packets into set of FLITS (flow control
digits). The first Flit of the packet (Header Flit) is containing the destination address and all subsets flits
will follow the routing way of the header Flit. In this paper, we consider an efficient algorithm for
broadcasting on an all-port wormhole-routed 3D mesh with arbitrary size. We introduce an efficient
algorithm, Y-Hamiltonian Layers Broadcast(Y-HLB). In this paper the behaviors of this algorithm were
compared to the previous results, our paradigm reduces broadcast latency and is simpler. In this paper our
simulation results show the average of our proposed algorithm over the other algorithms that presented.

In a network, one-to-all broadcasting is the process of disseminating messages from a source node to all
the nodes existing in the network through successive data transmissions between pairs of nodes.
Broadcasting is the most primary communication process in a network. In this paper, we study on multiport
wormhole-routed multicomputers where nodes are able to send multiple messages into the network at a
time. We propose efficient broadcast algorithms in multi-port wormhole-routed multicomputers which are
characterized by 3D mesh topology. The proposed algorithm Three-Dimension Broadcast Layers (3-DBl)
is designed such that can send messages to destinations within two start-up communication phases for each
2-D mesh. The second proposed algorithm Three-Dimension Broadcast Surfaces (3-DBS) is designed such
that can send messages to destinations within six start-up communication phases. The performance study in
this paper clearly shows the advantage of the proposed algorithm.

Broadcast is one of the most important approach in distributed memory parallel computers that is used to
find a routing approach from a one source to all nodes in the mesh. Broadcasting is a data communication
task in which corresponds to one-to-all communication. Routing schema is the approach that used to
determine the road that is used to send a message from a source node to destination nodes. In this paper,
we propose an efficient two algorithms for broadcasting on an all-port wormhole-routed 3D mesh with
arbitrary size. In wormhole routing large network packets are broken into small pieces called FLITs (flow
control digits). The destination address is kept in the first flit which is called the header flit and sets up the
routing behavior for all subsequent flits associated with the packet. If the packets of the message can’t
deliver to their destination and there is a cyclic dependence over the channels in the network, then the
deadlock even is occurred. In this paper we introduce an efficient two algorithms, Three-Dimension
Hamiltonian Broadcast (3-DHB) and Three-Dimension Six Ports Hamiltonian Broadcast (3-DSPHB)
which used broadcast communication facility with deadlock-free wormhole routing in general threedimensional
networks. In this paper the behaviors of these algorithms were compared using simulation.
The results presented in this paper indicate that the advantage of the proposed algorithms.