The combinatorial optimization problem of assigning the communicating coexisting processes of a parallel program onto a parallel machine so as to minimize its overall execution time is calledstatic mapping . This paper presents the work that has been carried out to date at the LaBRI on static mapping. We introduce a static mapping algorithm based on the recursive bipartitioning of both the source process graph and the target architecture graph and describe the capabilities of SCOTCH 3.1, a software package that implements this method. SCOTCH can efficiently map any weighted source graph onto any weighted target graph in a time linear in the number of source edges and logarithmic in the number of target vertices. We give brief descriptions of the algorithm and its bipartitioning methods and compare the performance of our mapper with respect to other mapping and partitioning software packages.