Mapping a class of algorithms from binary tree machines to linear arrays

Dilip Sarkar, Ratan Kumar Guha

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

Binary tree machines are convenient for designing parallel algorithms in many problems. However, when considering different engineering issues, linear arrays are easier to implement. A class of algorithms for binary tree machines that can be mapped onto linear arrays cost-effectively is identified, and the mapping for this class is presented. It is shown that if the input size is not too small, the algorithms that are optimal on a binary tree machine remain optimal on a linear array after its mapping.

Original languageEnglish (US)
Pages (from-to)202-204
Number of pages3
JournalComputer Systems Science and Engineering
Volume5
Issue number4
StatePublished - Oct 1 1990

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Mapping a class of algorithms from binary tree machines to linear arrays'. Together they form a unique fingerprint.

  • Cite this