Sequential file processing in fortran IV

The standard I/O facility for sequential disk/tape file handling in a Fortran IV IBM 360/370 Disk Operating System environment has some marked shortcomings, the most serious of which is that blocking of records is not provided for. This paper describes SAMFOR⁴ (Sequential Access Method in Fortran IV), a set of Fortran callable subprograms and a file declaration facility that enables the Fortran programmer to access and create ‘standard’ sequential files. Thus inter language compatibility of files is obtained. A manyfold increase in effectiveness may also be achieved.     

A toolkit for efficient numerical applications in Java

Java is widely recognized as a good object-oriented programming language. However, it is often considered as too slow for numerically intensive applications. This paper presents a software toolkit that brings the computational efficiency of numerical Fortran libraries to Java. The toolkit is organized in two layers. In the first layer, Java wrappers provide access to numerical libraries like BLAS, LAPACK or NAG. The second layer comprises vector and matrix classes as well as classes for common linear algebra tasks. Numerical experiments show that this strategy can substantially improve the performance of Java-based numerical applications.     

A notation for deterministic cooperating processes

This paper proposes extensions of sequential programming languages for parallel programming that have the following features: 1) Dynamic Structures: The process structure is dynamic. Processes and variables can be created and deleted. 2) Paradigm Integration: The programming notation supports shared memory and message passing models. 3) Determinism: Demonstrating that a program is deterministic-all executions with the same input produce the same output-is straightforward, Programs can be written so that compilers can verify that the programs are deterministic. Nondeterministic constructs can be introduced in a sequence of refinement steps to obtain greater efficiency if required. The ideas have been incorporated in an extension of Fortran, but the underlying sequential imperative language is not central to the ideas described here. A compiler for the Fortran extension, called Fortran M, is available by anonymous ftp From Argonne National Laboratory. Fortran M has been used for a variety of parallel applications     

Visual Fortran创建Win32 API式的DLL

将Visual Fortran开发的数学模型集成到系统,这样的需求正越来越多.在Visual Fortran开发环境中创建符合Win32API规范的DLL成了一个亟待解决的实际问题.对此进行较为系统的探讨,Win32 API事实上的标准是如何要求的,如何调整Visual Fortran的调用约定,如何消除Fortran 90/95的字符串,多维数组及派生类型与Win32 API中的对应实体的差异等,并用典型示例加以说明.给Visual Fortran创建Win32 API式的DLL提供了操作指南.     

Parallelizing subroutines in sequential programs

An algorithm for making sequential programs parallel is described, which first identifies all subroutines, then determines the appropriate execution mode and restructures the code. It works recursively to parallelize the entire program. We use Fortran in our work, but many of the concepts apply to other languages. Our hardware model is a shared-memory multiprocessor system with a fixed number of identical processors, each with its own local memory connected to a common memory that is accessible to all processors equally. The model implements interprocessor synchronization and communication via special memory locations or special storage. Systems like the Cray X-MP, IBM 3090, and Alliant FX/8 fit this model. Our input is a sequential, structured Fortran program with no overlapping branches. With today's emphasis on writing structured code, this restriction is reasonable. A prototype of a system to implement the algorithm is under development on an IBM 3090 multiprocessor     

A toolkit for parallel functional programming

Our toolkit for the design and implementation of parallel functional programs supports the stepwise development of parallel programs from a high level sequential specification to an optimised parallel implementation. The toolkit is used as follows:

• 1 The algorithm to be implemented is specified in a functional language. The program is debugged and tested using an interpreter.
• 2 The program is compiled for a sequential machine. Its performance is analysed and improved.
• 3 Annotation-driven transformations are applied to the program to indicate parallel tasks. Simulations at task level, basic block level and bus transaction level make it possible to analyse the parallel performance of the program at three levels of detail.
• 4 When the performance is optimised using the simulators, the program is executed on a genuine parallel machine.

Several programs have been developed with the toolkit. A program that simulates tidal flow in an estuary of the North sea is presented as a case study to demonstrate the merits of the toolkit when developing complex parallel programs. The toolkit not only supports the design of parallel applications, it also allows the study of important concepts in parallel computer architecture. These include the behaviour of cached memory systems, bus protocols, scheduling algorithms and memory management algorithms.     

A scalable HPF implementation of a finite‐volume computational electromagnetics application on a CRAY T3E parallel system

The time‐dependent Maxwell equations are one of the most important approaches to describing dynamic or wide‐band frequency electromagnetic phenomena. A sequential finite‐volume, characteristic‐based procedure for solving the time‐dependent, three‐dimensional Maxwell equations has been successfully implemented in Fortran before. Due to its need for a large memory space and high demand on CPU time, it is impossible to test the code for a large array. Hence, it is essential to implement the code on a parallel computing system. In this paper, we discuss an efficient and scalable parallelization of the sequential Fortran time‐dependent Maxwell equations solver using High Performance Fortran (HPF). The background to the project, the theory behind the efficiency being achieved, the parallelization methodologies employed and the experimental results obtained on the Cray T3E massively parallel computing system will be described in detail. Experimental runs show that the execution time is reduced drastically through parallel computing. The code is scalable up to 98 processors on the Cray T3E and has a performance similar to that of an MPI implementation. Based on the experimentation carried out in this research, we believe that a high‐level parallel programming language such as HPF is a fast, viable and economical approach to parallelizing many existing sequential codes which exhibit a lot of parallelism. Copyright © 2003 John Wiley & Sons, Ltd.     

