At the Linux Conference in Australia, Google has announced that Summer of Code 2011 will be taking place for its seventh year.
http://google-opensource.blogspot.com/2011/01/google-summer-of-code-announced-at-lca.html For the last three Summers OpenAFS has been accepted as a mentoring organization. http://www.openafs.org/gsoc.html Google Summer of Code benefits OpenAFS both by producing code for the project but more importantly by introducing students to the joys of developing open source and in particular, OpenAFS. There are many more organizations that wish to be accepted to Summer of Code than there are organizational slots. A strong application is backed by a deep pool of mentors and project ideas for the students to work on. The deadline for applying to GSoC 2011 is 11 March 2011. As those that have mentored in the past can attest, mentoring is a significant time commitment starting during the student application period the week of 28 March 2011 and ending on 26 August 2010 if you are lucky enough to end up with a student. A mentor should expect to spend ten to fifteen hours a week working with her/his student and the other accepted students. Projects should be challenging enough to peak the students interest but not so large that they cannot be accomplished by a mentored student during the coding period 23 May to 22 August. While it is not required that prospective students have prior experience using OpenAFS, it certainly would not hurt. If you work at a college or university that deploys OpenAFS, take a trip over to the local Computer Science department and ask faculty members to discuss Google Summer of Code with their classes and participation with OpenAFS in particular. Both undergraduate and graduate students are eligible to participate. Accepted students will receive a stipend of 5500 USD for successfully completing the program. If you are interested in mentoring a student or have a project idea, please send e-mail to [email protected]. Jeffrey Altman
signature.asc
Description: OpenPGP digital signature
