EFFICIENT PARALLEL ALGORITHMS FOR THE LIS AND LCS PROBLEMS ON BSR MODEL USING CONSTANT NUMBER OF SELECTIONS

Recently Akl et al. introduced a new model of parallel computation, called BSR (broadcasting with selective reduction) and showed that it is more powerful than any CRCW PRAM and yet requires no more resources for implementation than even EREW PRAM. The model allows constant time solutions to sorting...

Celý popis

Podrobná bibliografia

Vydané v:	Parallel algorithms and applications Ročník 14; číslo 3; s. 187 - 202
Hlavní autori:	MYOUPO, JEAN-FRÉDÉRIC, SEMÉ, DAVID
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Taylor & Francis Group 01.01.2000
Predmet:	Broadcast Concurrent read Concurrent write Interconnection unit Longest common subsequence Longest increasing subsequence Parallel algorithm Parallel random access machine Reduction; Selection
ISSN:	1063-7192
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!