Jump to content

Fast path

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 198.184.231.254 (talk) at 22:40, 13 March 2009 (spelling). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Fast path is a term used in computer science to describe an alternative 'faster' path through a program than the 'normal' path. It provides a shorter instruction path length, either by self-modifying code (eliminating one or more conditional branches) or other methods to improve algorithmic efficiency.

Origin

A fast path is analogous to a short cut (generic meaning: a shorter route or smaller effort).