Parallel Computing Technologies

Contextual information plays an increasingly crucial role in concurrent applications in the times of mobility and pervasiveness of computing. Context-Oriented Programming languages explicitly treat this kind of information. They provide primitive constructs to adapt the behaviour of a program, depending on the evolution of its operational environment, which is affected by other programs hosted therein independently and unpredictably. We discuss these issues and the challenges they pose, reporting on our recent work on MLCoDa, a language specifically designed for adaptation and equipped with a clear formal semantics and analysis tools. We will show how applications and context interactions can be better specified, analysed and controlled, with the help of some experiments done with a preliminary implementation of MLCoDa.

[1]  Stephen Wolfram,et al.  Universality and complexity in cellular automata , 1983 .

[2]  Yaroslav D. Sergeyev,et al.  Numerical point of view on Calculus for functions assuming finite, infinite, and infinitesimal values over finite, infinite, and infinitesimal domains , 2009, 1203.4140.

[3]  Yaroslav D. Sergeyev,et al.  Numerical Computations with Infinite and Infinitesimal Numbers: Theory and Applications , 2013 .

[4]  Georgios Ch. Sirakoulis,et al.  A Computational Intelligent Oxidation Process Model and Its VLSI Implementation , 2009, CSC.

[5]  Rocco Rongo,et al.  A New Algorithm for Simulating Wildfire Spread through Cellular Automata , 2011, TOMC.

[6]  Maurice Margenstern,et al.  An application of Grossone to the study of a family of tilings of the hyperbolic plane , 2011, Appl. Math. Comput..

[7]  Stephen Wolfram,et al.  A New Kind of Science , 2003, Artificial Life.

[8]  Giuseppe A. Trunfio.  Predicting Wildfire Spreading Through a Hexagonal Cellular Automata Model , 2004, ACRI.

[9]  Yaroslav Sergeev,et al.  Measuring fractals by infinite and infinitesimal numbers , 2008 .

[10]  Alfredo Garro,et al.  Single-tape and multi-tape Turing machines through the lens of the Grossone methodology , 2013, The Journal of Supercomputing.

[11]  S. Wolfram.  Statistical mechanics of cellular automata , 1983 .

[12]  S. K. Godunov,et al.  Theory of difference schemes : an introduction , 1964 .

[13]  Alfredo Garro,et al.  Observability of Turing Machines: A Refinement of the Theory of Computation , 2010, Informatica.

[14]  Genaro Juárez Martínez.  A Note on Elementary Cellular Automata Classification , 2013, J. Cell. Autom..

[15]  Gabriele Lolli,et al.  Infinitesimals and infinites in the history of mathematics: A brief survey , 2012, Appl. Math. Comput..

[16]  Yaroslav D. Sergeyev,et al.  A New Applied Approach for Executing Computations with Infinite and Infinitesimal Quantities , 2008, Informatica.

[17]  Maurice Margenstern.  Using grossone to count the number of elements of infinite sets and the connection with bijections , 2011, ArXiv.

[18]  Lawrence Narici,et al.  Functional Analysis and Valuation Theory , 1966 .

[19]  A. I. Sukhinov,et al.  Adaptive modified alternating triangular iterative method for solving grid equations with a non-self-adjoint operator , 2012 .

[20]  Yaroslav D. Sergeyev,et al.  Interpretation of percolation in terms of infinity computations , 2012, Appl. Math. Comput..