lib-src/scheduling/cyclescheduler.cc

   1 //////////////////////////////////////////////////////////////////////////////
   2 // NOTICE:
   3 //
   4 // ADLib, Prop and their related set of tools and documentation are in the
   5 // public domain.   The author(s) of this software reserve no copyrights on
   6 // the source code and any code generated using the tools.  You are encouraged
   7 // to use ADLib and Prop to develop software, in both academic and commercial
   8 // settings, and are welcomed to incorporate any part of ADLib and Prop into
   9 // your programs.
  10 //
  11 // Although you are under no obligation to do so, we strongly recommend that
  12 // you give away all software developed using our tools.
  13 //
  14 // We also ask that credit be given to us when ADLib and/or Prop are used in
  15 // your programs, and that this notice be preserved intact in all the source
  16 // code.
  17 //
  18 // This software is still under development and we welcome(read crave for)
  19 // any suggestions and help from the users.
  20 //
  21 // Allen Leung (leunga@valis.cs.nyu.edu)
  22 // 1994-1995
  23 //////////////////////////////////////////////////////////////////////////////
  24
  25 #include <AD/scheduling/cyclescheduler.h>
  26 #include <AD/contain/priqueue.h>
  27 #include <AD/
  28
  29 //////////////////////////////////////////////////////////////////////////////
  30 //  Constructors and destructor
  31 //////////////////////////////////////////////////////////////////////////////
  32 CycleScheduler:: CycleScheduler(Mem& m) : Super(m) {}
  33 CycleScheduler::~CycleScheduler() {}
  34
  35 //////////////////////////////////////////////////////////////////////////////
  36 //
  37 //  Cycle list scheduling
  38 //
  39 //////////////////////////////////////////////////////////////////////////////
  40 void CycleScheduler::list_schedule ()
  41 {  PriQueue<Ranking> ready;
  42    PriQueue<Ranking> waiting;
  43
  44    Time t = start_time();
  45 }