Show simple item record

An Algorithm for Group Formation and Maximal Independent Set in an Amorphous Computer

dc.date.accessioned2004-10-08T20:37:02Z
dc.date.accessioned2018-11-24T10:21:27Z
dc.date.available2004-10-08T20:37:02Z
dc.date.available2018-11-24T10:21:27Z
dc.date.issued1998-02-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6669
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6669
dc.description.abstractAmorphous 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.en_US
dc.format.extent2177371 bytes
dc.format.extent452206 bytes
dc.language.isoen_US
dc.titleAn Algorithm for Group Formation and Maximal Independent Set in an Amorphous Computeren_US


Files in this item

FilesSizeFormatView
AIM-1626.pdf452.2Kbapplication/pdfView/Open
AIM-1626.ps2.177Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record