摘要:

AbstractAn approach to achieving dynamic reconfiguration within the framework of Ada1is described. A technique for introducing a kernel facility for dynamic reconfiguration in Ada is illustrated, and its implementation using the Verdix VADS 5.5 Ada compiling system on a Sun3–120 running the 4.3 BSD Unix operating system is discussed. This experimental kernel allows an Ada program to change its own configuration dynamically, linking new pieces of code at run‐time. It is shown how this dynamic facility can be integrated consistently at the Ada language level, without introducing severe inconsistencies with respect to the Standard semant

ISSN:0038-0644    

DOI:10.1002/spe.4380230102

出版商:John Wiley&Sons, Ltd.    

年代:1993

数据来源: WILEY

摘要:

AbstractThe construction of minimal acyclic deterministic partial finite automata to represent large natural language vocabularies is described. Applications of such automata include spelling checkers and advisers, multilanguage dictionaries, thesauri, minimal perfect hashing and text compression.

ISSN:0038-0644    

DOI:10.1002/spe.4380230103

出版商:John Wiley&Sons, Ltd.    

年代:1993

数据来源: WILEY

摘要:

AbstractA new tool for generating implementation prototypes of communication protocols and concurrent systems specified using the ISO LOTOS language is presented in this paper. A brief introduction to LOTOS and a discussion of the main problems related to the efficient execution of specifications written in LOTOS are presented first. The design and implementation of the tool are then considered: LOTOS specifications are analysed and translated into C functions which are executed by co‐operating processes in the Unix environment. The set of LOTOS process definitions is first translated into a suitable number of extended finite‐state machines (EFSMs). The method proposed allows the problem of deriving unbounded EFSMs to be circumvented and a sort of control on the process number/size trade‐off to be obtained at the same time.The problem of implementing the LOTOS multi‐way rendezvous mechanism for process synchronization is solved by using an algorithm based on message‐passing techniques. An example of prototype derivation is also described, showing the form of C code generated by translating a simple specification. Finally, some performance figures are

ISSN:0038-0644    

DOI:10.1002/spe.4380230104

出版商:John Wiley&Sons, Ltd.    

年代:1993

数据来源: WILEY

摘要:

AbstractThe paper describes a new pictorial database oriented to image analysis, implemented inside the MIDAS data analysis system. Pictorial databases need expressive data structures in order to represent a wide class of information from the numerical to the visual. The model of the database is relational; however, a full normalization is not achievable, owing to the complexity of the visual information. The paper reports the general design and notes on the software implementation. Preliminary experiments show the performance of the pictorial database.

ISSN:0038-0644    

DOI:10.1002/spe.4380230105

出版商:John Wiley&Sons, Ltd.    

年代:1993

数据来源: WILEY

摘要:

AbstractWe have developed a new multi‐user application that integrates and extends the concepts in a variety of current multi‐user applications. It allows multiple users to store, retrieve and browse through information, communicate information both synchronously and asynchronously, create ‘pipes’ of consistent, editable and persistent views, and interactively specify handlers for events. It has been implemented using the experimental technologies of distributed objects and multi‐user editor generation. Our work on this application suggests a new and practical model for designing and implementing multi‐user applications. In this paper, we describe the user interface and implementation of the application, give the rationale for our design choices, describe our experience with the tools and techniques used in the implementation, and present conclusions and directions for

ISSN:0038-0644    

DOI:10.1002/spe.4380230106

出版商:John Wiley&Sons, Ltd.    

年代:1993

数据来源: WILEY

摘要:

AbstractCache performance has become a very crucial factor in the overall system performance of machines. Effective analysis of a cache design requires the evaluation of the performance of the cache for typical programs that are to be executed on the machine. Recent attempts to reduce the time required for such evaluations either result in a loss of accuracy or require an initial pass by a filter to reduce the length of the trace. This paper evaluates techniques that attempt to overcome these problems for instruction cache performance evaluation. For each technique variations with and without periodic context switches are examined. Information calculated during the compilation is used to reduce the number of references in the trace. Thus, in effect references are stripped before the initial trace is generated. These techniques are shown to significantly reduce the time required for evaluating instruction caches with no loss of accuracy.

ISSN:0038-0644    

DOI:10.1002/spe.4380230107

出版商:John Wiley&Sons, Ltd.    

年代:1993

数据来源: WILEY

ISSN:0038-0644    

DOI:10.1002/spe.4380230101

出版商:John Wiley&Sons, Ltd.    

年代:1993

数据来源: WILEY