
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
SidAhmedAli Touati, "On the Periodic Register Need in Software Pipelining," IEEE Transactions on Computers, vol. 56, no. 11, pp. 14931504, November, 2007.  
BibTex  x  
@article{ 10.1109/TC.2007.70752, author = {SidAhmedAli Touati}, title = {On the Periodic Register Need in Software Pipelining}, journal ={IEEE Transactions on Computers}, volume = {56}, number = {11}, issn = {00189340}, year = {2007}, pages = {14931504}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2007.70752}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  On the Periodic Register Need in Software Pipelining IS  11 SN  00189340 SP1493 EP1504 EPD  14931504 A1  SidAhmedAli Touati, PY  2007 KW  Periodic Register Requirement KW  MAXLIVE KW  Periodic Register Sufficiency KW  Software Pipelining KW  Stage Scheduling KW  Instruction Level Parallelism. VL  56 JA  IEEE Transactions on Computers ER   
[1] E. Altman, “Optimal Software Pipelining with Functional Units and Registers,” PhD dissertation, McGill Univ., Oct. 1995.
[2] D. de Werra, C. Eisenbeis, S. Lelait, and B. Marmol, “On a GraphTheoretical Model for Cyclic Register Allocation,” Discrete Applied Math., vol. 93, nos. 23, pp. 191203, July 1999.
[3] A.E. Eichenberger, E.S. Davidson, and S.G. Abraham, “Minimizing Register Requirements of a Modulo Schedule via Optimum Stage Scheduling,” Int'l J. Parallel Programming, vol. 24, no. 2, pp.103132, Apr. 1996.
[4] C. Eisenbeis, F. Gasperoni, and U. Schwiegelshohn, “Allocating Registers in Multiple InstructionIssuing Processors,” Proc. IFIP WG 10.3 Working Conf. Parallel Architectures and Compilation Techniques (PACT '95), pp. 290293, June 1995.
[5] D. Fimmel and J. Muller, “Optimal Software Pipelining under Resource Constraints,” Int'l J. Foundations of Computer Science, vol. 12, no. 6, pp. 697718, 2001.
[6] M. Golumbic, Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980.
[7] G. Huard, “Algorithmique du Décalage d'Instructions,” PhD dissertation, École Normale Supérieure de Lyon, Dec. 2001.
[8] L.J. Hendren, G.R. Gao, E.R. Altman, and C. Mukerji, “A Register Allocation Framework Based on Hierarchical Cyclic Interval Graphs,” Lecture Notes in Computer Science, vol. 641, pp. 176191, 1992.
[9] R. Huff, “LifetimeSensitive Modulo Scheduling,” Proc. ACM Conf. Programming Language Design and Implementation (PLDI '93), pp.258267, June 1993.
[10] J. Janssen, “Compilers Strategies for Transport Triggered Architectures,” PhD dissertation, Delft Univ., 2001.
[11] C.E. Leiserson and J.B. Saxe, “Retiming Synchronous Circuitry,” Algorithmica, vol. 6, pp. 535, 1991.
[12] S. Lelait, “Contribution à l'Allocation de Registres dans les Boucles,” PhD dissertation, Université d'Orléans, Jan. 1996.
[13] W. MangioneSmith, S.G. Abraham, and E.S. Davidson, “Register Requirements of Pipelined Processors,” Proc. Sixth ACM Int'l Conf. Supercomputing (ICS '92), pp. 260271, July 1992.
[14] J. Müller, D. Fimmel, and R. Merker, “Optimal Loop Scheduling with Register Constraints Using Flow Graphs,” Proc. Seventh Int'l Symp. Parallel Architectures, Algorithms and Networks (ISPAN '04), pp. 180186, 2004.
[15] Q. Ning and G.R. Gao, “A Novel Framework of Register Allocation for Software Pipelining,” Conf. Record 20th ACM SIGPLANSIGACT Symp. Principles of Programming Languages (POPL '93), pp. 2942, Jan. 1993.
[16] B.R. Rau, M. Lee, P.P. Tirumalai, and M.S. Schlansker, “Register Allocation for Software Pipelined Loops,” SIGPLAN Notices, vol. 27, no. 7, pp. 283299, July 1992.
[17] A. Sawaya, “Pipeline Logiciel: Découplage et Contraintes de Registres,” PhD dissertation, Université de Versailles SaintQuentinEnYvelines, Apr. 1997.
[18] A. Schrijver, Theory of Linear and Integer Programming. John Wiley & Sons, 1987.
[19] R. Sethi, “Complete Register Allocation Problems,” SIAM J. Computing, vol. 4, no. 3, pp. 226248, 1975.
[20] S.A.A. Touati, “Register Saturation in Instruction Level Parallelism,” Int'l J. Parallel Programming, vol. 33, no. 4, p. 57, Aug. 2005.
[21] S.A.A. Touati and C. Eisenbeis, “Early Periodic Register Allocation on ILP Processors,” Parallel Processing Letters, vol. 14, no. 2, June 2004.
[22] A. Tucker, “Coloring a Family of Circular Arcs,” SIAM J. Applied Math., vol. 29, no. 3, pp. 493502, Nov. 1975.
[23] J. Wang, C. Eisenbeis, M. Jourdan, and B. Su, “Decomposed Software Pipelining: A New Perspective and a New Approach,” Int'l J. Parallel Programming, vol. 22, no. 3, pp. 351373, June 1994.
[24] J. Wang, A. Krall, M.A. Ertl, and C. Eisenbeis, “Software Pipelining with Register Allocation and Spilling,” Proc. 27th Ann. Int'l Symp. Microarchitecture (MICRO '94), pp. 9599, Nov. 1994.