Synthesis of reliable application specific heterogeneous multiprocessors

Aurobindo Dasgupta; Ramesh Karri

Synthesis of reliable application specific heterogeneous multiprocessors

Aurobindo Dasgupta, Ramesh Karri

Research output: Chapter in Book/Report/Conference proceeding › Conference 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)N^d). For tree-structured task graphs, on the other hand, the algorithm runs in O(M(L + N)) time, and is also asymptotically optimum.

Original language	English (US)
Title of host publication	Proceedings - IEEE International Symposium on Circuits and Systems
Editors	Anon
Publisher	IEEE
Pages	1215-1218
Number of pages	4
Volume	2
State	Published - 1995
Event	Proceedings of the 1995 IEEE International Symposium on Circuits and Systems-ISCAS 95. Part 3 (of 3) - Seattle, WA, USA Duration: Apr 30 1995 → May 3 1995

Other

Other	Proceedings of the 1995 IEEE International Symposium on Circuits and Systems-ISCAS 95. Part 3 (of 3)
City	Seattle, WA, USA
Period	4/30/95 → 5/3/95

ASJC Scopus subject areas

Electrical and Electronic Engineering
Electronic, Optical and Magnetic Materials

Cite this

@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",

note = "Proceedings of the 1995 IEEE International Symposium on Circuits and Systems-ISCAS 95. Part 3 (of 3) ; Conference date: 30-04-1995 Through 03-05-1995",

}

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

AN - SCOPUS:0029190001

VL - 2

SP - 1215

EP - 1218

BT - Proceedings - IEEE International Symposium on Circuits and Systems

A2 - Anon, null

PB - IEEE

T2 - Proceedings of the 1995 IEEE International Symposium on Circuits and Systems-ISCAS 95. Part 3 (of 3)

Y2 - 30 April 1995 through 3 May 1995

ER -

Synthesis of reliable application specific heterogeneous multiprocessors

Abstract

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this