|
Dartmouth College Computer Science Technical Report series |
CS home TR home TR search TR listserv |
| By author: | A B C D E F G H I J K L M N O P Q R S T U V W Y Z | |
| By number: | 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998, 1997, 1996, 1995, 1994, 1993, 1992, 1991, 1990, 1989, 1988, 1987, 1986 | |
Abstract:
This paper concerns two fundamental problems in distributed
computing---mutual exclusion and mobile object tracking.
For a variant of the mutual exclusion problem where the network topology
is taken into account, all existing distributed solutions make use
of tokens.
It turns out that these token-based solutions for
mutual exclusion can also be adapted for object tracking, as the
token behaves very much like a mobile object.
To handle objects with replication, we go further to consider the
more general $k$-exclusion problem which has not been as well studied in
a network setting.
A strong fairness property for $k$-exclusion requires
that a process trying to enter the critical section will
eventually succeed even if \emph{up to} $k-1$ processes stay in
the critical section indefinitely.
We present a comparative survey of existing token-based mutual
exclusion algorithms, which have provided much inspiration for later
$k$-exclusion algorithms. We then propose two solutions
to the $k$-exclusion problem, the second of which meets the strong
fairness requirement. Fault-tolerance issues are also discussed along with the suggestion of
a third algorithm that is also strongly fair. Performances of the three algorithms are compared by simulation.
Finally, we show how the various exclusion algorithms
can be adapted for tracking mobile objects.
Bibliographic citation for this report: [plain text] [BIB] [BibTeX] [Refer]
Or copy and paste:
Yih-Kuen Tsay and
Chien-Chung Huang,
"Exclusion and Object Tracking in a Network of Processes."
Dartmouth Computer Science Technical Report TR2007-608,
December 2007.
Want to be notified about new tech reports? Join our mailing list.
Want to search our technical reports?
Want us to mail you a paper copy of a report? Send your address and the TR number to reports AT cs.dartmouth.edu
Copyright notice: The documents contained in this server are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.