Two-Level scheduling algorithm for simulation servers
We present a scheme for efficiently administrating a set of distributed simulation servers which attend requests from a number of users. These can be either sequential or parallel simulation models, or random combinations of the two. We treat each server as a BSP machine and organize our scheduling...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2002
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23145 |
| Aporte de: |
| Sumario: | We present a scheme for efficiently administrating a set of distributed simulation servers which attend requests from a number of users. These can be either sequential or parallel simulation models, or random combinations of the two. We treat each server as a BSP machine and organize our scheduling strategy upon the cost prediction and computation model supported by it. Empirical results show that the proposed strategy is able to achieve near optimal performance. Our aim was to develop a mechanism which be able to work with minimum global information so that it can be utilized on Web based simulation systems. |
|---|