Task assignment in Cayley interconnection topologies

Parallel Computing

Volumn 23, Issue 10, 1997, Pages 1429-1460

  Gutjahr, W J ^a   Hitz, M ^a   Mueck, T A ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

Cayley graphs; Heuristic optimization; Interconnection topologies; Quadratic problem; Task assignment

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; DATA TRANSFER; INTERCONNECTION NETWORKS; SIMULATED ANNEALING; TOPOLOGY;

CAYLEY GRAPH METHOD; MULTIPROCESSOR INTERCONNECTION TOPOLOGIES; OPTIMAL TASK TO PROCESSOR ASSIGNMENT;

MULTIPROCESSING SYSTEMS;

EID: 0031245388     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-8191(97)89285-x     Document Type: Article

References (35)

1. E. Aarts, J. Korst, Simulated Annealing and Boltzmann Machines, Wiley, Chichester, 1989.
2. S.B. Akers, D. Harel, B. Krishnamurty, The star-graph: An attractive alternative to the e-cube, in: Proceedings of the International Conference on Parallel Processing, 1987, pp. 393-400.
3. S.B. Akers, B. Krishnamurthy, Group graphs as interconnection networks, in: Proceedings of the 14th International Conference on Fault-Tolerant Computing, 1984, pp. 422-427.
4. S.B. Akers, B. Krishnamurthy, A group theoretic model for symmetric interconnection networks, in: Proc. of the 1986 Int. Conf. on Parallel Processing, IEEE CS Press, 1986.
5. S.B. Akers, B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Transactions on Computers 38 (1989) 555-565.
6. J.-C. Bermond, C. Delorme, J.-J. Quisquater, Strategies for interconnection networks: Some methods from graph theory, Journal of Parallel and Distributed Computing 3 (4) (1986).
7. S. Bhatia, D. Hirschberg, I.D. Scherson, Shortest paths in orthogonal graphs, Technical report 91-45, University of California, Irvine, 1991.
8. L.N. Bhuyan, D.T. Agrawal, Generalized hypercube and hyperbus structures for a computer network, IEEE Transactions on Computers 33 (1984) 323-333.
9. L.N. Bhuyan, Interconnection networks for parallel and distributed processing, IEEE Computer 20 (6) (1987).
10. E. Bonomi, J.-L. Lutton, The asymptotic behavior of quadratic sum assignment problems: A statistical mechanics approach, European Journal of Operational Research 26 (1986) 295-300.
11. R.E. Burkard, Quadratic Assignment Problems, European Journal Operational Research 15 (1984) 283-289.
12. R.E. Burkard, U. Finke, The asymptotic behavior of quadratic sum assignment problems, Zeitschrift für Operations Research 27 (1983) 73-81.
13. R.E. Burkard, F. Rendl, A thermodynamically motivated simulation procedure for combinatorial optimization problems, European Journal of Operational Research 17 (1984) 169-174.
14. L. Campbell, G.E. Carlsson, M.J. Dinneen, V. Faber, M.R. Fellows, J.W. Langston, J.W. Moore, A.P. Mullhaupt, H.B. Sexton, Small diameter symmetric networks from linear groups, IEEE Transactions on Computers 41 (1992) 218-220.
15. J. Chakrapani, J. Skorin-Kapov, Mapping tasks to processors to minimize communication time in a multiprocessor system, in: S.G. Nash, A. Sofer (Eds.), The Impact of Emerging Technologies on Computer Science and Operations Research, Kluwer, 1995.
16. D.T. Connolly, An improved annealing schema for the gap, European Journal of Operational Research 46 (1990) 93-100.
17. M.J. Dinneen, P.R. Haffner, New results for the degree/diameter problem, Networks 24 (1994).
18. A. El-Amawy, S. Latifi, Properties and performance of folded hypercubes, IEEE Transactions on Parallel Distributed Systems 2 (1) (1991) 31-42.
19. A. Ghafoor, T.R. Bashkow, I. Ghafoor, Bisectional fault-tolerant communication architecture for super-computer systems, IEEE Transactions on Computers 38 (10) (1989) 1425-1446.
20. M. Hitz, T.A. Mueck, Domain dependent evaluation of cayley graph topologies, in: Proc. of the ISCA Int. Conf. Parallel and Distributed Computing and Systems, International Society for Computers and Their Applications - ISCA, 1993.
21. M. Hits, T.A. Mueck, Interconnection topologies for shared nothing dbms architectures, in: M.E. Orlowska, M. Papazoglou (Eds.), Advances in Database Research, World Scientific Publishing, 1993.
22. M. Hitz, T.A. Mueck, Routing heuristics for cayley graph topologies, in: Proc. of the 10th IEEE Conf. on Artificial Intelligence for Applications (CAIA-94), IEEE Computer Society Press, 1994.
23. M. Jerrum, S. Skyum, Families of fixed degree graphs for processor interconnection, IEEE Transactions on Computers C33 (1984).
24. H. Kaiser, R. Mlitz, G. Zeilinger, Algebra für Informatiker, Springer-Verlag, Wien, New York, 1981.
25. S. Lakshmivarahan, S.K. Dhall, A new hierarchy of hypercube interconnection schemes for parallel computers, Journal of Supercomputing 2 (1988) 81-108.
26. S. Lakshmivarahan, J.S. Jwo, S.K. Dhall, Symmetry in interconnection networks based on cayley graphs of permutation groups: A survey, Parallel Computing 19 (4) 1993.
27. S. Laursen, Simulated annealing for the qap - optimal tradeoff between simulation time and solution quality, European Journal of Operational Research 69 (1993) 238-243.
28. V.M. Lo, Heuristic algorithms for task assignment in distributed systems, IEEE Transactions on Computers 37 (11) (1988) 1384-1397.
29. L.M. Ni, P.K. McKinley, A survey of wormhole routing techniques in direct networks, IEEE Computer 26 (2) (1993).
30. F. Preparata, J. Vuillemin, The cube-connected cycles: A versatile network for parallel computation, Communications of the ACM 24 (5) (1981).
31. Y. Saad, M.H. Schultz, Topological properties of hypercubes, Technical report DCR-RR-389, Department of Computer Science, Yale University, 1985.
32. I.D. Scherson, A theory for the description and analysis of a class of interconnection networks, Technical report CE-S89-002, Department of Electrical Engineering, Princeton University, 1989.
33. I.D. Scherson, Orthogonal graphs for the construction of a class of interconnection networks, IEEE Transactions on Parallel Distributed Systems 2 (1991) 3-19.
34. C.L. Seitz, The cosmic cubes, Communications of the ACM 28 (1985) 22-33.
35. P.J.M. van Laarhoven, E.H.L. Aarts, Simulated annealing: Theory and applications, in: Mathematics and Its Applications, D. Reidel Publishing Co., 1987.