This is about starting to use functional programming paradigms that get used more and more? It is mainly about rewriting a small test program (repclean) in a functional style, using immutablity, parallelism and async techniques.

Linux From Scratch (LFS) is a project that provides you with step-by-step instructions for building your own customized Linux system entirely from source. Build the customized linux step-by-step is good way to understand linux system deeply. (Include cross compile TEC which I have interest )

Spacewalk is the upstream project of SUSE Manager. Currently Spacewalk runs on RHEL, CentOS and Fedora, while SUSE Manager runs on SLES.

VOVO is a server-client architecture to determine current abuild load on devel-network machines. The goal is to trigger machines on and off depending on build power. It is an attempt to reduce power consumption. Current status:

Make a final attempt to implement a graphical user interface for grub2 (gfxboot2).

It's quite some work, unfortunately. Here's what's done so far:

CoreOS is a new Linux distribution that has been rearchitected to provide features needed to run modern infrastructure stacks. CoreOS is popular on most cloud providers (EC2, Rackspace, GCE), virtualization platforms (Vagrant, VMware, OpenStack, QEMU/KVM) and bare metal servers (PXE, iPXE, ISO, Installer). Play with CoreOS during hackweek and see how and why it works well for HA.

Storing the devices in libstorage as a graph looks like a natural approach. The boost graph library (BGL) could be used here instead of the selfmade iterator over iterator (not a graph) concept currently used. Together with a redesign of the current objects several features would be simple, e.g. using disks for filesystems, renaming LVM volume groups and logical volumes, switching to and from partitioned MD RAID.

It is well-known that two git commits within a single repo can be independent from each other, by changing separate files to each other, or changing separate parts of the same file(s). Conversely when a commit changes a line, it is "dependent" on not only the commit which last changed that line, but also any commits which were responsible for providing the surrounding lines of context, because without those previous versions of the line and its context, the commit's diff would not cleanly apply. As with most dependency relationships, these form a directed acyclic graph. Sometimes it is useful to understand the nature of parts of this graph; for example when porting a commit "A" between git branches via git cherry-pick, it can be useful to programmatically determine in advance the minimum number of other dependent commits which would also need to be cherry-picked to provide the context for commit "A" to cleanly apply.

Using traditional hardware development tools, apply a Non-uniform Choppy Transformation to a block of ligneous substance. The end result should be a 3D rendering of the Geeko glyph.