A Brief Introduction to Fortran 77 - Polaris

More documents

Recommendations

Info

’AB’ // ’DE’Relation operators compare the values of expression andproduce a logical value of true or false. The relation operatorshave lower precedence than arithmetic operators.The relation operators are:.LT. Less than.LE. Less than or equal to.EQ. Equal to.NE. Not equal to.GT. Greater than.GE. Greater than or equal toFor example,if (a*b .gt. c-1) then ...logical qq = t-1 .gt. 5if (q) then ...© 1998 David A. Padua14 of 118
The logical operators are:.NOT. Logical negation.AND. Logical Conjunction.OR. Logical inclusive disjunction.EQV. Logical equivalence.NEQV.Logical nonequivalence© 1998 David A. Padua15 of 118
Page 1 and 2: A Brief Introduction to Fortran 771
Page 3 and 4: InterpretersAn interpreter is a pro
Page 5 and 6: Source formTraditionally, Fortran s
Page 7 and 8: Lower case letters are considered e
Page 9 and 10: The form of a character constant is
Page 11 and 12: A scalar variable does not have to
Page 13: ExpressionsExpressions in Fortran c
Page 17 and 18: 3. DO statement. Iterative statemen
Page 19 and 20: Program UnitsA Fortran program alwa
Page 21 and 22: Notice that the variable y in the l
Page 23 and 24: Each read starts on the next record
Page 25 and 26: function rtflsp(func,x1,x2,xacc)par
Page 27 and 28: A Brief Introduction to Fortran 90
Page 29 and 30: IMPLICIT none29 of 118
Page 31 and 32: Array Shapes and SizesThe shape of
Page 33 and 34: Fortran 90 Intrinsic Proceduresaint
Page 35 and 36: Finer control on when an array is c
Page 37 and 38: Procedure InterfacesWhen a procedur
Page 39 and 40: Expressions in Fortran 90 may conta
Page 41 and 42: In the following compound statement
Page 43 and 44: 6.1 IntroductionOpenMP is a collect
Page 45 and 46: All variables are assumed to be sha
Page 47 and 48: Notice that the first statement can
Page 49 and 50: 6.4 The PSINGLE directiveFinally, s
Page 51 and 52: A better example of psingle:c$ompc$
Page 53 and 54: The syntax of the pdo directive is
Page 55 and 56: 6.6 The PARALLEL DO directiveAn alt
Page 57 and 58: And the routine pdo_2 can be rewrit
Page 59 and 60: 6.7 The PSECTIONS directiveAn alter
Page 61 and 62: end© 1998 David A. Padua61 of 118
Page 63 and 64: Chapter 7. Parallel Loops in OpenMP
Page 65 and 66:
Chapter 6. OpenMP65 of 118
Page 67 and 68:
Another example of a race is:c$omp
Page 69 and 70:
Another example is:c$ompparallel do
Page 71 and 72:
7.2 Race-free parallel loopsNext, w
Page 73 and 74:
7.3 PrivatizationSometimes the tran
Page 75 and 76:
Sometimes it is necessary to privat
Page 77 and 78:
One way to solve this problem is to
Page 79 and 80:
Variables in lastprivate are privat
Page 81 and 82:
print *,a(1),a(2)endprints1.000000
Page 83 and 84:
To account for this, a and b should
Page 86 and 87:
Most induction variables are quite
Page 88 and 89:
Here, again, only the induction var
Page 90 and 91:
The way to remove the races produce
Page 92 and 93:
We can now proceed as above to obta
Page 94 and 95:
However, there is a way to improve
Page 96 and 97:
Notice that now no races exist beca
Page 98 and 99:
7.6 Execution time of a parallel do
Page 100 and 101:
following time lines:abcdeDabcdeDDa
Page 102 and 103:
7.6 Critical Regions and Reductions
Page 104 and 105:
Here, we use the critical directive
Page 106 and 107:
The assumption is that it does not
Page 108 and 109:
© 1998 David A. Padua108 of 118
Page 110 and 111:
Page 112 and 113:
Page 114 and 115:
Page 116 and 117:
Page 118:
show all

A Brief Introduction to Fortran 77 - Polaris

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?