Efficient approximation algorithms for scheduling malleable tasks
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Dynamic Coscheduling on Workstation Clusters
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Simgrid: A Toolkit for the Simulation of Application Scheduling
CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
Condor-G: A Computation Management Agent for Multi-Institutional Grids
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
Utilization and Predictability in Scheduling the IBM SP2 with Backfilling
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Xen and the art of virtualization
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Resource Management and Knapsack Formulations on the Grid
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Evaluation of Knapsack-Based Scheduling Using the NPACI JOBLOG
HPCS '06 Proceedings of the 20th International Symposium on High-Performance Computing in an Advanced Collaborative Environment
A New Heuristic for Solving the Multichoice Multidimensional Knapsack Problem
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Metascheduling Multiple Resource Types using the MMKP
GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
Multiple objective scheduling of HPC workloads through dynamic prioritization
Proceedings of the High Performance Computing Symposium
| Hi-index | 0.00 |
The knapsack-based task scheduler has been previously shown to provide Quality of Service to malleable tasks on computational grids. In this study, we measure the sensitivity of the knapsack-derived schedules to variations in the prescribed allocation policies and their corresponding utility functions. In particular, we explore the effects of varying the strengths of an external user-specified monetary metric, an intrinsic estimated response time mediated by nearness to completion time metric, and of varying the shape of a sigmoidal normalizing utility function. The results of our analyses show that the knapsack strategy results in schedules that are consistent with the defined allocation policies. We conclude by indicating the recommended metric weights, that is, those that produce desirable schedule characteristics.