Improved implementations of binary universal operations

Improved implementations of binary universal operations (2001)

by Hagit Attiya , Eyal Dagan , The Technion

Venue:	J. ACM
Citations:	9 - 7 self

Datum	Value	Source
TITLE	Improved implementations of binary universal operations	INFERENCE
AUTHOR NAME	Hagit Attiya	SVM HeaderParse 0.2
AUTHOR NAME	Eyal Dagan	SVM HeaderParse 0.2
AUTHOR NAME	The Technion	SVM HeaderParse 0.2
ABSTRACT	We present an algorithm for implementing binary operations (of any type) from unary loadlinked (LL) and store-conditional (SC) operations. The performance of the algorithm is evaluated according to its sensitivity, measuring the distance between operations in the graph induced by conflicts, which guarantees that they do not influence the step complexity of each other. The sensitivity of our implementation is O(log\Lambda n), where n is the number of processors in the system. That is, operations that are \Omega (log\Lambda n) apart in the graph induced by conflicts do not delay each other. Constant sensitivity is achieved for operations used to implement heaps and array-based linked lists.	SVM HeaderParse 0.2
YEAR	2001	INFERENCE
VENUE	J. ACM	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	2001	INFERENCE
VOLUME	48	INFERENCE
CITATIONS	12 found	ParsCit 1.0