CPM

From HCL
Revision as of 11:25, 2 September 2010 by Kiril (talk | contribs) (New page: ToDo for CPM: * implement Traeff minimum/maximum decision making * implement mapping of processes based on sorting so that in a reserved set of resources, process X always refers to the e...)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

ToDo for CPM:

  • implement Traeff minimum/maximum decision making
  • implement mapping of processes based on sorting so that in a reserved set of resources, process X always refers to the exact same node Y