Pages that link to "Item:Q1188114"
From MaRDI portal
The following pages link to Optimal routing algorithms for mesh-connected processor arrays (Q1188114):
Displaying 20 items.
- Randomized multipacket routing and sorting on meshes (Q675295) (← links)
- Optimal many-to-one routing on the mesh with constant queues (Q1044696) (← links)
- Mesh permutation routing with locality (Q1199943) (← links)
- Packet Routing on grids of processors (Q1207327) (← links)
- Packet routing and PRAM emulation on star graphs and leveled networks (Q1325971) (← links)
- Practical algorithms for online routing on fixed and reconfigurable meshes (Q1325989) (← links)
- Optimal communication algorithms for Manhattan Street networks (Q1392541) (← links)
- List-ranking on interconnection networks. (Q1401927) (← links)
- Optimal oblivious routing on \(d\)-dimensional meshes (Q1770370) (← links)
- Fast deterministic selection on mesh-connected processor arrays (Q1911464) (← links)
- Optimal deterministic sorting and routing on grids and tori with diagonals (Q1961046) (← links)
- Flit-serial packet routing on meshes and tori (Q3445270) (← links)
- Efficient Parallel Routing Algorithms for Cartesian and Composition Networks (Q3628471) (← links)
- Routing algorithms in honeycomb meshes (Q3645052) (← links)
- Randomized Routing and Sorting on Fixed-Connection Networks (Q4304064) (← links)
- (Q4430867) (← links)
- Optimal multi-packet routing on the torus (Q5056134) (← links)
- Towards a better understanding of pure packet routing (Q5060094) (← links)
- Shorter queues for permutation routing on meshes (Q5096918) (← links)
- PERMUTATION ROUTING AND SORTING ON THE RECONFIGURABLE MESH (Q5248975) (← links)