Home | Trees | Indices | Help |
---|
|
1 # -------------------------------------------------------------------------- # 2 # Copyright 2006-2009, University of Chicago # 3 # Copyright 2008-2009, Distributed Systems Architecture Group, Universidad # 4 # Complutense de Madrid (dsa-research.org) # 5 # # 6 # Licensed under the Apache License, Version 2.0 (the "License"); you may # 7 # not use this file except in compliance with the License. You may obtain # 8 # a copy of the License at # 9 # # 10 # http://www.apache.org/licenses/LICENSE-2.0 # 11 # # 12 # Unless required by applicable law or agreed to in writing, software # 13 # distributed under the License is distributed on an "AS IS" BASIS, # 14 # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. # 15 # See the License for the specific language governing permissions and # 16 # limitations under the License. # 17 # -------------------------------------------------------------------------- # 18 19 from haizea.core.scheduler import EarliestStartingTime 20 from haizea.core.scheduler.preparation_schedulers import PreparationScheduler 21 from mx.DateTime import TimeDelta 225225 PreparationScheduler.__init__(self, slottable, resourcepool, deployment_enact) 26 self.handlers = {}27 3133 # The earliest starting time is "nexttime" on all nodes. 34 node_ids = [node.id for node in self.resourcepool.get_nodes()] 35 earliest = {} 36 for node in node_ids: 37 earliest[node] = EarliestStartingTime(nexttime, EarliestStartingTime.EARLIEST_NOPREPARATION) 38 return earliest39 42 4547 self.cleanup(lease)48
Home | Trees | Indices | Help |
---|
Generated by Epydoc 3.0.1 on Thu Dec 17 10:59:23 2009 | http://epydoc.sourceforge.net |