Introductory Fortran Programming
|
|
|
- Sara Barker
- 10 years ago
- Views:
Transcription
1 Motivation Department of Geosciences University of Oslo, N-0315 Oslo, Norway Spring 2005
2 Motivation Motivation 1 Motivation
3 Contents Motivation About Fortran 77 and 95 Gentle introduction to Fortran 77 and 95 programming File I/O Arrays and loops Detailed explanation of modules Computational efficiency aspects Using modules as objects The promise of Fortran 2003
4 Motivation About Fortran 77 and 95 Required background Programming experience with either C++, Java or Matlab Interest in numerical computing using Fortran Interest in writing efficient programs utilizing low-level details of the computer
5 Motivation About Fortran 77 and 95 About learning Fortran Fortran is a less complicated language than C++ and Java Even so it takes time to master the advanced details of Fortran 95 At least 6 months to a year working with Fortran 95 before you are familiar with the details Four days can only get you started You need to use Fortran 95 in your own projects to master the language Fortran 77 code is not the main topic here, but you need to have some knowledge of it
6 Motivation About Fortran 77 and 95 Teaching philosophy Intensive course Lectures 9-12 Hands-on training Learn form dissecting examples Get in touch with the dirty work Get some overview of advances topics Focus on principles and generic strategies Continued learning on individual basis This course just get you started - use textbooks, reference manuals and software examples from the internet for further work with projects
7 Motivation About Fortran 77 and 95 recommended attidude Dive into executable examples Don t try to understand everything Try to adapt examples to new problems Look up technical details in manuals/textbooks Learn on demand Keep a cool head Make your program small and fast - then your software long will last
8 Motivation About Fortran 77 and 95 About Fortran 77 and 95 2 About Fortran 77 and 95
9 Fortran 77 About Fortran 77 and 95 Intro to Fortran 77 programming Into the early/middle of the nineties Fortran 77 was the dominating language for number crunching It s predecessor Fortran IV was replaced by Fortran 77 in the early eighties. The first version of Fortran was written in 1957 and the language has evolved over time. Like many procedural languages Fortran has a failry simple syntax Fortran is good for only one thing, NUMBERCRUNCHING
10 Fortran 95 About Fortran 77 and 95 Intro to Fortran 77 programming Fortran 95 extends Fortran 77 with Nicer syntax, free format instead of fixed format User defined datatypes using the TYPE declaraion Modules containing data definitions and procedure declarations No implicit variable declaretions, avoiding typing errors Fortran 77 is a subset of fortran 95
11 About Fortran 77 and 95 Intro to Fortran 77 programming Fortran versus other languages C is low level and close to the machine, but can be error prone C++ is a superset of C and more reliable Java is simpler and more reliable than C++ Python is more high-level than Java
12 About Fortran 77 and 95 Intro to Fortran 77 programming Speed of Fortran versus other languages Fortran 77 is regarded as very fast C yield slightly slower code C++ and fortran 95 are slower than Fortran 77 Java is much slower
13 About Fortran 77 and 95 Intro to Fortran 77 programming Some guidelines Fortran 77 gives very fast programs, but the source code is less readable and more error prone due to implicit declarations Use Fortran 95 for your main program and Fortran 77 functions where speed is critical Sometimes the best solution is a combination of languages, e.g. Fortran, Python and C++ Use the language best suited for your problem
14 About Fortran 77 and 95 Intro to Fortran 77 programming Intro to Fortran 77 programming 3 Intro to Fortran 77 programming
15 Intro to Fortran 77 programming Intro to Fortran 95 programming Our first Fortran 77 program Goal: make a program writing the text Hello World Implementation Without declaring a string With string declaration
16 Intro to Fortran 77 programming Intro to Fortran 95 programming Without declaring a string variable C PROGRAM hw1 WRITE(*,*) Hello World END PROGRAM hw1
17 Intro to Fortran 77 programming Intro to Fortran 95 programming With declaring a string variable C PROGRAM hw1 CHARACTER*11 str WRITE(*,*) str END PROGRAM hw1
18 Intro to Fortran 77 programming Intro to Fortran 95 programming Some comments to the Hello World program Fortran 77 uses fixed format The source code is divided into positions on the line This is a heritage from the old days when communication with the computer was by punched cards A character in the first column identifies to the compiler that the rest of the line is a comment The coumns 2 to 5 is for jump labels and format specifiers Column 6 is for continuation of the previous line The column 7 to 72 is for the source code Column 73 to 80 is for comments
19 Intro to Fortran 77 programming Intro to Fortran 95 programming Intro to Fortran 95 programming 4 Intro to Fortran 95 programming
20 Intro to Fortran 95 programming Compiling and linking Fortran programs Scientific Hello World in Fortran 95 Usage:./hw1 2.3 Output of the program hw1 Hello, World! sin(2.3)= What to learn 1 Store the first command-line argument in a floating-point variable 2 Call the sine function 3 Write a combination of text and numbers to the screen
21 Intro to Fortran 95 programming Compiling and linking Fortran programs The code PROGRAM hw1 IMPLICIT NONE DOUBLE PRECISION :: r, s CHARACTER(LEN=80) :: argv! Input argument CALL getarg(1,argv)! A C-function r = a2d(argv)! Our own ascii to s = SIN(r) PRINT *, Hello Word sin(,r, )=,s END PROGRAM hw1! double! The intrinsic SINE! function
22 Intro to Fortran 95 programming Compiling and linking Fortran programs Dissection(1) Contrary to C++ the compiler does not need to se a declaration of subroutines and intrinsic functions Only external functions must be declared Comments in Fortran 95 are the! on a line The code is free format unlike Fortran 77
23 Intro to Fortran 95 programming Compiling and linking Fortran programs Dissection(2) All programs written in Fortran begins with the statement PROGRAM program name and ends with the statement END with the optional PROGRAM program name Unlike C++ and other programming language Fortran has no built in transfer of command line arguments A call to a C-function getarg(n,argv) transfers the n th argument to the character-string variable argv
24 Intro to Fortran 95 programming Compiling and linking Fortran programs Dissection(2) Floating point variables in Fortran 1 REAL: single precision 2 DOUBLE PRECISION: double precision a2d: your own ascii string to double function, Fortran has no intrinsic functions of this kind in contrast to C/C++ so you have to write this one yourself Automatic type conversion: DOUBLE PRECISION = REAL The SIN() function is an intrinsic function and does not need a specific declaration
25 Intro to Fortran 95 programming Compiling and linking Fortran programs An interactive version Let us ask the user for the real number instead of reading it from the command line WRITE(*.FMT= (A),ADVANCE= NO ) Give a real number: READ(*,*) r s = SIN(r)! etc.
26 Intro to Fortran 95 programming Compiling and linking Fortran programs Scientific Hello World in Fortran 77 C PROGRAM hw1 REAL*8 r,s CHARACTER*80 argv CALL getarg(1,argv) r = a2d(argv) s = SIN(r) WRITE(*,*) Hello World! sin(,r )=,s END PROGRAM hw1
27 Intro to Fortran 95 programming Compiling and linking Fortran programs Differences from the Fortran 95 version Fortran 77 uses REAL*8 instead of DOUBLE PRECISION Fortran 77 lacks IMPLICIT NONE directive A double precision variable has to be declared in Fortran 77 since default real numbers are single precision
28 Intro to Fortran 95 programming Compiling and linking Fortran programs Compiling and linking Fortran programs 5 Compiling and linking Fortran 95 programs
29 Compiling and linking Fortran 95 programs Manipulate data files How to compile and link (Fortran 95) One step (compiling and liking): unix> f90 -Wall -O3 -o hw1 hw1.f90 Two steps: unix> f90 -Wall -O3 -c hw1.f90 #Compile, result: hw1.o unix> f90 -o hw1 hw1.o # Link A linux system with Intel Fortran Compiler: linux> ifort -Wall -O3 -o hw1 hw1.f90
30 Compiling and linking Fortran 95 programs Manipulate data files Using the make utility to compile a program What is the make utility? the make utility reads a file containing the name(s) of the file(s) to be compiled togehter with the name of the executable program The makefile is either called makefile or Makefile as default Invoking the make utiltity: unix-linux> make
31 Compiling and linking Fortran 95 programs Manipulate data files A short example of a makefile FC= f90 $(shell ls *.f90./srclist) SRC=$(shell cat./srclist) OBJECTS= $(SRC:.f90=.o) prog : $(OBJECTS) $(FC) -o $@ $(OBJECTS) %.o : %.f90 $(FC) -c $?
32 Compiling and linking Fortran 95 programs Manipulate data files Rolling yourown make script The main feature of a makefile is to check time stamps in files and only recompile the required files Since the syntax of a makefile is kind of awkward and each flavour of unix has its own specialities you can make your own script doing almost the same
33 Compiling and linking Fortran 95 programs Manipulate data files The looks of the make.sh script(1) #!/bin/sh if [! -n $F90_COMPILER ]; then case uname -s in Linux) F90_COMPILER=ifort F90_OPTIONS= -Wall -O3 ;; *) F90_COMPILER=f90 F90_OPTIONS= -Wall -O3 esac fi
34 Compiling and linking Fortran 95 programs Manipulate data files The looks of the make.sh script(2) files= /bin/ls *.f90 for file in files; do stem= echo $file sed s/\.f90// echo $F90_COMPILER $F90_OPTIONS -I. -o $stem $file $F90_COMPILER $F90_OPTIONS -I. -o $stem $file ls -s stem done
35 Compiling and linking Fortran 95 programs Manipulate data files How to compile and link (Fortran 77) Either use the f90 compiler or if present the f77 compiler Rememeber that Fortran 77 is s subset of Fortran 95 An example: f90 -o prog prog.f or f77 -o prog prog.f
36 Compiling and linking Fortran 95 programs Manipulate data files How to compile and linkin general We compile a set of programs in Fortran and C++ Compile each set of files with the right compiler: unix$>$ f90 -O3 -c *.f90 unix$>$ g++ -O3 -c *.cpp Then link: unix$>$ f90 -o exec\_file -L/some/libdir \\ -L/other/libdir *.o -lmylib -lyourlib Library type: lib*.a: static; lib*.so: dynamic
37 Compiling and linking Fortran 95 programs Manipulate data files Manipulate data files 6 Manipulate data files
38 Manipulate data files File handling in Fortran Example: Data transformation Suppose we have a file with xy-data and that we want to transform the y data using some mathematical function f(y) Goal: write a Fortran 95 program that reads the file, transforms the y data and write the new xy-data to a new file
39 Manipulate data files File handling in Fortran Program structure 1 Read the names of input and output files as command-line arguments 2 Print error/usage message if less than two command-line arguments are given 3 Open the files 4 While more data in the file: read x and y from the input file set y=myfunc(y) write x and y to the output file 5 Close the files
40 Manipulate data files File handling in Fortran The fortran 95 code(1) FUNCTION myfunc(y) RESULT(r) IMPLICIT NONE DOUBLE PRECISION, INTENT(IN) :: y DOUBLE PRECISION :: r IF(y>=0.) THEN r = y**0.5*exp(-y) ELSE r = 0. END IF END FUNCTION myfunc
41 Manipulate data files File handling in Fortran The fortran 95 code(2) PROGRAM dtrans IMPLICIT NONE INTEGER :: argc, rstat DOUBLE PRECISION :: x, y CHARACTER(LEN=80) :: infilename, outfilename INTEGER,PARAMETER :: ilun = 10 INTEGER,PARAMETER :: olun = 11 INTEGER, EXTERNAL :: iargc argc = iargc() IF (argc < 2) THEN PRINT *, Usage: dtrans infile outfile STOP END IF CALL getarg(1,infilename) CALL getarg(2,outfilename)
42 Manipulate data files File handling in Fortran The fortran 95 code(3) OPEN(UNIT=ilun,FILE=infilename,FORM= FORMATTED,& IOSTAT=rstat) OPEN(UNIT=olun,FILE=outfilename,FORM= FORMATTED,& IOSTAT=rstat) rstat = 0 DO WHILE(rstat == 0) READ(UNIT=ilun,FMT= (F3.1,X,F3.1),IOSTAT=rstat)& x, y IF(rstat /= 0) THEN CLOSE(ilun) CLOSE(olun) STOP END IF y = myfunc(y) WRITE(UNIT=olun,FMT= (F3.1,X,F3.1),IOSTAT=rstat)& x, y
43 Manipulate data files File handling in Fortran File handling in Fortran 7 File handling in Fortran
44 File handling in Fortran Arrays and loops Fortran file opening Open a file for reading OPEN(UNIT=ilun,FORM= FORMATTED,IOSTAT=rstat) Open a file for writing OPEN(UNIT=ilun,FORM= FORMATTED,IOSTAT=rstat) Open for appending data OPEN(UNIT=ilun,FORM= FORMATTED,& POSITION= APPEND,IOSTAT=rstat)
45 File handling in Fortran Arrays and loops Fortran file reading and writing Read a double precision number READ(UNIT=ilun,FMT= (F10.6),IOSTAT=rstat) x Test if the reading was successful IF(rstat /= 0) STOP Write a double precision number WRITE(UNIT=olun,FMT= (F20.12),IOSTAT=rstat) x
46 File handling in Fortran Arrays and loops Formatted output The formatted output in Fortran is selected via the FORMAT of FMT statement In fortran 77 the FORMAT statement is used C FORMAT(F15.8) WRITE(*,100) x In Fortran 95 the FMT statement is used WRITE(*,FMT= (F15.8) ) x
47 File handling in Fortran Arrays and loops A convenient way of formatting in Fortran 95(1) Instead of writing the format in the FMT statement we can put it in a string variable CHARACTER(LEN=7) :: fmt_string fmt_string = (F15.8) WRITE(*,FMT=fmt_string) x
48 File handling in Fortran Arrays and loops A convenient way of formatting in Fortran 95(2) We can use a set of such format strings CHARACTER(LEN=7),DIMENSION(3) fmt_string(1) = (F15.8) fmt_string(2) = (2I4) fmt_string(3) = (3F10.2) WRITE(*,FMT=fmt_string(1)) x :: fmt_string
49 File handling in Fortran Arrays and loops Unformatted I/O in Fortran More often than not we use huge amount of data both for input and output Using formatted data increase both the filesize and the time spent reading and writing data from/to files We therefore use unformatted data in these cases
50 File handling in Fortran Arrays and loops Opening and reading an unformatted file Open syntax: OPEN(UNIT=ilun,FILE=infile,FORM= UNFORMATTED,& IOSTAT=rstat) Reading syntax: READ(UNIT=ilun,IOSTAT=rstat) array the array variable can be a vector or a multidimensional matrix
51 File handling in Fortran Arrays and loops Using direct access file I/O In some cases it is advantageous to be able to read and write the same portion of a file without reading it sequentially from start This is performed by using direct access file I/O Open syntax: OPEN(UNIT=ilun,FILE=infile,ACCESS= DIRECT,& RECL=lng,IOSTAT=rstat) Reading syntax: READ(UNIT=ilun,REC=recno,IOSTAT=rstat) array The array most be of equal size to the record length and the recno variable contains the record number to be read The records are numbered from 1 and up
52 File handling in Fortran Arrays and loops The namelist file A special type of file exists in Fortran 95 It is the namelist file which is used for input of data mainly for inititalizing purposes Reading syntax: INTEGER :: i, j, k NAMELIST/index/i, j, k READ(UNIT=ilun,NML=index,IOSTAT=rstat) This will read from the namelist file values into the variables i, j, k
53 File handling in Fortran Arrays and loops The contents of a namelist file Namelist file syntax: &index i=10, j=20, k=4 / A namelist file can contain more than one namelist
54 File handling in Fortran Arrays and loops Arrays and loops 8 Arrays and loops
55 Arrays and loops Subroutines and functions in Fortran Matrix-vector product Goal: calculate a matrix-vector product Make s simple example with known solution (simplifies debugging) Declare a matrix A and vectors x and b Initialize A Perform b = A x Check that b is correct
56 Arrays and loops Subroutines and functions in Fortran Basic arrays in Fortran Fortran 77 and 95 uses the same basic array construction Array indexing follows a quickly learned syntax: q(3,2) which is the same as in Matlab. Note that in C/C++ a multi dimensional array is transposed
57 Arrays and loops Subroutines and functions in Fortran Declaring basic vectors Declaring a fixed size vector INTEGER, PARAMETER :: n = 100 DOUBLE PRECISION, DIMENSION(n) :: x DOUBLE PRECISION, DIMENSION(50) :: b Vector indices starts at 1 not 0 like C/C++
58 Arrays and loops Subroutines and functions in Fortran Looping over a vector A simple loop INTEGER :: i DO i = 1, n x(i) = f(i) END DO! Definition of a function DOUBLE PRECISION FUNCTION f(i) INTEGER :: i... END FUNCTION f
59 Arrays and loops Subroutines and functions in Fortran Declaring baxic matrices Declaring a fixed size matrix INTEGER, PARAMETER :: m = 100 INTEGER, PARAMETER :: n = 100 DOUBLE PRECISION, DIMENSION(m,n) :: x Matrix indices starts at 1 not 0 like C/C++
60 Arrays and loops Subroutines and functions in Fortran Looping over the matrix A nested loop INTEGER :: i, j DO j = 1, n DO i = 1, n A(i,j) = f(i,j) END DO END DO
61 Arrays and loops Subroutines and functions in Fortran Note: matices are stored column wise; the row index should vary fastest Recall that in C/C++ matrices are stored row by row Typical loop in C/C++ (2nd index in inner loop): DO i = 1, m DO j = 1, n A(i,j) = f(i,j) END DO END DO We now traverse A in jumps
62 Arrays and loops Subroutines and functions in Fortran Dynamic memory allocation Very often we do not know the length of the array in advance By using dynamic memory allocation we can allocate the necessary chunk of memory at runtime You need to allocate and deallocate memory
63 Arrays and loops Subroutines and functions in Fortran Dynamic memeory allocation in Fortran 77 Static memory allocation (at compile time): DOUBLE PRECISION, DIMENSION(100) :: x Dynamic memory allocation (at runtime): DOUBLE PRECISION, ALLOCATABLE, DIMENSION(:) :: x ALLOCATE(x(100))... DEALLOCATE(x)
64 Arrays and loops Subroutines and functions in Fortran Dynamic memeory allocation in Fortran 95 Theare are two ways of declaring allocatable matrices in Fortran 95 Using the same attrribute ALLOCATABLE like in Fortran 77 Using a POINTER variable
65 Arrays and loops Subroutines and functions in Fortran Allocating memory using a POINTER Declare a pointer array variable DOUBLE PRECISION, POINTER ALLOCATE(x(100))... DEALLOCATE(x) :: x(:) Keep in mind that a Fortran 95 POINTER is not the same as a pointer in C/C++
66 Arrays and loops Subroutines and functions in Fortran Declaring and initializing A, x and b DOUBLE PRECISION, POINTER :: A(:,:), x(:), b(:) CHARACTER(LEN=20) :: str INTEGER :: n, i, j CALL getarg(1,str) n = a2i(str) ALLOCATE(A(n,n)); ALLOCATE(x(n)) ALLOCATE(b(n)) DO j = 1, n x(j) = j/2. DO i = 1, n A(i,j) = 2. + i/j END DO END DO
67 Arrays and loops Subroutines and functions in Fortran Matrix-vector product loop Computation DOUBLE PRECISION :: sum DO j = 1, n sum = 0. DO i = 1, n sum = sum + A(i,j) * x(i) END DO b(j) = sum END DO
68 Arrays and loops Subroutines and functions in Fortran Arrays and loops 9 Subroutines and functions in Fortran
69 Subroutines and functions in Fortran Pointers in Fortran 95 Subroutines A subroutine do not return any value and is the same as a void function in C/C++ In Fortran all aguments are passed as the address of the variable in the calling program This is the same as a call by refrence in C++ It is easy to for a C++ programmer to forget this and accidentally change the contents of the variable in the calling program
70 Subroutines and functions in Fortran Pointers in Fortran 95 An example of a subroutine This subroutine will calculate the square root of two arguments and returning the sum of the results in a third argument SUBROUTINE dsquare(x,y,z) DOUBLE PRECISION, INTENT(IN) :: x, y DOUBLE PRECISION, INTENT(OUT) :: z z = SQRT(x) + SQRT(y) END SUBROUTINE dsquare Using the INTENT(IN) and INTENT(OUT) will prevent any accidentally changes of the variable(s) in the calling program
71 Subroutines and functions in Fortran Pointers in Fortran 95 Functions A function always return a value just like corresponding functions in C/C++ The syntax of the function statement can be written in two ways depending on the fortran version In Fortran 77 it looks like a corresponding C++ function But in fortran 95 another syntax has been introduced
72 Subroutines and functions in Fortran Pointers in Fortran 95 An example of a function Fortran 77 style This function will calculate the square root of two arguments and returning the sum of the results DOUBLE PRECISION, FUNCTION dsquare(x,y) DOUBLE PRECISION, INTENT(IN) :: x, y DOUBLE PRECISION :: z z = SQRT(x) + SQRT(y) dsquare = z END FUNCTION dsquare
73 Subroutines and functions in Fortran Pointers in Fortran 95 An example of a function Fortran 95 style This function will calculate the square root of two arguments and returning the sum of the results FUNCTION dsquare(x,y), RESULT(z) DOUBLE PRECISION, INTENT(IN) :: x, y DOUBLE PRECISION :: z z = SQRT(x) + SQRT(y) END FUNCTION dsquare
74 Subroutines and functions in Fortran Pointers in Fortran 95 Pointers in Fortran Pointers in Fortran 95
75 Pointers in Fortran 95 Exercisex More about pointers in Fortran 95 As mentioned earlier a pointer in Fortran 95 IS NOT the same as a pointer in C/C++ A fortran 95 pointer is used as an alias to another variable, it beeing a single variable, a vector or a multidimensional array A pointer must be associated with a target variable or another pointer
76 Pointers in Fortran 95 Exercisex Some examples of pointer usage(1) A target pointer example DOUBLE PRECISION, TARGET, DIMENSION(100) :: x DOUBLE PRECISION, POINTER :: y(:)... y => x... y => x(20:80)... y => x(1:33) NULLIFY(y)
77 Pointers in Fortran 95 Exercisex Some examples of pointer usage (2) What happens when we try to access a deallocated array? PROGRAM ptr IMPLICIT NONE DOUBLE PRECISION, POINTER :: x(:) DOUBLE PRECISION, POINTER :: y(:) ALLOCATE(x(100)) x = 0. x(12:19) = 3.14 y => x(10:20) PRINT (A,3F10.4), Y-value, y(1:3) y => x(11:14) DEALLOCATE(x) PRINT (A,3F10.4), Y-value, y(1:3) PRINT (A,4F10.4), X-value, x(11:14) END PROGRAM ptr
78 Pointers in Fortran 95 Exercisex Some examples of pointer usage(3) This is what happened bullet.uio.no$ EXAMPLES/ptr forrtl: severe (174): SIGSEGV, segmentation fault occurred When we try to access the x-array in the last PRINT statement we get an segmentation fault This means we try to access a variable which is not associated with any part of the memory the program has access to
79 Pointers in Fortran 95 Exercisex Some examples of pointer usage(4) In our little example we clearly see that the memory pointed to by the x-array is no longer available On the other hand the part of the memory the y-array is pointing to is still available To free the last part of memory the y-array refers to we must nullify the y-array: NULLIFY(y)
80 Exercises Pointers in Fortran 95 Exercisex 11 Exercises
81 Exercises Modules Exercise1: Modify the Fortran 95 Hello World program Locate the first Hello World program Compile the program and test it Modification: write Hello World! and format it so the text and numbers are without unnecessary spaces
82 Exercises Modules Exercise2: Extend the Fortran 95 Hello World program Locate the first Hello World program Read the three command-line arguments: start, stop and inc Provide a usage message and abort the program in case there are too few command-line arguments Do r = start, stop, inc and compute the sine of r and write the result Write and additional loop using DO WHILE construction Verify that the program works
83 Exercises Modules Exercise3: Integrate a function(1) Write a function DOUBLE PRECISION FUNCTION trapezoidal(f,a,b,n) DOUBLE PRECISION, EXTERNAL :: f DOUBLE PRECISION :: a, b INTEGER :: n... END FUNCTION trapezoidal that integrate a user-defined function f between a and b using the Trapezoidal rule with n points: f (a) f (x) dx h( 2 + f (b) 2 + n 1 b a i=1 f (a + ih)), h = n 1 b a
84 Exercises Modules Exercise3: Integrate a function(2) The user defined function is specified as external in the argument specifications in the trapezoidal function Any function taking a double precision as an argument and returning a double precision number can now be used as an input argument to the trapezoidal function Verify that trapeziodal is implemented correctly
85 Binary format Exercises Modules A number like π can be represented in ASCII format as 3.14 (4 bytes) or E + 00 (11 bytes), for instance In memory, the number occupies 8 bytes (a double), this is the binary format of the number The binary format (8 bytes) can be stored directly in files Binary format (normally) saves space, and input/output is much faster since we avoid translation between ASCII characters and the binary repr. The binary format varies with the hardware and occasionally with the compiler version Two types of binary formats: little and big endian Motorola and Sun: big endian; Intel and Compaq: little endian
86 Exercises Modules Exercise4: Work with binary data in Fortran 77 (1) Scientific simulations often involve large data sets and binary storage of numbers saves space in files How to write numbers in binary format in Fortran 77: WRITE(UNIT=olun) array
87 Exercises Modules Exercise: Work with binary data in Fortran 77 (2) Create datatrans2.f (from datatrans1.f) such that the input and output data are in binary format To test the datatrans2.f we need utilities to create and read binary files 1 make a small Fortran 77 program that generates n xy-pairs of data and writes them to a file in binary format (read n from the command line) 2 make a small Fortarn 77 program that reads xy-pairs from a binary file and writes them to the screen With these utiltities you can create input data to datatrans2.f and view the file produced by datatrans2.f
88 Exercises Modules Exercise: Work with binary data in Fortran 77 (3) Modify datatrans2.f program such that the x and y numbers are stored in one long dynamic array The storage structure should be x1, y1, x2, y2,... Read and write the array to file in binary format using one READ and one WRITE call Try to generate a file with a huge number ( ) of pairs and use the unix time command to test the efficiency of reading/writing a single array in one READ/WRITE call compared with reading/writing each number separately
89 Exercises Modules Exercise 4: Work with binary data in Fortran 75 Do the Fortran 77 version of the exercise first! How to write numbers in binary format in Fortran 95 WRITE(UNIT=olun, IOSTAT=rstat) array Modify datatrans1.f90 program such that it works with binary input and output data (use the Fortran 77 utilities in the previous exercise to create input file and view output file)
90 Exercises Modules Exercise 6: Efficiency of dynamic memory allocation(1) Write this code out in detail as a stand-alone program: INTEGER, PARAMETER :: nrepetitions = INTEGER :: i, n CHARACTER(LEN=80) :: argv CALL getarg(1,argv) n = a2i(argv) DO i = 1, nrepetitions! allocate a vector of n double precision numbers! set second entry to something 1 deallocate the vector END DO
91 Exercises Modules Exercise 6: Efficiency of dynamic memory allocation(2) Write another program where each vector entry is allocated separately: INTEGER :: i, j DOUBLE PRECISION :: sum DO i = 1, nrepetitions! allocate each of the double precision!numbers separately DO j = 1, n! allocate a double precision number! add the value of this new item to sum! deallocate the double precision number END DO END DO
92 Exercises Modules Exercise : Efficiency of dynamic memory allocation(3) Measure the CPU time of vector allocation versus allocation of individual entries: unix> time myprog1 unix> time myprog2 Adjust the nrepetitions such that the CPU time of the fastest method is of order 10 seconds
93 Modules Exercises Modules 12 Modules
94 Modules A simple module Traditional programming Traditional programming: subroutines/procedures/functions data structures = variables, arrays data are shuffled between functions Problems with procedural approach Numerical codes are usually large, resulting in lots of functions with lots of arrays(large and their dimensions) Too many visible details Little correspondence between mathematical abstraction and computer code Redesign and reimplementation tend to be expensive
95 Modules A simple module Introduction to modules Modules was introduced in Fortran with the Fortran 90 standard A module can be looked upon as some sort of a class in C++ The module lacks some of the features of the C++ class so until Fortran 2003 is released we cannot use the OOP approach But we can use modules as objects and get something like the OOP style
96 Modules A simple module Programming with objects Programming with objects makes it easier to handle large and complicated code: Well-known in computer science/industry Can group large amounts of data (arrays) as a single variable Can make different implementation look the same for a user Not much explored in nummerical computing (until late 1990s)
97 Modules A simple module Example: programming with matrices Mathematical problem: Mattrix-matrix product: C = MB Matdix-vector product: y = Mx Points to consider: What is a matrix A well defined mathematical quantity, containing a table of numbers and a set of legal operations How do we program with matrices? Do standard arrays in any computer language give good enough support for matrices?
98 Modules A simple module A dense matrix in Fortran 77(1) Fortran 77 syntax c integer p, q, r real*8 M, B, C dimension(p,q) M dimension(q,r) B dimension(p,r) C real*8 y, x dimension(p) y dimension(q) x C matrix-matrix product: C = M*B call prodm(m,p,q,b,q,r,c) C matrix-vector product y = M*x call prodv(m,p,q,x,y)
99 Modules A simple module A dense matrix in Fortran 77(2) Drawback with this implementation Array sizes must be explicitly transferred New routines for different precisions
100 Modules A simple module Working qith a dense matrix in Fortran 95 DOUBLE PRECISION, DIMENSION(p,q) :: M DOUBLE PRECISION, DIMENSION(q,r) :: B DOUBLE PRECISION, DIMENSION(p,r) :: C DOUBLE PRECISION, DIMENSION(p) :: x DOUBLE PRECISION, DIMENSION(q) :: y M(j,k) = 3.14 C = MATMUL(M,b) y = MATMUL(M,x) Observe that We hide information about array sizes we hide storage structure the computer code is as compact as the mathematical notation
101 Modules A simple module Array declarations in Fortran 95 In Fortran 95 an array is in many ways like a C++ class, but with less functionality A Fortran 95 array contains information about the array structure and the length of each dimension As a part of the Fortran 95 language, functions exists to extract the shape and dimension(s) from arrays This means we no loger have to pass the array sizes as part of a function call
102 Modules A simple module What is this module, class or object A module is a collection of data structures and operations on them It is not a new type of variable, but a TYPE construct is A module can use other modules so we can create complex units which are easy to program with
103 Modules A simple module Extensions to sparse matrices Matrix for the discretization of 2 u = f Only 5n out of n 2 entries are nonzero Store only the nonzero entries! Many iterative solution methods for Au = b can operate on the nonzeroes only
104 Modules A simple module How to store sparse matrices(1) A = a 1,1 0 0 a 1,4 0 0 a 2,2 a 2,3 0 a 2,5 0 a 3,2 a 3,3 0 0 a 4,1 0 0 a 4,4 a 4,5 0 a 5,2 0 a 5,5 a 5,5 (1) Working with nonzeroes only is important for efficiency
105 Modules A simple module How to store sparse matrices(2) The nonzeroes can be stacked in a one-dimensional array Need two extra arrays to tell where a column starts and the row index of a nonzero A = (a1, 1, a1, 4, a2, 2, a2, 3, a2, 5,... irow = (1, 3, 6, 8, 11, 14) jcol = (1, 4, 2, 3, 5, 2, 3, 1, 4, ) (2) more complicated data structures and hence more complicated programs
106 Modules A simple module Sparse matrices in Fortran 77 Code example for y = Mx integer p, q, nnz integer irow(p+1), jcol(nnz) double precision M(nnz), x(q), y(p)... call prodvs(m, p, q, nnz, irow, jcol, x, y) Two major drawbacks: Explicit transfer of storeage structure (5 args) Different name for two functions that perform the same task on two different matrix formats
107 Modules A simple module Sparse matrix as a Fortran 95 module(1) MODULE mattypes TYPE sparse DOUBLE PRECISION, POINTER :: A(:)! long vector with! matrix entries INTEGER, POINTER :: irow(:)! indexing array INTEGER, POINTER :: jcol(:)! indexing array INTEGER :: m, n! A is logically! m times n INTEGER :: nnz! number of nonzero END TYPE sparse END MODULE mattypes
108 Modules A simple module Sparse matrix as a Fortran 95 module(1) MODULE matsparse USE mattypes TYPE(sparse),PRIVATE :: hidden_sparse CONTAINS SUBROUTINE prod(x, z) DOUBLE PRECISION, POINTER :: x(:), z(:)... END SUBROUTINE prod END MODULE matsparse
109 Modules A simple module Sparse matrix as a Fortran 95 module(2) What has been gained? Users cannot see the sparse matrix data structure Matrix-vector product syntax remains the same The usage of sparse and dense matrix is the same Easy to switch between the two
110 Modules A simple module The jungle of matrix formats When solving PDEs by finite element/difference methods there are numerous advantageous matrix formats: dense matrix banded matrix tridiagonal matrix general sparse matrix structured sparse matrix diagonal matrix finite differece stencil as a matrix The efficiency of numerical algorithms is often strongly dependend on the matrix storage scheme Goal: hide the details of the storage schemes
111 Modules A simple module Objects, modules and types Module matsparse = object Details of storage schemes are partially hidden Extensions in the module for interfaces to matrix operations Extensions in the module mattypes for specific storage schemes
112 Bad news Modules A simple module Programming with modules can be a great thing, but it might be inefficient Adjusted picture: When indexing a matrix, one needs to know its data storage structure because of efficiency Module based numerics: balance between efficiency and the use of objects
113 A simple module Modules A simple module 12 Modules
114 A simple module Modules and Operator Overloading A simple module example We want to avoid the problems which often occurs when we need to use global variables We starts out showing the Fortran 77 code for global variables with an example of a problem using them Then we show the Fortran 95 module avoiding this particular problem
115 A simple module Modules and Operator Overloading Modules and common blocks In Fortran 77 we had to use what is called a common block This common block is used to give a name to the part of the memory where we have global variables INTEGER i, j REAL x, y COMMON /ints/ i,j COMMON /floats/ x, y One problem here is that the variables in a common block is position dependent
116 A simple module Modules and Operator Overloading Common blocks An example of an error in the use of a common block SUBROUTINE t1 REAL x,y COMMON /floats/ y, x PRINT *, y END SUBROUTINE t1 Here we use the common block floats with the variables x and y The problem is that we have put y before x in the common declaration inside the subroutine What we are printing out is not the value of y, but that of x
117 A simple module Modules and Operator Overloading Use a module for global variables(1) To avoid the previous problem we are using a module to contain the global variables In a module it is the name of the variable and not the position that counts Our global variables in a module: MODULE global INTEGER :: i, j REAL :: x, y END MODULE global
118 A simple module Modules and Operator Overloading Use a module for global variables(2) Accessing a module and its varaibles SUBROUTINE t1 USE global PRINT *, y END SUBROUTINE t1 Now we are printing the value of variable y and not x as we did in the previous Fortran 77 example This is because we now are using the variable names directly and not the name of the common block
119 A simple module Modules and Operator Overloading Modules and Operator Overloading 12 Modules
120 Modules and Operator Overloading Doing arithmetic on derived datatypes We have a derived datatype: TYPE mytype INTEGER :: i REAL, POINTER :: rvector(:) DOUBLE PRECISION, POINTER :: darray(:,:) END TYPE mytype To be able to perform arithmetic operations on this derived datatype we need to create a module which does the job We want to overload the operators +, -, *, /, =
121 Modules and Operator Overloading Operator overloading(1) What is operator overloading? By this we mean that we extends the functionality of the intrinsic operators +, -, *, /, = to also perform the operations on other datatypes How do we do this in Fortran 95?
122 Modules and Operator Overloading Operator overloading(2) This is how: MODULE overload INTERFACE OPERATOR(+) TYPE(mytype) FUNCTION add(a,b) USE typedefs TYPE(mytype), INTENT(in) :: a TYPE(mytype), INTENT(in) :: b END FUNCTION add END INTERFACE END MODULE overload We have now extended the traditional addition functionality to also incorporate our derived datatype mytype We extends the other operators in the same way except for the equal operator
123 Modules and Operator Overloading Operator overloading(3) What the do we do to extend the equal operator? Not so very different than from the others MODULE overload INTERFACE ASSIGNMENT(=) SUBROUTINE equals(a,b) USE typedefs TYPE(mytype), INTENT(OUT) :: a TYPE(mytype), INTENT(IN) END SUBROUTINE equals END INTERFACE END MODULE overload :: b
124 Modules and Operator Overloading Operator overloading(4) Some explanations of what we have done The keywords INTERFACE OPERATOR signal to the compiler that we want to extend the default operations of the operator IN the same way we signal to the compiler we want to extend the default behaviour of the assignment by using the keyword it INTERFACE ASSIGNMENT The difference between the assignment and operator implementation is that the first is implemented using a subroutine while the others are implemented using a function
125 Modules and Operator Overloading Implementation of the multiplication operator(1) The multiplication operator for mytype FUNCTION multiply(a,b) RESULT(c) USE typedefs TYPE(mytype), INTENT(in) :: a TYPE(mytype), INTENT(in) :: b TYPE(mytype) :: c INTEGER :: rstat ALLOCATE(c%rvector(5),STAT=rstat) IF(rstat /= 0) THEN PRINT *, Error in allocating x.rvector, rstat END IF... It is important to remember that the implementation of the operators is in a separate file
126 Modules and Operator Overloading Implementation of the multiplication operator(2) The multiplication operator for mytype... ALLOCATE(c%darray(5,5),STAT=rstat) IF(rstat /= 0) THEN PRINT *, Error in allocating x.darray, rstat END IF c%i = a%i * b%i c%rvector = a%rvector * b%rvector c%darray = a%darray * b%darray END FUNCTION multiply It is important to remember to allocate the memory space for the result of the multiplication. Unless you do this the program will crash
127 Modules and Operator Overloading How we implement the assignment operator The assigmnent operator for mytype SUBROUTINE equals(a,b) USE typedefs TYPE(mytype), INTENT(OUT) :: a TYPE(mytype), INTENT(IN) :: b a%i = b%i a%rvector = b%rvector a%darray = b%darray END SUBROUTINE equals It is important to remember that the implementation of the assignment is in a separate file
128 Modules and Operator Overloading What have we really done in these two examples(1) The multiply function takes two input arguments and returns a variable of mytype To avoid mistakes of changing the value of any of the two arguments both have the attibute INTENT(IN) In C++ we would typically use the keyword const as an attribute to the argument The default for attribute for arguments to functions and subroutines in Fortran is INTENT(INOUT) which allowes us to modify the argument Fortran has the nice feature that we can multiply an array with another provided they have the same shape and size. We therefore does not need to go through one or more loops to perform the multiplication
129 Modules and Operator Overloading What have we really done in these two examples(2) The assigment is implemented using a subroutine Like in the multiplicaion we use the INTENT(IN) attribute to the second argument To the first argument we use the INTENT(OUT) attribute to signal that this argument is for the return of a value only
130 Modules and Operator Overloading
Chapter 7: Additional Topics
Chapter 7: Additional Topics In this chapter we ll briefly cover selected advanced topics in fortran programming. All the topics come in handy to add extra functionality to programs, but the feature you
Embedded Systems. Review of ANSI C Topics. A Review of ANSI C and Considerations for Embedded C Programming. Basic features of C
Embedded Systems A Review of ANSI C and Considerations for Embedded C Programming Dr. Jeff Jackson Lecture 2-1 Review of ANSI C Topics Basic features of C C fundamentals Basic data types Expressions Selection
WESTMORELAND COUNTY PUBLIC SCHOOLS 2011 2012 Integrated Instructional Pacing Guide and Checklist Computer Math
Textbook Correlation WESTMORELAND COUNTY PUBLIC SCHOOLS 2011 2012 Integrated Instructional Pacing Guide and Checklist Computer Math Following Directions Unit FIRST QUARTER AND SECOND QUARTER Logic Unit
Programming Languages & Tools
4 Programming Languages & Tools Almost any programming language one is familiar with can be used for computational work (despite the fact that some people believe strongly that their own favorite programming
Sources: On the Web: Slides will be available on:
C programming Introduction The basics of algorithms Structure of a C code, compilation step Constant, variable type, variable scope Expression and operators: assignment, arithmetic operators, comparison,
An Incomplete C++ Primer. University of Wyoming MA 5310
An Incomplete C++ Primer University of Wyoming MA 5310 Professor Craig C. Douglas http://www.mgnet.org/~douglas/classes/na-sc/notes/c++primer.pdf C++ is a legacy programming language, as is other languages
Topics. Introduction. Java History CS 146. Introduction to Programming and Algorithms Module 1. Module Objectives
Introduction to Programming and Algorithms Module 1 CS 146 Sam Houston State University Dr. Tim McGuire Module Objectives To understand: the necessity of programming, differences between hardware and software,
Name: Class: Date: 9. The compiler ignores all comments they are there strictly for the convenience of anyone reading the program.
Name: Class: Date: Exam #1 - Prep True/False Indicate whether the statement is true or false. 1. Programming is the process of writing a computer program in a language that the computer can respond to
Matrix Multiplication
Matrix Multiplication CPS343 Parallel and High Performance Computing Spring 2016 CPS343 (Parallel and HPC) Matrix Multiplication Spring 2016 1 / 32 Outline 1 Matrix operations Importance Dense and sparse
KITES TECHNOLOGY COURSE MODULE (C, C++, DS)
KITES TECHNOLOGY 360 Degree Solution www.kitestechnology.com/academy.php [email protected] [email protected] Contact: - 8961334776 9433759247 9830639522.NET JAVA WEB DESIGN PHP SQL, PL/SQL
A Fortran 2003 introduction by examples
A Fortran 2003 introduction by examples Gunnar Wollan 2012 1 Introduction The purpose of this book is to give a good insight in the Fortran 2003 programming language.by going through a number of examples
Thomas Jefferson High School for Science and Technology Program of Studies Foundations of Computer Science. Unit of Study / Textbook Correlation
Thomas Jefferson High School for Science and Technology Program of Studies Foundations of Computer Science updated 03/08/2012 Unit 1: JKarel 8 weeks http://www.fcps.edu/is/pos/documents/hs/compsci.htm
The C Programming Language course syllabus associate level
TECHNOLOGIES The C Programming Language course syllabus associate level Course description The course fully covers the basics of programming in the C programming language and demonstrates fundamental programming
The programming language C. sws1 1
The programming language C sws1 1 The programming language C invented by Dennis Ritchie in early 1970s who used it to write the first Hello World program C was used to write UNIX Standardised as K&C (Kernighan
C++ Programming Language
C++ Programming Language Lecturer: Yuri Nefedov 7th and 8th semesters Lectures: 34 hours (7th semester); 32 hours (8th semester). Seminars: 34 hours (7th semester); 32 hours (8th semester). Course abstract
Glossary of Object Oriented Terms
Appendix E Glossary of Object Oriented Terms abstract class: A class primarily intended to define an instance, but can not be instantiated without additional methods. abstract data type: An abstraction
Moving from CS 61A Scheme to CS 61B Java
Moving from CS 61A Scheme to CS 61B Java Introduction Java is an object-oriented language. This document describes some of the differences between object-oriented programming in Scheme (which we hope you
ALLIED PAPER : DISCRETE MATHEMATICS (for B.Sc. Computer Technology & B.Sc. Multimedia and Web Technology)
ALLIED PAPER : DISCRETE MATHEMATICS (for B.Sc. Computer Technology & B.Sc. Multimedia and Web Technology) Subject Description: This subject deals with discrete structures like set theory, mathematical
Information technology Programming languages Fortran Enhanced data type facilities
ISO/IEC JTC1/SC22/WG5 N1379 Working draft of ISO/IEC TR 15581, second edition Information technology Programming languages Fortran Enhanced data type facilities This page to be supplied by ISO. No changes
Jonathan Worthington Scarborough Linux User Group
Jonathan Worthington Scarborough Linux User Group Introduction What does a Virtual Machine do? Hides away the details of the hardware platform and operating system. Defines a common set of instructions.
Memory Systems. Static Random Access Memory (SRAM) Cell
Memory Systems This chapter begins the discussion of memory systems from the implementation of a single bit. The architecture of memory chips is then constructed using arrays of bit implementations coupled
El Dorado Union High School District Educational Services
El Dorado Union High School District Course of Study Information Page Course Title: ACE Computer Programming II (#495) Rationale: A continuum of courses, including advanced classes in technology is needed.
Solution of Linear Systems
Chapter 3 Solution of Linear Systems In this chapter we study algorithms for possibly the most commonly occurring problem in scientific computing, the solution of linear systems of equations. We start
Informatica e Sistemi in Tempo Reale
Informatica e Sistemi in Tempo Reale Introduction to C programming Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa October 25, 2010 G. Lipari (Scuola Superiore Sant Anna)
Introduction to Scientific Computing Part II: C and C++ C. David Sherrill School of Chemistry and Biochemistry Georgia Institute of Technology
Introduction to Scientific Computing Part II: C and C++ C. David Sherrill School of Chemistry and Biochemistry Georgia Institute of Technology The C Programming Language: Low-level operators Created by
Introduction to Python
Introduction to Python Sophia Bethany Coban Problem Solving By Computer March 26, 2014 Introduction to Python Python is a general-purpose, high-level programming language. It offers readable codes, and
Parallel and Distributed Computing Programming Assignment 1
Parallel and Distributed Computing Programming Assignment 1 Due Monday, February 7 For programming assignment 1, you should write two C programs. One should provide an estimate of the performance of ping-pong
Object Oriented Software Design
Object Oriented Software Design Introduction to Java - II Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa October 28, 2010 G. Lipari (Scuola Superiore Sant Anna) Introduction
13 File Output and Input
SCIENTIFIC PROGRAMMING -1 13 File Output and Input 13.1 Introduction To make programs really useful we have to be able to input and output data in large machinereadable amounts, in particular we have to
Object Oriented Software Design
Object Oriented Software Design Introduction to Java - II Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa September 14, 2011 G. Lipari (Scuola Superiore Sant Anna) Introduction
We will learn the Python programming language. Why? Because it is easy to learn and many people write programs in Python so we can share.
LING115 Lecture Note Session #4 Python (1) 1. Introduction As we have seen in previous sessions, we can use Linux shell commands to do simple text processing. We now know, for example, how to count words.
/* File: blkcopy.c. size_t n
13.1. BLOCK INPUT/OUTPUT 505 /* File: blkcopy.c The program uses block I/O to copy a file. */ #include main() { signed char buf[100] const void *ptr = (void *) buf FILE *input, *output size_t
Java CPD (I) Frans Coenen Department of Computer Science
Java CPD (I) Frans Coenen Department of Computer Science Content Session 1, 12:45-14:30 (First Java Programme, Inheritance, Arithmetic) Session 2, 14:45-16:45 (Input and Programme Constructs) Materials
Interpreters and virtual machines. Interpreters. Interpreters. Why interpreters? Tree-based interpreters. Text-based interpreters
Interpreters and virtual machines Michel Schinz 2007 03 23 Interpreters Interpreters Why interpreters? An interpreter is a program that executes another program, represented as some kind of data-structure.
Object Oriented Software Design II
Object Oriented Software Design II C++ intro Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa February 26, 2012 G. Lipari (Scuola Superiore Sant Anna) C++ Intro February 26,
CE 504 Computational Hydrology Computational Environments and Tools Fritz R. Fiedler
CE 504 Computational Hydrology Computational Environments and Tools Fritz R. Fiedler 1) Operating systems a) Windows b) Unix and Linux c) Macintosh 2) Data manipulation tools a) Text Editors b) Spreadsheets
PGR Computing Programming Skills
PGR Computing Programming Skills Dr. I. Hawke 2008 1 Introduction The purpose of computing is to do something faster, more efficiently and more reliably than you could as a human do it. One obvious point
Computer Programming I
Computer Programming I COP 2210 Syllabus Spring Semester 2012 Instructor: Greg Shaw Office: ECS 313 (Engineering and Computer Science Bldg) Office Hours: Tuesday: 2:50 4:50, 7:45 8:30 Thursday: 2:50 4:50,
Fundamentals of Java Programming
Fundamentals of Java Programming This document is exclusive property of Cisco Systems, Inc. Permission is granted to print and copy this document for non-commercial distribution and exclusive use by instructors
Computational Mathematics with Python
Computational Mathematics with Python Basics Claus Führer, Jan Erik Solem, Olivier Verdier Spring 2010 Claus Führer, Jan Erik Solem, Olivier Verdier Computational Mathematics with Python Spring 2010 1
Athena Knowledge Base
Athena Knowledge Base The Athena Visual Studio Knowledge Base contains a number of tips, suggestions and how to s that have been recommended by the users of the software. We will continue to enhance this
CS 141: Introduction to (Java) Programming: Exam 1 Jenny Orr Willamette University Fall 2013
Oct 4, 2013, p 1 Name: CS 141: Introduction to (Java) Programming: Exam 1 Jenny Orr Willamette University Fall 2013 1. (max 18) 4. (max 16) 2. (max 12) 5. (max 12) 3. (max 24) 6. (max 18) Total: (max 100)
CRASH COURSE PYTHON. Het begint met een idee
CRASH COURSE PYTHON nr. Het begint met een idee This talk Not a programming course For data analysts, who want to learn Python For optimizers, who are fed up with Matlab 2 Python Scripting language expensive
THE NAS KERNEL BENCHMARK PROGRAM
THE NAS KERNEL BENCHMARK PROGRAM David H. Bailey and John T. Barton Numerical Aerodynamic Simulations Systems Division NASA Ames Research Center June 13, 1986 SUMMARY A benchmark test program that measures
Overview. Lecture 1: an introduction to CUDA. Hardware view. Hardware view. hardware view software view CUDA programming
Overview Lecture 1: an introduction to CUDA Mike Giles [email protected] hardware view software view Oxford University Mathematical Institute Oxford e-research Centre Lecture 1 p. 1 Lecture 1 p.
Storing Measurement Data
Storing Measurement Data File I/O records or reads data in a file. A typical file I/O operation involves the following process. 1. Create or open a file. Indicate where an existing file resides or where
AMATH 352 Lecture 3 MATLAB Tutorial Starting MATLAB Entering Variables
AMATH 352 Lecture 3 MATLAB Tutorial MATLAB (short for MATrix LABoratory) is a very useful piece of software for numerical analysis. It provides an environment for computation and the visualization. Learning
Computational Mathematics with Python
Boolean Arrays Classes Computational Mathematics with Python Basics Olivier Verdier and Claus Führer 2009-03-24 Olivier Verdier and Claus Führer Computational Mathematics with Python 2009-03-24 1 / 40
ASSEMBLY PROGRAMMING ON A VIRTUAL COMPUTER
ASSEMBLY PROGRAMMING ON A VIRTUAL COMPUTER Pierre A. von Kaenel Mathematics and Computer Science Department Skidmore College Saratoga Springs, NY 12866 (518) 580-5292 [email protected] ABSTRACT This paper
Operation Count; Numerical Linear Algebra
10 Operation Count; Numerical Linear Algebra 10.1 Introduction Many computations are limited simply by the sheer number of required additions, multiplications, or function evaluations. If floating-point
Chapter 1. Dr. Chris Irwin Davis Email: [email protected] Phone: (972) 883-3574 Office: ECSS 4.705. CS-4337 Organization of Programming Languages
Chapter 1 CS-4337 Organization of Programming Languages Dr. Chris Irwin Davis Email: [email protected] Phone: (972) 883-3574 Office: ECSS 4.705 Chapter 1 Topics Reasons for Studying Concepts of Programming
Computational Mathematics with Python
Numerical Analysis, Lund University, 2011 1 Computational Mathematics with Python Chapter 1: Basics Numerical Analysis, Lund University Claus Führer, Jan Erik Solem, Olivier Verdier, Tony Stillfjord Spring
CHM 579 Lab 1: Basic Monte Carlo Algorithm
CHM 579 Lab 1: Basic Monte Carlo Algorithm Due 02/12/2014 The goal of this lab is to get familiar with a simple Monte Carlo program and to be able to compile and run it on a Linux server. Lab Procedure:
Lecture 11 Doubly Linked Lists & Array of Linked Lists. Doubly Linked Lists
Lecture 11 Doubly Linked Lists & Array of Linked Lists In this lecture Doubly linked lists Array of Linked Lists Creating an Array of Linked Lists Representing a Sparse Matrix Defining a Node for a Sparse
An Introduction to Assembly Programming with the ARM 32-bit Processor Family
An Introduction to Assembly Programming with the ARM 32-bit Processor Family G. Agosta Politecnico di Milano December 3, 2011 Contents 1 Introduction 1 1.1 Prerequisites............................. 2
CISC 181 Project 3 Designing Classes for Bank Accounts
CISC 181 Project 3 Designing Classes for Bank Accounts Code Due: On or before 12 Midnight, Monday, Dec 8; hardcopy due at beginning of lecture, Tues, Dec 9 What You Need to Know This project is based on
Good FORTRAN Programs
Good FORTRAN Programs Nick West Postgraduate Computing Lectures Good Fortran 1 What is a Good FORTRAN Program? It Works May be ~ impossible to prove e.g. Operating system. Robust Can handle bad data e.g.
TECHNOLOGY Computer Programming II Grade: 9-12 Standard 2: Technology and Society Interaction
Standard 2: Technology and Society Interaction Technology and Ethics Analyze legal technology issues and formulate solutions and strategies that foster responsible technology usage. 1. Practice responsible
ESPResSo Summer School 2012
ESPResSo Summer School 2012 Introduction to Tcl Pedro A. Sánchez Institute for Computational Physics Allmandring 3 D-70569 Stuttgart Germany http://www.icp.uni-stuttgart.de 2/26 Outline History, Characteristics,
How To Write Portable Programs In C
Writing Portable Programs COS 217 1 Goals of Today s Class Writing portable programs in C Sources of heterogeneity Data types, evaluation order, byte order, char set, Reading period and final exam Important
CS 3530 Operating Systems. L02 OS Intro Part 1 Dr. Ken Hoganson
CS 3530 Operating Systems L02 OS Intro Part 1 Dr. Ken Hoganson Chapter 1 Basic Concepts of Operating Systems Computer Systems A computer system consists of two basic types of components: Hardware components,
Compiling Object Oriented Languages. What is an Object-Oriented Programming Language? Implementation: Dynamic Binding
Compiling Object Oriented Languages What is an Object-Oriented Programming Language? Last time Dynamic compilation Today Introduction to compiling object oriented languages What are the issues? Objects
High-Level Programming Languages. Nell Dale & John Lewis (adaptation by Michael Goldwasser)
High-Level Programming Languages Nell Dale & John Lewis (adaptation by Michael Goldwasser) Low-Level Languages What are disadvantages of low-level languages? (e.g., machine code or assembly code) Programming
Java (12 Weeks) Introduction to Java Programming Language
Java (12 Weeks) Topic Lecture No. Introduction to Java Programming Language 1 An Introduction to Java o Java as a Programming Platform, The Java "White Paper" Buzzwords, Java and the Internet, A Short
Variable Base Interface
Chapter 6 Variable Base Interface 6.1 Introduction Finite element codes has been changed a lot during the evolution of the Finite Element Method, In its early times, finite element applications were developed
CSC230 Getting Starting in C. Tyler Bletsch
CSC230 Getting Starting in C Tyler Bletsch What is C? The language of UNIX Procedural language (no classes) Low-level access to memory Easy to map to machine language Not much run-time stuff needed Surprisingly
Chapter 3: Operating-System Structures. System Components Operating System Services System Calls System Programs System Structure Virtual Machines
Chapter 3: Operating-System Structures System Components Operating System Services System Calls System Programs System Structure Virtual Machines Operating System Concepts 3.1 Common System Components
MPI Hands-On List of the exercises
MPI Hands-On List of the exercises 1 MPI Hands-On Exercise 1: MPI Environment.... 2 2 MPI Hands-On Exercise 2: Ping-pong...3 3 MPI Hands-On Exercise 3: Collective communications and reductions... 5 4 MPI
PART-A Questions. 2. How does an enumerated statement differ from a typedef statement?
1. Distinguish & and && operators. PART-A Questions 2. How does an enumerated statement differ from a typedef statement? 3. What are the various members of a class? 4. Who can access the protected members
HSL and its out-of-core solver
HSL and its out-of-core solver Jennifer A. Scott [email protected] Prague November 2006 p. 1/37 Sparse systems Problem: we wish to solve where A is Ax = b LARGE Informal definition: A is sparse if many
Simple File Input & Output
Simple File Input & Output Handout Eight Although we are looking at file I/O (Input/Output) rather late in this course, it is actually one of the most important features of any programming language. The
Input Output. 9.1 Why an IO Module is Needed? Chapter 9
Chapter 9 Input Output In general most of the finite element applications have to communicate with pre and post processors,except in some special cases in which the application generates its own input.
Chapter 7D The Java Virtual Machine
This sub chapter discusses another architecture, that of the JVM (Java Virtual Machine). In general, a VM (Virtual Machine) is a hypothetical machine (implemented in either hardware or software) that directly
Python Programming: An Introduction to Computer Science
Python Programming: An Introduction to Computer Science Chapter 1 Computers and Programs 1 The Universal Machine n A computer -- a machine that stores and manipulates information under the control of a
QA Analysis of the WRF Program
QA Analysis of the WRF Program WRF Workshop, Boulder Colorado, 26-28th June 2012 Mark Anderson 1 John Collins 1,2,3,4 Brian Farrimond 1,2,4 [email protected] [email protected] [email protected]
Curriculum Map. Discipline: Computer Science Course: C++
Curriculum Map Discipline: Computer Science Course: C++ August/September: How can computer programs make problem solving easier and more efficient? In what order does a computer execute the lines of code
ADVANCED SCHOOL OF SYSTEMS AND DATA STUDIES (ASSDAS) PROGRAM: CTech in Computer Science
ADVANCED SCHOOL OF SYSTEMS AND DATA STUDIES (ASSDAS) PROGRAM: CTech in Computer Science Program Schedule CTech Computer Science Credits CS101 Computer Science I 3 MATH100 Foundations of Mathematics and
1 The Java Virtual Machine
1 The Java Virtual Machine About the Spec Format This document describes the Java virtual machine and the instruction set. In this introduction, each component of the machine is briefly described. This
Building Applications Using Micro Focus COBOL
Building Applications Using Micro Focus COBOL Abstract If you look through the Micro Focus COBOL documentation, you will see many different executable file types referenced: int, gnt, exe, dll and others.
Object Oriented Software Design II
Object Oriented Software Design II Introduction to C++ Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa February 20, 2012 G. Lipari (Scuola Superiore Sant Anna) C++ Intro February
Compiler Construction
Compiler Construction Lecture 1 - An Overview 2003 Robert M. Siegfried All rights reserved A few basic definitions Translate - v, a.to turn into one s own language or another. b. to transform or turn from
Chapter 5 Names, Bindings, Type Checking, and Scopes
Chapter 5 Names, Bindings, Type Checking, and Scopes Chapter 5 Topics Introduction Names Variables The Concept of Binding Type Checking Strong Typing Scope Scope and Lifetime Referencing Environments Named
Chapter 13: Program Development and Programming Languages
Understanding Computers Today and Tomorrow 12 th Edition Chapter 13: Program Development and Programming Languages Learning Objectives Understand the differences between structured programming, object-oriented
CSC 2405: Computer Systems II
CSC 2405: Computer Systems II Spring 2013 (TR 8:30-9:45 in G86) Mirela Damian http://www.csc.villanova.edu/~mdamian/csc2405/ Introductions Mirela Damian Room 167A in the Mendel Science Building [email protected]
Database Programming with PL/SQL: Learning Objectives
Database Programming with PL/SQL: Learning Objectives This course covers PL/SQL, a procedural language extension to SQL. Through an innovative project-based approach, students learn procedural logic constructs
JDK 1.5 Updates for Introduction to Java Programming with SUN ONE Studio 4
JDK 1.5 Updates for Introduction to Java Programming with SUN ONE Studio 4 NOTE: SUN ONE Studio is almost identical with NetBeans. NetBeans is open source and can be downloaded from www.netbeans.org. I
#820 Computer Programming 1A
Computer Programming I Levels: 10-12 Units of Credit: 1.0 CIP Code: 11.0201 Core Code: 35-02-00-00-030 Prerequisites: Secondary Math I, Keyboarding Proficiency, Computer Literacy requirement Semester 1
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation
Java Application Developer Certificate Program Competencies
Java Application Developer Certificate Program Competencies After completing the following units, you will be able to: Basic Programming Logic Explain the steps involved in the program development cycle
HPC Wales Skills Academy Course Catalogue 2015
HPC Wales Skills Academy Course Catalogue 2015 Overview The HPC Wales Skills Academy provides a variety of courses and workshops aimed at building skills in High Performance Computing (HPC). Our courses
C Compiler Targeting the Java Virtual Machine
C Compiler Targeting the Java Virtual Machine Jack Pien Senior Honors Thesis (Advisor: Javed A. Aslam) Dartmouth College Computer Science Technical Report PCS-TR98-334 May 30, 1998 Abstract One of the
What is a programming language?
Overview Introduction Motivation Why study programming languages? Some key concepts What is a programming language? Artificial language" Computers" Programs" Syntax" Semantics" What is a programming language?...there
Beyond the Mouse A Short Course on Programming
1 / 22 Beyond the Mouse A Short Course on Programming 2. Fundamental Programming Principles I: Variables and Data Types Ronni Grapenthin Geophysical Institute, University of Alaska Fairbanks September
Debugging. Common Semantic Errors ESE112. Java Library. It is highly unlikely that you will write code that will work on the first go
Debugging ESE112 Java Programming: API, Psuedo-Code, Scope It is highly unlikely that you will write code that will work on the first go Bugs or errors Syntax Fixable if you learn to read compiler error
Chapter 12 Programming Concepts and Languages
Chapter 12 Programming Concepts and Languages Chapter 12 Programming Concepts and Languages Paradigm Publishing, Inc. 12-1 Presentation Overview Programming Concepts Problem-Solving Techniques The Evolution
CUDAMat: a CUDA-based matrix class for Python
Department of Computer Science 6 King s College Rd, Toronto University of Toronto M5S 3G4, Canada http://learning.cs.toronto.edu fax: +1 416 978 1455 November 25, 2009 UTML TR 2009 004 CUDAMat: a CUDA-based
Language Evaluation Criteria. Evaluation Criteria: Readability. Evaluation Criteria: Writability. ICOM 4036 Programming Languages
ICOM 4036 Programming Languages Preliminaries Dr. Amirhossein Chinaei Dept. of Electrical & Computer Engineering UPRM Spring 2010 Language Evaluation Criteria Readability: the ease with which programs
5 Arrays and Pointers
5 Arrays and Pointers 5.1 One-dimensional arrays Arrays offer a convenient way to store and access blocks of data. Think of arrays as a sequential list that offers indexed access. For example, a list of
