This paper presents three algorithms for co-reserving resources. A novel mechanism for specifying QoS constraints with the requests is introduced. The performance of the algorithms are studied through extensive simulations. The results indicate that depending on the objective of optimization different algorithms should be used. One of the distinguishing features of our algorithms is that they operate in a pseudo-online mode (called the “batch” mode).
['Rui Min', 'Muthucumaru Maheswaran']
Scheduling Co-Reservations with Priorities in Grid Computing Systems