Searching for authors named Antonios Symvonis – sorted by Relevance.
21 documents found, showing 1 through 10.
Next 10 →
-
A Note on Deflection Routing on Undirected Graphs
- …We provide an algorithm that routes a load of k packets on an undirected graph G within 2diamG+ 2(k \Gamma 1) routing steps where diamG is the diameter of graph G. For a d-dimensional mesh M the required number of routing steps is at most diamM + (d \Gamma 1) + 2(k \Gamma 1) where diamM is the diame…
- Cited by 2 (0 self) – Add To MetaCart
-
Routing on Trees
- …In this paper, we study the permutation packet routing problem on trees. We show that every permutation can be routed on a tree of n vertices in n \Gamma 1 routing steps. We provide two algorithms that produce such routing schedules. The first algorithm builds in O(n 2 ) time a schedule that needs…
- Cited by 10 (2 self) – Add To MetaCart
-
Optimal algorithms for packet routing on trees
- …In this paper, we study the permutation packet routing problem on trees. We show that every permutation can be routed on a tree of n vertices in n, 1 routing steps. We provide an algorithm which produces in O(n 2) time a schedule that needs O(n 2) bits for its description. Moreover, we describe an o…
- Cited by 3 (2 self) – Add To MetaCart
-
Flit-Serial Packet Routing on Meshes and Tori
- …In this paper, we consider the flit-serial packet routing problem, where each packet consists of a sequence of k flits and is, thus, called a snake. Based on the properties of the snake during the routing, we give a formal definition of three different packet routing models, namely, the store-and-fo…
- Add To MetaCart
-
Searching a Pseudo 3-Sided Solid Orthoconvex Grid
- …In this paper we examine the edge searching problem on pseudo 3-sided solid orthoconvex grids. We define a similar problem which we call modified edge searching, and we derive a relation among the original edge searching problem and the modified one. Then, for the modified edge searching problem, w…
- Add To MetaCart
-
Optimal Algorithms for Multipacket Routing Problems on Rings
- …We study multipacket routing problems on rings of processors. We prove a new lower bound of 2n=3 routing steps for the case that k, the number of packets per processor, is at most 2. We also give an algorithm that tightens this lower bound. For the case where k ? 2, the lower bound is kn=4. The triv…
- Cited by 3 (0 self) – Add To MetaCart
-
On Deflection Worm Routing on Meshes
- …In this paper, we consider the deflection worm routing problem on two dimensional n \Theta n meshes. Our results include: (i) an off-line algorithm for routing permutations in O(kn) steps, and (ii) a general method to obtain deflection worm routing algorithms from packet routing algorithms. 1 Introd…
- Cited by 3 (2 self) – Add To MetaCart
-
A General Method for Deflection Worm Routing on Meshes Based on Packet Routing Algorithms
- …In this paper, we consider the deflection worm routing problem on n \Theta n meshes. In deflection routing a message cannot be queued and it is always moving until it reaches its destination. In worm routing, the message is considered to be a worm; a sequence of k flits which, during the routing, fo…
- Cited by 1 (0 self) – Add To MetaCart
-
A New Approach to Off-Line Packet Routing Case Study: 2-Dimensional Meshes
- …In this paper we present the multistage off-line routing model, a new and rather natural, way to model off-line packet routing problems. With this model, the problem of off-line packet routing reduces to the problem of finding edge disjoint paths on a multistage graph. The multistage off-line routin…
- Cited by 3 (3 self) – Add To MetaCart
-
An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements
- …Even though exact algorithms exist for permutation routing of n 2 messages on a n \Theta n mesh of processors which require constant size queues, the constants are very large and the algorithms very complicated to implement. In this paper, we present a novel, simple heuristic for the above proble…
- Cited by 4 (4 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
