Schedulers with load-store queue awareness
Abstract
In one embodiment, a computer-implemented method includes tracking a size of a load-store queue (LSQ) during compile time of a program. The size of the LSQ is time-varying and indicates how many memory access instructions of the program are on the LSQ. The method further includes scheduling, by a computer processor, a plurality of memory access instructions of the program based on the size of the LSQ.
- Inventors:
- Issue Date:
- Research Org.:
- International Business Machines Corp., Armonk, NY (United States)
- Sponsoring Org.:
- USDOE
- OSTI Identifier:
- 1343283
- Patent Number(s):
- 9563428
- Application Number:
- 14/669,472
- Assignee:
- INTERNATIONAL BUSINESS MACHINES CORPORATION
- Patent Classifications (CPCs):
-
G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING
- DOE Contract Number:
- B599858
- Resource Type:
- Patent
- Resource Relation:
- Patent File Date: 2015 Mar 26
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 97 MATHEMATICS AND COMPUTING
Citation Formats
Chen, Tong, Eichenberger, Alexandre E., Jacob, Arpith C., and Sura, Zehra N. Schedulers with load-store queue awareness. United States: N. p., 2017.
Web.
Chen, Tong, Eichenberger, Alexandre E., Jacob, Arpith C., & Sura, Zehra N. Schedulers with load-store queue awareness. United States.
Chen, Tong, Eichenberger, Alexandre E., Jacob, Arpith C., and Sura, Zehra N. Tue .
"Schedulers with load-store queue awareness". United States. https://www.osti.gov/servlets/purl/1343283.
@article{osti_1343283,
title = {Schedulers with load-store queue awareness},
author = {Chen, Tong and Eichenberger, Alexandre E. and Jacob, Arpith C. and Sura, Zehra N.},
abstractNote = {In one embodiment, a computer-implemented method includes tracking a size of a load-store queue (LSQ) during compile time of a program. The size of the LSQ is time-varying and indicates how many memory access instructions of the program are on the LSQ. The method further includes scheduling, by a computer processor, a plurality of memory access instructions of the program based on the size of the LSQ.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue Feb 07 00:00:00 EST 2017},
month = {Tue Feb 07 00:00:00 EST 2017}
}
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.
Works referenced in this record:
Circuit and method for scheduling instructions by predicting future availability of resources required for execution
patent, September 1996
- Hinton, Glenn J.; Martell, Robert W.; Fetterman, Michael A.
- US Patent Document 5,555,432
Scheduling instructions with different latencies
patent, March 2000
- Grochowski, Edward T.; Mulder, Hans; Lin, Derrick C.
- US Patent Document 6,035,389
Method for alternate preferred time delivery of load data
patent, May 2002
- Arimilli, Ravi Kumar; Arimilli, Lakshminarayanan Baba; Dodson, John Steven
- US Patent Document 6,389,529
System and method for scheduling instructions to maximize outstanding prefetches and loads
patent, July 2005
- Damron, Peter C.; Kosche, Nicolai
- US Patent Document 6,918,111
Dynamic resizing of superscalar datapath components for energy efficiency
journal, February 2006
- Ponomarev, D.; Kucuk, G.; Ghose, K.
- IEEE Transactions on Computers, Vol. 55, Issue 2, p. 199-213
An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas
journal, January 1989
- Bondi, André B.
- Computers & Operations Research, Vol. 16, Issue 3, p. 217-233