The dynamic block concept suggests an approach to organizing a program for parallel processing. In this approach, a program is organized into procedures and a procedure is organized into program blocks. A program bloc...
详细信息
The dynamic block concept suggests an approach to organizing a program for parallel processing. In this approach, a program is organized into procedures and a procedure is organized into program blocks. A program block is a collection of contiguous instructions and is an independent program unit. By using data areas for procedures and local registers for program blocks, procedures and program blocks are executed in parallel. The basic concept is discussed and the synchronization and communication problems are addressed.
In a previous paper the author had used the expression ″Principle of simplicity″ to describe a deductive method of defining a computer's instructions. Moreover, the algorithm concept could be circumscribed in a ...
详细信息
In a previous paper the author had used the expression ″Principle of simplicity″ to describe a deductive method of defining a computer's instructions. Moreover, the algorithm concept could be circumscribed in a form of algebra called the algebra of functions. Let X be the set of algorithms (functions), and P the set of programs (instruction sequences to be defined). The paper examines the application GAMMA :X yields P and the choices it implies. The extensions of this initiative are not considered in the paper.
Sorting plays an increasingly important role in determining the overall performance of data base systems. Described is a new sorting scheme, called the rebound sort, implementable on a variety of technologies, e. g. ,...
详细信息
Sorting plays an increasingly important role in determining the overall performance of data base systems. Described is a new sorting scheme, called the rebound sort, implementable on a variety of technologies, e. g. , magnetic bubbles and charge-coupled devices. The sort engine based on this new sorting scheme accepts as input a sequence of records, sorts them, and outputs the sorted records automatically. The actual sorting time is completely overlapped with the input/output time.
The method described permits program segments being repeatedly used, without the segments concerned having to be stored several times at different storage locations within the processing unit, or without the segments ...
详细信息
The method described permits program segments being repeatedly used, without the segments concerned having to be stored several times at different storage locations within the processing unit, or without the segments having to be detached from the program and having to be stored separately as a subroutine.
The field of computing-including its application by programmers, systems analysts and others-suffers tremendously from a lack of use of formal reasoning in everyday work. The problem can be solved, at least partly, by...
详细信息
The field of computing-including its application by programmers, systems analysts and others-suffers tremendously from a lack of use of formal reasoning in everyday work. The problem can be solved, at least partly, by teaching calculational methods in mathematics and programming in the freshman year, and in such a way that students develop a skill with the methods, and not just a passing understanding. Freshman courses should instil the idea that mathematical techniques can help and should encourage a sense of discrimination, of making judgements on technical matters based on technical concerns. A serious overhaul of the conventional second programming course and the discrete mathematics course along these lines could have a profound impact on the whole computer science curriculum. Moreover, a properly designed course would be beneficial for mathematicians and engineers as well.
A technique is described for enhancing the optimization of implicitly declared variables using the PL/I Optimizing Compiler. The technique includes a program which is implemented as a Time Sharing Option command proce...
详细信息
A technique is described for enhancing the optimization of implicitly declared variables using the PL/I Optimizing Compiler. The technique includes a program which is implemented as a Time Sharing Option command procedure.
暂无评论