Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6669Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Nagpal, Radhika | - |
| dc.creator | Coore, Daniel | - |
| dc.date | 2004-10-08T20:37:02Z | - |
| dc.date | 2004-10-08T20:37:02Z | - |
| dc.date | 1998-02-01 | - |
| dc.date.accessioned | 2013-10-09T02:46:24Z | - |
| dc.date.available | 2013-10-09T02:46:24Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-1626 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6669 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | 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. | - |
| dc.format | 2177371 bytes | - |
| dc.format | 452206 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-1626 | - |
| dc.title | An Algorithm for Group Formation and Maximal Independent Set in an Amorphous Computer | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.