Optimal computation of the contour of maximal elements on constrained reconfigurable meshes
The Reconfigurable Mesh (RM) attracted criticism for its key assumption that a message can be broadcast in constant time independent of bus length To account for this limit Beresford-Smith et al. have recently proposed k-constrained RM where buses of length at most k, a constant, are allowed to b formed. Straightforward simulations of optimal RM algorithms on this constrained RM model are found to be non-optimal. This paper presents two optimal algorithms to compute the contour of maximal...[Show more]
|Collections||ANU Research Publications|
|1562-01.2003-07-02T04:36:08Z.xsh||356 B||EPrints MD5 Hash XML|
|TR-CS-98-05.pdf||243.34 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.