登入選單
返回Google圖書搜尋
Optimal Parallel Algorithms for Computing Recursively Defined Functions
註釋Abstract: "We investigate recursively defined functions and present optimal algorithms on parallel random access machines (PRAM's) to compute them. It is shown that if for the average width w[bar] of the recursion tree the number of PRAM processors is O(w[bar]/log w[bar]), our parallel algorithms need the same amount of work as the best sequential algorithms for these problems up to a constant factor. In addition, this is possible using the weakest PRAM model, i.e., OROW-PRAM's (owner read, owner write parallel random access machines)."