Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/27927
DC FieldValueLanguage
dc.contributor.authorCao, Cen_US
dc.contributor.authorCao, Jen_US
dc.contributor.authorMa, Xen_US
dc.contributor.authorLu, Jen_US
dc.date.accessioned2014-12-19T04:18:48Z-
dc.date.available2014-12-19T04:18:48Z-
dc.date.issued2007-
dc.identifier.citationLecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2007, v. 4742 LNCS, p. 56-67en_US
dc.identifier.isbn3540747419-
dc.identifier.isbn9783540747413-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10397/27927-
dc.description5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007, Niagara Falls, 29-31 August 2007en_US
dc.description.abstractThe mobile agent (MA) technology has been widely applied in distributed applications. However, since mobile agents are highly autonomous, coordinating the their behaviours is hard. We concentrate on the mutual exclusion issue in this paper and propose an algorithm for achieving mutex among mobile agents. In contrast to the existing algorithms for traditional distributed processes, the proposed algorithm does not require MAs to have a pre-knowledge about other competitors, nor the total number of them. MAs can join/leave the competition session freely. The algorithm performance is also evaluated through simulations.en_US
dc.description.sponsorshipDepartment of Computingen_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.relation.ispartofLecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics)en_US
dc.titleA mutual exclusion algorithm for mobile agents-based applicationsen_US
dc.typeConference Paperen_US
dc.identifier.spage56-
dc.identifier.epage67-
dc.identifier.volume4742 LNCS-
dc.identifier.scopus2-s2.0-38149111821-
dc.identifier.eissn1611-3349-
Appears in Collections:Conference Paper
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page view(s)

116
Last Week
0
Last month
Citations as of Feb 18, 2020

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.