Division by Invariant Integers using Multiplication Export

@article{citeulike:2254050, abstract = {Integer division remains expensive on today's processors as the cost of integer multiplication declines. We present code sequences for division by arbitrary nonzero integer constants and run--time invariants using integer multiplication. The algorithms assume a two's complement architecture. Most also require that the upper half of an integer product be quickly accessible. We treat unsigned division, signed division where the quotient rounds towards zero, signed division where the quotient...}, author = {Granlund, Torbj\"orn and Montgomery, Peter L.}, citeulike-article-id = {2254050}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.2556}, journal = {ACM SIG\-PLAN Notices}, number = {6}, pages = {61--72}, posted-at = {2008-01-18 21:17:27}, priority = {3}, title = {Division by Invariant Integers using Multiplication}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.2556}, volume = {29}, year = {1994} }

TY - JOUR ID - citeulike:2254050 L3 - citeulike-article-id:2254050 N2 - Integer division remains expensive on today's processors as the cost of integer multiplication declines. We present code sequences for division by arbitrary nonzero integer constants and run--time invariants using integer multiplication. The algorithms assume a two's complement architecture. Most also require that the upper half of an integer product be quickly accessible. We treat unsigned division, signed division where the quotient rounds towards zero, signed division where the quotient... IS - 6 JF - ACM SIG\-PLAN Notices EP - 72 TI - Division by Invariant Integers using Multiplication VL - 29 SP - 61 AU - Granlund, Torbj\"orn AU - Montgomery, Peter PY - 1994/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.2556 ER -