Task assignment in Cayley interconnection topologies

DOI10.1016/S0167-8191(97)89285-XzbMath0894.68023OpenAlexW2071371865WikidataQ127498921 ScholiaQ127498921MaRDI QIDQ1389668

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

Cayley graphsheuristic optimizationquadratic assignment problemtask assignmentinterconnection topologies

Mathematics Subject Classification ID

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

Related Items

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