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

Dasgupta, A., & Karri, R. (1995). Synthesis of reliable application specific heterogeneous multiprocessors. In Anon (Ed.), Proceedings - IEEE International Symposium on Circuits and Systems (Vol. 2, pp. 1215-1218). IEEE.

Synthesis of reliable application specific heterogeneous multiprocessors. / Dasgupta, Aurobindo; Karri, Ramesh.

Proceedings - IEEE International Symposium on Circuits and Systems. ed. / Anon. Vol. 2 IEEE, 1995. p. 1215-1218.

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

Dasgupta, A & Karri, R 1995, Synthesis of reliable application specific heterogeneous multiprocessors. in Anon (ed.), Proceedings - IEEE International Symposium on Circuits and Systems. vol. 2, IEEE, pp. 1215-1218, Proceedings of the 1995 IEEE International Symposium on Circuits and Systems-ISCAS 95. Part 3 (of 3), Seattle, WA, USA, 4/30/95.
Dasgupta A, Karri R. Synthesis of reliable application specific heterogeneous multiprocessors. In Anon, editor, Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 2. IEEE. 1995. p. 1215-1218
Dasgupta, Aurobindo ; Karri, Ramesh. / Synthesis of reliable application specific heterogeneous multiprocessors. Proceedings - IEEE International Symposium on Circuits and Systems. editor / Anon. Vol. 2 IEEE, 1995. pp. 1215-1218
@inproceedings{86420bacad1e42929208be481aa751e9,
title = "Synthesis of reliable application specific heterogeneous multiprocessors",
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.",
author = "Aurobindo Dasgupta and Ramesh Karri",
year = "1995",
language = "English (US)",
volume = "2",
pages = "1215--1218",
editor = "Anon",
booktitle = "Proceedings - IEEE International Symposium on Circuits and Systems",
publisher = "IEEE",

}

TY - GEN

T1 - Synthesis of reliable application specific heterogeneous multiprocessors

AU - Dasgupta, Aurobindo

AU - Karri, Ramesh

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

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

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

M3 - Conference contribution

VL - 2

SP - 1215

EP - 1218

BT - Proceedings - IEEE International Symposium on Circuits and Systems

A2 - Anon, null

PB - IEEE

ER -