Duplicated Instruction Scheduling Method 


Vol. 27,  No. 5, pp. 446-457, May  2002


PDF
  Abstract

In this paper, we present a duplicated instruction allocation method in ways that inserts copies of instructions to vacant NOP slots with respect to scheduling which utilizes an instruction graph in VLIW architecture, The Duplicated Instruction Scheduling engages in the multiple copying and allocating of same instruction in VLIW architecture, It is characterized by the fact that duplicated instructions generated from the scheduling method become to take on the same role as the bypassing scheme which is adopted to remove data dependencies. Besides small overhead of Duplicated Instruction Scheduling makes it applicable appropriately, From the experimental results, we get to know that Duplicated Instruction Scheduling can enhance the performance up to 8% ~ 25% in case for VLIW machine equipped with simple bypassing paths, In consequence, for a VLIW machine with simple bypassing paths, to apply suggested Duplicated Instruction Scheduling is expected to be advisable.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

S. Kim and S. Kim, "Duplicated Instruction Scheduling Method," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 5, pp. 446-457, 2002. DOI: .

[ACM Style]

Suk-ju Kim and Sukil Kim. 2002. Duplicated Instruction Scheduling Method. The Journal of Korean Institute of Communications and Information Sciences, 27, 5, (2002), 446-457. DOI: .

[KICS Style]

Suk-ju Kim and Sukil Kim, "Duplicated Instruction Scheduling Method," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 5, pp. 446-457, 5. 2002.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880