Come summer though, I’ll probably do something. I keep planning a lot of things to do, but never do them (story of my life). [March 14, 2010]

Sure, like that really happened. Wishful thinking as always. [Insert meta-ing about meta posts here.]

It is now July, and I haven’t done much aside from my fourth co-op term (done this item Sept. 3rd) and the Math Orientation website. John and I visited each other a lot, and I went to his cottage last weekend. He is there now, while I am studying for STAT231 (BS231) — lucky him! I also took another Japanese course this term, and already had the exam. Two courses and co-op — never again.

I remember back in high school, the summers I would just waste away doing nothing. I think all I did was develop random useless scripts on the computer and play RO. I used to stay up until 5-6am, go to bed, and then wake up in the early evening to resume what I was doing before. What a waste! This summer, I am working full-time, on the computer doing side projects/websites, and playing RO again. That is mostly just the weekdays, too. Weekends usually have consisted of John coming down (from Toronto) or me going up via Greyhound. There (or here) we spend our time lying around doing nothing at all.

Such contrast from the high school summers.

It’s a bit depressing that I will never have a high school summer again, as I will never have a summer where I won’t be in school still or working full-time. The only time I can imagine having a ‘free’ summer like that is when I am very pregnant/having small children. That won’t be for a long while though :)

Awesomely enough, my summer has also been filled with Pokemon. I think I have also progressed from a fan to avid fan.

From the beginning of the Orientation week planning, I suggest Pokemon because it’s awesome — it made it to being the theme. I am the webmaster for the website, so lots of Pokemon for me there. Designing/developing that hackery was/is fun. Check out the glory. A lot of the hours spent aren’t even visible to the user, sadly. The secret special FOC pages are what I spent most of the time on. There the four FOC can view/edit the applicants’/leaders’ information. Not exactly difficult with PHP/MySQL, but it takes more time for error handling/data checking when not just writing things for myself. A couple forms and things from the main website that the leaders/applicants used also took some time as well. Frankly I’m surprised no one from the CSC or elsewhere has attempted to break/hijack the entire thing. Everyone has generally been nice — only a few spams and stupid things.

In addition to that, I just bought Pokemon SoulSilver. I previously… acquired… the ROM image from the vastness of the Internet and placed it on my… piece of DRAM that magically allows games to be played on the DS… but the game kept freezing and once erased my save file. After 5+ times of restarting the game, I just decided to buy the thing. First time I bought a DS game. I was so excited to learn that it came with a little pedometer thing — the PokeWalker. Sounds really lame, but you can put a Pokemon from the DS game ‘on’ it, and take it for a ‘walk’. I thought it was just steps => EXP, but you can apparently play little item/Pokemon games on it. It has a little concept of currency which you can trade for the ability to play a little game to get an item, or play a little game to find a Pokemon and fight/capture it. It reminds me of those old Nanos and Tamagotchis. I’m pretty impressed, I must say.
The graphics of the DS game are super hot, too. :D

It was a good assignment, but I think the system calls one (A2) was better. A2 was also easier to split up amongst a group of people. For A3, we needed to implement the physical memory manager, on demand page loading, and TLB replacement algorithms.

One of my major parts was the TLB replacement and it was pretty interesting. Since our TLB is a software-based one, you could modify your TLB to do whatever you wanted. I could have emulated ‘use bits’ or kept a reference count of some sort. However, something I made sure to keep in mind the whole time was that a TLB is supposed to be fast. This is the purpose of the TLB. So if the replacement algorithm takes a long time to decide or uses more TLB writes to store reference counts or whatever, it’s approaching the point of not being worth it. Instead I chose to just do a bunch of TLB reads to decide which entry to evict. I played on the fact that code/data is usually loaded sequentially in memory. I basically chose a random pivot entry, and compared the ‘distance’ in virtual memory between the pivot and the other entries. As the number of sequential pages increases in the TLB, I’ll also have a higher chance of choosing a pivot that has a lot of ‘close’ entries around it already. I then pick the entry ‘furthest’ away for eviction.

At the time this made sense to me, and even now it does, but I still get the feeling someone will be like “this is stupid because ___” and I’ll go “damn…” and cry on the inside. There are obviously better things out there, but this is already a slow software TLB so making it slower sucks.

Now I can resurface, resume my life, and do my last assignment. Then I start studying for finals.

It’s Easter today as well — I have a chocolate bunny to eat :D

