Download now Free registration required
The proper scheduling algorithms are implemented to divert the flow so that the faster response can be obtained from the huge data repository where several lakhs of records are maintained. The objective is to minimize the maximum stretch, i.e., the maximum ratio between the actual time an application has spent in the system and the time this application would have spent if executed alone. Scheduling task is very difficult on traditional parallel machines, and they become extremely challenging on heterogeneous clusters.
- Format: PDF
- Size: 298.9 KB