This paper compares the performance of three implementations of simplified pattern matching instruction. The fastest version was microprogrammed on a VAX-11/750, the next fastest was written for a Reduced Instruction Set. Computer (RISC I) developed at Berkeley, and the slowest was pro grammed on the VAX. The paper presents execution times for the microcode and for high-level language and machine language versions of the instruction
A b s t r a c t Objective: The authors consider the problem of exact string pattern matching using a...
Graduation date: 1980The purpose of this research is to design a high level language\ud (HLL) suitab...
This Paper describes the characteristics and the optimization techniques of a high level microprogra...
More than 120 algorithms have been developed for exact string matching within the last 40 years. We ...
This paper describes and discusses several pattern recognition programs that have been coded for and...
An implementation of a Graham-Glanville type pattern-matching code generator for the NRIMS systems p...
AbstractThis paper describes a reduced-instruction-set computer (RISC) architecture for PROLOG and g...
The advent of digital computers has made the routine use of pattern-matching possible in various app...
AbstractA few lines pattern matching algorithm is obtained by using the correctness proof of program...
A study was undertaken to evaluate the capabilities of two microprogrammable processors: the MLP-900...
The advent of digital computers has made the routine use of pattern-matching possible in various app...
AbstractIn this paper, we present a number of algorithms to test the instruction decoding function o...
Abstract. SIMD instructions exist in many recent microprocessors supporting parallel execution of so...
Abstract. The performance of the pattern matching algorithms based on bit-parallelism degrades when ...
The usual choice of programming languages for systems programming has been the basic symbolic assemb...
A b s t r a c t Objective: The authors consider the problem of exact string pattern matching using a...
Graduation date: 1980The purpose of this research is to design a high level language\ud (HLL) suitab...
This Paper describes the characteristics and the optimization techniques of a high level microprogra...
More than 120 algorithms have been developed for exact string matching within the last 40 years. We ...
This paper describes and discusses several pattern recognition programs that have been coded for and...
An implementation of a Graham-Glanville type pattern-matching code generator for the NRIMS systems p...
AbstractThis paper describes a reduced-instruction-set computer (RISC) architecture for PROLOG and g...
The advent of digital computers has made the routine use of pattern-matching possible in various app...
AbstractA few lines pattern matching algorithm is obtained by using the correctness proof of program...
A study was undertaken to evaluate the capabilities of two microprogrammable processors: the MLP-900...
The advent of digital computers has made the routine use of pattern-matching possible in various app...
AbstractIn this paper, we present a number of algorithms to test the instruction decoding function o...
Abstract. SIMD instructions exist in many recent microprocessors supporting parallel execution of so...
Abstract. The performance of the pattern matching algorithms based on bit-parallelism degrades when ...
The usual choice of programming languages for systems programming has been the basic symbolic assemb...
A b s t r a c t Objective: The authors consider the problem of exact string pattern matching using a...
Graduation date: 1980The purpose of this research is to design a high level language\ud (HLL) suitab...
This Paper describes the characteristics and the optimization techniques of a high level microprogra...