Changes between Version 2 and Version 3 of Ticket #1557


Ignore:
Timestamp:
Mar 24, 2008 1:12:57 PM (7 years ago)
Author:
agocorona
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #1557 – Description

    v2 v3  
    11Dynamic optimization of CPU and bandwidth resources in a network of nodes.
    22Components:
    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
    45   2 service/node discovery
     6
    57   3 distribution & syncronization of data: "split", "clone" and "merge" primitives
     8
    69   4 information exchange over "intelligent" channels that memorize bandwith usage and bandwith limits so they can detect bottlenecks.
     10
    711   5 The presentation, processing and data storage exchange of data is made trough these intelligent channels
     12
    813   6 Configurable rules that relocate and/or clone process and storage depending on the CPU and bandwith usage of their channels.
    914
     
    1722Haskell 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.
    1823
    19 Some implementations of distributed haskell define some primitives that fill the functionalities 1 and 2.
     24Some implementations of distributed haskell define some primitives that fill the specifications 1 and 2.
    2025
    2126mHaskell is the most complete and may be a good start (http://www.macs.hw.ac.uk/~dubois/mhaskell/)