F. D. Anger, J. Hwang, and Y. Chow, Scheduling with sufficient loosely coupled processors, Journal of Parallel and Distributed Computing, vol.9, issue.1, pp.9-87, 1990.
DOI : 10.1016/0743-7315(90)90116-7

URL : http://ufdc.ufl.edu/LS00001002/00021

P. Chretienne, Task scheduling over distributed memory machines, Proc. International Workshop on Parallel and Distributed Algorithms, pp.165-176, 1989.

K. Efe, Heuristic Models of Task Assignment Scheduling in Distributed Systems, Computer, vol.15, issue.6, pp.50-56, 1982.
DOI : 10.1109/MC.1982.1654050

M. Garey and D. Johnson, Computer and Intractability: A guide to the Theory of NP-Completness, 1979.

A. Gerasoulis and T. Yang, A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors, Journal of Parallel and Distributed Computing, vol.16, issue.4, pp.276-291, 1992.
DOI : 10.1016/0743-7315(92)90012-C

A. Gerasoulis and T. Yang, On the granularity and clustering of directed acyclic task graphs, IEEE Transactions on Parallel and Distributed Systems, vol.4, issue.6, pp.686-701, 1993.
DOI : 10.1109/71.242154

A. Gerasoulis and T. Yang, Dsc: Scheduling parallel tasks on an unbounded number of processors, IEEE Transactions on Parallel and Distributed Systems, vol.5, pp.951-967, 1994.

J. J. Hwang, Y. C. Chow, F. D. Anger, and B. Y. Lee, Scheduling Precedence Graphs in Systems with Interprocessor Communication Times, SIAM Journal on Computing, vol.18, issue.2, pp.18-244, 1989.
DOI : 10.1137/0218016

S. J. Kim and J. C. Browne, A General Approach to Mapping of Parallel Computation upon Multiprocessor Architectures, International Conference on Parallel Processing, pp.1-8, 1988.

Y. Kwok and I. Ahmad, Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors, IEEE Transactions on Parallel and Distributed Systems, vol.7, issue.5, pp.506-521, 1996.
DOI : 10.1109/71.503776

Y. K. Kwok and I. Ahmad, Bubble scheduling: A quasi dynamic algorithm for static allocation of tasks to parallel architectures, Proc. 7th IEEE Symposium on Parallel and Distributed Processing, pp.36-43, 1995.

C. Lavarenne and Y. Sorel, Performance Optimization of Multiprocessor Real- Time Applications by Graphs Transformations, Proc. Parallel Computing, 1993.

Y. Kwok and I. Ahmad, Towards an architecture-independent analysis of parallel algorithms, SIAM Journal on Computing, pp.19-322, 1990.

H. E. Rewini and T. G. Lewis, Scheduling parallel program tasks onto arbitrary target machines, Journal of Parallel and Distributed Computing, pp.9-138, 1990.

V. Sarkar, Partitionning and Scheduling Parallel Programs for Execution on Multiprocessors, 1989.

T. Yang and A. Gerasoulis, List scheduling with and without communication delays, Parallel Computing, vol.19, issue.12, pp.1321-1344, 1993.
DOI : 10.1016/0167-8191(93)90079-Z

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.5353

M. Y. Wu and D. Gajski, A programming aid for hypercube architectures, The Journal of Supercomputing, vol.28, issue.9, pp.349-372, 1988.
DOI : 10.1007/BF00129784

M. Y. Wu and D. Gajski, Hypertool: a programming aid for message-passing systems, IEEE Transactions on Parallel and Distributed Systems, vol.1, issue.3, pp.330-343, 1990.
DOI : 10.1109/71.80160

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.9185