1993
DOI: 10.1109/88.219857
|View full text |Cite
|
Sign up to set email alerts
|

High performance Fortran

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
51
0

Year Published

1995
1995
2013
2013

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 158 publications
(51 citation statements)
references
References 6 publications
0
51
0
Order By: Relevance
“…The comparison, however, should be made with other parallel programming languages. Even High Performance Fortran (Loveman, 1993) has many of the complexities that can be seen in EC. The current state-of-art in Distributed Programming is such that such com-plexities seem difficult to remove.…”
Section: Resultsmentioning
confidence: 99%
“…The comparison, however, should be made with other parallel programming languages. Even High Performance Fortran (Loveman, 1993) has many of the complexities that can be seen in EC. The current state-of-art in Distributed Programming is such that such com-plexities seem difficult to remove.…”
Section: Resultsmentioning
confidence: 99%
“…In languages with semiexplicit parallelism like GPH or Eden, the programmer specifies only a few key coordination aspects, for example, what threads to create, and the language implementation automatically manages the remaining coordination aspects. In an implicitly parallel language like High-Performance Fortran [11] or PMLS [12], the programmer does not specify coordination aspects, as the parallelism is implicit in the language semantics.…”
Section: High-level Parallel Coordinationmentioning
confidence: 99%
“…Programming models can range from purely task based models like Intel's TBB [4], Cilk [5], or PLASMA [6], to globally synchronous approaches, such as BSP [7]. Furthermore, they can be based on a common memory paradigm like Global Arrays [8] or HPF [9] or be data-driven, such as CHARM++ [10]. In contrast to these application domain independent systems, DSLs seek to create a language for a specific problem domain, such as MATLAB [11] for linear algebra, Liszt [12] for partial differential equations and SEQUEL [13] for databases.…”
Section: Introductionmentioning
confidence: 99%