Synthesis of reliable application specific heterogeneous multiprocessors

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/sup d/). For tree-structured task graphs, on the other hand, the algorithm runs in O(M(L+N)) time, and is also asymptotically optimum.

[1]  G.F. Watson,et al.  MIL reliability: a new approach , 1992, IEEE Spectrum.

[2]  Imtiaz Ahmad,et al.  Synthesis of application-specific multiprocessor systems , 1994, Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC.

[3]  Darrell D. E. Long,et al.  A study of the reliability of Internet sites , 1991, [1991] Proceedings Tenth Symposium on Reliable Distributed Systems.

[4]  Salim Hariri,et al.  Reliability Optimization in the Design of Distributed Systems , 1985, IEEE Transactions on Software Engineering.

[5]  Alain Billionnet.  Allocating Tree Structured Programs in a Distributed System with Uniform Communication Costs , 1994, IEEE Trans. Parallel Distributed Syst..

[6]  Alice C. Parker,et al.  SOS: Synthesis of application-specific heterogeneous multiprocessor systems , 2001, J. Parallel Distributed Comput..

[7]  Hironori Kasahara,et al.  Parallel processing of robot-arm control computation on a multimicroprocessor system , 1985, IEEE J. Robotics Autom..

[8]  J.-P. Wang,et al.  Task Allocation for Maximizing Reliability of Distributed Computer Systems , 1992, IEEE Trans. Computers.

[9]  Donald F. Towsley,et al.  Allocating programs containing branches and loops within a multiple processor system , 1986, IEEE Transactions on Software Engineering.

[10]  Ramesh Karri,et al.  Optimal algorithms for synthesis of reliable application-specific heterogeneous multiprocessors , 1995 .