1984
DOI: 10.1109/mc.1984.1659184
|View full text |Cite
|
Sign up to set email alerts
|

Modeling Algorithm Execution Time on Processor Arrays

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

1986
1986
1995
1995

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(3 citation statements)
references
References 2 publications
0
3
0
Order By: Relevance
“…Note that the use of an increasingly larger amount of processors could initially decrease the t ime to solve a problem. However, after some point, the use of too many processors could even take longer time than that required by a smaller number of processors (1,5,6,8,10). This led Flatt and Kennedy to examine the problem of finding the number of processors that would result in the smallest execution time.…”
Section: Introductionmentioning
confidence: 99%
“…Note that the use of an increasingly larger amount of processors could initially decrease the t ime to solve a problem. However, after some point, the use of too many processors could even take longer time than that required by a smaller number of processors (1,5,6,8,10). This led Flatt and Kennedy to examine the problem of finding the number of processors that would result in the smallest execution time.…”
Section: Introductionmentioning
confidence: 99%
“…Furthermore, computations (e.g., [2][3][4]) showed that while the use of an increasingly larger number of processors could initially decrease the time required for solution of a problem, the use of "too many" processors would result in a larger execution time than that required by a smaller number of processors (see Figure 1). This led to investigations concerning the number of processors that would lead to the minimum execution time.…”
Section: Introductionmentioning
confidence: 99%
“…Both the time taken to communicate between processors and the synchronization of the computational tasks need to be considered. Adams and Crockett [1984] present methods to quantify these timing costs using a linear system example. More generally, on parallel machines there are two ways by which speedup can be enhanced.…”
Section: Introductionmentioning
confidence: 99%