Regular paperTask assignment in Cayley interconnection topologies
References (35)
- et al.
The asymptotic behavior of quadratic sum assignment problems: A statistical mechanics approach
European Journal of Operational Research
(1986) Quadratic Assignment Problems
European Journal Operational Research
(1984)- et al.
A thermodynamically motivated simulation procedure for combinatorial optimization problems
European Journal of Operational Research
(1984) An improved annealing schema for the gap
European Journal of Operational Research
(1990)- et al.
Simulated Annealing and Boltzmann Machines
(1989) - et al.
The star-graph: An attractive alternative to the e-cube
- et al.
Group graphs as interconnection networks
- et al.
A group theoretic model for symmetric interconnection networks
- et al.
A group-theoretic model for symmetric interconnection networks
IEEE Transactions on Computers
(1989) - et al.
Strategies for interconnection networks: Some methods from graph theory
Journal of Parallel and Distributed Computing
(1986)
Shortest paths in orthogonal graphs
Generalized hypercube and hyperbus structures for a computer network
IEEE Transactions on Computers
Interconnection networks for parallel and distributed processing
IEEE Computer
The asymptotic behavior of quadratic sum assignment problems
Zeitschrift für Operations Research
Small diameter symmetric networks from linear groups
IEEE Transactions on Computers
Mapping tasks to processors to minimize communication time in a multiprocessor system
New results for the degree/diameter problem
Networks
Cited by (5)
Sorting on graphs by adjacent swaps using permutation groups
2016, Computer Science ReviewCitation Excerpt :Permutation Sorting for Ring Topology [18,21] Cayley graphs [3,19,20] play an important role in both mathematics (e.g. combinatorics [33,34], group theory [35,36], etc.) and computer science (e.g. interconnection network design [3,19,20], data center design [37,38], distributed systems [39,40], multi-agent systems [18,41], etc.). In Section 3 we used the diameters of several kinds of Cayley graphs to find upper bounds of the minimum number of adjacent swaps needed to sort objects on graphs with line, star, complete, and ring topologies.
Scalable rank-mapping algorithm for an icosahedral grid system on the massive parallel computer with a 3-D torus network
2014, Parallel ComputingCitation Excerpt :For several decades, many researchers have tackled the rank-mapping problem in order to efficiently execute application on parallel computer. ( e.g. [13–21] and the references cited therein). In graph theory, the rank-mapping problem is interpreted as the problem of embedding a source graph that represents a communication network into a destination graph that represents a node network.
A cooperative parallel tabu search algorithm for the quadratic assignment problem
2009, European Journal of Operational ResearchTask swapping networks in distributed systems
2013, International Journal of Computer MathematicsThe move-to-partner rule for self-organizing task allocation on a linear array
2002, Stochastic Models