School clearly keeps getting more challenging each time, and unfortunately I’m not nearly motivated enough to go meet it. This term, however, my operating system’s course is the only thing I’m really interested in (even Japanese is losing my interest). It’s so fun. We just had our ‘implement system calls’ assignment, and it was awesome. A really small subset of system calls, but fun anyways. We have groups for it too, and I’m with my roommate and her boyfriend (and friend of mine). Super fun. (and I’m a huge nerd.)

Today I discovered something cool while visiting some websites I hadn’t for a while (whilst procrastinating on homework of course). I know CSS2 and even CSS3 has been around for a while, but I’m really behind on that stuff too.

With the example below, things like sIFR are going to die for sure (and probably already have):

@font-face {
  font-family: "FONT";
  src: url(FONT.ttf) format("TYPE");
}
h1 { font-family: "FONT", sans-serif }

This basically will load the font specified onto your viewers’ computer, then replace the font as required in the load[ing/ed] page. With Chrome, this seems to be extremely flawless and happens in an instant. When I visited the person’s page, I thought the text was an image. However, a quick test of highlighting it told me it was not. Then I looked at the source, and saw this.

Firefox, on the other hand, took about half a second for it to replace the text. Not a problem, but people will notice. Especially if you user is downloading something else, or the font is just a big file, it will take a second or so to load. This is a lot of time for a user while viewing a website.

More information about this process here (alistapart.com)

So that’s pretty exciting, and motivates me a little bit to make a new design for my blog (which I barely update anyways). I guess I could bore anyone who comes here and talk about operating systems though, because I love to talk about it. :D

Also: Happy March. School ends so soon.. what a quick term D:

What is UML, graphviz, dot?

UML stands for Unified Modelling language. A picture/diagram is used to represent a ’system’, by which I mean a program in this case. Wikipedia says “UML includes a set of graphical notation techniques to create visual models of software-intensive systems.”

Graphviz is a free set of software that allows you to describe graphs in various ways. Dot is a language – nothing more – that represents a graph. The graphviz software takes a description of a graph written in dot, and give you your image in various formats.

Dot is a simple language, and uses intuitive labels and values for things like edges and nodes. The hardest part is thinking of what you need, and finding the correct spelling of the attributes to apply to your node/edge. (But that can be found on the documentation site – and google).

To make any graphs, you need: graphiz (there are windows binaries, and packages in popular linux distributions). Dot is a tool included with graphviz. You also need a text editor. There are GUIs for making graphs (and OSes like OSX have larger programs that use graphviz) but I’m going to be on the command line in Ubuntu.

First graph

There are a couple types of graphs (that I’ve seen so far and used) and they are directed graphs and undirected graphs. Directed means that there are arrows and form a direct relationship between nodes, and undirected means there are no arrows between the nodes, and the path from one node to another is bidirectional.

So let’s make a graph now. The hello world of graphs:

digraph G {
    node [ shape="box" ]
    edge [ arrowhead="dot" ]

    Hello [ label="Hello" ]
    World [ label="World", color="blue" ]

    Hello -> World
}

On the command line, I ran this command:

$ dot -Tpng -o helloworld.png helloworld.dot

-T specifies a type for the output to take. I chose a PNG image. Other types include, but not limited to, PDF, PS, BMP, GIF, JPEG… the list goes on. The -o allows me to specify an explicit output file. Last on the line is the input file – my description of the graph.

and this makes:

As you may have noticed, I didn’t say anything about where things were placed, or whether Hello is below World or not. The point of this graphing software is to that stuff for you. It magically figures out (via fancy algorithms) where to put things to occupy the space in the most efficient manner, without having things overlap or look ugly.

The line-by-line:
digraph G says you’re going to make a new digraph (short for directed graph) called G. node and edge here are describing all the edges and nodes for this graph. Hello and World are nodes. They have attributes: label, and for World, color. By default, text is black, nodes are white. I’ve changed the shape colour of World to blue. I could have set other things like background colours, text colours, and probably shape outlines. The label goes inside the node. One of the most important lines, Hello -> World, describes the relationship between Hello and World. The edgeop here tells us that Hello points to World. Since I chose “dot” for my edge above, I get a line with a circle at the end. Without relationships, directed graphs are pretty pointless.

Play around with all the options and you can make some pretty cool graphs. I made a digraph to model my course plan for university a while ago located here. Each node is a course, and the relationships define prerequisites. I coloured a bunch of nodes the same colours, and those represent the terms I will do those courses in. Other examples of digraphs include things like family trees, maps, fancy to-do lists, graph theory stuff, visualisations of various data structures.

UML and this digraph stuff

