3-D Networks-on-Chip (NoCs) have been proposed as a potent solution to address both the interconnection and design complexity problems facing future System-on-Chip (SoC) designs. In this paper, two topology-aware multicast routing algorithms, Multicasting XYZ (MXYZ) and Alternative XYZ (AL + XYZ) algorithms in supporting of 3-D NoC are proposed. In essence, MXYZ is a simple dimension order mult...

Manufacturing flexibility is a competitive weapon for surviving today’s highly variable and volatile markets. It is critical therefore, to select the appropriate type of flexibility for a given manufacturing system, and to design effective strategies for using this flexibility in a way to improve the system performance. This study focuses on full routing flexibility which includes not only alte...

This paper is a survey of the literature on applications of evolutionary algorithms for vehicle routing problems. It reports about genetic algorithms, evolution strategies and particle swarm optimization, when applied to the classical capacitated vehicle routing problem and many of its variants. The performance of evolutionary algorithms is also compared with the best alternative problem-solvin...

Matrix transpose is a fundamental communication operation which is not dealt with optimally by general purpose routing schemes. For two dimensional meshes, the first optimal routing schedule is given. The strategy is simple enough to be implemented, but details of the available hardware are not favorable. However, alternative algorithms, designed along the same lines, give an improvement on the...

We consider a random sequence of calls between nodes in a complete network with link capacities. Each call first tries the direct link. If that link is saturated, then the ‘first-fit dynamic alternative routing algorithm’ sequentially selects up to d random two-link alternative routes, and assigns the call to the first route with spare capacity on each link, if there is such a route. The ‘balan...

Decision making in process-aware information systems involves build-time and run-time decisions. At build-time, idealized process models are designed based on the organization’s objectives, infrastructure, context, constraints, etc. At run-time, this idealized view is often broken. In particular, process models generally assume that planned activities happen within a certain period. When such a...

In this paper we propose a deadlock free routing in irregular networks using pre x routing Pre x routing is a special type of routing with a compact routing table associated with each node processor Basically each outgoing channel of a node is assigned a special label and an outgoing channel is selected if its label is a pre x of the label of the destination node Node and channel labeling in an...

We investigate a known optimal lifetime solution for a linear wireless sensor network through simulation, and propose alternative solutions where a known optimal solution does not exist. The network is heterogeneous in the sensors’ energy distribution and also in the amount of data each sensor must communicate. As a basis for comparison, we analyze the lifetime of a network using a simple, near...

In systems using shortest-path routing tables, a single link failure is enough to interrupt the message transmission by disconnecting one or more shortestpath spanning trees. The on-line recomputation of an alternative path or of the entire new shortest path trees, rebuilding the routing tables accordingly, is rather expensive and causes long delays in the message’s transmission [5, 10]. Hopefu...