Fortran与C/C++的混合编译

在长期的数值计算中人们积累了大量宝贵的程序资源--Fortran、C/C 源程序,为了能综合利用这些资源,Win32环境下多采取基于动态链接库DLL的混合编程方法,增加了额外建造、加载DLL的负担.提出一种Fortran与C/C 混合编程的便捷途径:在特定集成开发环境下的混合编译,系统探讨Fortran与C/C 在调用约定上的协调问题,并用典型实例加以说明.     

混合编程与Fortran计算程序可视化

本文探索了用ＶＣ＋＋Ｆｏｒｔｒａｎ,ＯｐｅｎＧＬ进行混合编码的方法,该方法充分发挥了三种语言各自的优点,既能设计出画面丰富多彩,方便人机对话的界面,又有最大限度利用已有的有用Ｆｏｒｔｒａｎ语言编写的程序资源,并实现计算结果的可视化。用作者已有的用Ｆｏｒｔｒａｎ语言编写的源程序进行了尝试,结果良好。     

通过动态链接库实现VB和Fortran的混合编程

论述了 Fortran和 VB两种语言混合编程的基础 ,介绍了如何通过 DL L实现 VB6 .0和 Fortran的接口 ,通过参数传递实现其数据交换 ,实现了 VB的可视化界面与 Fortran强大的数值计算能力的结合 ,满足了大型应用软件的实现过程中系统综合任务的要求     

CoCoNutTrix: Collaborative Retrofitting for Information Visualization

In this paper, the authors retrofitted a version of NodeTrix, a single-user graph visualization environment based on the InfoVis toolkit, to support multiple independent mice. The resulting low-cost environment was called CoCoNutTrix (Colocated Collaborative NodeTrix). Then, it was assessed how analysts viewed CoCoNutTrix and whether it effectively supported collaborative data analysis among domain experts using real data sets for social-network analysis. Our goal is to refine and expand our knowledge about retrofitting and hence designing colocated collaborative- visualization systems.     

Fortran在末制导炮弹舵指令分析中的应用

Fortran语言在数值运算和运算速度方面具有优势,通过Fortran编程,对某型末制导炮弹的舵展开时间、舵延迟时间、舵延迟进行了分析,给出了舵延迟如何用Fortran实现,为下一步的全弹道计算和射击精度奠定了基础.     

一个面向对象的交互式创作工具OOIAT的设计与实现

在开放交互式创伤工具过程中,常常会遇到这样的难题：如何表示和建立用户模型及操作的对象,并向用户提供可直接操作的交互方式;如何有效地表示和管理对象之间的关系。,为此,我们设计并实现了一个创伤工具OOIAT,它提供了一个可扩充的,用于表示用户模型并集成了事件模型的对象集,使用户只需定义对象,不必了解对象如何传递
动作,如何实现其功能,就能够处理在这些对象上的交互式直接创伤。     

SPARE Parts: a C++ toolkit for string pattern recognition

In this paper, we consider the design and implementation of SPARE Parts, a C++ toolkit for pattern matching. SPARE Parts (in particular, the 2003 version presented in this article) is the second generation string pattern matching toolkit by the authors. The toolkit, the first generic program for keyword pattern matching, contains implementations of the well‐known Knuth–Morris–Pratt, Boyer–Moore, Aho–Corasick and Commentz–Walter algorithms (and their variants). The toolkit is freely available for non‐commercial use. Copyright © 2004 John Wiley & Sons, Ltd.     

Composing user interfaces with InterViews

The authors describe a user interface toolkit, InterViews, that offers a rich set of composition mechanisms and a variety of predefined objects, allowing easy implementation of complex user interfaces. InterViews supports composition of three object categories, each implemented as a hierarchy of object classes derived from a common base class. The categories are interactive objects, structured graphics objects, and structured text objects. The authors present several simple applications and show how InterViews objects can implement their interfaces. They illustrate the benefits of separating interactive behavior and abstract data in several different contexts. They discuss InterViews support for end-user customization as well as the status of the current implementation     

Fortran源程序在WindowsOOP环境下的应用

探讨了Windows下高效地使用原DOS系统下的Fortran计算程序代码技术,并通过一个具体的例子详细地介绍了调用约定的属性设置和参数调用的方法,为Fortran源程序在面向对象开发环境中的应用提供了一种切实有效的途径。     

基于词典的MIS应用系统生成工具

管理信息系统的快速开发与应用对提高生产效率和管理现代化水平具有重要的意义,本文作者在总结多个ＭＩＳ应用系统开发经验的基础上,开发了基于词典的ＭＩＳ应用系统生成工具,以加速ＭＩＳ应用系统的开发。本文着重介绍该生成工具的ＦｏｘｐｒｏＦｏｒ Ｄｏｓ版本。     

Porting a dusty deck Fortran program to a shared-memory multiprocessor

We describe an attempt to improve the performance of a sequential Fortran code on a shared memory multiprocessor. The only parallelism employed is that provided by a set of parallel BLAS. The code is modified to make maximum use of the BLAS and, in particular, to use an appropriate LAPACK routine. Comparisons are made with automatically generated parallel code.     

Parallel programming with Polaris

Parallel programming tools are limited, making effective parallel programming difficult and cumbersome. Compilers that translate conventional sequential programs into parallel form would liberate programmers from the complexities of explicit, machine oriented parallel programming. The paper discusses parallel programming with Polaris, an experimental translator of conventional Fortran programs that target machines such as the Cray T3D