|
|
Why have I been quiet for a while? Well most of my entries related to sensor networks are now posted on WSNblog.com instead. WSNBlog.com recently got featured on M2M magazine (although they got some information wrong about us). Some comments on this issue of the M2M magazine:
|
I am a PhD student at Princeton University. I study Computer Science and am interested in Networks and Systems.
Computer History Museum has this talk by Eric Brewer (UC Berkeley) where he goes over the rise and fall of Inktomi. I highly recommend watching this talk for folks interested in the history of the Internet, case studies of startup companies, insight into the Internet bubble, or technology research in general.
Inktomi was founded in 1996, by Eric and a Berkeley grad student, and went onto the Nasdaq 100 before it was bought by Yahoo! in March 2003. Yahoo search and MSN search are still powered by the Inktomi engine. At one point, Eric actually got a little emotional while talking about Intkomi and I can clearly relate to why.
At the end, he talks about the time when his 10% shares in Inktomi were worth a billion USD and he got interested in doing something for the "third world countries". Eric (along with Umar Saif) is the program co-chair of the NSDR workshop that I am organizing. NSDR'07 is specifically aimed at bringing the benefits of networking technologies to the third world.
Below is the GoogleVideo embedded video of the talk:
Inktomi was founded in 1996, by Eric and a Berkeley grad student, and went onto the Nasdaq 100 before it was bought by Yahoo! in March 2003. Yahoo search and MSN search are still powered by the Inktomi engine. At one point, Eric actually got a little emotional while talking about Intkomi and I can clearly relate to why.
At the end, he talks about the time when his 10% shares in Inktomi were worth a billion USD and he got interested in doing something for the "third world countries". Eric (along with Umar Saif) is the program co-chair of the NSDR workshop that I am organizing. NSDR'07 is specifically aimed at bringing the benefits of networking technologies to the third world.
Below is the GoogleVideo embedded video of the talk:
Joe Polastre, CTO of Moteiv (one of the co-authors of our recent MAC editorial) recently got featured on Discovery Channel and Science Channel. Below is a YouTube embedded video of the Discovery Channel broadcast. The story was later picked up by CNN as well.
| I was a visiting researcher at SICS (Sweden) last fall where I had an amazing time working with Thiemo Voigt and Adam Dunkels. Adam's work on Protothreads recently got accepted at ACM SenSys 2006 and I am listed as a co-author on the paper. SenSys is the premier conference in sensor networks. Much like what SIGCOMM is for networking folks. |
|
Protothreads are extremely lightweight stackless threads designed for severely memory constrained systems. One way to think about Protothreads is that they are a proof-of-concept of the 1979 Roger Needham "duality" argument. They are "something in-between" threads and event-driven programming. Maintaining state-machines makes event driven programming hard, but threads take too much memory to make them feasible on memory-constrained systems (e.g. sensor networks). Protothreads reduce/eliminate the need for maintaining explicit state-machines while keeping the memory overhead very low. Protothreads, unlike traditional threads, are stack-less and their memory overhead is very small (only two bytes per protothread).
For more details, read the Protothreads SenSys'06 paper. Also, you can download and use the Protothreads library.
Protothreads are already gaining popularity (checkout the Google hits). Here are a few interesting links:
|
I found out about Erdős Numbers from my alma mater faculty Arif Zaman, who has done some early work on random number generation. After seeing the list of famous paths to Erdős numbers I got curious about my own Erdős number (if it was not infinite). Let me explain Erdős numbers a little;
|
The online collaborative distance search page was not so useful in calculating my Erdős number primarily because I am not a Mathematician or a Theoretical Computer Scientist. So I had to manually calculate my Erdős paths and find the limit on the Erdős number (I had to find manual paths to someone recognized by the Erdős project database and reduce the overall path length as much as possible). Here are some paths I found (listing only one example path for each Erdős number):
- Erdős 7 Path: Muneeb Ali ------ Joseph Polastre ------ David Culler [Culler, David E. is recognized as Erdős 5]
- Erdős 6 Path: Muneeb Ali ------ Koen Langendoen ------ Frans Kaashoek [Kaashoek, M. Frans is recognized as Erdős 4]
- Erdős 5 Path: Muneeb Ali ------ Kay Römer ------ Friedemann Mattern [Mattern, Friedemann is recognized as Erdős 3]