IBM PML Vs Google MapReduce why you need to read
IBM Parallel Machine Learning Toolbox (PML) is similar to that of Google's MapReduce programming model (Dean and Ghemawat, 2004) and the open source Hadoop system,which is to provide Application Programming Interfaces (APIs) that enable programmers who have no prior experience in parallel and distributed systems to nevertheless implement parallel algorithms with relative ease. Google MapReduce Vs IBM PML Like MapReduce and Hadoop, PML supports associative-commutative computations as its primary parallelization mechanism . Unlike MapReduce and Hadoop, PML fundamentally assumes that learning algorithms can be iterative in nature, requiring multiple passes over data. The ability to maintain the state of each worker node between iterations, making it possible, for example, to partition and distribute data structures across workers Efficient distribution of data, including the ability of each worker to read a subset of the data, to sample the data, or to scan the entire data