DYNAMIC TASK ALLOCATION

The recent development of open computer systems has led to new challenges for the management of computer resources and their efficient utilization [1,2]. Interconnected heterogeneous computer systems, operating in a highly parallel manner, are very different in their behaviour to those conventional computational resources operating in an isolated and non-interconnected manner. The management of these systems requires a new approach aimed at an efficient distribution of computational requirements in an environment subject to continuous change and evolution.

[1]  John F. Shoch,et al.  The “worm” programs—early experience with a distributed computation , 1982, CACM.

[2]  C. Hewitt.  The challenge of open systems , 1990 .

[3]  Hogg,et al.  Dynamics of computational ecosystems. , 1989, Physical review. A, General physics.

[4]  Sverrir Olafsson,et al.  A general model for task distribution on an open heterogenous processor system , 1995, IEEE Trans. Syst. Man Cybern..

[5]  E. Jaynes.  Information Theory and Statistical Mechanics , 1957 .

[6]  Miron Livny,et al.  Condor-a hunter of idle workstations , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[7]  Bernardo A. Huberman,et al.  The ecology of computation , 1988, Digest of Papers. COMPCON Spring 89. Thirty-Fourth IEEE Computer Society International Conference: Intellectual Leverage.

[8]  D. Chandler,et al.  Introduction To Modern Statistical Mechanics , 1987 .

[9]  Tad Hogg,et al.  Spawn: A Distributed Computational Economy , 1992, IEEE Trans. Software Eng..

[10]  Ivan E. Sutherland,et al.  A futures market in computer time , 1968, Commun. ACM.