2 # NEPI, a framework to manage network experiments
3 # Copyright (C) 2013 INRIA
5 # This program is free software: you can redistribute it and/or modify
6 # it under the terms of the GNU General Public License as published by
7 # the Free Software Foundation, either version 3 of the License, or
8 # (at your option) any later version.
10 # This program is distributed in the hope that it will be useful,
11 # but WITHOUT ANY WARRANTY; without even the implied warranty of
12 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 # GNU General Public License for more details.
15 # You should have received a copy of the GNU General Public License
16 # along with this program. If not, see <http://www.gnu.org/licenses/>.
18 # Author: Alina Quereilhac <alina.quereilhac@inria.fr>
29 """ This class is to define a task, that is represented by an id,
30 an execution time 'timestamp' and an action 'callback """
32 def __init__(self, timestamp, callback):
34 self.timestamp = timestamp
35 self.callback = callback
37 self.status = TaskStatus.NEW
39 class HeapScheduler(object):
40 """ Create a Heap Scheduler.
44 This class is thread safe.
45 All calls to C Extensions are made atomic by the GIL in the CPython implementation.
46 heapq.heappush, heapq.heappop, and list access are therefore thread-safe.
51 super(HeapScheduler, self).__init__()
54 self._idgen = itertools.count(1)
58 """ Returns the list of pending task ids """
61 def schedule(self, task):
62 """ Add the task 'task' in the heap of the scheduler
64 :param task: task that need to be schedule
68 task.id = self._idgen.next()
70 entry = (task.timestamp, task.id, task)
71 self._valid.add(task.id)
72 heapq.heappush(self._queue, entry)
75 def remove(self, tid):
76 """ Remove a task form the heap
78 :param tid: Id of the task that need to be removed
82 self._valid.remove(tid)
87 """ Get the next task in the scheduler
92 timestamp, tid, task = heapq.heappop(self._queue)
93 if tid in self._valid: