A CSP Description of some Parallel Sorting Algorithms

dc.contributor.author	Linck, M. H.
dc.date.accessioned	2018-05-22T13:28:52Z
dc.date.available	2018-05-22T13:28:52Z
dc.date.issued	1982
dc.identifier.citation	Quaestiones Informaticae Vol 2 No 1 1982	en
dc.identifier.issn	0254-2757
dc.identifier.uri	http://hdl.handle.net/10500/24006
dc.description.abstract	Hoare's CSP notation is used to describe 3 parallel sorting algorithms. The first algorithm uses n/2 processes working in parallel, the second uses an array of n parallel processes and the third algorithm is a parallel version of quicksort.	en
dc.language.iso	en	en
dc.publisher	Linck, M.H. (1982) A CSP Description of some Parallel Sorting Algorithms,. Computer Society of South Africa (on behalf of SAICSIT)	en
dc.title	A CSP Description of some Parallel Sorting Algorithms	en
dc.type	Article	en
dc.description.department	School of Computing	en