Changes between Version 1 and Version 2 of Ticket #1557
- Mar 24, 2008 1:10:07 PM (7 years ago)
v1 v2 1 1 Dynamic optimization of CPU and bandwidth resources in a network of nodes. 2 2 Components: 3 1 1st phase: remote install, 2nd phase: Remote eval, remote fork and optionally "moveTo" primitives 3 1 1st phase: remote install, 2nd phase: Remote eval, remote fork and optionally "moveTo" primitives 4 4 2 service/node discovery 5 5 3 distribution & syncronization of data: "split", "clone" and "merge" primitives … … 13 13 - Dymamic relocation of the three tiers in a single node when in stand alone mode, 14 14 - Expansion when available nodes. 15 15 16 16 17 Haskell allow for definitions of type classes with default definitions for complex primitives like, for example, synchronization. At the same time it is flexible enough to define when syncronization scenarios are permitted or not, so that automatic or semiatomatic rules can be applied depending on the nature of the data and the application specification. It is also possible to define clear interfaces for stateless, data storage and stateful processes, the latter one considered as a stateless + a data storage process.