Hi, >If some one wants to hear more about Wireshark, I can do that after >the 22-may-2008)
Thanks ,this will be great ! I am all for it ! DS On Wed, Apr 30, 2008 at 12:06 PM, Nir Abulaffio <[EMAIL PROTECTED]> wrote: > Thanks for the offer, I am in. > Please not in the period 11-22/may/2008 as I'll be in mil. > > (If some one wants to hear more about Wireshark, I can do that after the > 22-may-2008) > Nir. > > > On Tue, 29 Apr 2008, Shachar Shemesh wrote: > > Hai Zaar wrote: > > Yeah, great topic! > > It will be great if this issue will be covered as well: > > http://www.airs.com/blog/archives/79 > > > First, I've only read this through twice, and so have not, yet, > understood what the compiler is doing to this code. As such, I don't > feel qualified to comment. > > The other aspect is that the lecture is more algorithmic than > implementation. I'm trying to answer the "how do you structure your > program so that algorithmic complexity doesn't kill you of an heart > attackbefore you are 30". Just as the article points out, a simple > > > memory barrier here would solve the problem, so this is obviously an > implementation question. > > > I'll try to point out some of these problems, but that won't be the focus. > > Shachar > _______________________________________________ > Haifux mailing list > Haifux@haifux.org > http://hamakor.org.il/cgi-bin/mailman/listinfo/haifux > _______________________________________________ > Haifux mailing list > Haifux@haifux.org > http://hamakor.org.il/cgi-bin/mailman/listinfo/haifux > _______________________________________________ Haifux mailing list Haifux@haifux.org http://hamakor.org.il/cgi-bin/mailman/listinfo/haifux