Jump to content

Fast path

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 213.93.230.146 (talk) at 12:01, 17 June 2009 (Add packet routing example. What has self-modifying code to do with this?). 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 a path with shorter instruction path length through a program compared to the 'normal' path. For a fast path to be effective it must handle the most commonly occuring tasks more efficiently than the 'normal' path, leaving the latter to handle uncommon cases, corner cases, error handling, and other anomalies. Fast paths are a form of optimization.

For example dedicated packet routing hardware used to build computer networks will often sport hardware dedicated to handling the most common kinds of packets, with other kinds, for example with control information or packets directed at the device itself instead of to be routed elsewhere, put on the metaphorical "slow path", in this example usually implemented by software running on the control processor.

Origin

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