|
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:
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, Pentium)
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 restricted LL/SC).
To bridge this gap, this thesis presents a series of efficient, wait-free
algorithms that implement LL/SC from CAS or restricted LL/SC.
Bibliographic citation for this report: [plain text] [BIB] [BibTeX] [Refer]
Or copy and paste:
Srdjan Petrovic,
"Efficient Wait-Free Algorithms for Implementing LL/SC Objects."
Dartmouth Computer Science Technical Report TR2005-556,
August 2005.
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.