ON OPTIMAL OROW-PRAM ALGORITHMS FOR COMPUTING RECURSIVELY DEFINED FUNCTIONS
We investigate parallel algorithms to compute recursively defined functions. Our computational model are parallel random access machines (PRAM's). We preferably make use of the OROW-PRAM (owner read, owner write), a model supposed to be even weaker and more realistic than the EREW-PRAM (exclusive read, exclusive write) and that still provides the opportunities of a completely connected processor network. For OROW-PRAM's we show that our parallel algorithms are work-optimal.
1993 ◽
Vol 03
(04)
◽
pp. 367-382
Keyword(s):
Keyword(s):
1999 ◽
Vol 09
(01)
◽
pp. 31-42
◽
Keyword(s):
2004 ◽
Vol Vol. 6 no. 2
◽
1997 ◽
Vol 07
(01)
◽
pp. 25-37
◽
Keyword(s):
1993 ◽
Vol 04
(02)
◽
pp. 179-192
◽
1996 ◽
Vol 06
(02)
◽
pp. 213-222
◽
Keyword(s):
Keyword(s):
1997 ◽
Vol 07
(01)
◽
pp. 3-11
◽
Keyword(s):