1988
DOI: 10.1098/rsta.1988.0092
|View full text |Cite
|
Sign up to set email alerts
|

Computational models for parallel computers

Abstract: Computational models define the usage patterns of a computer. They can be used to derive the architecture of the machine, provide guidelines for programming tools, and suggest how the machine should be used in applications. Identifying computational models is especially important for parallel computers, since their architectures and usages are still not well understood in general. This paper describes a number of computational models for parallel computers. These models characterize the communication patterns … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

1993
1993
2010
2010

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 22 publications
(7 citation statements)
references
References 18 publications
0
7
0
Order By: Relevance
“…Much of the motivation for its development was derived from issues in robotics [11], so the machine has a variety of attractive features, not the least of which is the ability to combine different models of computation [12J as appropriate in single applications [13]. Since this was our first exposure to the iWarp, we implemented the algorithms using simple strategies.…”
Section: Methodsmentioning
confidence: 99%
“…Much of the motivation for its development was derived from issues in robotics [11], so the machine has a variety of attractive features, not the least of which is the ability to combine different models of computation [12J as appropriate in single applications [13]. Since this was our first exposure to the iWarp, we implemented the algorithms using simple strategies.…”
Section: Methodsmentioning
confidence: 99%
“…Many choices regarding resource allocation, such as the mapping of the various tasks on the machine and the degree of parallelism of each task, might be decided by the compiler tool on the basis of either suitable performance models or directives supplied by the programmer. As an example of this high-level approach, below we show how COLT HPF can be exploited by a high-level, template-based co-ordination language that facilitates programmers in organizing HPF tasks according to pipelines and processor farm forms of task parallelism [7,8]. We present templates which implement these forms of task parallelism and we discuss their instantiation by means of a simple compiler.…”
Section: Exploiting Colt Hpf For Structured Task Parallelismmentioning
confidence: 98%
“…This time I chose matrix multiplication, which can be pipelined in a straightforward way as shown in Figure 2 [37].…”
Section: The Multiplication Pipelinementioning
confidence: 99%