data InitTVar a = TVar [TVar a] sorry Am 04.08.2010 um 10:04 schrieb Frank Kupke:
> 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: > > data initTVar a = TVar [TVar a] > > 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. > > Frank > > Am 03.08.2010 um 21:59 schrieb Alberto G. Corona: > >> That is really nice. >> >> 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 ? >> >> Alberto. >> >> 2010/8/3 Christopher Done <chrisd...@googlemail.com> >> This is very cool, thanks for writing it. I will try it when I get home >> tonight. >> >> On 3 August 2010 10:35, Frank Kupke <f...@informatik.uni-kiel.de> wrote: >> > Hi, >> > >> > DSTM is an implementation of a robust distributed Software Transactional >> > Memory (STM) library for Haskell. Many real-life applications are >> > distributed by nature. Concurrent applications may profit from robustness >> > added by re-implementation as distributed applications. DSTM extends the >> > STM >> > abstraction to distributed systems and presents an implementation efficient >> > enough to be used in soft real-time applications. Further, the implemented >> > library is robust in itself, offering the application developer a high >> > abstraction level to realize robustness, hence, significantly simplifying >> > this, in general, complex task. >> > >> > The DSTM package consists of the DSTM library, a name server application, >> > and three sample distributed programs using the library. Provided are a >> > simple Dining Philosophers, a Chat, and a soft real-time Bomberman game >> > application. Distributed communication is transparent to the application >> > programmer. The application designer uses a very simple name server >> > mechanism to set up the system. The DSTM library includes the management of >> > unavailable process nodes and provides the application with abstract error >> > information thus facilitating the implementation of robust distributed >> > application programs. >> > >> > For usage please look into the documentation file: DSTMManual.pdf. >> > >> > The package including the documentation can be found on: >> > http://hackage.haskell.org/package/DSTM-0.1.1 >> > >> > Best regards, >> > Frank Kupke >> > >> > _______________________________________________ >> > Haskell-Cafe mailing list >> > Haskell-Cafe@haskell.org >> > http://www.haskell.org/mailman/listinfo/haskell-cafe >> > >> > >> _______________________________________________ >> Haskell-Cafe mailing list >> Haskell-Cafe@haskell.org >> http://www.haskell.org/mailman/listinfo/haskell-cafe >> > > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe@haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
