A stochastic automaton-based algorithm for flexible and distributed network partitioning

Proceedings - 2005 IEEE Swarm Intelligence Symposium, SIS 2005

Volumn 2005, Issue , 2005, Pages 281-288

  Wan, Yan ^a   Roy, Sandip ^a   Saberi, Ali ^a   Lesieutre, Bernard ^b  

^a WASHINGTON STATE UNIVERSITY   (United States)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATING-AGENT NETWORKS; DISTRIBUTED STOPPING CRITERION; MODEL-BASED PARTITIONING ALGORITHM; OPTIMAL K-WAY PARTITION;

ALGORITHMS; AUTOMATION; COMMUNICATION; CONSTRAINT THEORY; COSTS; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING; SENSORS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33745792174     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SIS.2005.1501632     Document Type: Conference Paper

References (17)

1. C. Asavathiratham, S. Roy, B. Lesieutre and G. Verghese. "The inuence model," IEEE Control Systems Magazine, Dec. 2001.
2. A. Pinar and B. Hendrickson, "Partitioning for complex objectives," in Proceedings of Irregular 2001
3. R. B. Boppana, "Eigenvalues and graph bisection: an average case analysis," IEEE FOCS, pp. 280-285, 1987.
4. B. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs," Bell Systems Technical J., vol.49, pp 291-307, Feb. 1970.
5. D. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon, "Optimization by simulated annealing: an experimental evaluation; part I, graph partitioning," Operations Research, Nov/Dec 1989; 37, 6.
6. B. Chamberlain,"Graph partitioning algorithms for distributed workloads of parallel computations," Technical Report UW-CSE-98-10-03, University of Washington, Oct. 1998.
7. P. K. Chan, M. D. Schlag, and J. Y. Zien, "Spectral k-way ratio-cut partitioning and clustering," 30th ACM/IEEE Design Automation Conference, Dallas Texas, June 1993.
8. C.L. DeMarco and J. Wassner, "A generalized eigen-value perturbation approach to coherency," Proc. IEEE Conference on Control Applications, pp. 611-617, Sept. 1995.
9. S. Roy and B. Lesieutre. "Studies in network partitioning based on topological structure," 32nd Annual North American Power Symposium, Waterloo, Canada, Oct. 2000.
10. R. D. Williams, "Performance of dynamic load balancing algorithms for unstructured mesh calculations," Concurrency: Practice and Experience, 3 (1991), pp. 457-481.
11. T. Nguyen Bui and B. R. Moon, "Genetic algorithm and graph partitioning," IEEE Transactions on Computers, vol. 45, No. 7, July 1996.
12. C. K. Cheng and Y. C. Wei, "An improved two way partitioning algorithm with stable perform," IEEE Trans. on Computer-Aided Design, 10(12): 1502-1511, Dec. 1991.
13. S. Roy, A. Saberi, and K. Herlugson, "A controltheoretic perspective on the design of distributed agreement protocols," submitted to Automatica, Oct. 2004.
14. Y. Wan, S. Roy, A. Saberi, and B. C. Lesieutre, "A stochastic automaton-based algorithm for flexible and distributed network partitioning," submitted to the IEEE Transactions on Parallel and Distributed Systems, Apr. 2005.
15. D. H. Wolpert and W. G. Macready, "No free lunch theorems for search," Technical Report, Santa Fe Institute, No. 95-02-010, 1995.
16. H. You, V. Vittal, and X. Wang, "Slow coherency-based Islanding," IEEE Transactions on Power Systems, Vol. 19, NO. 1, Feb. 2004.
17. A. Jadbabaie, "On geographic routing with location information," submitted to Proceedings of the IEEE Conference on Decision and Control, The Bahamas, 2004.