[′min·ə·məm ¦lat·ən·sē rü‚tēn] (computer science) A computer routine that is constructed so that the latency in serial-access storage is less than the random latency that would be expected if storage locations were chosen without regard for latency. Also known as minimum-access routine.