Static Mapping of Process Graphs

[1]  Abderezak Touzene,et al.  A multilevel partitioning approach for efficient tasks allocation in heterogeneous distributed systems , 2008, J. Syst. Archit..

[2]  François Pellegrini,et al.  Improvement of the Efficiency of Genetic Algorithms for Scalable Parallel Graph Partitioning in a Multi-level Framework , 2006, Euro-Par.

[3]  Eric E. Aubanel,et al.  PaGrid: A Mesh Partitioner for Computational Grids , 2006, Journal of Grid Computing.

[4]  Zhen Yang,et al.  Effective Memetic Algorithms for VLSI Design = Genetic Algorithms Local Search Multi-Level Clustering , 2004, Evolutionary Computation.

[5]  Füsun Özgüner,et al.  Precedence-Constrained Task Allocation onto Point-to-Point Networks for Pipelined Execution , 1999, IEEE Trans. Parallel Distributed Syst..

[6]  Ishfaq Ahmad,et al.  Optimal task assignment in heterogeneous distributed computing systems , 1998, IEEE Concurr..

[7]  Ricardo Cayssials,et al.  Precedence constraints in hard real-time distributed systems , 1997, Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168).

[8]  Mary Mehrnoosh Eshaghian-Wilner,et al.  Mapping heterogeneous task graphs onto heterogeneous system graphs , 1997, Proceedings Sixth Heterogeneous Computing Workshop (HCW'97).

[9]  Jean Roman,et al.  SCOTCH: A Software Package for Static Mapping by Dual Recursive Bipartitioning of Process and Architecture Graphs , 1996, HPCN Europe.

[10]  Martin G. Everett,et al.  Partitioning & Mapping of Unstructured Meshes to Parallel Machine Topologies , 1995, IRREGULAR.

[11]  J. Ramanujam,et al.  Task allocation onto a hypercube by recursive mincut bipartitioning , 1990, C3P.

[12]  P. Sadayappan,et al.  Nearest-Neighbor Mapping of Finite Element Graphs onto Processor Meshes , 1987, IEEE Transactions on Computers.

[13]  Francine Berman,et al.  On Mapping Parallel Algorithms into Parallel Architectures , 1987, J. Parallel Distributed Comput..

[14]  J. Ramanujam,et al.  Cluster partitioning approaches to mapping parallel programs onto a hypercube , 1987, Parallel Comput..

[15]  James V. Hansen,et al.  Task allocation in distributed processing systems , 1986 .

[16]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[17]  Shahid H. Bokhari,et al.  A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor System , 1981, IEEE Transactions on Software Engineering.

[18]  Shahid H. Bokhari,et al.  On the Mapping Problem , 1981, IEEE Transactions on Computers.

[19]  Norman E. Gibbs,et al.  A Comparison of Several Bandwidth and Profile Reduction Algorithms , 1976, TOMS.

[20]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[21]  Parallel Processing Letters c ○ World Scientific Publishing Company Exact Algorithms for a Task Assignment Problem , 2008 .

[22]  Bora Uçar,et al.  Task assignment in heterogeneous computing systems , 2006, J. Parallel Distributed Comput..

[23]  El-Ghazali Talbi,et al.  Méthodes de placement statique des processus sur architectures parallèles , 1991 .

[24]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.