A multi-agent memetic algorithm approach for distributed object allocation

Journal of Computational Science

Volumn 2, Issue 4, 2011, Pages 353-364

  Pendharkar, Parag C ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Distributed computing; Graph bisection; Memetic algorithm; Multi agent systems

Indexed keywords

DISTRIBUTED COMPUTING ENVIRONMENT; DISTRIBUTED OBJECTS; GRAPH BISECTION; HEURISTIC APPROACH; INTER-SERVER COMMUNICATIONS; LOWER BOUNDS; MEMETIC ALGORITHMS; SEMI-DEFINITE PROGRAMMING;

ALGORITHMS; HEURISTIC METHODS; HEURISTIC PROGRAMMING; MATHEMATICAL PROGRAMMING; MULTI AGENT SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 82455172201     PISSN: 18777503     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jocs.2011.08.002     Document Type: Article

References (41)

1. Abramson D., Randall M. A simulated annealing code for general integer linear programs. Annals of Operations Research 1999, 86:3-21.
2. Barker K., Bhar S. A graphical approach to allocating class fragments in distributed objectbase systems. Distributed and Parallel Databases 2001, 10:207-239.
3. Battiti R., Bertossi A.A. Greedy, prohibition and reactive heuristics for graph partitioning. IEEE Transactions on Computers 1999, 48:361-385.
4. Bell J.E., Griffis S.E., Cunningham W.A., Eberlan J.A. Location optimization of strategic alert sites for homeland defense. Omega 2011, 39:151-158.
5. Bui T.N., Moon B.R. Genetic algorithm and graph partitioning. IEEE Transactions on Computers 1996, 45:841-855.
6. Chiu C-C., Hsu C-H., Yeh Y-S. A genetic algorithm for reliability-oriented task assignment with k duplications in distributed systems. IEEE Transactions on Reliability 2006, 55(1):105-117.
7. Choi S., Wu C. Partitioning and allocation of objects in heterogeneous distributed environments using the niched pareto genetic algorithm. Proceedings of the 5th Asia Pacific Software Engineering Conference (APSEC 98) 1998, 8 pp.
8. Costa A.M., Franca P.M., Filho C.L. Two-level network design with intermediate facilities: an application to electrical distribution systems. Omega 2011, 39:3-13.
9. Coulouris G., Dollimore J., Kindberg T. Distributed Systems Concepts and Design 2005, Addison-Wesley, Boston. 4th ed.
10. Fergany T., Sarhan A. Efficient allocation of distributed object-oriented tasks to a pre-defined scheduled system. International Journal of Computers and Applications 2006, 28(1):35-42.
11. Ferreira C.E., Martin A., de Souza C.C., Weismantel R., Wolsey L.A. The node capacited graph partitioning problem: a computational study. Mathematical Programming 1998, 81:229-256.
12. Fernandez-Baca D. Allocating modules to processors in a distributed system. IEEE Transactions on Software Engineering 1989, 15:1427-1436.
13. Garey M.R., Johnson D.S. Computers and Intractibility: A Guide to the Theory of NP-Completeness 1979, Freeman, San Francisco.
14. Goldberg D.E. Genetic Algorithms in Search, Optimization, and Machine Learning 1989, Addison-Wesley, Reading, MA.
15. Hao J.K., Pannier J. Simulated annealing and tabu search for constraint solving. Fifth International Symposium on Artificial Intelligence and Mathematic 1998, 1-15.
16. Hong B., Prasanna V.K. Adaptive allocation of independent tasks to maximize throughput. IEEE Transactions on Parallel and Distributed Systems 2007, 18(10):1420-1435.
17. Huhns M., Weiss G. Guest Editorial. Machine Learning 1998, 33:123-129.
18. Karisch S.E., Rendl F., Clausen J. Solving graph bisection problems with semidefinite programming. INFORMS Journal on Computing 2000, 12:177-191.
19. Kartik S., Murthy C.S.R. Task allocation algorithms for maximizing reliability of distributed computing systems. IEEE Transactions on Computers 1997, 46(6):719-724.
20. Kernighan B.W., Lin S. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal 1970, 49:291-307.
21. Kirkpatrick S., Gelatt C.D., Vecchi M.P. Optimization by simulated annealing. Science 1983, 220:671-679.
22. Koshy J., Wirjawan I., Pandey R., Ramin Y. Balancing computation and communication costs: the case of hybrid execution in sensor networks. Ad Hoc Networks 2008, 6:1185-1200.
23. Lee S-M., Ha Y., Park H-S. Allocation of classes in distributed object-oriented databases. Proceedings of 10th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing 2009, 237-242.
24. Ma P.Y.R., Lee E.Y.S., Tsuchiya M. A task allocation model for distributed computing systems. IEEE Transactions on Computers 1982, C-31:41-47.
25. Mattiussi C., Durr P., Marbach D., Floreano D. Beyond graphs: a new synthesis. Journal of Computational Science 2011, 2(2):165-177.
26. Mehrabi A., Mehrabi S., Mehrabi A.D. An adaptive genetic algorithm for multiprocessor task assignment problem with limited memory. Proceedings of the World Congress on Engineering and Computer Science 2009, 6 pp.
27. Moscato P. On evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms 1989, Technical Report 826, Caltech Concurrent Computational Program.
28. Moulin B., Chaib-Draa B. An overview of distributed artificial intelligence. Foundations of Distributed Artificial Intelligence 1996, 3-55. John Wiley and Sons, New York. O'Hare, Jennings (Eds.).
29. Nickschas M., Brinkschulte U. Decentralize task allocation in an organic real-time middleware-an auction-based approach. ATC 2009 Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing 2009, 574-579.
30. Oommen B.J., Croix E.V.S. Graph partitioning using learning automata. IEEE Transactions on Computers 1996, 45:195-208.
31. Paszynski M., Pardo D., Paszynska A. Parallel multi-frontal solver for p adaptive finite element modeling of multi-physics computational problems. Journal of Computational Science 2010, 1(1):48-54.
32. Purao S., Jain H.K., Nazareth D.L. An approach to distribution of object-oriented applications in loosely coupled networks. Journal of Management Information Systems 2002, 18:195-234.
33. Salman A., Ahmad I., Al-Madani S. Particle swarm optimization for task assignment problem. Microprocessors and Microsystems 2002, 26:363-371.
34. Smith R.G., Davis R. Frameworks for cooperation in distributed problem solving. IEEE Transactions on Systems, Man, and Cybernetics 1981, 11:61-70.
35. Stone H.S. Multiprocessor scheduling with the aid of network flow algorithms. IEEE Transactions on Software Engineering 1977, 3:85-93.
36. Vallee-Rai R., Hendren L., Sundaresan V., Lam P., Gagnon E., Co P. Soot-a JAVA optimization framework. Proceedings of Centers for Advanced Studies Conference 1999, 125-135.
37. Vidyarthi D.P., Rani K. Distributed shared memory for object allocation in DCS. International Journal of Information Technology and Management 2006, 5(1):87-91.
38. Weikum G., Vossen G. Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery 2002, Morgan Kaufmann Publishers, San Francisco.
39. Widell N., Nyberg C. Cross entropy based module allocation for distributed systems. Proceedings of Parallel and Distributed Computing and Systems 2004, 6 pp.
40. Wu H., Chang D., Oldham W.J.B. Dynamic task allocation models for large distributed systems. IEEE Transactions on Parallel and Distributed Systems 1995, 6(12):1301-1315.
41. Wujuan L., Veeravalli B. An adaptive object allocation and replication algorithm in distributed databases. Proceedings of the 23rd International Conference on Distributed Computing Systems Workshops 2003, 6 pp.