✦ LIBER ✦

Sorting-Based Selection Algorithms for Hypercubic Networks

✍ Scribed by P. Berthomé; A. Ferreira; B. M. Maggs; S. Perennes; C. G. Plaxton

Publisher: Springer
Year: 2000
Tongue: English
Weight: 94 KB
Volume: 26
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s004539910011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Probabilistic Networks for Selection,

On Probabilistic Networks for Selection, Merging, and Sorting

✍ T. Leighton; Y. Ma; T. Suel 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 220 KB

A parallel markovian model reliability a

A parallel markovian model reliability algorithm for hypercube networks

✍ E.L. Zapata; J.D. Bruguera; O.G. Plata; F.F. Rivera 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 715 KB

Sorting algorithms for filters based on

Sorting algorithms for filters based on ordered statistics: Performance considerations

✍ Fabio Pasian 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 341 KB

QoS-based routing algorithms for ATM net

QoS-based routing algorithms for ATM networks

✍ Li Layuan; Li Chunling 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 217 KB

This paper presents a planned routing algorithm (PRA) and a hierarchical routing algorithm (HRA) for ATM networks. The PRA can establish the multicast tree with the presence of bandwidth and delay constraints. The HRA can be compliant with the PNNI speci®cation from the ATM Forum. It uses an adaptiv

Performance evaluation of a random-walk-

Performance evaluation of a random-walk-based algorithm for embedding dynamically evolving trees in hypercubic networks

✍ Keqin Li 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 250 KB 👁 1 views

An efficient permutation-based parallel

An efficient permutation-based parallel algorithm for range-join in hypercubes

✍ Hong Shen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 731 KB