The hierarchical structure of protocols and the functions associated with them are first introduced. A representation model based on the theory of colloquy and on the interlocutor concept is described. It is shown tha...
详细信息
The hierarchical structure of protocols and the functions associated with them are first introduced. A representation model based on the theory of colloquy and on the interlocutor concept is described. It is shown that this representation is well adapted to the implementation of a simulation program. Based on a description of the ST-ST protocol of Cyclades, the extensions of the interlocutor concept are pointed out. The extensions required by the hierarchical structure of protocols are also examined.
The analysis of concurrent programs is a field which is still in its infancy. This paper describes our work on the analysis of concurrent programs under the Actor model of computation. The Actor model of computation i...
详细信息
The analysis of concurrent programs is a field which is still in its infancy. This paper describes our work on the analysis of concurrent programs under the Actor model of computation. The Actor model of computation is based on computational objects called actors, which process information by sending and receiving messages. Large numbers of actors may be executing concurrently, and communication between actors occurs asynchronously. This paper has presented a number of preliminary results in the run-time analysis of Actor computations. Run-time analyses are very likely to become an important part of the concurrent programmers' toolbox. As we begin to build more of these tools and gain experience with using them, we will be able to more fully explore the capabilities and limitations of the techniques we have developed.
In a computational system, reflection is the process of reasoning about and acting upon the computational system itself. Reasoning and acting involve accessing and changing part or the whole of the system. The whole m...
详细信息
In a computational system, reflection is the process of reasoning about and acting upon the computational system itself. Reasoning and acting involve accessing and changing part or the whole of the system. The whole motivation of computational reflection is to make the object-level computation perform effectively by dynamically modifying the internal organization of the computational system. This paper discusses the importance of reflective languages and the challenge in their design. Techniques for effecient implementation are discussed.
Following is a continuation of the list of titles and authors. Recovery Strategies in the No. 2 Electronic Switching System. By P. J. Kennedy and T. M. Quinn. Design of Asynchronous Sequential Machines for Fault Detec...
详细信息
Following is a continuation of the list of titles and authors. Recovery Strategies in the No. 2 Electronic Switching System. By P. J. Kennedy and T. M. Quinn. Design of Asynchronous Sequential Machines for Fault Detection. By D. H. Sawin, III, G. K. Maki, and S. R. Groenig. Fault-Tolerant Asynchronous Sequential Machine. By W. W. Patterson and G. A. Metze. Iterative Cell Switch Design for Hybrid Redundancy. By D. P. Siewiorek and E. J. McCluskey. Figure of Merit for Fault-Tolerant Space computers. By H. Hecht. Modeling of a Bubble Memory Organization with Self-Checking Translators to Achieve High Reliability. By W. G. Bouricius, W. C. Carter, E. P. Hsieh, D. C. Jessep, and A. B. Wadia.
By analyzing the data dependency graph of a program it is possible to determine the potential for program speedups by simultaneous execution of logically inddpendent operations. When concurrent execution of instructio...
详细信息
By analyzing the data dependency graph of a program it is possible to determine the potential for program speedups by simultaneous execution of logically inddpendent operations. When concurrent execution of instructions in existing programs on a given machine is attempted, efficient detection of data independence during execution is a central difficulty. Simulation, using actual program traces, has been used to evaluate the effectiveness of several approaches to detecting the presence of logically independent operations as a function of the number of processing elements. The results indicate that simple conflict detection algorithms perform about as well as more complex detection algorithms if the number of processing elements is six or less.
This article presents the sources and types of error possible in a data entry system, the possible methods of detection and procedures for correction. A quantitative method of evaluating the cost of errors in determin...
详细信息
This article presents the sources and types of error possible in a data entry system, the possible methods of detection and procedures for correction. A quantitative method of evaluating the cost of errors in determining the extent of error checking needed in any system is indicated. With intelligent analysis of possible error situations and their costs, the user can set acceptable error thresholds and meet the objective of selective data integrity at an optimum overall cost.
Efficient algorithms for asynchronous multiprocessor systems must achieve a balance between low process communication and high adaptability to variations in process speed. Algorithms which employ problem decomposition...
详细信息
Efficient algorithms for asynchronous multiprocessor systems must achieve a balance between low process communication and high adaptability to variations in process speed. Algorithms which employ problem decomposition can be classified as static and dynamic. Static and dynamic algorithms are particularly suited for low process communication and high adaptability, respectively. In order to find the ″best″ method, something about mean execution times must be known. Techniques for the analysis of the mean execution time are developed for each type of algorithm, including applications of order statistics and queueing theory. These techniques are applied in detail to (1) static generalizations of quicksort, (2) static generalizations of merge sort, and (3) a dynamic generalization of quicksort.
暂无评论