@incollection{,
	
					
					
					40F85BE656C25AF6BDFB2996F570605F
				,
	author={{Ms. RanjeetKaur} and {Dr. Pushpa RaniSuri} and {Kurukshetra University, Kurukshetra}},
	journal={{Global Journal of Computer Science and Technology}},
	journal={{GJCST}}0975-41720975-435010.34257/gjcst,
	address={Cambridge, United States},
	publisher={Global Journals Organisation}14319
}

@incollection{b0,
	
	
		,
	title={{Systems programming: Coping with parallelism}}
		,
	author={{
			RKTreiber
		}}
	
	
		,
	journal={{RJ}}
		
			5118
			,
	year={April 1986}
		
	

}

@incollection{b1,
	
	
		,
	title={{Nonblocking algorithms and preemption-safe locking on multiprogrammed shared -memory multiprocessors}}
		,
	author={{
			MMichael
		} and {
			MScott
		}}
		
	
	
		,
	journal={{Journal of Parallel and Distributed Computing}}
		
			51
			1
			
			,
	year={1998}
		
	

}

@book{b2,
	
	
		,
	title={{A scalable lock-free stack algorithm}}
		,
	author={{
			DHendler
		} and {
			NShavit
		} and {
			LYerushalmi
		}}
		
		
		TR-2004-128
		
			,
	year={2004}
		
		
			Sun Microsystems Laboratories
		
	
	,
	note={Technical Report}

}

@incollection{b3,
	
	
		,
	title={{Implementing Lock-Free queues}}
		,
	author={{
			JDValois
		}}
	
	
		,
	booktitle={{Seventh International Conference on Parallel and Distributed Computing Systems}}
				Las Vegas, NV
		
			,
	year={October 1994}
		
	

}

@incollection{b4,
	
	
		,
	title={{Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms}}
		,
	author={{
			MMMichael
		} and {
			MLScott
		}}
		
	
	
		,
	booktitle={{15th ACM Symp. On Principles of Distributed Computing (PODC)}}
				
			,
	year={May 1996}
			
		
	

}

@book{b5,
	
	
		,
	title={{Using elimination to implement scalable and lock-free FIFO queues}}
		,
	author={{
			MarkMoir
		} and {
			DanielNussbaum
		} and {
			OriShalev
		} and {
			NirShavit
		}}
		
		
		
		
			,
	year={2005}
		
	

}

@incollection{b6,
	
	
		,
	title={{Concurrent manipulation of binary search trees}}
		,
	author={{
			HKung
		} and {
			PLehman
		}}
		
	
	
		,
	journal={{ACM Transactions on Programming Languages and Systems}}
		
			5
			
			,
	year={September 1980}
		
	

}

@incollection{b7,
	
	
		,
	title={{Efficient Locking for Concurrent Operations on B-trees}}
		,
	author={{
			PLehman
		} and {
			SYao
		}}
		
	
	
		,
	journal={{ACM Trans. Database Systems}}
		
			6
			4
			,
	year={1981}
		
	

}

@incollection{b8,
	
	
		,
	title={{Concurrent operations on b-trees with overtaking}}
		,
	author={{
			YSagiv
		}}
	
	
		,
	journal={{Journal of Computer and System Sciences}}
		
			33
			2
			
			,
	year={October 1986}
		
	

}

@incollection{b9,
	
	
		,
	title={{A symmetric concurrent b-tree algorithm}}
		,
	author={{
			VLanin
		} and {
			DShasha
		}}
		
	
	
		,
	booktitle={{Proceedings of the Fall Joint Computer Conference}}
				the Fall Joint Computer Conference
		
			,
	publisher={IEEE Computer Society Press}
			,
	year={1986. November 1986}
			
		
	

}

@incollection{b10,
	
	
		,
	title={{Simultaneous update of priority structures}}
		,
	author={{
			JBiswas
		} and {
			JBrowne
		}}
		
	
	
		,
	booktitle={{Proceedings of the 1987 International Conference on Parallel Processing}}
				the 1987 International Conference on Parallel Processing
		
			,
	year={August 1987}
			
		
	

}

@incollection{b11,
	
	
		,
	title={{Concurrent access of priority queues}}
		,
	author={{
			VRao
		} and {
			VKumar
		}}
		
	
	
		,
	journal={{IEEE Transactions on Computers}}
		
			37
			
			,
	year={December 1988}
		
	

}

@incollection{b12,
	
	
		,
	title={{LR-algorithm: concurrent operations on priority queues}}
		,
	author={{
			RAyani
		}}
	
	
		,
	booktitle={{Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing}}
				the 2nd IEEE Symposium on Parallel and Distributed Processing
		
			,
	year={1991}
			
		
	

}

@incollection{b13,
	
	
		,
	title={{An efficient algorithm for concurrent priority queue heaps}}
		,
	author={{
			GHunt
		} and {
			MMichael
		} and {
			SParthasarathy
		} and {
			MScott
		}}
		
		
		
	
	
		,
	journal={{Information Processing Letters}}
		
			60
			3
			
			,
	year={November 1996}
		
	

}

@incollection{b14,
	
	
		,
	title={{Skiplist-Based Concurrent Priority Queues}}
		,
	author={{
			NLotan
		} and {
			Shavit
		}}
		
	
	
		,
	booktitle={{International Parallel and Distributed Processing Symposium}}
				
			,
	year={2000}
		
	

}

@book{b15,
	
	
		,
	title={{Fast and Lock-Free Concurrent Priority Queues for Multithread System}}
		,
	author={{
			HSundell
		} and {
			PTsigas
		}}
		
		
	

}

