### Abstract

Processor-time-optimal algorithms are presented for several image and graph problems on a parallel architecture that combines an orthogonally accessed memory with a linear array structure. The organization has p processors and a memory of size Θ(n^{2}) locations. The number of processors p can vary over a wide range while providing processor-time-optimal algorithms for sorting and for several problems from graph theory, computational geometry, and image analysis. Sorting and geometric problems can be solved in O((n^{2}/p) log n + n) time, which is optimal for p in the range [1, n log n]. Graph and image problems can be solved in O(n^{2}/p + n^{1/2}) time, which is optimal for p in the range [1, n^{3/2}]. The algorithms implemented on the proposed architecture have processor-time products superior to those of the mesh and pyramid computer algorithms.

Original language | English |
---|---|

Title of host publication | Proc 3 Symp Front Massively Parallel Comput Frontiers 90 |

Publisher | Publ by IEEE |

Pages | 278-281 |

Number of pages | 4 |

ISBN (Print) | 0818620536 |

Publication status | Published - 1 Dec 1990 |

Externally published | Yes |

Event | Proceedings of the 3rd Symposium on the Frontiers of Massively Parallel Computation - Frontiers '90 - College Park, MD, USA Duration: 8 Oct 1990 → 10 Oct 1990 |

### Other

Other | Proceedings of the 3rd Symposium on the Frontiers of Massively Parallel Computation - Frontiers '90 |
---|---|

City | College Park, MD, USA |

Period | 8/10/90 → 10/10/90 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*Proc 3 Symp Front Massively Parallel Comput Frontiers 90*(pp. 278-281). Publ by IEEE.

**Optimal processor-time tradeoffs on massively parallel memory-based architectures.** / Alnuweiri, Hussein; Prasanna Kumar, V. K.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proc 3 Symp Front Massively Parallel Comput Frontiers 90.*Publ by IEEE, pp. 278-281, Proceedings of the 3rd Symposium on the Frontiers of Massively Parallel Computation - Frontiers '90, College Park, MD, USA, 8/10/90.

}

TY - GEN

T1 - Optimal processor-time tradeoffs on massively parallel memory-based architectures

AU - Alnuweiri, Hussein

AU - Prasanna Kumar, V. K.

PY - 1990/12/1

Y1 - 1990/12/1

N2 - Processor-time-optimal algorithms are presented for several image and graph problems on a parallel architecture that combines an orthogonally accessed memory with a linear array structure. The organization has p processors and a memory of size Θ(n2) locations. The number of processors p can vary over a wide range while providing processor-time-optimal algorithms for sorting and for several problems from graph theory, computational geometry, and image analysis. Sorting and geometric problems can be solved in O((n2/p) log n + n) time, which is optimal for p in the range [1, n log n]. Graph and image problems can be solved in O(n2/p + n1/2) time, which is optimal for p in the range [1, n3/2]. The algorithms implemented on the proposed architecture have processor-time products superior to those of the mesh and pyramid computer algorithms.

AB - Processor-time-optimal algorithms are presented for several image and graph problems on a parallel architecture that combines an orthogonally accessed memory with a linear array structure. The organization has p processors and a memory of size Θ(n2) locations. The number of processors p can vary over a wide range while providing processor-time-optimal algorithms for sorting and for several problems from graph theory, computational geometry, and image analysis. Sorting and geometric problems can be solved in O((n2/p) log n + n) time, which is optimal for p in the range [1, n log n]. Graph and image problems can be solved in O(n2/p + n1/2) time, which is optimal for p in the range [1, n3/2]. The algorithms implemented on the proposed architecture have processor-time products superior to those of the mesh and pyramid computer algorithms.

UR - http://www.scopus.com/inward/record.url?scp=0025563960&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025563960&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0025563960

SN - 0818620536

SP - 278

EP - 281

BT - Proc 3 Symp Front Massively Parallel Comput Frontiers 90

PB - Publ by IEEE

ER -