CTDNET-III - AN EAGER REDUCTION MODEL WITH LAZINESS FEATURES

A message passing multiprocessor model for computation based on functi onal languages has been suggested. The model follows the applicative ( eager) order of reduction, giving it an edge in exploiting parallelism over those following normal order. However, the applicative strategy is prone to being unsafe and is incapable of handling recursion. A con cept of Partial task has been introduced whose sluggishness in reducti on is utilised to achieve a controlled version of recursion. The model has certain other features which make it selectively lazy so that the reduction tends to be more need-based and hence more safe.