This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Practical Delay Enforced Multistream (DEMUS) Control of Deeply Pipelined Processors
March 1995 (vol. 44 no. 3)
pp. 458-462
ASCII Text
x 
 
"Practical Delay Enforced Multistream (DEMUS) Control of Deeply Pipelined Processors," IEEE Transactions on Computers, vol. 44, no. 3, pp. 458-462, March, 1995.
 
 
BibTex
x
 
@article{ 10.1109/TC.1995.10002,
author = {},
title = {Practical Delay Enforced Multistream (DEMUS) Control of Deeply Pipelined Processors},
journal ={IEEE Transactions on Computers},
volume = {44},
number = {3},
issn = {0018-9340},
year = {1995},
pages = {458-462},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1995.10002},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Practical Delay Enforced Multistream (DEMUS) Control of Deeply Pipelined Processors
IS - 3
SN - 0018-9340
SP458
EP462
EPD - 458-462
PY - 1995
KW - Efficient control
KW - pipeline utilization
KW - simulation
KW - thread scheduling
KW - multithreaded computers.
VL - 44
JA - IEEE Transactions on Computers
ER -
 

Abstract—The simulated performance of a practical multithreaded mechanism for achieving high utilization of deeply pipelined (> 5 stage) processors is presented. Threads are dynamically interleaved in one pipeline. After each instruction is dispatched, enough delay is introduced so that successive instructions cannot interfere. Four scheduling algorithms, three of which are realizable, are tested on a simple simulated processor. Good pipeline utilization can be achieved even when the number of running threads is less than the number of pipeline stages.

Index Terms:
Efficient control, pipeline utilization, simulation, thread scheduling, multithreaded computers.
Citation:
"Practical Delay Enforced Multistream (DEMUS) Control of Deeply Pipelined Processors," IEEE Transactions on Computers, vol. 44, no. 3, pp. 458-462, March 1995, doi:10.1109/TC.1995.10002
Usage of this product signifies your acceptance of the Terms of Use.