STUDIA UNIVERSITATIS

AMBIENTUM BIOETHICA BIOLOGIA CHEMIA DIGITALIA DRAMATICA EDUCATIO ARTIS GYMNAST. ENGINEERING EPHEMERIDES EUROPAEA GEOGRAPHIA GEOLOGIA HISTORIA HISTORIA ARTIUM INFORMATICA IURISPRUDENTIA MATHEMATICA MUSICA NEGOTIA OECONOMICA PHILOLOGIA PHILOSOPHIA PHYSICA POLITICA PSYCHOLOGIA-PAEDAGOGIA SOCIOLOGIA THEOLOGIA CATHOLICA THEOLOGIA CATHOLICA LATIN THEOLOGIA GR.-CATH. VARAD THEOLOGIA ORTHODOXA THEOLOGIA REF. TRANSYLVAN ROMÂNA ENGLISH INFOKIOSK CONTACT ADDRESSES SPECIAL ACCESS SUBSCRIPTION FORM NEWSLETTER & DOWNLOAD NEWEST ISSUES THIS YEAR ISSUES ALL ISSUES IN ARCHIVE FIND IN ARCHIVE HISTORY TODAY SCOP & OBJECTIVES THE TEAM


	The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.


	STUDIA INFORMATICA - Issue no. Sp.Issue 2 / 2009

	Article:	A PARALLELIZATION SCHEME OF SOME ALGORITHMS. Authors: ERNEST SCHEIBER.


	Abstract: This note presents a parallelizing scheme of an algorithm with an unknown number of tasks or dynamicaly varing number of tasks but using a fixed number of workers or workstations, based on the dispatcher-worker paradigm. Aconsequence of this approach is that the same scheme is used to implement, asan example, the backtracking algorithm and the quicksort method. Key words and phrases. parallel algorithms, dispatcher-worker, parallel backtracking.




			Back to previous page