Mostra el registre d'ítem simple
Fringe analysis of synchronized parallel algorithms on 2--3 trees
dc.contributor.author | Baeza-Yates, R |
dc.contributor.author | Gabarró Vallès, Joaquim |
dc.contributor.author | Messeguer Peypoch, Xavier |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-12-14T13:10:05Z |
dc.date.available | 2016-12-14T13:10:05Z |
dc.date.issued | 1998-06 |
dc.identifier.citation | Baeza-Yates, R., Gabarro, J., Messeguer, X. "Fringe analysis of synchronized parallel algorithms on 2--3 trees". 1998. |
dc.identifier.uri | http://hdl.handle.net/2117/98212 |
dc.description.abstract | We are interested in the fringe analysis of synchronized parallel insertion algorithms on 2—3 trees namely the algorithm of W.Paul U. Vishkin and H. Wagener PVW. This algorithm inserts k keys into a tree of size n with parallel time Olog n log k Fringe analysis studies the distribution of the bottom subtrees and it is still an open problem for parallel algorithms on search trees. To tackle this problem we introduce a new kind of algorithms whose two extreme cases seems to upper and lower bounds the performance of the PVW algorithm. We extend the fringe analysis to parallel algorithms and we get a rich mathematical structure giving new interpretations even in the sequential case. The process of insertions is modeled by a Markov chain and the coecients of the transition matrix are related with the expected local behavior of our algorithm. Finally we show that this matrix has a power expansion over (n+1)-1 where the coecients are the binomial transform of the expected local behavior. This expansion shows that the parallel case can be approximated by iterating the sequential case. |
dc.format.extent | 14 p. |
dc.language.iso | eng |
dc.relation.ispartofseries | LSI-98-37-R |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject.other | Fringe analysis |
dc.subject.other | Synchronized parallel insertion algorithms |
dc.subject.other | Binomial transform |
dc.subject.other | 2-3 trees |
dc.title | Fringe analysis of synchronized parallel algorithms on 2--3 trees |
dc.type | External research report |
dc.contributor.group | Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
dc.rights.access | Open Access |
local.identifier.drac | 1874254 |
dc.description.version | Postprint (published version) |
local.citation.author | Baeza-Yates, R.; Gabarro, J.; Messeguer, X. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [139]
-
Reports de recerca [1.107]