A SIMPLE, EFFICIENT ALGORITHM FOR MAXIMUM FINDING ON RINGS
dc.contributor.author | Higham, Lisa | eng |
dc.contributor.author | Przytycka, Teresa | eng |
dc.date.accessioned | 2008-02-27T22:13:52Z | |
dc.date.available | 2008-02-27T22:13:52Z | |
dc.date.computerscience | 1999-05-27 | eng |
dc.date.issued | 1992-12-01 | eng |
dc.description.abstract | The maximum finding problem is: given a network of processors with distinct identifiers, find that processor with the maximum identifier. We present a new deterministic algorithm for maximum finding on asynchronous undirectional rings. To date the maximum finding algorithm with the best message complexity uses at most 1.356\fIn log n + O(n)\fR messages in the worst case. This algorithm is somewhat involved and its analysis is quite complicated. Our algorithm is simple, has a very much simpler analysis and achieves a lower worst case message complexity (less than 1.271\fIn log n + O(n)\fR messages). An additional contribution of this paper is a new perspective on this problem that exhibits its structure thus permitting a better understanding of various message saving mechanisms. | eng |
dc.description.notes | We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca | eng |
dc.identifier.department | 1992-494-32 | eng |
dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30820 | |
dc.identifier.uri | http://hdl.handle.net/1880/45988 | |
dc.language.iso | Eng | eng |
dc.publisher.corporate | University of Calgary | eng |
dc.publisher.faculty | Science | eng |
dc.subject | Computer Science | eng |
dc.title | A SIMPLE, EFFICIENT ALGORITHM FOR MAXIMUM FINDING ON RINGS | eng |
dc.type | unknown | |
thesis.degree.discipline | Computer Science | eng |