Task assignment in Cayley interconnection topologies

DOI10.1016/S0167-8191(97)89285-XMaRDI QIDQ1389668zbMATH OpenOpenAlexWikidataFDO

Authors D. Massart

Publication date 30 June 1998

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(97)89285-x

zbMATH Keywords

quadratic assignment problemCayley graphsheuristic optimizationtask assignmentinterconnection topologies

Mathematics Subject Classification ID

Theory of operating systems (68N25) Computer system organization (68M99)

Recommendations

• Processor interconnection networks from Cayley graphs
• Optimal task assignment in linear array networks
• Optimal layout of trivalent Cayley interconnection networks
• Channel assignment on Cayley graphs
• New methods for using Cayley graphs in interconnection networks
• Two families of Cayley graph interconnection networks
• Task allocation on a network of processors
• Fast load balancing in Cayley graphs and in circuits

Cited in

(4)

• A cooperative parallel tabu search algorithm for the quadratic assignment problem
• The move-to-partner rule for self-organizing task allocation on a linear array
• Task swapping networks in distributed systems
• Sorting on graphs by adjacent swaps using permutation groups

This page was built for publication: Task assignment in Cayley interconnection topologies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389668)