A method of storage access scheduling for a memory device having a workload of different priority access requests including access requests having a real-time priority, the method comprising: characterizing the memory device by determining a value for a balanced number of concurrent access requests at an average request size associated with a concurrent access maximum throughput associated with the memory device, and determining worst-case device service latency values based on the balanced number of concurrent access requests; characterizing the workload by determining, at least one of: a minimum initial slack time value associated with a total worst-case service access time for the access requests in the workload having a real-time priority based on the values obtained from characterizing the memory device; a burstiness value associated with the access requests in the workload having a real-time priority; and a worst-case queue delay value based on the values obtained from characterizing the memory device; receiving a real-time access request associated with an access request storage location value; and processing the real-time access request, utilizing a processor, based on the access request storage location value and the values obtained characterizing the memory device and the workload; wherein processing the real-time access request includes: assigning the real-time access request to a pending queue holding only real-time access requests; withdrawing the real-time access request from the pending queue holding only real-time access requests; and assigning the real-time access request to a primary queue; wherein the primary queue is divided into a current queue and a next queue, wherein both the current queue and the next queue receive different priority access requests, wherein the received different priority access requests are assigned to the current queue and the next queue based on their respective access request storage location values, and wherein the current queue is associated with a count or a throughput rate time to regulate swapping the current queue and the next queue and the count or throughput rate time is modified when an access request is assigned to the current queue. characterizing the memory device by determining a value for a balanced number of concurrent access requests at an average request size associated with a concurrent access maximum throughput associated with the memory device, and determining worst-case device service latency values based on the balanced number of concurrent access requests; determining a value for a balanced number of concurrent access requests at an average request size associated with a concurrent access maximum throughput associated with the memory device, and determining worst-case device service latency values based on the balanced number of concurrent access requests; characterizing the workload by determining, at least one of: a minimum initial slack time value associated with a total worst-case service access time for the access requests in the workload having a real-time priority based on the values obtained from characterizing the memory device; a burstiness value associated with the access requests in the workload having a real-time priority; and a worst-case queue delay value based on the values obtained from characterizing the memory device; a minimum initial slack time value associated with a total worst-case service access time for the access requests in the workload having a real-time priority based on the values obtained from characterizing the memory device; a burstiness value associated with the access requests in the workload having a real-time priority; and a worst-case queue delay value based on the values obtained from characterizing the memory device; receiving a real-time access request associated with an access request storage location value; and processing the real-time access request, utilizing a processor, based on the access request storage location value and the values obtained characterizing the memory device and the workload; assigning the real-time access request to a pending queue holding only real-time access requests; withdrawing the real-time access request from the pending queue holding only real-time access requests; and assigning the real-time access request to a primary queue; wherein the primary queue is divided into a current queue and a next queue, wherein both the current queue and the next queue receive different priority access requests, wherein the received different priority access requests are assigned to the current queue and the next queue based on their respective access request storage location values, and wherein the current queue is associated with a count or a throughput rate time to regulate swapping the current queue and the next queue and the count or throughput rate time is modified when an access request is assigned to the current queue.