Browse Prior Art Database

Limited Domain Search Algorithm for Code Optimization

IP.com Disclosure Number: IPCOM000061075D
Original Publication Date: 1986-Jun-01
Included in the Prior Art Database: 2005-Mar-09

Publishing Venue

IBM

Related People

Authors:
Caraballo, MP Katz, NA Mehta, MA Picon, RJ Seeland, JJ Tate, JB [+details]

Abstract

A technique is described whereby a software algorithm used in conjunction with microprocessors, such as an Intel 8085, will provide a multiple searching capability in a limited domain environment. Microprocessors with a limited instruction set, such as the Intel 8085, normally require an extensive use of code to provide a multiple search capability. The algorithm described herein optimizes the code so as to search for one item in a limited domain of items. It is more efficient than the standard scan field and increment routines usually used. An example of a use for this technique is in applications where identification of a character is required in a line-turnaround situation. Since comparisons are made in each receiver handler, the receiver handler is interrupt driven and is therefore time constrained.