Static Deadlock Prevention in Dynamically Configured Communication Networks

[Klaus D. Witzel]

Hi folks,

long time no see :)

Did you notice the very interesting papers,

-
http://www.google.com/search?q=prevention+deadlock+dynamically+site:research.microsoft.com

the .ppt as well as the .pdf documents on the $MS$ research site.

Nice trick with forking & passing of communication endpoints (atomic)
between processes/threads; plus soundness proof of deadlock-freeness ;)

And (of course) in light of their Singularity OS.

Enjoy!

Cheers,
Klaus

[Igor Stasenko]

2008/10/15 Klaus D. Witzel <klaus....@cobss.com>:

>
> Hi folks,
>
> long time no see :)
>

Yeah.. I'm currently reimplementing a parser/scanner. I took a
squeak's parser as a base, but added tokens as objects, which makes
them easier to operate with, like:

token next -- get next token. After initializing scanner, you can
forget about it, since all you need is tokens :)
token prev -- you always can look back , because they linked together
in a chain.
token isBinary / isKeyword etc -- different helper methods which
helping to make code less complex and more readable.
token start / end -- automatically tracking position in source code

Thanks for the link :)

> Cheers,
> Klaus
>
> >
>

--
Best regards,
Igor Stasenko AKA sig.