Semiconductor & Computer Engineering
From WikiChip
Difference between revisions of "vector-length agnostic"
(Created page with "{{title|Vector-Length Agnostic (VLA)}} '''Vector-length agnostic''' ('''VLA''') refers to a programming model whereby vectorized code is compiled such that it could run un...") |
|||
| Line 1: | Line 1: | ||
{{title|Vector-Length Agnostic (VLA)}} | {{title|Vector-Length Agnostic (VLA)}} | ||
| − | '''Vector-length agnostic''' ('''VLA''') refers to a [[programming model]] whereby vectorized code is compiled such that it could run under any [[vector length]] the underlying [[microarchitecture]] implements. In other words, VLA-based vectorized code automatically adapts to the [[vector length]] of the machine at [[runtime]]. | + | '''Vector-length agnostic''' ('''VLA''') refers to a [[programming model]] whereby vectorized code is compiled such that it could run under any [[vector length]] the underlying [[microarchitecture]] implements. In other words, VLA-based vectorized code automatically adapts and scales to the [[vector length]] of the machine at [[runtime]]. |
{{stub}} | {{stub}} | ||
Latest revision as of 12:28, 23 September 2018
Vector-length agnostic (VLA) refers to a programming model whereby vectorized code is compiled such that it could run under any vector length the underlying microarchitecture implements. In other words, VLA-based vectorized code automatically adapts and scales to the vector length of the machine at runtime.
 |
This article is still a stub and needs your attention. You can help improve this article by editing this page and adding the missing information. |