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|
Over the past decade, a pair of instructions called load-linked (LL)
and store-conditional (SC) have emerged as the most suitable
synchronization instructions for the design of lock-free algorithms. However, current architectures do not support these instructions;
instead, they support either CAS (e.g., UltraSPARC, Itanium)
or restricted versions of LL/SC (e.g., POWER4, MIPS, Alpha).
Thus, there is a gap between what algorithm designers want (namely, LL/SC) and what multiprocessors actually support (namely, CAS or RLL/RSC).
To bridge this gap, a flurry of algorithms that implement LL/SC from CAS have appeared in the literature.
The two most recent algorithms are due to Doherty, Herlihy, Luchangco, and Moir (2004)
and Michael (2004).
To implement M LL/SC objects shared by N processes, Doherty et al.'s algorithm uses
only O(N + M) space, but is only non-blocking and not wait-free.
Michael's algorithm, on the other hand, is wait-free, but uses O(N^2 + M) space.
The main drawback of his algorithm is the time complexity of the SC operation:
although the expected amortized running time of SC is only O(1),
the worst-case running time of SC is O(N^2).
The algorithm in this paper overcomes this drawback.
Specifically, we design a wait-free algorithm that achieves a space complexity of O(N^2 + M),
while still maintaining the O(1) worst-case running time for LL and SC operations.
Bibliographic citation for this report: [plain text] [BIB] [BibTeX] [Refer]
Or copy and paste:
Prasad Jayanti and Srdjan Petrovic, "Efficiently Implementing a Large Number of LL/SC Objects." Dartmouth Computer Science Technical Report TR2005-554, August 2005.
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.