. Amestoy, An Approximate Minimum Degree Ordering Algorithm, SIAM Journal on Matrix Analysis and Applications, vol.17, issue.4, pp.886-905, 1996.
DOI : 10.1137/S0895479894278952

G. H. Cavalheiro-(-gerson, ? Athapascan 1: Interface générique pour l'ordonnancement dans un environnement d'exécution parallèle. ? France, Thèse de doctorat, 1999.

G. H. Cavalheiro-(-gerson and R. , Jean-Louis). ? Un schéma modulaire pour l'écriture des ordonnanceurs. In : RenPar'98, 1998.

(. E. Dijkstra, Solution of a problem in concurrent programming control, Communications of the ACM, vol.8, issue.9, p.569, 1965.
DOI : 10.1145/365559.365617

(. J. Dongarra and (. R. Et-whaley, ? A Users' Guide to the BLACS v1.0. ? Rapport technique, 1995.

(. L. Facq and . Et-roman, ? Distribution par bloc pour une factorisation parallèle de Cholesky, Parallèlisme et applications irrégulières, éd. par Authié (G.) et al, pp.135-147, 1995.

. Fu, Jiao (Xiangmin) et Yang (Tao) ? Efficient sparse LU factorization with partial pivoting on distributed memory machines, IEEE Transactions on Parallel and Distributed Systems, vol.9, issue.2, pp.109-124, 1998.

. Fu, Run-Time Techniques for Exploiting Irregular Task Parallelism on Distributed Memory Architectures, Journal of Parallel and Distributed Computing, vol.42, issue.2, pp.143-156, 1997.
DOI : 10.1006/jpdc.1997.1319

A. George, Nested Dissection of a Regular Finite Element Mesh, SIAM Journal on Numerical Analysis, vol.10, issue.2, pp.345-363, 1973.
DOI : 10.1137/0710032

. Gibbons, Matias (Yossi) et Ramachandran (Vijaya) ? The queue-read queue-write PRAM model: Accounting for contention in parallel algorithms, SIAM Journal on Computing, vol.28, pp.2-733, 1999.

R. L. Graham, Bounds on Multiprocessing Timing Anomalies, SIAM Journal on Applied Mathematics, vol.17, issue.2, pp.416-429, 1969.
DOI : 10.1137/0117039
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.8131

S. Grimshawandrew, Easy-to-use object-oriented parallel processing with Mentat, Computer, vol.26, issue.5, pp.39-51, 1993.
DOI : 10.1109/2.211896

. Gupta, Karypis (George) et Kumar (Vipin) ? Highly scalable parallel algorithms for sparse matrix factorization, IEEE Transactions on Parallel and Distributed Systems, vol.8, pp.5-502, 1997.
DOI : 10.1109/71.598277
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.9813

R. H. Halstead, Parallel Computing Using Multilisp, In : Parallel Computation and Computers for Artificial Intelligence, éd. par Kowalik (J.S.), pp.21-49, 1988.
DOI : 10.1007/978-1-4613-1989-4_2

K. Kumar, Vipin) ? A Fast and High Quality Mutilevel Scheme for Partitioning Irregular Graphs, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.359-392, 1999.

. Kleiman, Shah (Devang) et Smaalders (Bart). ? Programming With Threads, p.534, 1995.

(. R. Lipton, (. D. Rose, and E. , Generalized Nested Dissection, SIAM Journal on Numerical Analysis, vol.16, issue.2, pp.346-358, 1979.
DOI : 10.1137/0716027

. Liu, A note on Graham's bound, Information Processing Letters, vol.36, issue.1, pp.1-5, 1990.
DOI : 10.1016/0020-0190(90)90177-Y

. Mehaut, Jean-François) et Namyst (Raymond) ? Marcel : Une bibliothèque de processus légers. ? Rapport technique, 1995.

E. ). Mohr, . Kranz, A. David, and J. Et-halstead, Robert H.). ? Lazy task creation: A technique for increasing the granularity of parallel programs, IEEE Transactions on Parallel and Distributed Systems, vol.2, pp.3-264, 1991.

(. R. Namyst, ? ÈÅ ¾ : Parallel multithreaded machine. A computing environment for distributed architectures In : Parallel Computing: Stateof-the-Art and Perspectives, Proceedings of the Conference ParCo'95, pp.279-285, 1995.

(. R. Nikhil, Cid: A parallel, ???shared-memory??? C for distributed-memory machines, Lecture Notes in Computer Science, vol.892, pp.376-390, 1995.
DOI : 10.1007/BFb0025891

(. R. Nikhil, Parallel symbolic computing in Cid, Lecture Notes in Computer Science, vol.1068, pp.217-242, 1996.
DOI : 10.1007/BFb0023064

. Papadimitriou, Towards an Architecture-Independent Analysis of Parallel Algorithms, SIAM Journal on Computing, vol.19, issue.2, pp.322-328, 1990.
DOI : 10.1137/0219021

. Pellegrini, Roman (Jean) et Amestoy (Patrick) ? Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering, Proceeding of IRREGULAR'99, pp.986-995, 1999.

. Rayward-smith, UET scheduling with unit interprocessor communication delays, Discrete Applied Mathematics, vol.18, issue.1, pp.55-71, 1987.
DOI : 10.1016/0166-218X(87)90042-4
URL : http://doi.org/10.1016/0166-218x(87)90042-4

. Stroustrup, ? The C++ Progamming Language, 1997.

V. Wilson-(-gregory and . Lu, Paul) (édité par). ? Parallel Programming Using C++, 1996.

Y. Fu, Cong) ? Space/time-efficient scheduling and execution of parallel irregular computations, ACM Transactions on Programming Languages and Systems, vol.20, issue.6, pp.1195-1222, 1998.