So for my last CS246 project, we need to make a UML diagram to fit on an 8.5×11 sheet of paper. We’re handing it in electronically, so it must be done on the computer at some point. I really didn’t feel like writing it on paper, then opening up gimp/paint to draw boxes and lines for 3hrs. I’ve used dot before, so I know it’s much easier to open a text editor and write the descriptions of these graphs. It’s very easy to modify, then just compile in less than a second.

There are 7 classes, and 2 subclasses for this project design. So I need 9 boxes to draw the classes, then shove arrows between them in a way that describes how the classes interact with each other. UML’s boxed are sectioned into at least 2 sections. So far I’ve only done one shape – the box. Most of the other shapes graphviz offers look to be like only one label. How do I fit so much stuff into a node?

There is a special shape called a ‘record’. It allows for a special definition of a label that makes sections out of your node. The sections are formed when a pipe (|) character is seen in the label. Read more about the record shape.

digraph C {
    SomeClass [
        shape="record"
        label="{SomeClass|some attributes\l|some operations/methods\l}"
    ]
}

The description looks messy for that, but the important point here is that the pipes separate the label into sections. The \l in there means: make a new line, and align to the left.

With record, I can make my classes now, and then join them like a normal digraph. I’ll make a sample, more interesting system to model instead of the one I’m doing for my project.

Sample Model – Pokemon

Pokemon is cool. Let’s use pokemon for an example. I’ll model an example party of pokemon and a trainer. The key thing to look for here is common methods (attacks) between pokemon, and the connection between me (the trainer). You will see the basics UML and a simple system model in this example.

digraph Party {
    node [ shape="record" ]
    // I want the default arrowhead, so I won't set any
    // global (until changed later) edge descriptions

    Trainer [
        // You can use string concatenation to split strings into smaller chunks
        label="{Trainer|- name : String\l- money : Integer\l|" +
                 "- party : String[1..*]\l" +
                 "+ callPokemon( pokemon : Pokemon ) : bool\l" +
                 "+ returnPokemon ( pokemon : Pokemon ) : void\l}"
     ]

    Pokemon [
        label="{Pokemon|- name : String\l- health : Integer\l|" +
                 "+ tackle : Attack\l}"
        color="orange"
    ]

    Charmander [
        label="{Charmander|\l|+ ember : Attack\l}"
        color="red"
    ]

    Vaporeon [
        label="{Vaporeon|\l|+ surf : Attack\l}"
        color="blue"
    ]

    // Finally, the relationships
    // Vaporeon is a Pokemon
    Vaporeon -> Pokemon [ arrowhead="empty" ]

    // So is Charmander
    Charmander -> Pokemon [ arrowhead="empty" ]

    // Trainer can have up to 6 pokemon
    // Each pokemon is caught by only one trainer
    Trainer -> Pokemon [
        label="caught"
        headlabel="1..6"
        taillabel="1"
        arrowhead="none"
    ]
}

Once again:

dot -Tpng -o pokemon.png pokemon.dot

Okay, so that took a long time. I should have been working on something else (see sidenote). It looks like a lot of stuff up there in order to describe an image you could have drawn faster, but for much larger diagrams, this is faster (you can write programs to write dot code for you). The product of all this is:

As for explaining things, I will assume you now have some knowledge of UML from the wikipedia page, and understand what the arrows and lines mean as well as the basic attribute types.

The most important segment of the description above is:

    Trainer -> Pokemon [
        label="caught"
        headlabel="1..6"
        taillabel="1"
        arrowhead="none"
    ]

This tells us about the relationship between the Trainer and the multiple pokemon – called ‘caught’. Since a party of pokemon can contain from 1 to 6 pokemon (1 to 6 caught pokemon), I’ve set my label to be 1..6 at the pokemon point. Each pokemon can only be caught by only one trainer, so taillabel is 1. These are called ‘restrictions’ in the model. They give the viewer some more detail about how your system/program works. If I had put headlabel=”*” that would mean that a Trainer could catch 0 or more pokemon (all 150+!).

Charmander -> Pokemon [ arrowhead="empty" ]
Vaporeon -> Pokemon [ arrowhead="empty" ]

These two lines mean that the subclasses of Pokemon – Charmander and Vaporeon – are represented as a parent/child relationship. Pokemon contains common operations (attacks) and attributes (name, health). In a program, Vaporeon and Charmander would inherit from the Pokemon base class.

Conclusion

Pokemon is awesome. The record shape makes UML possible in dot.

It’s 6am now and I didn’t sleep yet for one, and I should have been writing the test documentation and finishing the UML diagram for the project. Instead, I thought I’d make this tutorial. I’ve also eaten a lot of carrots in this time.

Idea: turn this into a mathNEWS article!!11!