1. 24 Sep, 2012 1 commit
    • Eric Eide's avatar
      Replace license symbols with {{{ }}}-enclosed license blocks. · 6df609a9
      Eric Eide authored
      This commit is intended to makes the license status of Emulab and
      ProtoGENI source files more clear.  It replaces license symbols like
      "EMULAB-COPYRIGHT" and "GENIPUBLIC-COPYRIGHT" with {{{ }}}-delimited
      blocks that contain actual license statements.
      This change was driven by the fact that today, most people acquire and
      track Emulab and ProtoGENI sources via git.
      Before the Emulab source code was kept in git, the Flux Research Group
      at the University of Utah would roll distributions by making tar
      files.  As part of that process, the Flux Group would replace the
      license symbols in the source files with actual license statements.
      When the Flux Group moved to git, people outside of the group started
      to see the source files with the "unexpanded" symbols.  This meant
      that people acquired source files without actual license statements in
      them.  All the relevant files had Utah *copyright* statements in them,
      but without the expanded *license* statements, the licensing status of
      the source files was unclear.
      This commit is intended to clear up that confusion.
      Most Utah-copyrighted files in the Emulab source tree are distributed
      under the terms of the Affero GNU General Public License, version 3
      Most Utah-copyrighted files related to ProtoGENI are distributed under
      the terms of the GENI Public License, which is a BSD-like open-source
      Some Utah-copyrighted files in the Emulab source tree are distributed
      under the terms of the GNU Lesser General Public License, version 2.1
  2. 16 Dec, 2005 1 commit
    • Robert Ricci's avatar
      The beginnings of a toy version of assign written in Comet. I'm · ef81939b
      Robert Ricci authored
      working on getting a feeling of whether or not it's feasible to
      implement assign in Comet. I think if it is, it would be a huge win in
      terms of maintainability and extensibility.
      So far, it's looking very promising. I'm struggling a bit with the
      syntax, and the lack of an API reference. But, once I figure out how
      to do what I need, it's making a lot of sense.
      All this program does so far is try to respect the number of slots on
      physical nodes - ie. not assign more than one vnode to a pnode, but it
      can do arbitrary numbers instead of just 1.
      It does not read top/ptop files, doesn't know about types, doesn't try
      to minimize any score, doesn't do features/desires, doesn't know about
      links at all, etc. Like I said, it's the beginnings of a toy program.
      It looks to me like what we're going to end up doing is writing a
      program to produce Comet programs. One of the cool things about this
      is that it means we can leave out any constraints, etc. that are not
      relevant to the particular mapping problem at hand. And, it should
      make it easy for us to plug in other search techniques (ie. write the
      obvious ones for certain pathological cases, like snakes and