Highly Distributable Associative Memory Based Computational Framework for Parallel Data Processing in Cloud

One of the main challenges for large-scale computer clouds dealing with massive real-time data is in coping with the rate at which unprocessed data is being accumulated. In this regard, associative memory concepts open a new pathway for accessing data in a highly distributed environment that will facilitate a parallel-distributed computational model to automatically adapt to the dynamic data environment for optimized performance. With this in mind, this paper targets a new type of data processing approach that will efficiently partition and distribute data for clouds, providing a parallel data access scheme that enables data storage and retrieval by association where data records are treated as patterns; hence, finding overarching relationships among distributed data sets becomes easier for a variety of pattern recognition and data-mining applications. The ability to partition data optimally and automatically will allow elastic scaling of system resources and remove one of the main obstacles in provisioning data centric software-as-a-service in clouds.

[1]  Asad I. Khan,et al.  A peer-to-peer associative memory network for intelligent information systems , 2002 .

[2]  Anang Hudaya Muhamad Amin,et al.  One Shot Associative Memory Method for Distorted Pattern Recognition , 2007, Australian Conference on Artificial Intelligence.

[3]  Ralph Johnson,et al.  design patterns elements of reusable object oriented software , 2019 .

[4]  K. Ohkuma A hierarchical associative memory consisting of multi-layer associative modules , 1993, Proceedings of 1993 International Conference on Neural Networks (IJCNN-93-Nagoya, Japan).

[5]  Yuan Yu,et al.  Dryad: distributed data-parallel programs from sequential building blocks , 2007, EuroSys '07.

[6]  Asad I. Khan,et al.  A Hierarchical Graph Neuron Scheme for Real-Time Pattern Recognition , 2008, IEEE Transactions on Neural Networks.

[7]  David Gelernter,et al.  Generative communication in Linda , 1985, TOPL.

[8]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[9]  Zubair A. Baig,et al.  A Pattern Recognition Scheme for Distributed Denial of Service (DDoS) Attacks in Wireless Sensor Networks , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[10]  Asad I. Khan,et al.  Energy‐Efficient Pattern Recognition for Wireless Sensor Networks , 2010 .

[11]  Kristof Van Laerhoven,et al.  Self-organization in ad hoc sensor networks: an empirical study , 2002 .

[12]  Jamie Shiers,et al.  Grid today, clouds on the horizon , 2009, Comput. Phys. Commun..

[13]  Anang Hudaya Muhamad Amin,et al.  Integrating sensory data within a structural analysis grid , 2009 .

[14]  Jingren Zhou,et al.  SCOPE: easy and efficient parallel processing of massive data sets , 2008, Proc. VLDB Endow..

[15]  Anang Hudaya Muhamad Amin,et al.  Commodity-Grid Based Distributed Pattern Recognition Framework , 2008, AusGrid.