Fetching the paper…
Reading the bibliography…
Static mapping is the assignment of parallel processes to the processing elements (PEs) of a parallel system, where the assignment does not change during the application's lifetime.
E. Cuthill and J. McKee, “Reducing the bandwidth of sparse symmetric matrices,” in Proc. 24th ACM Int. Conf. ACM, 1969, pp. 157–172
1969
Earlier work this paper cites.
D. Johnson, “Efficient algorithms for shortest paths in sparse networks,” Journal of the ACM , vol. 24, no. 1, 1977
1977
Earlier work this paper cites.
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness . W. H. Freeman & Co., 1979
1979
Earlier work this paper cites.
A. Rosenberg, “Issues in the study of graph embeddings,” in Lectures in Computer Science , 1980, pp. 150–176
1980
Earlier work this paper cites.
Y. M. Kim and T.-H. Lai, “The Complexity of Congestion-1 Embedding in a Hypercube,” Journal of Algorithms , vol. 12, no. 2, pp. 246 – 280, 1991. [Online]. Available: http://www.sciencedirect.com/science/article/pii/019667749190004I
1991
Earlier work this paper cites.
F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes . Morgan Kaufmann Publishers, 1992
1992
Earlier work this paper cites.
——, “Static Mapping by Dual Recursive Bipartitioning of Process and Architecture Graphs,” in Scalable High-Performance Computing Conference (SHPCC) . IEEE, May 1994, pp. 486–493
1994
Earlier work this paper cites.
J. Teresco, M. Beall, J. Flaherty, and M. Shephard, “A Hierarchical Partition Model for Adaptive Finite Element Computation,” Computer Methods in Applied Mechanics and Engineering , vol. 184, no. 2–4, pp. 269 – 285, 2000. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0045782599002315
2000
Earlier work this paper cites.
B. Hendrickson and T. G. Kolda, “Graph partitioning models for parallel computing,” Parallel Computing , vol. 26, no. 12, pp. 1519–1534, 2000
2000
Earlier work this paper cites.
C. Walshaw and M. Cross, “Multilevel Mesh Partitioning for Heterogeneous Communication Networks,” Future Generation Comp. Syst. , vol. 17, no. 5, pp. 601–623, 2001
2001
Earlier work this paper cites.
T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms . MIT Press, 2001
2001
Earlier work this paper cites.
The BlueGene/L Team, “An overview of the BlueGene/L supercomputer,” in Proc. of the 2002 ACM/IEEE Conference on Supercomputing . ACM, 2002, pp. 1–22
2002
Cited alongside, same era.
A. J. Soper, C. Walshaw, and M. Cross, “A combined evolutionary search and multilevel optimisation approach to graph partitioning,” Journal of Global Optimization , vol. 29, no. 2, pp. 225–241, 2004
2004
Cited alongside, same era.
S. Huang, E. Aubanel, and V. C. Bhavsar, “PaGrid: A mesh partitioner for computational grids,” Journal of Grid Computing , vol. 4, no. 1, pp. 71–88, 2006
2006
Cited alongside, same era.
B. Ucar, C. Aykanat, K. Kaya, and M. Ikinci, “Task Assignment in Heterogeneous Computing Systems,” Journal of Parallel and Distributed Computing , vol. 66, no. 1, pp. 32 – 46, 2006. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0743731505001577
2006
Cited alongside, same era.
A. Bhatele, N. Jain, W. D. Gropp, and L. V. Kale, “Avoiding Hot-Spots on Two-Level Direct Networks,” in ACM/IEEE Conference for High Performance Computing, Networking, Storage and Analysis (SC) . ACM, 2011, pp. 76:1–76:11
2011
Later among the works it cites.
A. Bhatele and L. Kale, “Heuristic-Based Techniques for Mapping Irregular Communication Graphs to Mesh Topologies,” in 13th Conference on High Performance Computing and Communications (HPCC) , 2011, pp. 765–771
2011
Later among the works it cites.
S. Y. Chan, T. C. Ling, and E. Aubanel, “The Impact of Heterogeneous Multi-Core Clusters on Graph Partitioning: An Empirical Study,” Cluster Computing , vol. 15, no. 3, pp. 281–302, 2012
2012
Later among the works it cites.
I. Safro, P. Sanders, and C. Schulz, “Advanced coarsening schemes for graph partitioning,” in Proc. 11th Int. Symp. on Experimental Algorithms . Springer, 2012, pp. 369–380
2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
F. Pellegrini, “Scotch and libscotch 5.0 user’s guide,” LaBRI, Université Bordeaux I, Tech. Rep., December 2007
2007
Cited alongside, same era.
I. Moulitsas and G. Karypis, “Architecture aware partitioning algorithms,” in Proc. 8th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP’08) , 2008, pp. 42–53
2008
Cited alongside, same era.
E. Aubanel, “Resource-Aware Load Balancing of Parallel Applications,” in Handbook of Research on Grid Technologies and Utility Computing: Concepts for Managing Large-Scale Applications , E. Udoh and F. Z. Wang, Eds. Information Science Reference - Imprint of: IGI Publishing, May 2009, pp. 12–21
2009
Cited alongside, same era.
L. d. F. Costa, O. N. Oliveira Jr, G. Travieso, F. A. Rodrigues, P. R. Villas Boas, L. Antiqueira, M. P. Viana, and L. E. Correa Rocha, “Analyzing and modeling real-world phenomena with complex networks: a survey of applications,” Advances in Physics , vol. 60, no. 3, pp. 329–412, 2011
2011
Cited alongside, same era.
T. Hoefler and M. Snir, “Generic Topology Mapping Strategies for Large-scale Parallel Architectures,” in ACM International Conference on Supercomputing (ICS’11) . ACM, 2011, pp. 75–85
2011
Cited alongside, same era.
F. Pellegrini, “Static Mapping of Process Graphs,” in Graph Partitioning , C.-E. Bichot and P. Siarry, Eds. John Wiley & Sons, 2011, ch. 5, pp. 115–136
2011
Cited alongside, same era.
H. Meuer, E. Strohmaier, H. Simon, and J. Dongarra, “June 2013 | TOP500 supercomputer sites,” http://top500.org/lists/2013/06/
2013
Later among the works it cites.
G. Karypis and V. Kumar, MeTiS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices, Version 5.1.0 , http://glaros.dtc.umn.edu/gkhome/fetch/sw/metis/manual.pdf
2013
Later among the works it cites.
P. Sanders and C. Schulz, “High quality graph partitioning,” in Proc. of the 10th DIMACS Impl. Challenge Workshop: Graph Partitioning and Graph Clustering . AMS, 2013, pp. 1–17
2013
Later among the works it cites.
E. Jeannot, G. Mercier, and F. Tessier, “Process Placement in Multicore Clusters: Algorithmic Issues and Practical Techniques,” IEEE Transactions on Parallel and Distributed Systems , vol. PP, no. 99, pp. 1–1, 2013
2013
Later among the works it cites.
B. Brandfass, T. Alrutz, and T. Gerhold, “Rank Reordering for MPI Communication Optimization,” Computers & Fluids , vol. 80, no. 0, pp. 372 – 380, 2013. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S004579301200028X
2013
Later among the works it cites.
C. Schulz, “Hiqh Quality Graph Partititioning,” Ph.D. dissertation, Karlsruhe Institute of Technology, 2013
2013
Later among the works it cites.