Task assignment in Cayley interconnection topologies

Aarts, 1989 Akers, 1987, The star-graph: An attractive alternative to the e-cube, 393 Akers, 1984, Group graphs as interconnection networks, 422 Akers, 1986, A group theoretic model for symmetric interconnection networks Akers, 1989, A group-theoretic model for symmetric interconnection networks, IEEE Transactions on Computers, 38, 555, 10.1109/12.21148 Bermond, 1986, Strategies for interconnection networks: Some methods from graph theory, Journal of Parallel and Distributed Computing, 3, 10.1016/0743-7315(86)90008-0 Bhatia, 1991, Shortest paths in orthogonal graphs Bhuyan, 1984, Generalized hypercube and hyperbus structures for a computer network, IEEE Transactions on Computers, 33, 323, 10.1109/TC.1984.1676437 Bhuyan, 1987, Interconnection networks for parallel and distributed processing, IEEE Computer, 20, 10.1109/MC.1987.1663585 Bonomi, 1986, The asymptotic behavior of quadratic sum assignment problems: A statistical mechanics approach, European Journal of Operational Research, 26, 295, 10.1016/0377-2217(86)90193-1 Burkard, 1984, Quadratic Assignment Problems, European Journal Operational Research, 15, 283, 10.1016/0377-2217(84)90093-6 Burkard, 1983, The asymptotic behavior of quadratic sum assignment problems, Zeitschrift für Operations Research, 27, 73, 10.1007/BF01916903 Burkard, 1984, A thermodynamically motivated simulation procedure for combinatorial optimization problems, European Journal of Operational Research, 17, 169, 10.1016/0377-2217(84)90231-5 Campbell, 1992, Small diameter symmetric networks from linear groups, IEEE Transactions on Computers, 41, 218, 10.1109/12.123397 Chakrapani, 1995, Mapping tasks to processors to minimize communication time in a multiprocessor system Connolly, 1990, An improved annealing schema for the gap, European Journal of Operational Research, 46, 93, 10.1016/0377-2217(90)90301-Q Dinneen, 1994, New results for the degree/diameter problem, Networks, 24, 10.1002/net.3230240702 El-Amawy, 1991, Properties and performance of folded hypercubes, IEEE Transactions on Parallel Distributed Systems, 2, 31, 10.1109/71.80187 Ghafoor, 1989, Bisectional fault-tolerant communication architecture for supercomputer systems, IEEE Transactions on Computers, 38, 1425, 10.1109/12.35837 Hitz, 1993, Domain dependent evaluation of cayley graph topologies Hits, 1993, Interconnection topologies for shared nothing dbms architectures Hitz, 1994, Routing heuristics for cayley graph topologies Jerrum, 1984, Families of fixed degree graphs for processor interconnection, IEEE Transactions on Computers, C33 Kaiser, 1981 Lakshmivarahan, 1988, A new hierarchy of hypercube interconnection schemes for parallel computers, Journal of Supercomputing, 2, 81, 10.1007/BF00127849 Lakshmivarahan, 1993, Symmetry in interconnection networks based on cayley graphs of permutation groups: A survey, Parallel Computing, 19, 10.1016/0167-8191(93)90054-O Laursen, 1993, Simulated annealing for the qap — optimal tradeoff between simulation time and solution quality, European Journal of Operational Research, 69, 238, 10.1016/0377-2217(93)90167-L Lo, 1988, Heuristic algorithms for task assignment in distributed systems, IEEE Transactions on Computers, 37, 1384, 10.1109/12.8704 Ni, 1993, A survey of wormhole routing techniques in direct networks, IEEE Computer, 26, 10.1109/2.191995 Preparata, 1981, The cube-connected cycles: A versatile network for parallel computation, Communications of the ACM, 24, 10.1145/358645.358660 Saad, 1985, Topological properties of hypercubes Scherson, 1989, A theory for the description and analysis of a class of interconnection networks Scherson, 1991, Orthogonal graphs for the construction of a class of interconnection networks, IEEE Transactions on Parallel Distributed Systems, 2, 3, 10.1109/71.80185 Seitz, 1985, The cosmic cubes, Communications of the ACM, 28, 22, 10.1145/2465.2467 van Laarhoven, 1987, Simulated annealing: Theory and applications