Diálogos en investigación en la Konrad Lorenz 4.1. Implemented functions In this work functions max, min, sorting values and routing tables are implemented. Definition of functions are local and executed as F in the Receive action of each agent. Agents take infi and newi and assign values to out i . Implementing each algorithm is easy because they only imply to change the value (or type) of newi , infi and out i and establish a predicate. Table 1 presents a description of the different functions computed. Declarations of variables of type collection are written as var ∈ type []. Identity of process i ( pi ) is a String ( pi ∈ String ). \ and ∪ are difference and union of collections respectively. In the case of max and min, the algorithm is performed over the data of Integer type, so there is classic calculation of max and min having each process in a network a value. The same case happens with sorting where an Integer value of each process is extracted and added to an Integer collection Integer[] and this collection is sorted. Table 1. Functions F Implemented. Function Max Min Sorting Routing Tables Parameter Definition Input type infi ∈< pi , Integer > [], newi ∈< pi , Integer > [] Predicate aux < pi , Integer > [] = Re cu [ ch ] \ (newi ∪ infi ) out i = max (aux, infi ) Output type out i ∈< pi , Interger > Input type infi ∈< pi , Integer > [], newi ∈< pi , Integer > [] Predicate aux < pi , Integer > [] = Re cu [ ch ] \ (newi ∪ infi ) out i = min (aux, infi ) Output type out i ∈< pi , Integer > Input type infi ∈< pi , Integer > [], newi ∈< pi , Integer > [] Predicate aux < pi , Integer > [] = Recu [ ch ] \ (newi ∪ infi ) out i = sort (aux  infi ) Output type out i ∈< pi , Integer[] > Input type infi ∈< pi , pi > [], newi ∈< pi , pi > [] Predicate aux < pi , pi > [] = Recu [ ch ] \ (newi ∪ infi ) Output Type ( ) out i ⋅ put ch, (out i ⋅ get (ch )  aux ) out i ∈< ch, pi [] > [] 282 Inicio Contenido Salir Volver

Diálogos sobre Investigación: Avances Científicos Konrad Lorenz