<html><head></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space; ">data InitTVar a = TVar [TVar a]<div><br></div><div>sorry<br><div></div></div><div><div>Am 04.08.2010 um 10:04 schrieb Frank Kupke:</div><br class="Apple-interchange-newline"><blockquote type="cite"><div style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space; ">Thanks. In fact, the server lookup is needed only to make initial contact to another node, or better - as the distributed architecture is transparent to the app programmer - to make initial contact to another TVar. This initial TVar would then be able to distribute more TVars. It could be typed something like:<div><br></div><div>data initTVar a = TVar [TVar a]<br><div><br></div><div>Also, once you have made contact (i.e. lookup from name server) to a TVar, you can access it as if it were locally defined. It does not matter if the name server then fails or not. Obviously, a failed name server would not allow to make new contacts. Then your distributed program would need to create redundant name servers and make sure their IP address stays the same or is known to every node.</div><div><br></div><div>Frank</div><div><br><div><div>Am 03.08.2010 um 21:59 schrieb Alberto G. Corona:</div><br class="Apple-interchange-newline"><blockquote type="cite">That is really nice.<div><br></div><div>The architecture seems to be around a single server that bring lookup services, so there is a single point of failure. I´m thinking on cloud computing. Can be extended to have backup servers somehow ?</div>
<div><br></div><div>Alberto.</div><div><br><div class="gmail_quote">2010/8/3 Christopher Done <span dir="ltr"><<a href="mailto:chrisdone@googlemail.com" target="_blank">chrisdone@googlemail.com</a>></span><br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
This is very cool, thanks for writing it. I will try it when I get home tonight.<br>
<div><div></div><div><br>
On 3 August 2010 10:35, Frank Kupke <<a href="mailto:frk@informatik.uni-kiel.de" target="_blank">frk@informatik.uni-kiel.de</a>> wrote:<br>
> Hi,<br>
><br>
> DSTM is an implementation of a robust distributed Software Transactional<br>
> Memory (STM) library for Haskell. Many real-life applications are<br>
> distributed by nature. Concurrent applications may profit from robustness<br>
> added by re-implementation as distributed applications. DSTM extends the STM<br>
> abstraction to distributed systems and presents an implementation efficient<br>
> enough to be used in soft real-time applications. Further, the implemented<br>
> library is robust in itself, offering the application developer a high<br>
> abstraction level to realize robustness, hence, significantly simplifying<br>
> this, in general, complex task.<br>
><br>
> The DSTM package consists of the DSTM library, a name server application,<br>
> and three sample distributed programs using the library. Provided are a<br>
> simple Dining Philosophers, a Chat, and a soft real-time Bomberman game<br>
> application. Distributed communication is transparent to the application<br>
> programmer. The application designer uses a very simple name server<br>
> mechanism to set up the system. The DSTM library includes the management of<br>
> unavailable process nodes and provides the application with abstract error<br>
> information thus facilitating the implementation of robust distributed<br>
> application programs.<br>
><br>
> For usage please look into the documentation file: DSTMManual.pdf.<br>
><br>
> The package including the documentation can be found on:<br>
> <a href="http://hackage.haskell.org/package/DSTM-0.1.1" target="_blank">http://hackage.haskell.org/package/DSTM-0.1.1</a><br>
><br>
> Best regards,<br>
> Frank Kupke<br>
><br>
</div></div><div><div></div><div>> _______________________________________________<br>
> Haskell-Cafe mailing list<br>
> <a href="mailto:Haskell-Cafe@haskell.org" target="_blank">Haskell-Cafe@haskell.org</a><br>
> <a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br>
><br>
><br>
_______________________________________________<br>
Haskell-Cafe mailing list<br>
<a href="mailto:Haskell-Cafe@haskell.org" target="_blank">Haskell-Cafe@haskell.org</a><br>
<a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br>
</div></div></blockquote></div><br></div>
</blockquote></div><br></div></div></div>_______________________________________________<br>Haskell-Cafe mailing list<br><a href="mailto:Haskell-Cafe@haskell.org">Haskell-Cafe@haskell.org</a><br>http://www.haskell.org/mailman/listinfo/haskell-cafe<br></blockquote></div><br></body></html>