✦ LIBER ✦

Time lower bounds for parallel sorting on a mesh-connected processor array

✍ Scribed by Yijie Han; Yoshihide Igarashi

Book ID: 118287426
Publisher: Springer-Verlag
Year: 1989
Tongue: English
Weight: 549 KB
Volume: 26
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00288975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Time lower bounds for sorting on multi-d

Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays

✍ Yijie Han; Yoshihide Igarashi 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 604 KB

Some parallel sorts on a mesh-connected

Some parallel sorts on a mesh-connected processor array and their time efficiency

✍ Kazuhiro Sado; Yoshihide Igarashi 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 684 KB

Lower bounds for sorting on mesh-connect

Lower bounds for sorting on mesh-connected architectures

✍ Manfred Kunde 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 531 KB

Parallel image normalization on a mesh c

Parallel image normalization on a mesh connected array processor

✍ S.-Y. Lee; S. Yalamanchili; J.K. Aggarwal 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 645 KB

Integer sorting on a mesh-connected arra

Integer sorting on a mesh-connected array of processors

✍ Danny Krizanc 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 649 KB

Parallel B-Spline Surface Interpolation

Parallel B-Spline Surface Interpolation on a Mesh-Connected Processor Array

✍ F.H. Cheng; G.W. Wasilkowski; J.Y. Wang; C.M. Zhang; W.P. Wang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 422 KB

A parallel implementation of Chebyshev method is presented for the B-spline surface interpolation problem. The algorithm finds the control points of a uniform bicubic B-spline surface that interpolates \(m \times n\) data points on an \(m \times n\) mesh-connected processor array in constant time. H