@book{b16,
	
	
		,
	title={{A highly concurrent priority queue based on the b-link tree}}
		,
	author={{
			TJohnson
		}}
		91-007
		
			,
	year={August 1991}
		
		
			University of Florida
		
	
	,
	note={Technical Report}

}

@incollection{b17,
	
	
		,
	title={{An evaluation of concurrent priority queue algorithms}}
		,
	author={{
			QHuang
		} and {
			WWeihl
		}}
		
	
	
		,
	booktitle={{IEEE Parallel and Distributed Computing Systems}}
				
			,
	year={1991}
			
		
	

}

@incollection{b18,
	
	
		,
	title={{Lock-free linked lists using compareand-swap}}
		,
	author={{
			JDValois
		}}
	
	
		,
	booktitle={{Proceedings of the 14th ACM Symposium on Principles of Distributed Computing}}
				the 14th ACM Symposium on Principles of Distributed Computing
		
			,
	year={1995}
			
		
	

}

@incollection{b19,
	
	
		,
	title={{A pragmatic implementation of nonblocking linked-lists}}
		,
	author={{
			TLHarris
		}}
	
	
		,
	booktitle={{Proceedings of the 15th International Symposium on Distributed Computing}}
				the 15th International Symposium on Distributed Computing
		
			,
	year={2001}
			
		
	

}

@incollection{b20,
	
	
		,
	title={{High performance dynamic lockfree hash tables and list-based sets}}
		,
	author={{
			MMMichael
		}}
	
	
		,
	booktitle={{Proceedings of the 14th annual ACM Symposium on Parallel Algorithms and Architectures}}
				the 14th annual ACM Symposium on Parallel Algorithms and Architectures
		
			,
	year={2002}
			
		
	

}

@book{b21,
	
	
		,
	title={{Non-Blocking Synchronization and System Design}}
		,
	author={{
			MGreenwald
		}}
		STAN-CS-TR-99-1624
		
			,
	year={1999}
			8
			,
	address={Palo Alto, A}
		
		
			Stanford University
		
	
	,
	note={Technical Report}

}

@book{b22,
	
	
		,
	title={{Elimination trees and the construction of pools and stacks}}
		,
	author={{
			NShavit
		} and {
			DTouitou
		}}
		
		
			,
	year={1997}
			30
			
		
	
	,
	note={Theory of Computing Systems}

}

@incollection{b23,
	
	
		,
	title={{A methodology for implementing highly concurrent data objects}}
		,
	author={{
			MHerlihy
		}}
	
	
		,
	journal={{ACM Transactions on Programming Languages and Systems}}
		
			15
			5
			
			,
	year={1993}
		
	

}

@incollection{b24,
	
	
		,
	title={{Linearizability: a Correctness Condition for Concurrent Objects}}
		,
	author={{
			MHerlihy
		} and {
			JWing
		}}
		
	
	
		,
	journal={{ACM Transactions on Programming Languages and Systems}}
		
			12
			3
			
			,
	year={1990}
		
	

}

@incollection{b25,
	
	
		,
	title={{NOBLE: A Non-Blocking Inter-Process Communication Library}}
		,
	author={{
			HSundell
		} and {
			PTsigas
		}}
		
	
	
		,
	booktitle={{Proceedings of the 6th Workshop on Languages, Compilers and Run-time Systems for Scalable Computers}}
				the 6th Workshop on Languages, Compilers and Run-time Systems for Scalable Computers
		
			,
	year={2002}
		
	

}

@incollection{b26,
	
	
		,
	title={{Integrating Non-blocking Synchronization in Parallel Applications: Performance Advantages and Methodologies}}
		,
	author={{
			PTsigas
		} and {
			YZhang
		}}
		
	
	
		,
	booktitle={{Proceedings of the 3rd ACM Workshop on Software and Performance}}
				the 3rd ACM Workshop on Software and Performance
		
			,
	publisher={ACM Press}
			,
	year={2002}
			
		
	

}

@incollection{b27,
	
	
		,
	title={{A methodology for implementing highly concurrent data objects}}
		,
	author={{
			MHerlihy
		}}
	
	
		,
	journal={{ACM Transactions on Programming Languages and Systems}}
		
			15
			5
			
			,
	year={November 1993}
		
	

}

@incollection{b28,
	
	
		,
	title={{Algorithms for scalable synchronization on shared memory multiprocessors}}
		,
	author={{
			JMellor-Crummey
		} and {
			MScott
		}}
		
	
	
		,
	journal={{ACM Transactions on Computer Systems}}
		
			9
			1
			
			,
	year={1991}
		
	

}

@incollection{b29,
	
	
		,
	title={{Locking without Blocking: Making Lock Based concurrent Data Structure Algorithms Nonblocking}}
		,
	author={{
			JTurek
		} and {
			DShasha
		} and {
			SPrakash
		}}
		
		
	
	
		,
	booktitle={{Proceedings of the 11th ACM SIGACT-SIGMOD-SIGARTSymposium on Principles of Database Systems}}
				the 11th ACM SIGACT-SIGMOD-SIGARTSymposium on Principles of Database Systems
		
			,
	year={1992}
			
		
	

}

@book{b30,
	
	
		,
	title={{Concurrent Maintenance of Skip Lists}}
		,
	author={{
			WPugh
		}}
		CS-TR- 2222.1
		
			,
	year={1989}
			,
	address={College Park}
		
		
			Institute for Advanced Computer Studies, Department of Computer Science, University of Maryland
		
	
	,
	note={Technical Report}

}

@incollection{b31,
	
	
		,
	title={{Skip Lists: "A Probabilistic Alternative to Balanced Trees}}
		,
	author={{
			WPugh
		}}
	
	
		,
	booktitle={{Communications of the ACM}}
				
			,
	year={June 1990}
			33
			
		
	

}