By Topic

Optimal algorithms for synthesis of reliable application-specific heterogeneous multiprocessors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. Dasgupta ; Dept. of Electr. & Comput. Eng., Massachusetts Univ., Amherst, MA, USA ; R. Karri

Fast and optimally-reliable application-specific multiprocessor-synthesis is critical in system-level design, especially in medical, automotive, space, and military applications. Previous work in multiprocessor-synthesis and task-allocation for performance and reliability requires exponential time, and therefore, is useful only for small examples. We present the first deterministic and provably-optimal algorithm (RELSYN-OPT) to synthesize real-time, reliable multiprocessors using a heterogeneous library of N processors and L link types. We prove that for a series-parallel graph with M subtasks and nested-depth d, the worst-case computational complexity of RELSYN-OPT Is O(M·(L+N)·Nd). For tree-structured task graphs, RELSYN-OMT runs in O(M·(L+N)), and is asymptotically optimum, RELSYN-OPT, because of its speed, applies to static and dynamic task allocation for an ultra-reliable distributed processing environment for which, until now, research has produced only suboptimal heuristic solutions

Published in:

IEEE Transactions on Reliability  (Volume:44 ,  Issue: 4 )