Build infastructure
Code dump
Scheduler framework done

All I need to do now is track the availiability of nodes...
Schedules DES on one giant tile

This isn't pretty, but it does appear to schedule DES for a single
giant tile.
Add some simple network support

This doesn't contain a particularly useful network model: specifically
it doesn't account for congestion at all.  Nonetheless, it does at
least report a number that somewhat cooresponds to how long it'll take
to execute on a networked DREAMER chip...
Make the scheduling algorithm significantly greedier

Rather than searching every tile on the array for a place to put each
operation this new algorithm simply find the first tile at which it's
possible to schedule an operation and then does it.
Simplify the scheduling algorithm

The old scheduling code would try to find the best tile to place some
node on, which is complicated because it requires rolling back
scheduling decisions.  I never really made it far enough to get that
to work and have instead simply made the algorithm greedier (it has a
simple ordering for where an operation should be scheduler), which
removes the need to roll back decisions.

This gets rid of the lasts bits of cruft that were related to that old
scheduler.
Use a network configuration file

Now these tools can run against an arbitrary DREAMER network
configuration, so there's at least one paramater!
Add a "--help" text

This is much better than just SEGVing when the arguments aren't
correct.
Do greedy placement for memories

It turns out this is actually slighly worse than doing random memory
placement for the DES test case, whoops!
Add a DES test case

All this really does is make sure that DES doesn't SEGV the PAR code,
but I guess it's a start!
Add a concentrated mesh test

Just as expected: this is faster than a mesh but slower than a full
crossbar...
Allow memories to be placed at any time

The general idea is that pflo files refer to memories with their
regular operations, as memories are just indexes.  This always tries
to place memories greedily.
Handle LD and ST operations

Note that these aren't handled correctly: they're allowed to be placed
on any tile.  With any luck this will be OK because the placement tool
will constrain them to be on the same tile, but this should probably
be verified at some point.

Unfortunately this is somewhat difficult to do because you'd have to
walk the graph a bit and make sure that the memory whose address is
used to generate this offset is on the same tile as the memory
instruction.
Run placed DES as a test

This will require the latest libflo, which uses placed files.
Essentially the idea here is that I want to make sure the placed stuff
doesn't fail while I try to actually use the placement information...
Port to the latest libflo

7befd3c Make a node's position availiable
Sort before performing a computation

While this doesn't actually make a difference, it's going to be
necessary for when I actually take placement into account.
Map to 8x8, not 16x16
Put operations where they've been placed

This gives significantly better results for the mesh network, but not
really any better for the other two networks.  This will have to be
resolved, but not tonight!
Cache better placement for DES

I hacked in some bits of stuff that place DES more correctly for other
sorts of on-chip networks and now we actually get a reasonable speedup
for different networks.