gsoc

Hello Everybody!

My name is Andrej Spielmann and I am the GSoC student who will be implementing anti-aliasing based on LCD sub-pixels to Haiku’s graphics engine (App server, Painter, etc.).
Stephan Assmus is going to be my mentor on this project and Oliver Ruiz Dorantes seems to be my backup mentor and an eager investigator to the Slovak language and cuisine :-)

A short introduction of myself: I was born in Slovakia (Bratislava) and I still live there during vacations. During high school I have spent two years in Germany so I can speak German quite fine (Normally I would say very good but there are many Germans around :-). Now I’m studying at the University of Oxford (UK) at a 4-year undergraduate course in Mathematics & Computer Science. After I finish, I would like to go for a PhD somewhere else in Europe (Norway, Switzerland??) or in the USA. I very much like traveling, tourism, hiking and cooking. I’m most probably going to use a part of the GSoC money for a long trip around Russia including a part of the Trans-Siberian Railway.

I have no prior experience with coding for Haiku but I admire it a lot and will be very pleased to get involved with the community. Right now, I’m a little busy preparing for my exams, which take place between 2nd and 19th of June (but quite sparsely distributed, so there should be time for GSoC).
I am planning to start working on my project by the end of the next week, hopefully a couple of days before the official starting date to compensate for the time during exams when I won’t be able to fully concentrate on GSoC.

I will be coding on a Mac. I have set up all the compilation tools natively and now I’m able to build a hard disk image that runs in Parallels Desktop. If this turns out to be too slow or obstructing I will be considering other alternatives.
Right now the first big challenge for me will be to understand and get familiar with the existing Haiku code that I will be modifying. I will keep you updated on how it is going.

Bye,
Andrej

Contact:
ICQ: 161748133
Skype: andrejspielmann
e-mail: andrej.spielmann@seh.ox.ac.uk

Hello, Everybody!
I'm Dustin, the student in the 2008 Summer of Code who is going to implement support for system timers other than the TSC in Haiku.

I've been actively tracking (and trying to involve myself in) Haiku's development for a few months now, but have been passively watching it since Be, Inc. went under and OpenBeOS sprang to life. In that time, I've gained a basic understanding of the Be/Haiku API, and of limited parts of the Haiku kernel.

Couple growing kernel knowledge with studying standards documents such as that for the HPET, and I believe I can finish this, or get a very appreciable start on it, over the summer, and plan to stick around long afterwards.

I can be found in #haiku on Freenode, my nickname is DHowett.

Thanks very much,
Dustin Howett

Hi everyone!
I am the GSoc student to implement the swap file support.

Haven't been here for a long time since I spent a week prepareing for the school's exam. The annoying exam ended yesterday, and now I have time to make some preparations for this summer.

I have got a basic unstanding of the Haiku vm system during the application period. In the next few days, I will investigate how paging is implemented in Linux and FreeBSD (I've stated doing that but was interrupted by the exam)and continue to work on my haiku vm tutorial. :-)

Bye,
Zhao Shuai

In this post, I'll do my presentation, and will talk you about my GSoC project, "Writing a CIFS client"

During this summer I was working under my mentor Jerome Duval's guidance. This is the first time I tried to be part of the GSOC program.

Even though I had some private issues this week, all is going well with the PackageInstall. In its current form it is able to properly install all 3 test BeOS packages I tried on it, creating files and directories along with their data and attributes without flaw. So, what's left to do right now?

(Or: knitting a delicate fabric, part II: sewing it all together)
(Or: Right, Joker, the underwear might be on the outside, but I get to drive the Batmobile!)
(Or: I just had to say something about Batman and the Batmobile. Couldn't help it.)

Cool, now we have a space- and time-efficient data structure (which is nothing more than a nice structure to handle non-overlapping numeric ranges) we can use to implement the simplified stride scheduling thing I've been discussing ou the previous posts, which will remain small most of the time, and won't change its shape like mad, so it's also very gentle on the CPU cache. Not only that, but the same effects hold for any trees, shall we decide that red-black trees aren't adequate and set ourselves to use splay trees, AA trees, AVL trees, Huffman trees, unbalanced binary trees (please: no.), whatever. So far we took care of the (not any more) skewed proportions due to randomness (by using strides), the mapping of "tickets" to tasks (by using trees to store the queues, "indexes" as the tickets, offsets to simulate "special" tickets, and lazy evaluation to efficiently implement offset propagation to upper queues), and the order of complexity (by using the queues as the node elements of the tree, where the key is base priority times number of threads in that queue).