I have again had the pleasure of having an article published by the web site The Platform, this time in two parts. As the article says at the start, this is written as part of my own study as to what the term "In-Memory Computing" was really all about. I hope you enjoy it. The articles can be found here:
I've contended for some time that one of the key concepts missing from Computer Science education are the concepts associated with addressing. In fact, the first language that most new students are taught is Java, a language which goes out of its way to avoid programmers from using an address. So, I've wanted to write something that provides a rapid overview of addressing and I think I've found a readable way of explaining it; IBM's Power CAPI is special because it provides an I/O device to use the same addressing as is used in the typical program. How it does it and how addressing actually works is the purpose of this page called Power CAPI’s Secret is Addressing.
And, once again, on June 22, 2015, I have had the pleasure of having this article published on the web site The Platform. See Addressing Is The Secret Of Power8 CAPI
Being interested in variable memory access latencies - some pretty esoteric stuff, right? - from my work with NUMA-based topologies, I was intrigued when I first read about the Knight's Landing processor with its Near Memory (a.k.a., On-Package Memory). Not much was written on it at the time, so I decided to write - mostly for myself - on what it would need to be given the scraps of real information out there. The paper called Thoughts and Conjecture on Near Memory is the result.
As of April 29, 2015, I am also very proud to announce that this article can also be found as part of the The Platform web site here: http://www.nextplatform.com/2015/04/28/thoughts-and-conjecture-on-knights-landing-near-memory/.
Having volunteered at RCTC's (Rochester Community and Technical College) in their Math Learning Center, and having been allowed to work with both the students and some very skilled volunteers, it began to dawn on me that we had something very special here. We were seeing students who would otherwise be failing or just getting by instead being very successful. It struck me, and then others, that something along these lines might be just the push our education system needed.
So the page linked here - Study Hall - is an argument that we need to start some sort of a process that matches up retired but skilled individuals with the students who need them, no matter the subject, no matter the grade.
I've been intrigued by a relatively new notion called a Burst Buffer. It seems to be used most in discussions relating to HPC (High Performance Computing) and near future really large systems called Exascale. The concept did not seem to difficult and did not seem to be described in clear enough terms. So I thought I'd see whether I might do better. My attempt can be found here: The What and Why of Burst Buffers
And, as of 5/19/2015, I have again had the honor of having an article of mine published on The Platform. You can find this same article here: http://www.nextplatform.com/2015/05/19/the-what-and-why-of-burst-buffers/
I have been volunteering as part of the Rochester CoderDojo project at the YMCA. As part of that, I have had the opportunity to show elementary and middle school students how to program. The beginner subject for that teaches what is essentially the essence of programming via a tool produced by MIT called Scratch. I like to bring in a new example program, something they could potentially do for each class. This time, I produced a valentine. You can find it here.... A Valentine to My Wife. Go check it out.
Use this to find MIT's Scratch tool for your self.
As many of you know, I tend to create picture collages for many of the sets of digital pictures I take. When I do, I print them for my own library of collages and make them available at that time to many of you. It seems that now I have nearly 170 of such collages residing on my own computer (which is backed up). As a further back up, I thought I'd keep copies of them on my web server, and, having done so, make them available via the web to you folks as well.
So, you can find sets of 8 larger thumbnails of them at this site.... http://mrfunk.info/Collages/Collage.html . From here you can page through these sets of thumbnails and then see large versions by clicking on thumbnail of your choosing.
You can find a screen show of wedding pictures here: http://mrfunk.info/Wedding/Wedding.html