<?xml version="1.0"?>

<!DOCTYPE owl [
	<!ENTITY rdf "http://www.w3.org/1999/02/22-rdf-syntax-ns#">
	<!ENTITY rdfs "http://www.w3.org/2000/01/rdf-schema#">
	<!ENTITY xsd "http://www.w3.org/2001/XMLSchema#">
	<!ENTITY owl "http://www.w3.org/2002/07/owl#">
	<!ENTITY cc "http://web.resource.org/cc/#">
	<!ENTITY project "http://ebiquity.umbc.edu/ontology/project.owl#">
	<!ENTITY person "http://ebiquity.umbc.edu/ontology/person.owl#">
	<!ENTITY pub "http://ebiquity.umbc.edu/ontology/publication.owl#">
	<!ENTITY assert "http://ebiquity.umbc.edu/ontology/assertion.owl#">
]>

<!--

This ontology document is licensed under the Creative Commons
Attribution License. To view a copy of this license, visit
http://creativecommons.org/licenses/by/2.0/ or send a letter to
Creative Commons, 559 Nathan Abbott Way, Stanford, California
94305, USA.

-->

<rdf:RDF 
		xmlns:rdf = "&rdf;"
		xmlns:rdfs = "&rdfs;"
		xmlns:xsd = "&xsd;"
		xmlns:owl = "&owl;"
		xmlns:cc = "&cc;"
		xmlns:project = "&project;"
		xmlns:person = "&person;"
		xmlns:pub = "&pub;"
		xmlns:assert = "&assert;">
	<pub:TechReport rdf:about="http://ebiquity.umbc.edu/paper/html/id/789/Modified-Bully-Algorithm-using-Election-Commission">
		<rdfs:label><![CDATA[Modified Bully Algorithm using Election Commission]]></rdfs:label>
		<pub:title><![CDATA[Modified Bully Algorithm using Election Commission]]></pub:title>
		<pub:publishedOn rdf:datatype="&xsd;dateTime">2009-10-09T00:00:00-05:00</pub:publishedOn>
		<pub:abstract><![CDATA[Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized control IPC, etc. A leader is required to make synchronization between different processes. And different election algorithms are used to elect a coordinator among the available processes in the system such a way that there will be only one coordinator at any time. Bully election algorithm is one of the classical and well-known approaches in coordinator election process. This paper will present a modified version of bully election algorithm using a new concept called election commission. This approach will not only reduce redundant elections but also minimize total number of elections and hence it will minimize message passing, network traffic, and complexity of the existing system.]]></pub:abstract>
		<pub:tag><![CDATA[distributed computing]]></pub:tag>
		<pub:booktitle><![CDATA[arXiv eprint ]]></pub:booktitle>
		<pub:publisher><![CDATA[arXiv]]></pub:publisher>
		<pub:author>
			<rdf:List>
				<rdf:first>
					<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/et al./"><person:name><![CDATA[et al.]]></person:name><rdfs:label><![CDATA[et al.]]></rdfs:label></person:Person>
				</rdf:first>
				<rdf:rest>					<rdf:List>
						<rdf:first>
							<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Muhammad/Rahman"><person:name><![CDATA[Muhammad Mahbubur Rahman]]></person:name><rdfs:label><![CDATA[Muhammad Mahbubur Rahman]]></rdfs:label></person:Person>
						</rdf:first>
						<rdf:rest rdf:resource="&rdf;nil" />
					</rdf:List>
				</rdf:rest>
			</rdf:List>
		</pub:author>
		<pub:firstAuthor>
<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/et al./"><person:name><![CDATA[et al.]]></person:name><rdfs:label><![CDATA[et al.]]></rdfs:label></person:Person>
		</pub:firstAuthor>
	</pub:TechReport>

<rdf:Description rdf:about="">
	<cc:License rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
</rdf:Description>

</rdf:RDF>
