Stop the war!
Остановите войну!
for scientists:
default search action
International Journal of High Speed Computing, Volume 3
Volume 3, Number 1, March 1991
- Stefan Vandewalle, Rafael Van Driessche, Robert Piessens:
The Parallel Performance of Standard Parabolic Marching Schemes. 1-29 - Kyle A. Gallivan, William Jalby, Allen D. Malony, Harry A. G. Wijshoff:
Performance Prediction for Parallel Numerical Algorithms. 31-62 - Tao Li:
Parallel Imprecise Iterative Deepening for Combinatorial Optimization. 63-76 - Takaya Arita, Masahiro Sowa:
High Speed Synchronization for a Statically Scheduled Superscalar Processor. 77-87
Volume 3, Number 2, June 1991
- Anita Mayo:
A Decomposition Finite Difference Method for the Fourth Order Accurate Solution of Poisson's equation on General Regions. 89-106 - Selim G. Akl, G. R. Guenther:
Application of Broadcasting with Selective Reduction to the Maximal Sum Subsegment Problem. 107-119 - Eiichi Goto, Kia-Fock Loe:
Josephson Supercomputer Design Using Quantum Flux Parametron. 121-134 - Paul Spee, Weng-Fai Wong, Eiichi Goto:
Effects of Multiple Instruction Stream Execution on Cache Performance. 135-155
Volume 3, Number 3/4, September & December 1991
- Koichiro Tamura:
Research Results of the Project "high Speed Computing System for Scientific and Technological Uses". 157-168 - Nobuo Uchida:
Fujitsu Vp2000 Series Supercomputers. 169-185 - Akihiro Iwaya, Tadashi Watanabe:
The Parallel Processing Feature of the NEC SX-3 Supercomputer System. 187-197 - Paul Kang-Hoh Phua:
An Evaluation of Nonlinear Optimization Codes on Supercomputers. 199-213 - Russell Carter:
Y-MP Floating Point and Cholesky Factorization. 215-222 - Zuo-Ming Yin, Chee-Kong Chui, Renben Shu, Kuan-Tsae Huang:
Two Precedence-Related Task-Scheduling Algorithms. 223-240
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.