Year: 1991
Type: conference-paper
Abstract: Static algorithmsare such algorithms whose behaviour is independent of indata.Regardless of the input, the same computations will always be carried out.Because of this property, static algorithms can be scheduled once and for all, and very efficient hardware with a minimum of control can be designed to support the schedule.Machinery.
Author: Björn Lisper
Institution: KTH Royal Institute of Technology
Language: English
Subfield: Hardware and Architecture
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2151586821
