C++ and Fortran 77 Timing Comparisons
| dc.contributor.author | Keenan, Philip T. | en_US |
| dc.date.accessioned | 2018-06-18T17:41:08Z | en_US |
| dc.date.available | 2018-06-18T17:41:08Z | en_US |
| dc.date.issued | 1993-01 | en_US |
| dc.date.note | January 1993 | en_US |
| dc.description.abstract | Recently there has been considerable debate within the scientific computation community over the suitability of C++ for large scale numerical computation. This note reports on timing studies of Fortran 77 and C++ conducted on the Intel IPSC/3 Hypercube, the IBM RS-6000 and the Sun Sparc Station 2. Timings are presented for two fundamental algorithms including a dense vector inner product and multiplication of a dense vector by a sparse matrix. Comparison to hand coded assembler routines is also provided in selected cases. The results demonstrate that C and C++ can be just as efficient as FORTRAN and therefore deserve serious consideration. | en_US |
| dc.format.extent | 25 pp | en_US |
| dc.identifier.citation | Keenan, Philip T.. "C++ and Fortran 77 Timing Comparisons." (1993) <a href="https://hdl.handle.net/1911/101786">https://hdl.handle.net/1911/101786</a>. | en_US |
| dc.identifier.digital | TR93-03 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1911/101786 | en_US |
| dc.language.iso | eng | en_US |
| dc.title | C++ and Fortran 77 Timing Comparisons | en_US |
| dc.type | Technical report | en_US |
| dc.type.dcmi | Text | en_US |
Files
Original bundle
1 - 1 of 1