Concurrent Bubble Sort Program			
									DUE: Monday, November 7 			
							no mo					
							ck or					
			mo gd 	bug-			ch-mo					
	Prog	ch	conc	less		child/	share	dist				
	#	conc	w ch	Mo Ck	#sems	sem	lock	ck	Method						Dist Check Method		Notes	Grade
												
#0050	D	YES	YES	YES	32	1	YES	NO	sem/slot; sm part bot neck - NO mo bug							100
#0246	O	YES	YES	YES	32	1	YES	YES	sem/slot; dist sort ck - NO mo bug 		SortHeight Variable method	Late	90
#0977	A	YES	NO	NO	32	1	YES	NO	sem/slot; mo locks 2's - mo bug			All ch do mo work			82
#1137	M	NO	NO	YES	1	31	YES	NO	~1 sem; no conc; NO mo bug								75
#1510	L	YES	NO	NO	32	1	YES	NO	sem/slot; mo locks 2's - mo bug			All ch do mo work			82
#2151	J	NO	NO	NO	2	31	NO	NO	1 sem 4 ch; 1 4 mo; no ch conc; mo bug							70
#2465	K	NO	NO	YES	1	31	YES	NO	~1 sem; no conc; NO mo bug			All ch do mo work			75
#2563	A	YES	NO	NO	32	1	YES	NO	sem/slot; mo locks 2's - mo bug			All ch do mo work			82
#4444	B	NO	NO	YES	1	31	YES	NO	1 sem & no conc - No mo bug			unintelligible				75
#4847	M	NO	NO	YES	1	31	YES	NO	~1 sem; no conc; NO mo bug			unintelligible				75
#5455	P	NO	NO	YES	1	31	YES	NO	~1 sem; no conc; NO mo bug			All ch do mo work			75
#5988	F	YES	YES	YES	32	1	YES	YES	sem/slot; dist sort ck - NO mo bug 		SortHeight Variable method		100
#6318	G	NO	NO	NO	2	31	NO	NO	1 sem 4 ch; 1 4 mo; no ch conc; mo bug		All ch do mo work+ ch msg to mo		70
#7477	H	YES	NO	NO	32	1	YES	NO	sem/slot; mo locks 1's - mo bug			All ch do mo work			82
#7710	E	NO	NO	NO	1	31	YES	NO	1 sem & no conc - mo bug			unintelligible				70
#8597	N	YES	NO	NO	32	1	YES	NO	sem/slot; mo locks 2's - mo bug			All ch do mo work			82
#9146	I	YES	NO	YES	32	1	YES	NO	sem/slot; mo locks all - No mo bug		All ch do mo work, w hints		100
#9308	G	NO	NO	NO	2	31	NO	NO	1 sem 4 ch; 1 4 mo; no ch conc; mo bug		All ch do mo work			70
#9941	C	YES	NO	NO	32	1	YES	NO	sem/slot; mo locks 1's - mo bug			unintelligible				82
												
LEGEND:		ch										#sems is the approximate number of semaphores used in the algorithm		
LEGEND:		conc	means children are able to operate concurrently									
LEGEND:												child/sem is the number of children per semaphore		
LEGEND:		mo gd 										
LEGEND:		conc										no mo ck or ch-me share lock		
LEGEND:		w ch	means mother has error-free concurrency with child threads		means there is no mother check for sorted list or the 		
LEGEND:												mother and children wait on the same lock(s)		
LEGEND:		bug-										
LEGEND:		less										dist ck means the algorithm employs a distributed checking		
LEGEND:		Mo Ck	means the sort-check is bugless						algorithm to see if the list is sorted