1998•Unpublished venueRequires access

Parallel Functional Program Computing Model and Task Partition

Zhou Yi

Abstract

In this paper, task tree is introduced to model a parallel functional program on distributed and message passing platform. Based on this model, the main issues of task partition, such as task size and parallelism, are analyzed with speedup as the performance measure. An optimized partition algorithm is given, and an implemented system——PARLisp's performance data is supplied as an example.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Computer science, Speedup, Partition (number theory), Parallel computing, Task (project management), Parallelism (grammar), Data parallelism, Task parallelism