Dartmouth College Computer Science
Technical Report series
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 X Y Z|
|By number:||2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998, 1997, 1996, 1995, 1994, 1993, 1992, 1991, 1990, 1989, 1988, 1987, 1986|
We specify and prove an algorithm solving k-Exclusion, a generalization of the Mutual Exclusion problem. k-Exclusion requires that at most k processes
be in the Critical Section (CS) at once; in addition, we require bounded exit, starvation freedom and fairness properties. The goal within this
framework is to minimize the number of Remote Memory References (RMRs) made. Previous algorithms have required Omega(k) RMRs in the worst case. Our
algorithm requires O(log k) RMRs in the worst case under the Cache-Coherent (CC) model, a considerable improvement in time complexity.
Senior Honors Thesis; advisor: Prasad Jayanti.
Bibliographic citation for this report: [plain text] [BIB] [BibTeX] [Refer]
Or copy and paste:
Jonathan H. Choi, "A Solution to k-Exclusion with O(logk) RMR Complexity." Dartmouth Computer Science Technical Report TR2011-682, June 2011.
Notify me about new tech reports.
Search the technical reports.
To receive paper copy of a report, by mail, 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.
Technical reports collection maintained by David Kotz.