Write in a clean editor, then format for International Journal of High Speed Computing in one click — DocuGuru applies the official World Scientific template with superscript references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
International Journal of High Speed Computing is a peer-reviewed journal published by World Scientific, covering Parallel Computing and Optimization Techniques, Distributed and Parallel Computing Systems, Interconnection Networks and Systems.
| Publisher | World Scientific |
|---|---|
| Reference style | Superscript numbered (World Scientific) Superscript — small raised numerals in the text 1. Smith, A., Jones, B. & Lee, C. A representative article title. International Journal of High Speed Computing 12, 45–58 (2023).
Formats any DOI in the closest standard style — International Journal of High Speed Computing has no published style definition, so this is an approximation. No sign-up. |
| Publishes research in | Parallel Computing and Optimization Techniques Distributed and Parallel Computing Systems Interconnection Networks and Systems Matrix Theory and Algorithms Embedded Systems Design Techniques |
| ISSN | 0129-0533 |
| h-index | 22 |
| i10-index | 48 |
| Total citations | 2,049 |
| Top institutions publishing here | Ames Research Center |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
Parafrase-2 is a vectorizing/parallelizing compiler implemented as a source to source code restructurer. This paper discusses the organization of Parafrase-2 and goals of the project. Specific topics discussed are : dependence analysis, timing and overhead analysis, interprocedural analysis, automatic scheduling and the graphical user interface.
This paper describes and compares three parallel algorithms for solving sparse triangular systems of equations. These methods involve some preprocessing overhead and are primarily of interest in solving many systems with the same coefficient matrix. The first approach is to use a fixed blocksize and form the inverse of the diagonal blocks. The second approach…
The usual QR algorithm for finding the eigenvalues of a Hessenberg matrix H is based on vector-vector operations, e.g. adding a multiple of one row to another. The opportunities for parallelism in such an algorithm are limited. In this paper, we describe a reorganization of the QR algorithm to permit either matrix-vector or matrix-matrix operations…
Parallel programs may be represented as a set of interrelated sequential tasks. When multiprocessors are used to execute such programs, the parallel portion of the application can be speeded up by an appropriate allocation of processors to the tasks of the application. Given a parallel application defined by a task precedence graph, the goal of…
. The multiplication of a vector by a matrix is the kernel operation in many algorithms used in scientific computation. A fast and efficient parallel algorithm for this calculation is therefore desirable. This paper describes a parallel matrix--vector multiplication algorithm which is particularly well suited to dense matrices or matrices with an irregular sparsity pattern.…
