An Optimal Algorithm for Scheduling Requests on Interleaved Memories for a Pipelined Processor

In this paper an optimal algorithm for scheduling requests on interleaved memories is presented. With this algorithm the average completion time for servicing a finite set of randomly generated requests is proved to be minimum. Performance of this algorithm for nonrandom requests has not been proved...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on computers Vol. C-30; no. 10; pp. 787 - 800
Main Authors:	Ramamoorthy, C V, Wah, B W
Format:	Journal Article
Language:	English
Published:	IEEE 01.10.1981
Subjects:	Bandwidth Computers Costs Data modules instruction modules intelligent buffers interleaved memories memory bandwidth Memory management Memory modules optimal scheduling algorithm Organizations pipelined processor Random access memory Scheduling Scheduling algorithms Simulation
ISSN:	0018-9340, 1557-9956
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!