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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on computers Ročník C-30; číslo 10; s. 787 - 800
Hlavní autori:	Ramamoorthy, C V, Wah, B W
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE 01.10.1981
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!