This paper concerns user experience in improving the performance of NAG library FORTRAN routines for the CRAY-1S. Following a brief discussion of CRAY hardware and software features which need to be borne in mind, som...
详细信息
ISBN:
(纸本)0198536011
This paper concerns user experience in improving the performance of NAG library FORTRAN routines for the CRAY-1S. Following a brief discussion of CRAY hardware and software features which need to be borne in mind, some preliminary results from the linear algebra section of the NAG library will be presented. The relative advantages of using the BLAS (Basic Linear Algebra Subroutines) in CRAY SCILIB and of using modified in-line code will be discussed, and some timings given for the various approaches. Some of the limitations imposed by the need for the new version of the library to be as consistent as possible with the old will be indicated. Finally, a number of case studies will be presented.
The computer documentation is itself considered an information system. It must convey the operations of a complex symbolic system to several levels of users, a problem that can be as complex as the design of the progr...
详细信息
The computer documentation is itself considered an information system. It must convey the operations of a complex symbolic system to several levels of users, a problem that can be as complex as the design of the program itself. Many of the problems related to poor documentation are in the final analysis problems of communications design and information retrieval wholly unrelated to the problems of clear writing, for a stylistically well-written manual may be impossible to use. The critical factors often ignored include thorough indexing, rational organization, the use of synonyms and the explanation of technical terms, visual representations, feedback from users, and other aspects. This paper traces the development of microcomputer documentation and will use examples from well-known systems to illustrate some of the problems that occur due to a lack of understanding of how to communicate information to the user. The author draws upon his experience in designing documentation for a major database management software product and upon his experience as a microcomputer consultant to demonstrate some of the concerns that must be addressed in designing effective documentation.
Mascot was designed as a methodology for implementing real time embedded applications where the software is complex and highly interactive. Since Ada and MASCOT address a common problem domain, and since there is alre...
详细信息
Mascot was designed as a methodology for implementing real time embedded applications where the software is complex and highly interactive. Since Ada and MASCOT address a common problem domain, and since there is already a high investment in MASCOT expertise in the UK, it is of immediate concern to both the Ministry of Defence and to large sectors of British industry to consider the issues of Ada and MASCOT. The author presents the issues involved in this comparison and suggests some solutions.
作者：
Johnsson, S.LennartYale Univ
Dep of Computer Science New Haven CT USA Yale Univ Dep of Computer Science New Haven CT USA
Three parallel algorithms for sorting M uniformly distributed elements on a Boolean n-cube of N equals 2**n , N less than equivalent to M, processors are presented. Two of the algorithms combine sequential sort with b...
详细信息
ISBN:
(纸本)081860560X
Three parallel algorithms for sorting M uniformly distributed elements on a Boolean n-cube of N equals 2**n , N less than equivalent to M, processors are presented. Two of the algorithms combine sequential sort with bitonic sort to accomplish a time complexity of O(Mlog M/N) for N greater than greater than M, and O(log**2 M) for M congruent N. One algorithm sorts the elements cyclically, such that a processor holds sorted elements that are congruent modN. The processor algorithm sorts subsequences of M/N consecutive elements into each processor. The third algorithm is a parallel bucket sort that sorts the elements into L buckets in time O(M/N plus L) if N less than equivalent to L and time O(M/N plus L plus log N - log L) for N less than L.
An examination is made of the problem of scheduling of tasks in multiprogrammingcomputersystems. An algorithm for minimizing the time of execution of information-dependent tasks in homogeneous and nonhomogeneous com...
详细信息
An examination is made of the problem of scheduling of tasks in multiprogrammingcomputersystems. An algorithm for minimizing the time of execution of information-dependent tasks in homogeneous and nonhomogeneous computersystems is proposed. A comparative estimate of the algorithm with the earlier reported ones is given. The method is designed for use in a multitask scheduling system.
A dialog system with a language processor of the compiler type is described. The system is intended for adjusting and testing apparatus which has no offline control and which is connected to a computer through a commo...
详细信息
A dialog system with a language processor of the compiler type is described. The system is intended for adjusting and testing apparatus which has no offline control and which is connected to a computer through a common busbar. The system is intended for the use of engineers involved in product development. It can be used to adjust both simple interface modules and complex hardware assemblies. The system has been used for computers of the Elektronika family and the SM-4.
TAPE 300 assists users of the Siemens 300 systems in recording, reading and managing file and library data on half-inch magnetic tapes. It can also be used on the small business computers of the 6. 000 systems. In con...
详细信息
TAPE 300 assists users of the Siemens 300 systems in recording, reading and managing file and library data on half-inch magnetic tapes. It can also be used on the small business computers of the 6. 000 systems. In contrast to previous magnetic tape utility routines, TAPE 300 features a number of important enhancements. These include the standard generation and processing of tape labels for off-line data interchange and the support of special functions of the 3959 magnetic tape unit.
International Business Machines' (IBM) Job Entry Subsystem 3 (JES 3) is the integral part of the MVS operating system that is responsible for controlling all jobs from their entry into the system until their exit ...
详细信息
International Business Machines' (IBM) Job Entry Subsystem 3 (JES 3) is the integral part of the MVS operating system that is responsible for controlling all jobs from their entry into the system until their exit out of the system. JES 3 maintains total awareness of each job while it is in the system and services the jobs upon request. These services include: preparing the job for execution, selecting the job for execution, and the processing of SYSIN/SYSOUT data. This paper reports the findings of the performance evaluation study of JES 3 through the use of a General Purpose Simulation System (GPSS) model of JES 3 and exhibits the benefits of using simulation models to study complex systems such as JES 3. Once the model was developed, it was used to evaluate the effects of varying the job scheduler parameters of JES 3 in the batch job environment. The input workload and service times for the model were derived from System Management Facilities (SMF) and Resource Management Facilities (RMF) data from the modeled system.
The purpose of a priority sort is to carry out beforehand (before the visualization) the many calculations which are involved in the removal of unseen surfaces. These calculations are carried out without reference to ...
详细信息
The purpose of a priority sort is to carry out beforehand (before the visualization) the many calculations which are involved in the removal of unseen surfaces. These calculations are carried out without reference to the position or orientation of the observer - once for all possible images of the scene. This approach sharply reduces the volume of the calculations during the image generation time. The cost in computation time is reduced to the extent that it becomes possible to generate three-dimensional visual scenes in real time. In this paper we briefly describe an implementation of the algorithm proposed for a preliminary spatial sort by priority.
暂无评论