L
Título: An Algorithm for Group Formation and Maximal Independent Set in an Amorphous Computer
Autores: Nagpal, Radhika
Coore, Daniel
Fecha: 2004-10-08
2004-10-08
1998-02-01
Publicador:
Fuente: Ver documento
Tipo:
Tema:
Descripción: Amorphous computing is the study of programming ultra-scale computing environments of smart sensors and actuators cite{white-paper}. The individual elements are identical, asynchronous, randomly placed, embedded and communicate locally via wireless broadcast. Aggregating the processors into groups is a useful paradigm for programming an amorphous computer because groups can be used for specialization, increased robustness, and efficient resource allocation. This paper presents a new algorithm, called the clubs algorithm, for efficiently aggregating processors into groups in an amorphous computer, in time proportional to the local density of processors. The clubs algorithm is well-suited to the unique characteristics of an amorphous computer. In addition, the algorithm derives two properties from the physical embedding of the amorphous computer: an upper bound on the number of groups formed and a constant upper bound on the density of groups. The clubs algorithm can also be extended to find the maximal independent set (MIS) and $Delta + 1$ vertex coloring in an amorphous computer in $O(log N)$ rounds, where $N$ is the total number of elements and $Delta$ is the maximum degree.
Idioma: Inglés
Artículos similares:
Description Of Procedures In Automotive Engine Plants por Artzner, Denis,Whitney, Dr. Daniel
Reading Courtesy Amounts on Handwritten Paper Checks por Palacios, Rafael,Wang, Patrick S.P.,Gupta, Amar
On Trees and Logs por Pavlova, Anna,Cass, David
Saturn, The GM/UAW Partnership por Rubinstein, Saul,Kochan, Thomas
Academic Earmarks and the Returns to Lobbying por De Figueiredo, John M.,Silverman, Brian S.
10