Previous Up

References

[1]
Albert Benveniste and Gérard Berry. The synchronous approach to reactive and real-time systems. Proceedings of the IEEE, 79(9):1270–1282, September 1991.
[2]
E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM TOPLAS, 8(2), 1986.
[3]
R.E. Bryant. Graph-based algorithms for boolean function manipulation. In IEEE Transaction on Computers, C-35(8):677-691, August 1936.
[4]
David Harel and Amir Pnueli. On the development of reactive systems. In K. R. Apt, editor, Logics and Models of Concurrent Systems. Springer Verlag, New York, 1985.
[5]
A.M. Turing. On computable numbers, with an application to the entscheindungs problem. In Proc. London Math. Soc., 1936.
[6]
Grady Brooch, Ivar Jacobson, James Rumbaugh, and Jim Rumbaugh. The Unified Modeling Language User Guide (The Addisson-Wesley Object Technology Series). Addisson-Wesley, 1998.
[7]
R. Kocik. Sur l’optimisation des systèmes distribués temps réel embarqués : application au prototypage rapide d’un véhicule électrique semi-autonome. PhD thesis, Université de Rouen, Spécialité informatique industrielle, 22/03/2000.
[8]
A. Girault, H. Kalla, and Y. Sorel. A scheduling heuristics for distributed real-time embedded systems tolerant to processor and communication media failures. International Journal of Production Research, 42(14):2877–2898, July 2004.
[9]
A. Girault, H. Kalla, M. Sighireanu, and Y. Sorel. An algorithm for automatically obtaining distributed and fault-tolerant static schedules. In Proceedings of International Conference on Dependable Systems and Networks, DSN’03, San Francisco, California, USA, June 2003.
[10]
R. Balakrisnan and K. Ranganathan. A Textbook of Graph Theory. Springer, 2000.
[11]
C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
[12]
J.B. Dennis. Data flow supercomputers. IEEE Computer, 13(11), 1980.
[13]
V. Pratt. Modeling concurrency with partial orders. International Journal of Parallel Programming, 15(1), 1986.
[14]
I. Rival. The role of graphs in the theory of ordered sets and its applications. In Nato Advanced Study Institute on Graphs and Order, 1984.
[15]
Y. Sorel. Massively parallel systems with real time constraints, the algorithm architecture adequation methodology. In Proceedings of Conference on Massively Parallel Computing Systems, MPCS’94, Ischia, Italy, May 1994.
[16]
A. Vicard. Formalisation et optimisation des systèmes informatiques distribués temps réel embarqués. PhD thesis, Université de Paris Nord, Spécialité informatique, 5/07/1999.
[17]
A. Dias, C. Lavarenne, M. Akil, and Y. Sorel. Optimized implementation of real-time image processing algorithms on field programmable gate arrays. In Proceedings of Fourth International Conference on Signal Processing, ICSP’98, Beijing, China, October 1998.
[18]
A.Y. Zomaya. Parallel and distributed computing handbook. McGraw-Hill, 1996.
[19]
T. Grandpierre. Modélisation d’architectures parallèles hétérogènes pour la génération automatique d’exécutifs distribués temps réel optimisés. PhD thesis, Université de Paris Sud, Spécialité électronique, 30/11/2000.
[20]
F. Gecseg. Products of automata. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1986.
[21]
Texas Instruments. Tms320c4x user’s guide.
[22]
Oystein Ore. Theory of Graphs. AMS, 1962.
[23]
C.A. Mead and L.A. Conway. Introduction to VLSI systems. Addison-Wesley, 1980.
[24]
Y. Sorel. Real-time embedded image processing applications using the algorithm architecture adequation methodology. In Proceedings of IEEE International Conference on Image Processing, ICIP’96, Lausanne, Switzerland, September 1996.
[25]
Michael R. Garey and David S. Johnson. Computers and intractability : a guide to the theory of NP-completeness. W.H. Freeman, 1979.
[26]
Zhen Liu and Christophe Corroyer. Effectiveness of heuristics and simulated annealing for the scheduling of concurrent task. an empirical comparison. In PARLE’93, 5th international PARLE conference, June 14-17, pages 452–463, Munich, Germany, November 1993.
[27]
A. Vicard and Y. Sorel. Formalization and static optimization for parallel implementations. In Proceedings of Workshop on Distributed and Parallel Systems, DAPSYS’98, Budapest, Hungary, September 1998.
[28]
T. Grandpierre, C. Lavarenne, and Y. Sorel. Optimized rapid prototyping for real-time embedded heterogeneous multiprocessors. In Proceedings of 7th International Workshop on Hardware/Software Co-Design, CODES’99, Rome, Italy, May 1999.
[29]
Y.K. Kwok and I Ahmad. Dynamic critical-path scheduling : An effective technique for allocating task graphs to multiprocessors. In IEEE Trans. on Parallel and Distributed Systems, 7(5):506–521, Munich, Germany, May 1996.
[30]
T. Grandpierre and Y. Sorel. From algorithm and architecture specification to automatic generation of distributed real-time executives: a seamless flow of graphs transformations. In Proceedings of First ACM and IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE’03, Mont Saint-Michel, France, June 2003.

Previous Up