Synthesis of reliable application specific heterogeneous multiprocessors

Aurobindo Dasgupta, Ramesh Karri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present a deterministic and provably optimal algorithm to synthesize real time, reliable multiprocessors using a heterogeneous library of N processors and L link types. For a series-parallel task graph consisting of M sub tasks and with a nested depth d, the worst-case complexity of the proposed algorithm is O(M(L + N)Nd). For tree-structured task graphs, on the other hand, the algorithm runs in O(M(L + N)) time, and is also asymptotically optimum.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
Editors Anon
PublisherIEEE
Pages1215-1218
Number of pages4
Volume2
StatePublished - 1995
EventProceedings of the 1995 IEEE International Symposium on Circuits and Systems-ISCAS 95. Part 3 (of 3) - Seattle, WA, USA
Duration: Apr 30 1995May 3 1995

Other

OtherProceedings of the 1995 IEEE International Symposium on Circuits and Systems-ISCAS 95. Part 3 (of 3)
CitySeattle, WA, USA
Period4/30/955/3/95

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Cite this