Browse Prior Art Database

Pipelined String Manipulation Algorithm

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

Publishing Venue

IBM

Related People

Authors:
Lang, TG [+details]

Abstract

A method is described to maximize the performance of string operations on a microprocessor. The byte string operations on the microprocessor assume these requirements: 1. The string may be any length from one to 65535 bytes. 2. The address of the source string may be on any byte boundary. 3. The address of the destination string may also be on any byte boundary, not necessarily the same as the source string's boundary. The microprocessor performs at maximum speed when operating on 4 bytes at a time, but the 4-byte quantities must be on 4-byte boundaries. The microprocessor can work with 2-byte quantities on 2-byte boundaries and 1-byte quantities on 1-byte boundaries.