摘要:

AbstractWe present the implementation of a Prolog system composed of interpreter and compiler. The originality of our work consists in the adoption of a new framework to realize the main components of the system. The framework relies on new mechanisms, called sleepers. With their help we have developed a complete Prolog interpreter in which all the control activities, from backtracking up to last‐call optimization, are performed by the sleeper mechanism. We have also produced a Prolog compiler by using a philosophy and tactics that are completely independent of hardware constraints; it exploits an incremental and abstract implementation technique, based on a delayed non‐local execution protocol. Our approach to Prolog system implementation has been extremely useful both in terms of software design and overall performa

ISSN:0038-0644    

DOI:10.1002/spe.4380230202

出版商:John Wiley&Sons, Ltd.    

年代:1993

数据来源: WILEY

摘要:

AbstractPMS‐Prolog is an implementation of Prolog designed for distributed systems, and therefore uses coarsegrain parallelism in preference to the fine‐grain parallelism of other implementations. Prolog processes are formally defined and interprocess communication is explicit. An overview of PMS‐Prolog is provided, followed by an examination of the PMS‐Prolog solutions to four problems. These solutions are also compared to other solutions from the literature. From this, the strengths and weaknesses of the PMS‐Prolog model can be seen. Avenues for improving the model are then

ISSN:0038-0644    

DOI:10.1002/spe.4380230203

出版商:John Wiley&Sons, Ltd.    

年代:1993

数据来源: WILEY

摘要:

AbstractThis paper explores PrologIII's capabilities through the study of two short but non‐trivial applications that are chosen to show the advantages of constraint logic programming languages over conventional Prologs, especially for tackling combinatorial problems.The first application (manipulation of causal graphs) highlights the expressive power of the constraints on booleans and shows that constraint logic programming techniques provide great flexibility for the exploration of the domain of an application, and therefore significantly improve Prolog's prototyping capabilities.The second application (map colouring) demonstrates that a combined use of numerical constraints and constraints on trees of PrologIII enables one to improve solutions based on standard backtracking, through the use of simple heuristics. Such heuristics allow drastic reduction of the search space and yield good performance even for quite complex problems. The adaptability of the approach to other combinatorial problems is shown on several example

ISSN:0038-0644    

DOI:10.1002/spe.4380230204

出版商:John Wiley&Sons, Ltd.    

年代:1993

数据来源: WILEY

摘要:

AbstractThe Peregrine RPC system provides performance very close to the optimum allowed by the hardware limits, while still supporting the complete RPC model. Implemented on an Ethernet network of Sun‐3/60 workstations, a null RPC between two user‐level threads executing on separate machines requires 573μs. This time compares well with the fastest network RPC times reported in the literature, ranging from about 1100 to 2600 μs, and is only 309 μs above the measured hardware latency for transmitting the call and result packets in our environment. For large multi‐packet RPC calls, the Peregrine user‐level data transfer rate reaches 8.9 Mbit/s, approaching the Ethernet's 10 Mbit/s network transmission rate. Between two user‐level threads on the same machine, a null RPC requires 149 μs. This paper identifies some of the key performance optimizations used in Peregrine, and quantitatively assesses t

ISSN:0038-0644    

DOI:10.1002/spe.4380230205

出版商:John Wiley&Sons, Ltd.    

年代:1993

数据来源: WILEY

摘要:

AbstractThis paper presents a new representation of control flow graphs which is readable and concise, keeping all pertinent information as it appears in the source code. The iconic control graph provides an exact transformation of the source code. It is a basis for control flow visualization, unstructuredness identification, path crossing and path computation. The representation is programming‐language independent. The iconic control flow construction is automate

ISSN:0038-0644    

DOI:10.1002/spe.4380230206

出版商:John Wiley&Sons, Ltd.    

年代:1993

数据来源: WILEY

ISSN:0038-0644    

DOI:10.1002/spe.4380230201

出版商:John Wiley&Sons, Ltd.    

年代:1993

数据来源: WILEY