Task assignment and transaction clustering heuristics for distributed systems

Information Sciences

Volumn 97, Issue 1-2, 1997, Pages 199-219

  Aguilar, Jose ^a   Gelenbe, Erol ^b  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; GRAPH THEORY; HEURISTIC PROGRAMMING; NEURAL NETWORKS;

RANDOMLY GENERATED PROGRAM GRAPHS; TASK ASSIGNMENT PROBLEM;

PARALLEL PROCESSING SYSTEMS;

EID: 0031104514     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(96)00178-8     Document Type: Article

References (56)

1. J. Aguilar, Comparison between the random neural network model and other optimization combinatorial methods for large acyclic graph partitioning problem, in: Proceedings of the 7th International Symposium on Computer and Information Sciences, ISCIS VII, Antalya, Turkey, 1992.
2. J. Aguilar, Combinatorial optimization methods: A study of graph partitioning problem, in: Proceedings of the Panamerican Workshop on Applied and Computational Mathematics, PWACM, Caracas, Venezuela, 1993.
3. J. Aguilar, Heuristic algorithms for task assignment of parallel programs, in: Proceedings of the International Conference on Massively Parallel Processing, Applications and Development, Delft, Holland, 1994.
4. J. Aguilar, Resolution du problème de placement de tâches avec de techniques d'optimisation combinatoires, in: Proceedings 6éme Rencontres Francophones du parallelisme, Lyon, France, 1994.
5. J. Aguilar, L'Allocation de tâches, l'équilibrage de charge et l'optimisation combinatoire, Ph.D. Thesis, René Descartes University, Paris, France, 1995.
6. F. Andre and J. Pazat, Le placement de tâches sur une architecture parallèle, Tech. Sci. Inf. 7:385-401 (1988).
7. S. Baker and K. Milner, A process migration harness for dynamic load balancing, in: Proceedings of the 14th Technical Meeting of the World Occam and Transputer User Group, 1991.
8. A. Barak and A. Shilob, A distributed load balancing policy for a multicomputer, Software Pract. Exp. 15:901-913 (1985).
9. J. Baxter and J. Patel, The LAST algorithm: A heuristic based static allocation algorithm, in: Proceedings of the International Conference on Parallel Processing, Pennsylvania, 1989.
10. G. Bernard, D. Steve, and M. Simatic, Placement et migration dans les systèmes repartis faiblement couplés, Tech. Sci. Inf. 10:307-337 (1989).
11. S. Bokhari, On the mapping problem, IEEE Trans. Computers C-30:207-214 (1981).
12. S. Bokhari, Assignment Problems in Parallel and Distributed Computing, Kluwer Academic, Boston, MA, 1987.
13. N. Bowen, C. Nikolaou, and A. Ghafoor, On the assignment problem of arbitrary process systems to heterogeneous distributed computer systems, IEEE Trans. Computers 41:257-273 (1992).
14. W. Chu, L. Holloway, M. Lan, and K. Efe, Task allocation in distributed data processing, Computers, pp. 57-68 (1980).
15. W. Chu and M. Lan, Task allocation and precedence relations for distributed real time systems, IEEE Trans. Computers C-36:667-679 (1987).
16. J. Colin, Problèmes d'ordonnancement avec délais de communication: Complexité et algorithmes, Ph.D. Thesis, Paris VI University, Paris, France, 1989.
17. D. Du, Allocation de tâches dans les systèmes reconfigurables de type statique, Ph.D. Thesis, Orsay University, France, 1992.
18. K. Efe, Heuristic models of task assignment scheduling in distributed systems, Computers 15:50-56 (1982).
19. M. Eskicioglu, Process migration in distributed systems: A comparative survey, Technical Report, University of Alberta, 1990.
20. F. Ercal, J. Ramanujam, and P. Sadayappan, Task allocation onto a hypercube by recursive mincut bipartitioning, J. Paral. Distrib. Comput. 10:35-44 (1990).
21. L. Ford and D. Fulkerson, Flows in Networks, Princeton University, Princeton, NJ, 1962.
22. A. Gabrielian and D. Tyler, Optimal object allocation in distributed computer systems, in: Proceedings of the 4th International Conference on Distributed Computing Systems, Cambridge, MA, 1984.
23. E. Gelenbe, Multiprocessor Performance, Wiley, New York and Chichester, 1989.
24. E. Gelenbe, Random neural networks with positive and negative signals and product form solution, Neural Comput. 1(4):502-511 (1989).
25. E. Gelenbe, Stable random neural networks, Neural Comput. 2(2):239-247 (1990).
26. E. Gelenbe and R. Kushwaha, Incremental dynamic load balancing in distributed system, in: Proceedings of the International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS), Durham, NC, 1994.
27. D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
28. E. Houstis, Module allocation of real-time applications to distributed systems, IEEE Trans. Software Engrg. 16:699-709 (1990).
29. J. Hwang, Y. Chow, F. Anger, and C. Lee, Scheduling precedence graphs in systems with interprocessor communication times, SIAM J. Comput. 18:244-257 (1989).
30. W. Joosen and P. Verbaeten, On the use of process migration in distributed systems, Microproc. Microprogr. 28:49-52 (1990).
31. B. Kernighan and S. Lin, An efficient algorithm for partitioning graphs, Bell Syst. Tech. J. (1970).
32. C. Kim and H. Kameda, An algorithm for optimal static load balancing in distributed computer systems, IEEE Trans. Computers 41:381-384 (1992).
33. S. Kim and J. Browne, A general approach to mapping of parallel computations upon multiprocessors architectures, in: Proceedings of the International Conference on Parallel Processing, Pennsylvania, 1988.
34. O. Kremin and J. Kramer, Methodical analysis of adaptive load sharing algorithms, IEEE Trans. Paral. Distrib. Syst. 3:747-759 (1992).
35. P. Krueger and M. Livny, The diverse objectives of distributed scheduling policies, in: Proceedings of the 7th International Conference on Distributed Computing Systems, Berlin, Germany, 1987.
36. H. Kuchen and A. Wagener, Comparison of dynamic load balancing strategies, J. Paral. Distrib. Proc. 303-314 (1991).
37. K. Kyrimis, Placement of processes and files in distributed systems, Technical Report, Princeton University, 1990.
38. H. Lin and M. Keller, The gradient model load balancing policies, IEEE Trans. Software Engrg. SE-13:32-38 (1987).
39. H. Lin and C. Raghavendra, A dynamic load-balancing policy with a central job dispatcher, IEEE Trans. Software Engrg. 18:148-157 (1992).
40. V. Lo, Heuristic algorithms for task assignment in distributed systems, IEEE Trans. Computers 37:1384-1397 (1988).
41. V. Lo, Algorithms for static task assignment and symmetric contraction in distributed computer systems, Technical Report, University of Oregon, 1988.
42. L. Ni, C. Xu, and T. Gendreau, A distributed drafting algorithm for load balancing, IEEE Trans. Software Engrg. SE-11:1153-1159 (1985).
43. C. Nikolaou, D. Ferguson, G. Leitner, and G. Kar, Allocation and relocation of processes in a distributed computer system, Curr. Adv. Distrib. Comput. Commun. 1 (1986).
44. C. Papadimitriou and J. Tsitsiklis, On stochastic scheduling with in-tree precedence constraint, SIAM J. Comput. 16(1):1-6 (1987).
45. K. Park, Process migration policies in distributed operating systems, Trans. Inf. Proc. 31:1080-1090 (1990).
46. G. Peretto, Neural networks and combinatorial problems, in: Proceedings of the International Conference on Neural Networks, Paris, France, 1990.
47. K. Ramamritham, J. Stankovic, and W. Zhao, Distributed scheduling of tasks with deadlines and resource requirements, IEEE Trans. Computers 38:1110-1123 (1989).
48. M. Schaar, K. Efe, L. Delcambre, and L. Bhuyan, Load balancing with network cooperation, in: Proceedings of the 11th Conference on Distributed Computing Systems, Arlington, VA, 1991.
49. C. Shen and W. Tsai, A graph matching approach to optimal task assignment in distributed computing systems using minimax criterion, IEEE Trans. Computers C-34:197-203 (1985).
50. N. Shirazi and M. Wang, Analysis and evaluation of heuristic methods for static task scheduling, J. Paral. Distrib. Comput. 10:222-232 (1990).
51. H. Stone, Multiprocessor scheduling with the aid of network flow algorithms, IEEE Trans. Software Engrg. SE-3:85-93 (1977).
52. J. Soh and V. Thomas, Process migration for load balancing in distributed systems, in: Proceedings of TENCON'87, 1987, pp. 888-892.
53. E. Talbi and P. Bessiere, Un algorithme génétique massivement parallèle pour le problème de partitionement de graphes, Rapport de Recherche, Laboratoire de Génie Informatique, Grenoble, France, 1991.
54. A. Tantawi and D. Towsley, Optimal static load balancing in distributed computer systems, J. ACM 32:445-465 (1985).
55. B. Wells, D. Jackson, and C. Caroll, A parallel task allocation methodology for nonbuffered message-passing environments, Technical Report, University of Alabama, 1989.
56. C. Xu and F. Lau, Analysis of the generalized dimension exchange method for dynamic load balancing, J. Paral. Distrib. Comput. 16:386-393 (1992).